#1347

Minimum Number of Steps to Make Two Strings Anagram

pupil · 415 · lc medium +25 · verified · 82.5% accepted · 2,821 likes · top 94%

Description

You have two strings s and t of the same length. In one step you may replace any character in t. Return the minimum number of replacements needed to make t an anagram of s (containing the same characters in any order).

Example 1:

Input: s = "bab", t = "aba"

Output: 1

Explanation: Replace the first 'a' in t with b, t = "bba" which is anagram of s.

Example 2:

Input: s = "leetcode", t = "practice"

Output: 5

Explanation: Replace 'p', 'r', 'a', 'i' and 'c' from t with proper characters to make t anagram of s.

Example 3:

Input: s = "anagram", t = "mangaar"

Output: 0

Explanation: "anagram" and "mangaar" are anagrams.

Code

1

2

3

class Solution:
    def minSteps(self, s: str, t: str) -> int:

class Solution:
    def minSteps(self, s: str, t: str) -> int: