New solution branch2 #51
Closed
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
not needed that's why deleted
Owner
|
@Sahilkumar19 Hey I see you deleted Exercise07_05. If I merge this it will delete the Exercise 07_05 file on the master branch.
This should reset the commit history to the point where the only changes made were to the Exercise01_04 |
Owner
|
@Sahilkumar19 , actually nevermind, I found a PR you created that has only the changes to Exercise 01_04 in it. I am going to close this current one here, and I will approve the other one. |
Contributor
Author
thanks, Now I have got the point |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
@HarryDulaney , please take a look at this, previous (iterative ) solution was correct . I have the solution completely have solved the linear recurrence relation of fibonacci numbers and got the exact solution to find the nth fibonacci number . on further solving and observing about the time complexity it becomes O(1.6180)^n which is golden number raised to power n.