-
Notifications
You must be signed in to change notification settings - Fork 48
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.
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
Branches - Farah #42
base: master
Are you sure you want to change the base?
Branches - Farah #42
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Overall nice work, you hit the learning goals here. Well done.
new_solution = first_solution + second_solution | ||
second_solution = first_solution | ||
first_solution = new_solution |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice!
# Time Complexity - ? | ||
# Space Complexity - ? (should be O(n)) | ||
# Time Complexity - O(n) where n integer passed through fibonacci(n) method | ||
# Space Complexity - ? (should be O(n)); It is O(n) where n is the number of times the method is called and placed on the stack | ||
# Hint, you may want a recursive helper method | ||
def fibonacci(n) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time Complexity - ? | ||
# Space Complexity - ? | ||
# Time Complexity - O(n) where n is equal to the number of digits in the n-number passed in the method | ||
# Space Complexity - O(n) where n is equal to the number of times the super_digit method is placed on the call stack | ||
def super_digit(n) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
# Time Complexity - ? | ||
# Space Complexity - ? | ||
# Time Complexity - O(n) where n is equal to the number of digits in the n-number passed in the super_digit method or the number of digits in the result-number passed in the super_digit method. | ||
# Space Complexity - O(n) where n is equal to the number of times the suger_digit method is placed on the call stack | ||
def refined_super_digit(n, k) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Nice work!
No description provided.