Leetcode 1347. Minimum Number of Steps to Make Two Strings Anagram
Given two equal-length lowercase strings s and t, compute the minimum number of single-character replacements in t needed to make it an anagram of s by matching character counts; this reduces to summing the positive differences between s's and t's letter frequencies.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.