Palindrome Checker
How it works
A palindrome reads the same forwards and backwards: "racecar", "level", "A man a plan a canal Panama". Palindrome detection is a classic string manipulation problem — and extends to numbers, DNA sequences, and even music. The Palindrome Checker tests any text for palindrome status, with options to ignore case, spaces, and punctuation.
**Algorithm** The simplest test: reverse the string and compare to the original. O(n). A slightly more elegant approach uses two pointers (left and right) that walk inward, comparing characters — this stops early on the first mismatch. Both run in O(n) time.
**Types of palindromes** Word palindromes: "level", "radar", "civic", "kayak", "madam". Sentence palindromes (ignoring spaces/punctuation): "Was it a car or a cat I saw?", "Never odd or even", "Do geese see God?". Number palindromes: 12321, 1001. Date palindromes (by format): 2/02/2020 (in MM/DD/YYYY).
**Longest palindromic substring** Finding the longest palindromic substring in a string is a classic algorithms problem solved optimally by Manacher's algorithm in O(n) time. It's used in bioinformatics to find palindromic DNA sequences (restriction enzyme recognition sites are often palindromic in the complementary strand).
**DNA palindromes** In molecular biology, a DNA palindrome is a sequence where the complement read in the opposite direction is identical: GAATTC (EcoRI recognition site) on one strand, read 3'→5', is CTTAAG — the same as the other strand read 5'→3'. These restriction enzyme recognition sites are "molecular palindromes" and are used in genetic engineering for precise DNA cutting.
Privacy: all text processing runs in the browser. No data is transmitted.
Frequently Asked Questions
- 'Tattarrattat' (12 letters), coined by James Joyce in Ulysses (1922) to describe a knock on a door, is often cited as the longest palindromic word in English. 'Rotator' (7), 'repaper' (7), 'reviver' (7), 'racecar' (7) are among common longer palindromes. 'Kayak' (5), 'level' (5), 'civic' (5), 'radar' (5) are well-known. Single-letter and two-letter palindromes exist in many languages. In Finnish, 'saippuakivikauppias' (19 letters) meaning 'soap stone vendor' is reportedly the longest palindromic word in common use.
- The 'Sator Square' (a 2D palindrome) is among the oldest, found in Pompeii (pre-79 CE) and at Cirencester, UK. It reads SATOR AREPO TENET OPERA ROTAS — this 5×5 word square reads the same horizontally, vertically, and backwards. The sentence roughly translates to 'The sower Arepo holds the wheels with effort.' The Latin palindrome 'In girum imus nocte et consumimur igni' ('We go around in the night and are consumed by fire', attributed to describe moths around a flame) is also ancient, though its exact origin is debated.
- Palindromic numbers (numbers that read the same forwards and backwards in base 10: 121, 1331, 12321) have been studied but have no deep mathematical structure — they depend on the arbitrary base-10 representation. However, palindromes exist in all bases: 9 = 1001 in base 2 (binary palindrome). The '196 algorithm' (take any number, add it to its reverse; repeat) is conjectured to eventually produce a palindrome for all starting numbers, but 196 and many others have been tested to millions of digits without producing one — the 'Lychrel numbers'.
- Palindrome detection appears in: (1) Bioinformatics — palindromic DNA sequences are restriction enzyme recognition sites used in molecular cloning. (2) Compiler design — balanced parentheses checking is structurally related to palindrome detection (both use stack-based parsing). (3) Algorithm interviews — 'longest palindromic substring' (solved in O(n) by Manacher's algorithm) and 'valid palindrome' (with character filtering) are classic interview problems. (4) Regular expressions — matching palindromes requires recursive regex or context-sensitive grammar beyond regular languages, which is a key example in formal language theory (palindromes are a context-free but non-regular language).