Back to Question
Maximum Subarray (Kadane's Algorithm)
Question Explain
Given an integer array `nums`, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Start Trying This Question Simulation
Click "Start Speaking" and answer the question naturally.