Competitive coding 3 complete

Problem1.py

@@ -0,0 +1,35 @@
+# 532. K-diff Pairs in an Array
+class Solution:
+    def findPairs(self, nums: List[int], k: int) -> int:
+        Map = {}
+        count = 0
+
+        for n in nums:
+            if n not in Map:
+                Map[n] = 1
+            else:
+                Map[n] += 1
+        print(Map)
+
+        if k == 0:
+            for n in nums:
+                if n in Map:
+                    if Map[n] > 1:
+                        count += 1
+                    Map[n] = 0
+            return count
+
+
+        for n in nums:
+            value = n-k
+            if value in Map:
+                count += 1
+                Map.pop(value)
+            else:
+                count += 0
+
+        return count
+
+
+
+

Problem2.py

@@ -0,0 +1,30 @@
+# 118. Pascal's Triangle
+class Solution:
+    def generate(self, numRows: int) -> List[List[int]]:
+        output = []
+        def getRow(r,c):
+            result = [1]
+            ans = 1
+
+            for i in range(1,r+1):
+                ans = ans * ((r+1)-i) // i
+                result.append(ans)
+            return result
+
+        for i in range(numRows):
+            output.append(getRow(i,i+1))
+
+        return output
+
+
+
+
+
+
+
+
+
+
+
+
+