-
Notifications
You must be signed in to change notification settings - Fork 8
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
Richelle - dynamic programming assignment #3
base: master
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice work Richelle, you hit the learning goals here. Very clean, readable code. Well done.
// Time Complexity: O(n) | ||
// Space Complexity: O(1) constant | ||
|
||
function maxSubArray(nums) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Nice work Richelle!
// Time Complexity: O(n) where n = num | ||
// Space Complexity: O(n) - technically my in 2n because of the .slice | ||
|
||
// P(1) = 1 | ||
// P(2) = 1 | ||
// for all n > 2 | ||
// P(n) = P(P(n - 1)) + P(n - P(n - 1)) | ||
|
||
function newmanConway(num) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
No description provided.