Skip to content
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

Janice H. #32

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

Janice H. #32

wants to merge 5 commits into from

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.

👍

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

👍

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