Completed Competitive-Coding-3

K-diffPairs.py

@@ -0,0 +1,28 @@
+class Solution:
+    def findPairs(self, nums: List[int], k: int) -> int:
+        # TC : O(n)
+        # SC : O(n)
+        seen = set()    # Initialize a set to keep track of seen numbers
+        pairs = set()   # Initialize a set to store unique pairs
+
+
+        for n in nums:
+            pair1 = n + k  
+            pair2 = n - k   
+
+            # Check if | val| has been seen and 
+            # if the pair (n, pair1) is not already counted
+            if pair1 in seen and (pair1, n) not in seen:
+                pairs.add((n, pair1))
+
+            # Check if |-val| has been seen and 
+            # if the pair (n, pair2) is not already counted
+            if pair2 in seen and (pair2, n) not in seen:
+                pairs.add((pair2, n))
+
+            # Add the current number to the seen set for future pair checks
+            seen.add(n)
+
+        # Return the number of unique pairs found
+        return len(pairs) 
+

PascalTriangle.py

@@ -0,0 +1,19 @@
+class Solution:
+    def generate(self, numRows: int) -> List[List[int]]:
+        # TC: O(n**2)
+        # SC: O(n**2)
+        if numRows == 0:
+            return []
+        res = [[1]]
+        if numRows == 1:
+            return res
+
+        for _ in range(numRows - 1):
+            dummy_row = [0] + res[-1] + [0]
+            row = []
+
+            for i in range(len(res[-1]) + 1):
+                row.append(dummy_row[i] + dummy_row[i+1])
+            res.append(row)
+
+        return res