-
Notifications
You must be signed in to change notification settings - Fork 47
Branches - Brianna K #35
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
base: master
Are you sure you want to change the base?
Conversation
|
Well done you hit the learning goals here. Nice work! Sorry for the delay I must not have hit submit. |
| temp = solutions[0] + solutions[1] | ||
| solutions[0] = solutions[1] | ||
| solutions[1] = temp |
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.
Yes!
| # Time Complexity - O(n) | ||
| # Space Complexity - O(n) (should be O(n)) | ||
| # 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.
👍
| # Space Complexity - ? | ||
| # Time Complexity - O(n^2) | ||
| # Space Complexity - O(n) | ||
| 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 - ? | ||
|
|
||
| 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.
👍
No description provided.