Skip to Content
PracticeProblems.org

Coding Interviews: Dynamic Programming

Collapse
All Coding InterviewsSimple Data StructuresSearching and SortingArrays and StringsStacks and QueuesGreedy AlgorithmsDynamic ProgrammingGraphsComplex Data StructuresMathMiscellaneousSystem Design
Climbing Stairs

You are climbing a staircase. It takes n steps to reach the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Dynamic ProgrammingEasyVideoPythonCode Solution