-
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
Kim #22
base: master
Are you sure you want to change the base?
Kim #22
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, thanks for getting it in. You hit everything here. Well done! It's been a pleasure teaching you Kim! Keep in touch with us.
# Time Complexity: ? | ||
# Space Complexity: ? | ||
# Time Complexity: O(n) - where n is equal to the length of nums - 1 | ||
# Space Complexity: O(1) - constant | ||
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: O(n) - where n equals num - 2 | ||
# Space Complexity: O(n) - where n equals num * 2 (for the space needed for the string and the array) |
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 equals num - 2 | ||
# Space Complexity: O(n) - where n equals num * 2 (for the space needed for the string and the array) | ||
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.