Skip to content

Conversation

@OhCloud
Copy link

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

Take a look again at the fibonacci problem. It looks like you weren't finished there. More things to work on.

end
end
end
results[n] = fib(n-1) + fib(n-2)

Choose a reason for hiding this comment

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

Ok some serious issues here:

  1. There is no method called fib
  2. There is no object called results
  3. It looks like this is the bad 2n solution.

More to work on here. Take a look at the examples in the notes.

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

👍

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