## [f]izzbuzzer

### Looking for good programming challenges?

Use the search below to find our solutions for selected questions!

# Fun with Anagrams

Sharing is caring!

Problem Statement
Two strings are anagrams if they are permutations of each other. For example, “aaagmnrs” is an anagram of “anagrams”. Given an array of strings, remove each string that is an anagram of an earlier string, then return the remaining array in sorted order.

For example, given the strings `s = ['code', 'doce', 'ecod', 'framer', 'frame']`, the strings `'doce'` and `'ecod'` are both anagrams of `'code'` so they are removed from the list. The words `'frame'` and `'framer'` are not anagrams due to the extra `'r'` in `'framer'`, so they remain. The final list of strings in alphabetical order is `['code', 'frame', 'framer']`.

Function Description
Complete the function `funWithAnagrams` in the editor below. It must return a list of strings in alphabetical order, ascending.

funWithAnagrams has the following parameters:

• `s[s,...s[n-1]]`: an array of strings

Constraints
1 ≤ n ≤ 1000
1 ≤ |s[i]| ≤ 1000
Each string s[i] is made up of characters in the range ascii[a-z]

Sample Input For Custom Testing

``````4
code
aaagmnrs
anagrams
doce
``````

Sample Output

``````aaagmnrs
code
``````

Explanation
aaagmnrs and anagrams are anagrams, code and doce are anagrams. After sorting aaagmnrs comes first.

Solution

```public class FunWithAnagrams {

public static boolean areAnagram(String w1, String w2) {
char[] chr1 = w1.toCharArray();
char[] chr2 = w2.toCharArray();

// Sorting the two arrays and checking for equality also works, but this is faster

int[] count = new int;
for (char ch : chr1) {
count[ch - 97] = count[ch - 97] + 1;
}

for (char ch : chr2) {
count[ch - 97] = count[ch - 97] - 1;
}

for (int n : count) {
if (n != 0) {
return false;
}
}

return true;
}

public static String key(String word) {
char[] chrs = word.toCharArray();
Arrays.sort(chrs);
return new String(chrs);
}

public static List<String> funWithAnagrams(List<String> s) {
Set<String> found = new HashSet<String>();
for (int i=0; i<s.size(); i++) {
String word = s.get(i);
String key = key(word);
if (!found.contains(key)) {
}

}

Collections.sort(ans);

return ans;
}

public static void main(String[] args) throws FileNotFoundException {
//List<String> a = Arrays.asList("code", "doce", "ecod", "framer", "frame");
List<String> a = Arrays.asList("code", "aaagmnrs", "anagrams", "doce");
System.out.println(funWithAnagrams(a));
}

}
```