# of p's anagrams in s. # Strings consists of lowercase English letters only and the length of # both strings s and p will not be larger than 20,100. # The order of output does not matter. # The ...
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.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results