🧩 Day 25: LC 974 {Subarray Sums Divisible by K}
💡 Prefix Sum + Hashmap
Track prefix sum remainders in a frequency map.
Key trick: add 'k' to negative remainders to keep them valid!
Matching remainders = a divisible subarray found.
#DailyCoding #ProblemSolving #TecO6
🧩 Day 24: LC 152 {Max Product Subarray}
💡 Kadane's Algo
Track min/max products to handle negatives.
Two negatives can multiply into the new global maximum!
#DailyCoding #JobSearch #TecUL
🧩 Day 23: LC 53 {Max Subarray}
💡 Kadane's Algorithm
Extend the sum or start fresh at current element.
Global max tracks the best subarray found!
#DailyCoding #JobSearch #Tecyy