Minimum Steps to Anagram
Given two strings s and t which only contain lowercase English letters. Calculate the minimum number of steps to make s an anagram of t. In each step, you can replace any character in s.
##...
Example
Unlock to view complete problem details
and practice with sample input/output
Was this article helpful?
View Test Cases & Run Code requires membership
Standard Input
Execution Result: