Maximum SubarrayMEDIUM

🌐

ArrayDynamic ProgrammingKadane's Algorithm

Ek integer array `nums` diya gaya hai. Uska subarray dhundho jiska sum sabse zyada ho aur wo sum return karo.

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
[4,-1,2,1] ka sum = 6 sabse zyada hai.

Input: nums = [1]
Output: 1
Sirf ek element hai.

AmazonMicrosoftGoogleSwiggy

🌳 STRATEGY TREE MAP

🔬 X-RAY LIVE VISUALIZATION

Loading X-Ray…

🖊

Upar jo visualization dekhi, usi ke according code likho.
Sirf 20% sahi code likhne pe full solution unlock ho jaega! 🔓