Photo by Phyllis Poon on Unsplash

Given two List of strings a and b, we need to find the minimum number of manipulations required to make each two strings anagram from the two lists.

Time Complexity: O(n), where n is the length of the string.

Full Stack Programmer, love to solve problem’s during free time.