Peer-to-Peer Interview Prep

Master the Coding
Interview, Together.

Practice live technical interviews with fellow students, conquer algorithms, and land your dream software engineering job.

🔒app.codematch.io/interview
Interview Session
Question 1 of 2
▶ 44:00
Export PDF
Next →
End Session
← Home
🎙 Interviewer
💻 Interviewee
Dynamic Programming
Easy
LeetCode #70
Climbing Stairs
Your Role
Guide your partner through this problem. Use the follow-up questions to probe their thinking and evaluate their approach.
Interviewer Questions
1
What are the base cases for this problem?
Answer
When n=1 return 1, when n=2 return 2.
2
What is the time complexity of your solution?
3
Can you solve it with O(1) space?