q_10156_Climbing_Stairs.json

{
  "question": {
    "qid": "q_10156",
    "diff": 1,
    "tags": ["Dynamic Programming"],
    "title": "Climbing Stairs",
    "prompt": [
      "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?"
    ],
    "examples": [
      {
        "input": "2",
        "output": "2",
        "explanations": [
          "There are two ways to climb to the top: 1 step + 1 step or 2 steps."
        ]
      }
    ],
    "constraints": ["1 <= n <= 45"],
    "functionArguments": ["n"],
    "hints": ["To reach nth step, what could have been your previous steps?"]
  },
  "testcases": [
    { "tid": "1", "input": [2], "expected": 2 },
    { "tid": "2", "input": [3], "expected": 3 }
  ],
  "submitted": 0,
  "accepted": 0,
  "questionLevel": 5
}