Day 1 final practice code update

rubix-coder · rubix-coder · commit 8775c4a1fe01 · 2024-11-17T22:58:07.000+05:30
diff --git a/leetcode-master/arrays_and_hashing/two_sum.py b/leetcode-master/arrays_and_hashing/two_sum.py
@@ -59,6 +59,7 @@ def twoSum(self, nums, target):
 Beats 65.07% of users with Python3
 """
 
+
 # Solution 2 : One Pass Hash Table
 class Solution_2:
     def twoSum(self, nums, target):
@@ -73,7 +74,7 @@ def twoSum(self, nums, target):
 
 obj = Solution_2()
 ans = obj.twoSum([2, 7, 11, 15], 9)
-print(ans)
+# print(ans)
 
 """
 ================= Results ====================================
@@ -84,4 +85,22 @@ def twoSum(self, nums, target):
 Memory
 18.12 MB
 Beats 6.37% of users with Python3
-"""
+"""
+
+
+# Solution 3 :
+
+
+class Solution_3:
+    def twoSum(nus, target):
+        cleaned = []
+        for i in nus:
+            if i <= target:
+                cleaned.append(i)
+        for i in cleaned:
+            if target-cleaned[i] in cleaned:
+                return [nus.index(cleaned[i]), nus.index(target-cleaned[i])]
+
+
+sol_3 = Solution_3.twoSum(nus = [1, 2, 3, 6], target = 10)
+print(sol_3)
diff --git a/leetcode-master/arrays_and_hashing/valid_anagram.py b/leetcode-master/arrays_and_hashing/valid_anagram.py
@@ -126,3 +126,19 @@ def isAnagram(self, s: str, t: str) -> bool:
 45ms Beats 76.79%
 16.94MB Beats 43.51%
 """
+
+
+
+from collections import defaultdict
+class Solution5:
+    def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
+        anagram_dict = defaultdict(list)
+        result = []
+
+        for s in strs:
+            sorted_s = tuple(sorted(s))
+            anagram_dict[sorted_s].append(s)
+
+        return list(anagram_dict.values())
+
+# https://leetcode.com/problems/group-anagrams/submissions/1455490795
