Get Minimum Difference
Get Minimum Difference is an Ibm interviews coding interview question. Given two same-sized string arrays a and b, determine for each pair the minimum number of character changes in either string to make them anagrams, or return -1 if impossible. Strings use lowercase a–z. Return an int array with results per pair. A clear string manipulation interview problem and interview question.
Example
Unlock to view complete problem details
and practice with sample input/output
Was this article helpful?
View Test Cases & Run Code requires membership
Input Variables
Execution Result:
