Merge pull request #92 from allwells/allwells

Solution for question 27

Author: pawangeek

0027/README.md

@@ -0,0 +1,15 @@
+# 27. Remove Elements
+
+## Problem Statement
+
+Given an integer array `nums` and an integer `val`, remove all occurrences of `val` in `nums` in-place. The relative order of the elements may be changed.
+
+Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array `nums`. More formally, if there are `k` elements after removing the duplicates, then the first `k` elements of `nums` should hold the final result. It does not matter what you leave beyond the first `k` elements.
+
+Return `k` after placing the final result in the first `k` slots of `nums`.
+
+Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.
+
+## Link to problem
+
+<https://leetcode.com/problems/remove-element/>

0027/RemoveElements.py

@@ -0,0 +1,16 @@
+from typing import List
+
+
+class Solution:
+
+    def removeElement(self, nums: List[int], val: int) -> int:
+        k = 0
+
+        for n in range(len(nums)):
+
+            # checks which element in the array does not match with val
+            if nums[n] != val:
+                nums[k] = nums[n]
+                k += 1  # increments the value of k by 1
+
+        return k