[Leetcode] 1347. Minimum Number of Steps to Make Two Strings Anagram

https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/

Minimum Number of Steps to Make Two Strings Anagram - LeetCode

class Solution:
    def minSteps(self, s: str, t: str) -> int:
        step = 0

        dic_s = {}
        for n in s:
            if dic_s.get(n, None) is None:
                dic_s[n] = 1
            else:
                dic_s[n] += 1

        for key, value in dic_s.items():
            sub = value - t.count(key)
            if sub > 0:
                step += sub

        return step