Given two arrays of strings X and Y of equal length, for each pair (X[i], Y[i]), calculate the minimum number of character alterations required to make X[i] an anagram of Y[i]. If lengths differ…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.