Skip to content

Conversation

@JansenMartin
Copy link

Thank you, Chris!

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, you fully applied dynamic programming to these solutions. Well done!

# Space Complexity: ?
# Time Complexity: O(n), where n is the number of elements inside the nums array
# Space Complexity: O(1), because extra space required isn't determined by input
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.

👍

# Space Complexity: ?
# Time complexity: O(n), where n is the input
# Space Complexity: O(n), where n is the input
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