Find the Maximum-Sum Contiguous Subarray
Company: J.P. Morgan
Role: Software Engineer II
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Find the maximum sum of a nonempty contiguous subarray in linear time and constant space, correctly handling all-negative input and 64-bit accumulated sums.
Read the full J.P. Morgan Software Engineer II interview experience this question came from