Skip to content

issue#70, answer of climbing stairs problem #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

issue#70, answer of climbing stairs problem #9

wants to merge 1 commit into from

Conversation

Alireza-Sampour
Copy link

No description provided.

@aayush26
Copy link
Owner

Please mention in the Solution as O(2^n) time complexity in the comment of your code.

Just a FYI, this problem can be solved in O(n) and optimize even further to O(log n)

@aayush26
Copy link
Owner

aayush26 commented Oct 11, 2019 •
edited
Loading

Please add a link of successful submission link in leetcode

@aayush26
Copy link
Owner

Thanks for sending out the PR.

Detailed instructions on how to contribute to this repo has been updated here:
https://github.com/aayush26/leetcode/blob/master/README.md#how-to-contribute

Please send out a new revision accordingly.

ReyAhamed added a commit to ReyAhamed/leetcode that referenced this pull request Oct 13, 2019
@ReyAhamed
Added Solution for problem aayush26#9
a5d02f8
vidhithebest added a commit to vidhithebest/leetcode that referenced this pull request Oct 14, 2019
@vidhithebest
aayush26#9 solution leetcode
7ecce8b
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@Alireza-Sampour @aayush26