Skip to content

Conversation

@PranayChauhan2516
Copy link
Contributor

Pull Request Template

Description

Summary:
You are climbing a stair case. It takes n steps to reach to the top.

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

Put check marks:

Have you made changes in README file ?

  • Added problem & solution under correct topic.
  • Specified Space & Time complexity.
  • Specified difficulty level, tag & Note(if any).

Make sure all below guidelines are followed else PR will get Reject:

  • My code follows the style guidelines of this project
  • I have performed a self-review of my own code
  • I have commented my code so that it is easy to understand
  • I have made corresponding changes to the documentation
  • My changes generate no new warnings
  • Any dependent changes have been merged and published in downstream modules

@GouravRusiya30
Copy link
Member

@PranayChauhan2516 This is not the efficient code. Please try to do it in O(1) space.

@PranayChauhan2516
Copy link
Contributor Author

Done!

@PranayChauhan2516
Copy link
Contributor Author

@GouravRusiya30 It is now correct!

@GouravRusiya30
Copy link
Member

Update Readme for space complexity

@PranayChauhan2516
Copy link
Contributor Author

@GouravRusiya30 Done sir!

@GouravRusiya30
Copy link
Member

Thanks for contributing @PranayChauhan2516

@GouravRusiya30 GouravRusiya30 merged commit c56a9f0 into codedecks-in:master Oct 6, 2020
@GouravRusiya30
Copy link
Member

Don't forget to give us 🌟

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants