anagram solution Stefan

clean-code-challanges/src/main/java/Anagram.java

@@ -1,3 +1,5 @@
+import java.util.ArrayList;
+import java.util.Arrays;
 import java.util.List;
 
 /**
@@ -7,11 +9,36 @@
  */
 public class Anagram {
 
-  public Anagram(String word) {
+  private String word;
 
+  public Anagram(String word) {
+    this.word = word;
   }
 
   public List<String> match(List<String> candidates) {
-    return null;
+
+    List <String> anagrams = new ArrayList<>();
+    String sortedWord = getSortedWord(word);
+
+    if (candidates == null || candidates.size() == 0) {
+      return null;
+    }
+
+    for (String candidate : candidates) {
+      if (word.toLowerCase().equals(candidate.toLowerCase())) {
+        continue;
+      }
+      String sortedCandidate = getSortedWord(candidate);
+      if (sortedWord.equals(sortedCandidate)) {
+        anagrams.add(candidate);
+      }
+    }
+    return anagrams;
+  }
+
+  public String getSortedWord(String word) {
+    char [] letters = word.toLowerCase().toCharArray();
+    Arrays.sort(letters);
+    return new String(letters);
   }
 }

clean-code-challanges/src/test/java/AnagramTest.java

@@ -10,7 +10,6 @@
 import static org.junit.Assert.assertThat;
 import static org.junit.Assert.assertTrue;
 
-@Ignore
 public class AnagramTest {
 
   @Test

clean-code-challanges/src/test/java/PigLatinTranslatorTest.java

@@ -1,3 +1,4 @@
+import org.junit.Ignore;
 import org.junit.Test;
 import org.junit.runner.RunWith;
 import org.junit.runners.Parameterized;
@@ -8,6 +9,7 @@
 import static org.junit.Assert.assertEquals;
 
 @RunWith(Parameterized.class)
+@Ignore
 public class PigLatinTranslatorTest {
 
   private String englishPhrase;