Skip to content

Conversation

@Kimberly-Fasbender
Copy link

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.

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.

# 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)

Choose a reason for hiding this comment

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

👍

Comment on lines +2 to +3
# 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)

Choose a reason for hiding this comment

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

👍

# 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)

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