Minimum Number of Steps to Make Two Strings Anagram II LeetCode solution in Python

1
class Solution:
2
    def minSteps(self, s: str, t: str) -> int:
3
        sMap = dict()
4
        tMap = dict()
5

6
        for character in s:
7
            sMap[character] = sMap.get(character, 0) + 1
8

9
        for character in t:
10
            tMap[character] = tMap.get(character, 0) + 1
11

12
        count = 0
13

14
        for key, value in sMap.items():
15
            if value >= tMap.get(key, 0):
16
                count += value - tMap.get(key, 0)
17

18
        for key, value in tMap.items():
19
            if value >= sMap.get(key, 0):
20
                count += value - sMap.get(key, 0)
21

22
        return count