Maximum Subarray

Cisco OA included the standard maximum subarray problem, identified by the candidate as LeetCode 53 with no noted modification. Requirements Given an integer array, return the maximum possible sum of a contiguous non-empty subarray. The candidate identified this as LeetCode 53. Notes Prepare both Kadane's algorithm and the usual all-negative edge case.