Palindromic Substrings of Length ≥3 | Dataford Interview Questions

Palindromic Substrings (LC 647) variant: print all palindromic substrings of length >= 3

Asked in the online skills assessment stage. Implement a function that returns every palindromic substring in a string s with length at least 3. Return the substrings in the order they are discovered by expanding around each center from left to right. Do not include duplicates, even if the same substring appears at multiple positions.

Function signature: def palindromic_substrings(s):

Input: a single string s

Output: a list of strings containing the unique palindromic substrings of length >= 3.

Constraints

1 <= len(s) <= 2000
s contains only printable ASCII characters
Return each palindrome once
Preserve discovery order from left to right

Function Signature

def palindromic_substrings(s):

Your question is Palindromic Substrings of Length ≥3. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem