PreviousNext
Coding/Arrays and strings

Permutation substring

Write codeMedium25 min

Your task

Return True if the string t contains any permutation (anagram) of the string s as a contiguous substring, otherwise False. Both strings consist of lowercase English letters. For example, t = "eidbaooo" contains "ba", a permutation of s = "ab", so the answer is True; t = "eidboaoo" does not. If len(s) > len(t) the answer is False. Aim for O(len(t)) time.

Examples

contains_permutation(s: str, t: str) -> bool
Example 1
Inputcontains_permutation("ab", "eidbaooo")
OutputTrue