← Maximum Subarray
Discussions
Sign in to join the discussion.
H
harini.p
OFFICIAL
3 weeks, 4 days ago
Clean Python solution, beats most submissions.
A single pass with a running value is enough here. Keep track of the best answer so far and update it as you scan, which gives O(n) time and O(1) extra space.
💬 1 reply
A
abose
4 weeks, 1 day ago
Finally got AC after 3 WAs. Sharing what I missed.
A single pass with a running value is enough here. Keep track of the best answer so far and update it as you scan, which gives O(n) time and O(1) extra space.
💬 1 reply
S
shrutisha8
1 month, 2 weeks ago
Simple approach explained for beginners.
A single pass with a running value is enough here. Keep track of the best answer so far and update it as you scan, which gives O(n) time and O(1) extra space.
💬 1 reply
S
shegde
3 months, 3 weeks ago
Asked in my CRED OA last week.
A single pass with a running value is enough here. Keep track of the best answer so far and update it as you scan, which gives O(n) time and O(1) extra space.
💬 1 reply