FastPrep
Problem · String

Anagram Difference 🌿

Learn this problem
● EasyIxlFULLTIMEOA

Problem statement

An anagram is a word whose characters can be rearranged to create another word. Given two strings, determine the minimum number of characters in either string that must be modified to make the two strings anagrams. If it is not possible to make the two strings anagrams, return -1.

Function

getMinimumDifference(a: String[], b: String[]) → int[]

Complete the function getMinimumDifference in the editor.

getMinimumDifference has the following parameter(s):

  1. 1. String[] a: an array of strings
  2. 2. String[] b: an array of strings

Returns

int[]: the minimum number of characters in either string that needs to be modified to make the two strings anagrams or -1 if it is not possible

Examples

Example 1

a = ["tea", "tea", "act"]b = ["ate", "toe", "acts"]return = [0, 1, -1]

  • a[0] = tea and b[0] = ate are anagrams, so 0 characters need to be modified.
  • a[1] = tea and b[1] = toe are not anagrams. Modify 1 character in either string (o -> a or a -> o) to make them anagrams.
  • a[2] = act and b[2] = acts are not anagrams and cannot be converted to anagrams because they contain different numbers of characters.
  • The return array is [0, 1, -1]

Constraints

  • Each string consists of lowercase characters [a-z].
  • 1 ≤ n ≤ 100
  • 0 ≤ |a[i]|, |b[i]| ≤ 104

    • More Ixl problems

    drafts saved locally
    public int[] getMinimumDifference(String[] a, String[] b) {
    // write your code here
}
    a["tea", "tea", "act"]
    b["ate", "toe", "acts"]
    expected[0, 1, -1]
    checking account