Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· 1d-dp Mock interview

Palindromic Substrings

Given a string `s`, return the number of palindromic substrings (substrings that read the same forwards and backwards). Different positions count separately even if equal.

Examples

in: s = "abc"

out: 3

a, b, c

in: s = "aaa"

out: 6

a, a, a, aa, aa, aaa

Constraints

1 <= len(s) <= 1000
s is lowercase letters

Hints

target: O(n^2) time⌘↩ run · ⇧⌘↩ submit