Skip to content

FIRE - ALICE D#21

Open
codeandmorecode wants to merge 2 commits intoAda-C14:masterfrom
codeandmorecode:master
Open

FIRE - ALICE D#21
codeandmorecode wants to merge 2 commits intoAda-C14:masterfrom
codeandmorecode:master

Conversation

@codeandmorecode
Copy link

Thanks for reviewing it! :)

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.

Great work Alice, I did leave one comment on the max subarray, but it all works. Well done.

Comment on lines +9 to +12
while i < nums.length do
array_of_max_sum_ending_in_i[i] = [array_of_max_sum_ending_in_i[i - 1] + nums[i], nums[i]].max
i += 1
end

Choose a reason for hiding this comment

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

Wow, so compact!

Comment on lines +2 to 4
# Time Complexity: O(n)
# Space Complexity: O(n)
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.

This works, but you can actually do it without the array. You only need to keep track of the max subarray ending at the current index and the max subarray seen so far.

It's kind of like the fibonacci problem.

That said your time complexity is great.

Comment on lines +3 to 5
# Time complexity: O(n)
# Space Complexity: O(n)
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