Remove all solution markdown, task images, solution PDFs, and add renamed folder structure as part of THB-wide reorganization.

uebung_01/src/task4/AnagrammChecker.java

@@ -0,0 +1,35 @@
+package task4;
+
+import java.lang.reflect.Array;
+import java.util.Arrays;
+
+public class AnagrammChecker {
+    private String word0;
+    private String word1;
+
+    public AnagrammChecker(String word0, String word1){
+        this.word0 = word0;
+        this.word1 = word1;
+    }
+
+
+
+    public void isAnagram(){
+        String sortedWord0 = sortString(word0);
+        String sortedWord1 = sortString(word1);
+
+        if (sortedWord1.equals(sortedWord0)) {
+            System.out.println("Die Wörter sind Anagramme.");
+        } else {
+            System.out.println("Die Wörter sind keine Anagramme.");
+        }
+    }
+
+    private String sortString(String string) {
+        char tempArr[] = string.toCharArray();
+
+        Arrays.sort(tempArr);
+
+        return new String(tempArr);
+    }
+}

uebung_01/src/task4/AnagrammCheckerAI.java

@@ -0,0 +1,27 @@
+package task4;
+
+import java.util.Arrays;
+
+public class AnagrammCheckerAI {
+    private String word0;
+    private String word1;
+
+    public AnagrammCheckerAI(String word0, String word1){
+        this.word0 = word0;
+        this.word1 = word1;
+    }
+
+
+
+    public boolean isAnagram() {
+        if (word0 == null || word1 == null) {
+            return false;
+        }
+        char[] chars0 = word0.toLowerCase().toCharArray();
+        char[] chars1 = word1.toLowerCase().toCharArray();
+        Arrays.sort(chars0);
+        Arrays.sort(chars1);
+        return Arrays.equals(chars0, chars1);
+    }
+
+}