Permutation substring
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.
Implement
contains_permutation(s: str, t: str) → boolExamples
in
["ab","eidbaooo"]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
["ab","eidbaooo"]truenot run yetsample