diff --git a/src/CommonElementsFinder.java b/src/CommonElementsFinder.java
index fb88a4b..7d98c9b 100644
--- a/src/CommonElementsFinder.java
+++ b/src/CommonElementsFinder.java
@@ -1,4 +1,5 @@
 import java.util.Set;
+import java.util.TreeSet;
 
 /**
  * The CommonElementsFinder class provides a method for finding common elements
@@ -15,7 +16,26 @@ public class CommonElementsFinder {
      */
     public static Set<Integer> findCommonElements(int[] array1, int[] array2) {
         // TODO
-        return null;
+
+        Set<Integer> set1 = new TreeSet<>();
+            for (int num : array1) {
+                set1.add(num);
+            }
+
+
+        Set<Integer> set2 = new TreeSet<>();
+        for (int num : array2) {
+                set2.add(num);
+            }
+
+        Set<Integer> commonNumSet = new TreeSet<>();
+        for (int num : set1) {
+            if (set2.contains(num)) {
+                commonNumSet.add(num);
+            }
+        }
+
+        return commonNumSet;
     }
 
 
diff --git a/src/DuplicateRemover.java b/src/DuplicateRemover.java
index 8d70003..ecf1237 100644
--- a/src/DuplicateRemover.java
+++ b/src/DuplicateRemover.java
@@ -1,4 +1,7 @@
+import java.util.ArrayList;
 import java.util.List;
+import java.util.Set;
+import java.util.TreeSet;
 
 /**
  * The DuplicateRemover class provides a method to remove duplicate words
@@ -15,7 +18,17 @@ public class DuplicateRemover {
      */
     public static List<String> sortAndRemoveDuplicates(String[] words) {
         // TODO
-        return null;
+        Set<String> unique = new TreeSet<>();
+        for (String word : words) {
+            unique.add(word);
+        }
+
+        List<String> wordList = new ArrayList<>();
+        for (String word : unique) {
+            wordList.add(word);
+        }
+
+        return wordList;
     }
 
     public static void main(String[] args) {
diff --git a/src/UniqueCharacterChecker.java b/src/UniqueCharacterChecker.java
index 554ffc4..668758a 100644
--- a/src/UniqueCharacterChecker.java
+++ b/src/UniqueCharacterChecker.java
@@ -1,3 +1,6 @@
+import java.util.HashSet;
+import java.util.Set;
+
 /**
  * The UniqueCharacterChecker class provides a method to check if all characters
  * in a given word are unique.
@@ -14,7 +17,14 @@ public static boolean hasUniqueCharacters(String word) {
         // TODO: implement this!
         // Requirement: This must run in O(n) time, where n is the number of characters in the word
         // Hint: Stuck? Consider looking up "charAt" and seeing how it can help you
-        return false;
+
+        Set<Character> charSet = new HashSet<>();
+
+        for (char c : word.toCharArray()) {
+            charSet.add(c);
+        }
+
+        return charSet.size() == word.length();
     }
 
     public static void main(String[] args) {