Update

Author: yashprsin

DSA_RoadMap/01_ContainsDupicate.py

@@ -0,0 +1,57 @@
+from typing import List
+
+# ---------------------- Solution 1 -----------------------
+
+# class Solution:
+#     def containsDuplicate(self, nums: List[int]) -> bool:
+#         n = len(nums)
+#         for i in range(n):
+#             for j in range(i+1,n):
+#                 # print(nums[i], nums[j])
+#                 if nums[i] == nums[j]:
+#                     return True
+#         return False
+
+# ---------------------- Solution 2 -----------------------
+
+# class Solution:
+#     def containsDuplicate(self, nums: List[int]) -> bool:
+#         seen = set()
+#         print(seen)
+#         for num in nums:
+#             if num in seen:
+#                 return True
+#             seen.add(num)
+#         return False
+
+# ---------------------- Solution 3 -----------------------
+
+
+# class Solution:
+#     def containsDuplicate(self, nums: List[int]) -> bool:
+#         hs = set(nums)
+#         return len(hs) != len(nums)
+
+
+# ---------------------- Solution 4 -----------------------
+
+# class Solution:
+#     def containsDuplicate(self, nums: List[int]) -> bool:
+#         nset = set()
+#         for num in nums:
+#             if num in nset:
+#                 return True
+#             nset.add(num)
+#         return False
+
+# ---------------------- Solution 5 -----------------------
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        nd =len(set(nums))
+        if len(nums) == nd:
+            return False
+        else:
+            return True
+
+nums = [1,2,3,1]
+print(Solution().containsDuplicate(nums))

DSA_RoadMap/02_ValidAnagram.py

@@ -0,0 +1,38 @@
+
+# ---------------------- Solution 1 -----------------------
+
+
+# class Solution:
+#     def isAnagram(self, s: str, t: str) -> bool:
+#         if len(s) == len(t):
+#             if  sorted(s) == sorted(t):
+#                 return True
+#         return False
+
+# ---------------------- Solution 2 -----------------------
+
+
+# class Solution:
+#     def isAnagram(self, s: str, t: str) -> bool:
+#         if len(s) != len(t):
+#             return False
+         
+#         freq1 = Counter(s)
+#         freq2 = Counter(t)
+        
+#         for i in freq1:
+#             if freq1[i] != freq2[i]:
+#                 return False
+
+#         return True
+
+# ---------------------- Solution 3 -----------------------
+
+
+class Solution:
+    def isAnagram(self, s: str, t: str) -> bool:
+        return sorted(s) == sorted(t)
+
+s1 = "anagram"
+t1 = "nagaran"
+print(Solution().isAnagram(s1, t1))

DSA_RoadMap/03_TwoSum.py

@@ -0,0 +1,30 @@
+from typing import List
+
+# class Solution:
+#     def twoSum(self, nums: List[int], target: int) -> List[int]:
+#         n = len(nums)
+#         for i in range(n):
+#             for num2 in range(i+1, n):
+#                 print(nums[i] , nums[num2])
+#                 if nums[i] + nums[num2] == target:
+#                     return [i, num2]
+#                 # raise ValueError("No solution found")
+
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        hmap = {}
+        for i in range(len(nums)):
+            hmap[nums[i]] = i
+        for i in range(len(nums)):
+            complement = target - nums[i]
+            if complement in hmap and hmap[complement] != i:
+                return [i, hmap[complement]]
+
+
+
+
+nums = [3,2,4]
+target = 6
+
+print(Solution().twoSum(nums, target))