Frage im Vorstellungsgespräch bei Walkover Web Solutions

They gave me a classic array-based problem, find the maximum subarray sum (Kadane's Algorithm), which is a popular LeetCode medium that tests your understanding of dynamic programming and array traversal.