Available question text
Given two lowercase strings, find the minimum number of single-character append operations to make them anagrams — this reduces to computing character frequencies and summing the absolute differences for each of the 26 letters (i.e., bringing the smaller count up to the larger for each character).
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 2186. Minimum Number of Steps to Make Two Strings Anagram II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source