LeetCode 906: Super Palindromes
A clear explanation of counting super-palindromes by generating palindromic roots and checking their squares.
Tag
Palindrome
9 notes
LeetCode 866: Prime Palindrome
A clear explanation of finding the smallest prime palindrome greater than or equal to n by generating odd-length palindromes and testing primality.
LeetCode 730: Count Different Palindromic Subsequences
Count distinct non-empty palindromic subsequences using interval dynamic programming and duplicate handling.
LeetCode 647: Palindromic Substrings
A center expansion solution for counting every palindromic substring in a string.
LeetCode 564: Find the Closest Palindrome
A clear explanation of Find the Closest Palindrome using prefix mirroring and a small candidate set.
LeetCode 479: Largest Palindrome Product
A clear explanation of finding the largest palindrome made from the product of two n-digit numbers by generating palindrome candidates directly.
LeetCode 214: Shortest Palindrome
A clear explanation of building the shortest palindrome by finding the longest palindromic prefix using KMP.
LeetCode 132: Palindrome Partitioning II
Find the minimum number of cuts needed to split a string into palindromic substrings using palindrome precomputation and dynamic programming.
LeetCode 5: Longest Palindromic Substring
A detailed explanation of finding the longest palindromic substring using expand-around-center.