Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1347. Minimum Number of Steps to Make Two Strings Anagram
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source