Skip to content

Conversation

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

Comment on lines +24 to +26
temp = s[1]
s[1] = s[0] + s[1]
s[0] = temp

Choose a reason for hiding this comment

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

Yes!

# Time Complexity - ?
# Space Complexity - ? (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.

👍

Comment on lines 4 to 5
# Space Complexity - ? (should be O(n))
# Hint, you may want a recursive helper method

Choose a reason for hiding this comment

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

No answers here?

# Space Complexity - ?
# Time Complexity - O(n)
# Space Complexity - O(1)
def super_digit(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 - O(n)
# Space Complexity - O(1)

Choose a reason for hiding this comment

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

The time/space complexity will be the same O(log10n)

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