## What is it? A palindrome string reads the same forwards and backwards. This visualization covers how to check whether a given string is a palindrome using the two-pointer technique. ## How it works - Place `left = 0`, `right = n-1` - Compare `str[left]` and `str[right]` - If they are not equal → not a palindrome, return false - Advance `left++` and `right--` - If pointers cross without a mismatch → it is a palindrome, return true **Alternative:** Reverse the string and compare with the original — equal means palindrome. ## When to use - Validating user input - Pre-check before applying expansion-based palindrome algorithms - As a sub-step in "Longest Palindromic Substring" or similar problems ## Key Points - Two-pointer: O(n) time, O(1) space — optimal - Reversal approach: O(n) time, O(n) space - Odd-length strings have a middle character that is always "equal" to itself