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