-
Notifications
You must be signed in to change notification settings - Fork 47
Leaves - Katie K #38
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?
Leaves - Katie K #38
Conversation
CheezItMan
left a comment
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. Do take a look at my comments.
| if current >= 3 | ||
| look_up[current] = look_up[current-1] + look_up[current-2] | ||
| look_up.delete(current - 2) |
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.
Clever
| # 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 - ? (should be O(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.
no answer here?
|
|
||
| # Time Complexity - ? | ||
| # Space Complexity - ? | ||
| 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.
👍 but no time/space complexity?
|
|
||
| # 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.
👍 But you can go further with dynamic programming.
No description provided.