Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Day 190 #393

Closed
vaskoz opened this issue Feb 28, 2019 · 0 comments
Closed

Day 190 #393

vaskoz opened this issue Feb 28, 2019 · 0 comments
Assignees
@vaskoz

Comments

@vaskoz
Copy link
Owner

vaskoz commented Feb 28, 2019

Good morning! Here's your coding interview problem for today.

This problem was asked by Facebook.

Given a circular array, compute its maximum subarray sum in O(n) time.

For example, given [8, -1, 3, 4], return 15 as we choose the numbers 3, 4, and 8 where the 8 is obtained from wrapping around.

Given [-4, 5, 1, 0], return 6 as we choose the numbers 5 and 1.
@vaskoz vaskoz self-assigned this Feb 28, 2019
@vaskoz vaskoz mentioned this issue Feb 28, 2019
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@vaskoz vaskoz

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@vaskoz