Skip to main content
Palindromic Substrings | AlgoCracked
AlgoCracked
ProblemsPalindromic Substrings
Medium69.0% acceptance
Blind75Dynamic ProgrammingStringTwo Pointers

Palindromic Substrings

Given a string s , return the number of palindromic substrings in it. Substrings at different start or end positions are counted separately even if they are equal as text. Input format Input is [s] , e.g. [ aaa ] .

Loading workspace…