Valid Palindrome Visualizer: Two Pointer String Check

Valid Palindrome: how it works

A palindrome reads the same forwards and backwards. The two-pointer technique checks this in O(n) time by comparing characters from both ends moving inward.

1. Two Pointers Setup

   Place a left pointer at index 0 and a right pointer at the last index. They move toward each other.

2. Compare & Move

   At each step, compare the characters at left and right. If they match, move both inward (left++, right--). If they differ, the string is not a palindrome.

3. Result

   If the pointers cross without finding a mismatch, the string is a palindrome. Time: O(n), Space: O(1).