Competitive-Coding-3 Done

Problem1.py

@@ -0,0 +1,16 @@
+# Time Complexity = O(n)  Space Complexity = O(n)
+from collections import Counter
+class Solution:
+    def findPairs(self, nums: list[int], k: int) -> int:
+        count = 0
+        c = Counter(nums)
+        for key, val in c.items():
+            if k == 0:
+                if val > 1:
+                    count += 1
+            else:
+                if key + k in c:
+                    count += 1
+
+        return count
+

Problem2.py

@@ -0,0 +1,14 @@
+class Solution:
+    def generate(self, numRows: int) -> list[list[int]]:
+        dp = []
+        for i in range(1, numRows + 1):
+            dp.append([0] * i)
+
+        for i in range(0, numRows):
+            for j in range(0, i + 1):
+                if j == 0 or j == i:
+                    dp[i][j] = 1
+                else:
+                    # The previous values both are added together
+                    dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]
+        return dp