Scribd Logo
Upload

Welcome to Scribd!

  • LeetCode Python

    Uploaded by

    Drive User
    10 views7 pages
    There are 3 ways to climb n=3 steps to the top of a staircase where each step climbed can be 1 or 2 steps: 1) climbing 1 step at a time for each of the 3 steps, 2) climbing 1 step then 2 steps, or 3) climbing 2 steps then 1 step. The document discusses 3 approaches - a simple recursive method, a memoization method to reduce time complexity from exponential to linear, and a tabulation method that is also linear time.

    Original Description:

    Original Title

    LeetCode_Python

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    There are 3 ways to climb n=3 steps to the top of a staircase where each step climbed can be 1 or 2 steps: 1) climbing 1 step at a time for each of the 3 steps, 2) climbing 1 step then 2 steps, or 3) climbing 2 steps then 1 step. The document discusses 3 approaches - a simple recursive method, a memoization method to reduce time complexity from exponential to linear, and a tabulation method that is also linear time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views7 pages

    LeetCode Python

    Uploaded by

    Drive User
    There are 3 ways to climb n=3 steps to the top of a staircase where each step climbed can be 1 or 2 steps: 1) climbing 1 step at a time for each of the 3 steps, 2) climbing 1 step then 2 steps, or 3) climbing 2 steps then 1 step. The document discusses 3 approaches - a simple recursive method, a memoization method to reduce time complexity from exponential to linear, and a tabulation method that is also linear time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    Climbing Stairs

    21DCE041 Deep Kalathiya


    21DCE043 Utsav Katharotiya
    Question ?
    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?

    Input: n = 3
    Output: 3
    Explanation: There are three ways to climb to the top.
    1. 1 step + 1 step + 1 step
    2. 1 step + 2 steps
    3. 2 steps + 1 step
    Approch
    01 02 03
    Tabulization Method. It is
    Simple method Memoization method that also reduce time
    using recursion. reduce time complexity. compexity.

    Time Complexity: O(2^n) Time Complexity: O(n) Time Complexity: O(n)


    Simple Method
    Code: Output:
    Memoization method
    Code: Output:
    Tabulation Method
    Code: Output:

    You might also like