Skip to content

Conversation

@KKennedyCodes
Copy link

No description provided.

Copy link

@CheezItMan CheezItMan left a 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.

Comment on lines +25 to +27
if current >= 3
look_up[current] = look_up[current-1] + look_up[current-2]
look_up.delete(current - 2)

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)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines 3 to 4
# Time Complexity - ?
# Space Complexity - ? (should be O(n))

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)

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)

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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants