Find Palindromes in Text | Dataford Interview Questions

Write a function to identify palindromes within a given text string.

Treat each contiguous sequence of letters as a word. Return the words with at least two letters that read the same forward and backward when compared case-insensitively, preserving their original spelling and text order. Ignore punctuation and whitespace.

Constraints

0 <= len(text) <= 10^5
Words are contiguous sequences of Unicode alphabetic characters
Only words with at least two letters are considered
Return words in their original order and spelling

Function Signature

def identify_palindromes(text):

Your question is Find Palindromes in Text. 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

Write a function to identify palindromes within a given text string.

Constraints

0 <= len(text) <= 10^5
Words are contiguous sequences of Unicode alphabetic characters
Only words with at least two letters are considered
Return words in their original order and spelling

Function Signature

def identify_palindromes(text):

Your question is Find Palindromes in Text. 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.