Search results for #LeetCode53
❓ Problem 2: Maximum Subarray 📘 Learned: Keep running sum max. If sum ever drops below 0, reset to 0. Track max so far (ans). Handles negatives by initializing ans = -Infinity. ✅ Solved on: LeetCode #53 – Maximum Subarray #DSA #Kadane #DynamicProgramming #LeetCode53
0
0
1
9
0
Trends for United States
180 B posts
45,1 B posts
60,3 B posts
166 B posts
193 B posts
38,3 B posts
6.868 posts
63,6 B posts
53,5 B posts
4.470 posts
4.748 posts
6.019 posts
5.026 posts
129 B posts
4.346 posts
35,9 B posts
2.394 posts
2.851 posts
8.792 posts
2.342 posts