Skip to content

Conversation

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

# Space Complexity: ?
# Time Complexity: O(n), where n is the number of elements input in the array.
# Space Complexity: O(1)
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 +7 to +10
elsif num == 1
return "1"
elsif num == 2
return "1 1"

Choose a reason for hiding this comment

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

Do you really need these? If you have the array, do you need these elsif conditions?

@@ -1,7 +1,26 @@
# Time complexity: O(n) where n is the input value.
# Space Complexity: O(n) where n is the input value.
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