Day 26: LeetCode Challenges
Today I conquered two challenges – palindrome checking and zero sum subarrays. Let's dive into this coding quest!
Palindrome Check: I tackled the classic palindrome problem by using a two-pointer approach. Ignoring non-alphanumeric characters, I compared characters from both ends of the string. It was immensely satisfying to see my solution pass all tests.
Zero Sum Subarrays: The zero sum subarrays challenge involved understanding prefix sums. By tracking cumulative sums with a hashmap, I efficiently identified subarrays with a sum of zero.
These LeetCode challenges reinforced the power of problem-solving strategies. They highlighted the importance of algorithms, data structures, and coding efficiency.
