Minimum Number of Steps to Make Two Strings Anagram II

Problem Description

You are given two strings s and t. In one step, you can append any character to either s or t.

Return the minimum number of steps to make s and t anagrams of each other.

An anagram of a string is a string that contains the same characters with a different (or the same) ordering.

Example 1:

Input: s = "leetcode", t = "coats"
Output: 7
Explanation: 
- In 2 steps, we can append the letters in "as" onto s = "leetcode", forming s = "leetcodeas".
- In 5 steps, we can append the letters in "leede" onto t = "coats", forming t = "coatsleede".
"leetcodeas" and "coatsleede" are now anagrams of each other.
We used a total of 2 + 5 = 7 steps.
It can be shown that there is no way to make them anagrams of each other with less than 7 steps.

Example 2:

Input: s = "night", t = "thing"
Output: 0
Explanation: The given strings are already anagrams of each other. Thus, we do not need any further steps.

Constraints:

• 1 <= s.length, t.length <= 2 * 105
• s and t consist of lowercase English letters.

Solution (Go)

func minSteps(s string, t string) int {
	steps := 0
	sMap := make(map[rune]int)
	tMap := make(map[rune]int)
	for _, r := range s {
		sMap[r]++
	}
	for _, r := range t {
		tMap[r]++
	}
	for k, v := range sMap {
		if v > tMap[k] {
			steps += v - tMap[k]
		}
	}
	for k, v := range tMap {
		if v > sMap[k] {
			steps += v - sMap[k]
		}
	}
	return steps
}