Minimum Number of Steps to Make Two Strings Anagram
Given two strings s and t of equal length, consisting only of lowercase English letters. In one step, you may replace any character in t with another lowercase letter.
Return the **minimum numb...
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: