class Solution:

    def findAnagrams(self, s: str, p: str) -> List[int]:

        my_dict = {}

        res = []

        count = 0

        for char in p:

            freq = my_dict.get(char, 0)

            my_dict[char] = freq + 1

        for i in range(len(s)):

            char = s[i]

            if char in my_dict:

                my_dict[char] -= 1

                if my_dict[char] == 0:

                    count += 1

            if i >= len(p):

                start = i - len(p)

                start_char = s[start]

                if start_char in my_dict:

                    my_dict[start_char] += 1

                    if my_dict[start_char] == 1:

                        count -= 1

            # check my_dict size instead of len(p)

            if count == len(my_dict):

                res.append(i - len(p) + 1)

        return res

public class Solution {

  public List<Integer> allAnagrams(String sh, String lo) {

    // Write your solution here

    Map<Character, Integer> map = new HashMap<>();

    char[] charArr = sh.toCharArray();

    for (int i = 0; i < charArr.length; i++) {

      map.put(charArr[i], map.getOrDefault(charArr[i], 0) + 1);

    }

    List<Integer> res = new ArrayList<>();

    char[] lCharArr = lo.toCharArray();

    int count = 0;

    int start = 0;

    for (int i = 0; i < lCharArr.length; i++) {

      char cur = lCharArr[i];

      if (map.containsKey(cur)) {

        int num = map.get(cur);

        if (num == 1) {

          count += 1;

        }

        map.put(cur, num - 1);

      }

      if (i >= sh.length()) {

        start = i - sh.length();

        if (map.containsKey(lCharArr[start])) {

          int startNum = map.get(lCharArr[start]);

          if (startNum == 0) {

            count -= 1;

          }

          map.put(lCharArr[start], startNum + 1);

        }

      }

      if (count == map.size()) {

        res.add(i - sh.length() + 1);

      }

    }

    return res;

  }

}