Skip to content

Conversation

@brikemp
Copy link

@brikemp brikemp commented Nov 18, 2019

No description provided.

@CheezItMan
Copy link

Well done you hit the learning goals here. Nice work!

Sorry for the delay I must not have hit submit.

Comment on lines +16 to +18
temp = solutions[0] + solutions[1]
solutions[0] = solutions[1]
solutions[1] = temp

Choose a reason for hiding this comment

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

Yes!

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

👍

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

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.

👍

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