python C++速解Leetcode 1347 Minimum Number of Steps to Make Two Strings A...

python cpp速解Leetcode 1347  Minimum Number of Steps to Make Two Strings Anagram

No need for hash table. there are are just 26 alphabets.

s is anagram of t  ⟺ freq(s)==freq(t)

In other words, s is a permutation of t.

[codes on Leetcodes]https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/solutions/4555476/freq-count-o-26-space-1-line-8ms-beats-100/

[Leetcode playList]https://www.youtube.com/watch?v=TqKZGAHLKdw&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk