-
Notifications
You must be signed in to change notification settings - Fork 29
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
Kirsten #11
base: master
Are you sure you want to change the base?
Kirsten #11
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, you fully applied dynamic programming to these solutions. Well done!
storage_hash = { | ||
1 => 1, | ||
2 => 1 | ||
} |
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.
Just curious why use a hash instead of an array? Just because 0 is unused?
# Time Complexity: ? | ||
# Space Complexity: ? | ||
# Time Complexity: O(n) where n is the number of items in the array | ||
# Space Complexity: O(1) | ||
def max_sub_array(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.
👍
# Time complexity: ? | ||
# Space Complexity: ? | ||
# Time complexity: O(n), where n is the input number | ||
# Space Complexity: O(n), where n is the input number | ||
def newman_conway(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.