1
class Solution:
2
    def checkInclusion(self, s1: str, s2: str) -> bool:
3
        if len(s1) > len(s2):
4
            return False
5
        s1_map = {}
6
        s2_map = {}
7
        for i in range(ord("a"), ord("z") + 1):
8
            s1_map[chr(i)] = 0
9
            s2_map[chr(i)] = 0
10

11
        for i in s1:
12
            s1_map[i] += 1
13

14
        l = 0
15
        r = 0
16

17
        while r < len(s2):
18
            print(s2_map, l, r)
19
            if r == 0:
20
                while r < len(s1):
21
                    s2_map[s2[r]] += 1
22
                    r += 1
23
                if s2_map == s1_map:
24
                    return True
25

26
            else:
27
                s2_map[s2[l]] -= 1
28
                s2_map[s2[r]] += 1
29

30
                if s2_map == s1_map:
31
                    return True
32
                else:
33
                    l += 1
34
                    r += 1
35

36
        return False