Finished new Leetcode problem

Author: PalmaAnd

Java/src/main/java/problems/leetcode/hash_table/KthDistinctStringInArray.java

@@ -0,0 +1,23 @@
+package problems.leetcode.hash_table;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class KthDistinctStringInArray {
+    public String kthDistinct(String[] arr, int k) {
+        Map<String, Boolean> map = new HashMap<String, Boolean>();
+        for (String s : arr) {
+            if (!map.containsKey(s))
+                map.put(s, true);
+            else
+                map.put(s, false);
+        }
+        for (String s : arr) {
+            if (map.get(s)) {
+                k--;
+                if (k == 0) return s;
+            }
+        }
+        return "";
+    }
+}

Java/src/test/java/problems/leetcode/hash_table/KthDistinctStringInArrayTest.java

@@ -0,0 +1,32 @@
+package problems.leetcode.hash_table;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class KthDistinctStringInArrayTest {
+
+    @Test
+    void testSimple() {
+        KthDistinctStringInArray kthDistinctStringInArray = new KthDistinctStringInArray();
+        String[] input = {"d", "b", "c", "b", "c", "a"};
+        String result = kthDistinctStringInArray.kthDistinct(input, 2);
+        assertEquals("a", result);
+    }
+
+    @Test
+    void testMultipleSymbols() {
+        KthDistinctStringInArray kthDistinctStringInArray = new KthDistinctStringInArray();
+        String[] input = {"aaa", "aa", "a"};
+        String result = kthDistinctStringInArray.kthDistinct(input, 1);
+        assertEquals("aaa", result);
+    }
+
+    @Test
+    void testComplexString() {
+        KthDistinctStringInArray kthDistinctStringInArray = new KthDistinctStringInArray();
+        String[] input = {"a", "b", "a"};
+        String result = kthDistinctStringInArray.kthDistinct(input, 3);
+        assertEquals("", result);
+    }
+}

Java/src/test/java/problems/leetcode/hash_table/RomanToIntegerTest.java

@@ -2,7 +2,6 @@
 
 import org.junit.jupiter.api.Test;
 
-import static org.junit.jupiter.api.Assertions.assertArrayEquals;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 
 class RomanToIntegerTest {

README.md

@@ -43,6 +43,7 @@ Here is a list of the problems I've solved along with links to the corresponding
 | [3Sum](https://leetcode.com/problems/3sum/)                                                           | [Java](Java/src/main/java/problems/leetcode/two_pointers/ThreeSum.java)            |
 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)                          | [Java](Java/src/main/java/problems/leetcode/others/LongestCommonPrefix.java)       |
 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer)                                    | [Java](Java/src/main/java/problems/leetcode/hash_table/RomanToInteger.java)        |
+| [Roman to Integer](https://leetcode.com/problems/kth-distinct-string-in-an-array)                     | [Java](Java/src/main/java/problems/leetcode/hash_table/KthDistinctStringInArray.java)|
 
 ## Java Solutions