Skip to content

Conversation

@sarashahbaig
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.

Take a look at my comments for Fibonacci, you can get most of the way by looking at the textbook curriculum.

# Time Complexity - o(n)
# Space Complexity - o(n) (should be O(n))
# 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.

This is the brute force O(2n) solution. Check the notes and see if you can approach this a better way.

# Space Complexity - ?
# Time Complexity - o(n)
# Space Complexity - o(n^2)
def super_digit(n)

Choose a reason for hiding this comment

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

👍

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