Minimum Number of Steps to Make Two Strings Anagram
You are given two strings of the same length s and t. In one step you can choose any character of t and replace it with another character.
Return the minimum number of steps to make t an anagram of s.
An Anagram of a string is a string that contains the same characters with a different (or the same) ordering.
Example 1
Input
s = "bab", t = "aba"Output
1Replace the first 'a' in
t with b, making t = "bba", which is an anagram of s.Example 2
Input
s = "leetcode", t = "practice"Output
5Replace 'p', 'r', 'a', 'i', and 'c' from
t with proper characters to make t an anagram of s.Constraints
- 1 <= s.length <= 5 * 10^4
- s.length == t.length
- s and t consist of lowercase English letters only.