-
Notifications
You must be signed in to change notification settings - Fork 34
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
Fire - Blaine #28
base: master
Are you sure you want to change the base?
Fire - Blaine #28
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 Blaine, you hit the learning goals here. Well done.
# Time Complexity: O(n) | ||
# Space Complexity: O(n) | ||
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.
The space complexity here is O(1) because you're not building another array etc.
# Time complexity: O(n) | ||
# Space Complexity: O(n)2 | ||
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.
# Time complexity: O(n) | |
# Space Complexity: O(n)2 | |
def newman_conway(num) | |
# Time complexity: O(n) | |
# Space Complexity: O(n) | |
def newman_conway(num) |
I'm assuming you meant to say space complexity was O(n)
No description provided.