Skip to content

Conversation

@norrise120
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 items in nums
# 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 +16 to +19
last = hash[count - 1]
current = hash[last] + hash[count - last]
hash[count] = current
result.push(current)

Choose a reason for hiding this comment

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

Just curious why a hash, and why name it hash, instead of maybe sequence or something to indicate what it stores.

@@ -1,7 +1,26 @@
# Time complexity: O(n), where n is directly proportional to the size of num
# Space Complexity: O(n), where n is directly proportional to the size of num
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