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

Leaves - Emily V #34

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Conversation

emilyvomacka
Copy link

Some doubts about space and time complexity, and wondering if I totally missed the boat on refined_super_digit as I don't get how it's necessarily more time or space intensive than super_digit. Thanks!

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.


# 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 +3 to +4
# Time Complexity - O(1) <- this doesn't feel quite right but it's definitely not O(n)
# Space Complexity - O(1) <- same here

Choose a reason for hiding this comment

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

Correct it's O(log10n)


# 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.

This is the bute-force solution, can you think of a better way to do this 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