done

kdiff.py

@@ -0,0 +1,21 @@
+#Time Complexity: O(N)
+#Space Complexity: O(N)
+
+class Solution:
+    def findPairs(self, nums: List[int], k: int) -> int:
+
+        res = 0
+        map = {}
+
+        for i in range(len(nums)):
+                map[nums[i]] = map.get(nums[i],0) +1
+
+        for key in map:
+            if k ==0:
+                if map[key] >=2:
+                    res+=1
+            else:
+                if (key + k) in map:
+                    res+=1 
+        return res
+

pascalTriangle.py

@@ -0,0 +1,18 @@
+#Time Complexity: O(numRows²)
+#Space Complexity: O(numRows²)
+
+class Solution:
+    def generate(self, numRows: int) -> List[List[int]]:
+
+        result = []
+
+        for row_num in range(numRows):
+            row = [1]
+
+            if result:
+                rec_row = result[-1]
+                for i in range(1,row_num):
+                    row.append(rec_row[i-1] + rec_row[i])
+                row.append(1)
+            result.append(row)
+        return result