Finished new problem

Author: PalmaAnd

Java/src/main/java/problems/leetcode/two_pointers/RemoveElement.java

@@ -0,0 +1,13 @@
+package problems.leetcode.two_pointers;
+
+public class RemoveElement {
+    public int removeElement(int[] nums, int val) {
+        int k = 0;
+        for (int i = 0; i < nums.length; i++) {
+            if (nums[i] != val) {
+                nums[k++] = nums[i];
+            }
+        }
+        return k;
+    }
+}

Java/src/test/java/problems/leetcode/two_pointers/RemoveElementTest.java

@@ -0,0 +1,35 @@
+package problems.leetcode.two_pointers;
+
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class RemoveElementTest {
+    RemoveElement r = new RemoveElement();
+
+    @Test
+    public void testSimple() {
+        int[] nums = {3, 2, 2, 3};
+        int val = 3;
+        assertEquals(2, r.removeElement(nums, val));
+    }
+    @Test
+    public void testComplex() {
+        int[] nums = {0, 1, 2, 2, 3, 0, 4, 2};
+        int val = 2;
+        assertEquals(5, r.removeElement(nums, val));
+    }
+    @Test
+    public void testEmptyArray() {
+        int[] nums = {};
+        int val = 3;
+        assertEquals(0, r.removeElement(nums, val));
+    }
+    @Test
+    public void testNonExistingVal() {
+        int[] nums = {2};
+        int val = 3;
+        assertEquals(1, r.removeElement(nums, val));
+    }
+
+}

README.md

@@ -41,9 +41,10 @@ Here is a list of the problems I've solved along with links to the corresponding
 | [Min Stack](https://leetcode.com/problems/min-stack/)                                                 | [Java](Java/src/main/java/problems/leetcode/stack/MinStack.java)                   |
 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)   | [Java](Java/src/main/java/problems/leetcode/stack/ReversePolish.java)              |
 | [3Sum](https://leetcode.com/problems/3sum/)                                                           | [Java](Java/src/main/java/problems/leetcode/two_pointers/ThreeSum.java)            |
+| [Remove Element](https://leetcode.com/problems/kth-distinct-string-in-an-array)                       | [Java](Java/src/main/java/problems/leetcode/two_pointers/RemoveElement.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)|
+| [Roman to Integer](https://leetcode.com/problems/remove-element/)                                     | [Java](Java/src/main/java/problems/leetcode/hash_table/KthDistinctStringInArray.java)|
 
 ## Java Solutions