Day 182 – LeetCode #3423: Maximum Subarray Sum After One Operation | #java #200daysofcode #leetcode

🎯 Day 182 – LeetCode #3423: Maximum Subarray Sum After One Operation | Java

Today I took on a dynamic programming challenge that builds on Kadane's algorithm — with a twist!
You're allowed to square one element to boost your subarray sum.

✅ Covered two DP states: without and with squaring
✅ Tracked and updated max sum across iterations
✅ Handled edge cases like negative elements

This problem is a perfect blend of greedy insight and DP skills! 💡🔥

#Java #LeetCode #DynamicProgramming #MaxSubarray #Kadane #CodingChallenge #100DaysOfCode #200DaysOfCode