Skip to content

Conversation

@jaitch
Copy link

@jaitch jaitch commented Nov 18, 2019

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 +15 to +17
new_sum = fib_saver.sum
fib_saver[0] = fib_saver[1]
fib_saver[1] = new_sum

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.

👍

# Space Complexity - ?
# Time Complexity - O(nlog10n)?
# Space Complexity - O(log10n)?
def super_digit(n)

Choose a reason for hiding this comment

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

👍

# Space Complexity - O(log10n)?
def refined_super_digit(n, k)
super_digit(n * k)

Choose a reason for hiding this comment

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

The trick here is to find the superdigit of n and then multiply the result by k.

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.

3 participants