Completed Competitive_Coding-3

K-diff pairs in Array

@@ -0,0 +1,22 @@
+class Solution:
+    def findPairs(self, nums: List[int], k: int) -> int:
+
+        nums = sorted(nums)
+
+        left = 0
+        right = 1
+
+        result = 0
+
+        while (left < len(nums) and right < len(nums)):
+            if (left == right or nums[right] - nums[left] < k):
+                right += 1
+            elif nums[right] - nums[left] > k:
+                left += 1
+            else:
+                left += 1
+                result += 1
+                while (left < len(nums) and nums[left] == nums[left - 1]):
+                    left += 1
+
+        return result

Pascal's Triangle

@@ -0,0 +1,14 @@
+class Solution:
+    def generate(self, num_rows: int) -> List[List[int]]:
+        triangle = []
+
+        for row_num in range(num_rows):
+            row = [None for _ in range(row_num + 1)]
+            row[0], row[-1] = 1, 1
+
+            for j in range(1, len(row) - 1):
+                row[j] = triangle[row_num - 1][j - 1] + triangle[row_num - 1][j]
+
+            triangle.append(row)
+
+        return triangle