[Feat] Add some implementation

Author: AustinPardosi

1-TwoSum.py

@@ -0,0 +1,9 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        hashMap = {}
+        for i, num in enumerate(nums):
+            temp = target - num
+            if temp in hashMap:
+                return hashMap[temp], i
+            hashMap[num] = i
+        return

217-ContainsDuplicate.py

@@ -0,0 +1,8 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        dataSet = set()
+        for num in nums:
+            if num in dataSet:
+                return True
+            dataSet.add(num)
+        return False

242-ValidAnagram.py

@@ -0,0 +1,20 @@
+class Solution:
+    def isAnagram(self, s: str, t: str) -> bool:
+        if len(s) != len(t):
+            return False
+
+        hashMapS = {}
+        for num in s:
+            if num not in hashMapS:
+                hashMapS[num] = 1
+            else:
+                hashMapS[num] += 1
+
+        hashMapT = {}
+        for num in t:
+            if num not in hashMapT:
+                hashMapT[num] = 1
+            else:
+                hashMapT[num] += 1
+
+        return hashMapS == hashMapT

49-GroupAnagrams.py

@@ -0,0 +1,14 @@
+class Solution:
+    def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
+        hashMap = {}
+        result = []
+        for str in strs:
+            sortedString = "".join(sorted(str))
+            if sortedString not in hashMap:
+                hashMap[sortedString] = [str]
+            else:
+                hashMap[sortedString].append(str)
+
+        for val in hashMap.values():
+            result.append(val)
+        return result