From ce4e18125f6325f8df92d048c1cd275bf3f6903d Mon Sep 17 00:00:00 2001 From: kanikanegii Date: Tue, 30 Sep 2025 18:38:25 -0700 Subject: [PATCH 1/2] Create pascalTriangle.py --- pascalTriangle.py | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 pascalTriangle.py diff --git a/pascalTriangle.py b/pascalTriangle.py new file mode 100644 index 00000000..386b24cb --- /dev/null +++ b/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 From 842df1d0040feb49661c321d03b5af9b2c2a37bc Mon Sep 17 00:00:00 2001 From: kanikanegii Date: Tue, 30 Sep 2025 18:39:21 -0700 Subject: [PATCH 2/2] Create kdiff.py --- kdiff.py | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 kdiff.py diff --git a/kdiff.py b/kdiff.py new file mode 100644 index 00000000..48a92f42 --- /dev/null +++ b/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 +