Sliding Window Pattern Search | Dataford Interview Questions

Implement a sliding window algorithm to search for palindromes or specific patterns within a large body of text.

Implement find_palindromes(text, min_length, max_length) to return every palindromic substring whose length is within the inclusive range. Return each match as [start, end], using a zero-based start index and an exclusive end index. Sort results by start index, then end index.

Input and Output

text is a string. min_length and max_length are integers. Return a list of two-element lists.

Constraints

1 <= len(text) <= 10000
1 <= min_length <= max_length <= len(text)
text contains printable ASCII characters
Return every matching substring, including overlapping matches

Function Signature

def find_palindromes(text, min_length, max_length):

Your question is Sliding Window Pattern Search. 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