Skip to content

Conversation

@kanderson38
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!

Comment on lines +8 to +11
storage_hash = {
1 => 1,
2 => 1
}

Choose a reason for hiding this comment

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

Just curious why use a hash instead of an array? Just because 0 is unused?

# Space Complexity: ?
# Time Complexity: O(n) where n is the number of items 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.

👍

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