From 25f4ef9c44ef49033b08debb65cb7f9dfb1c753a Mon Sep 17 00:00:00 2001 From: BharathVuppala96 Date: Thu, 15 Jan 2026 15:01:50 -0800 Subject: [PATCH] 2problem completed --- K-DIFF PAIRS IN ARRAY.py | 15 +++++++++++++++ pascal triangle.py | 16 ++++++++++++++++ 2 files changed, 31 insertions(+) create mode 100644 K-DIFF PAIRS IN ARRAY.py create mode 100644 pascal triangle.py diff --git a/K-DIFF PAIRS IN ARRAY.py b/K-DIFF PAIRS IN ARRAY.py new file mode 100644 index 00000000..b3894c41 --- /dev/null +++ b/K-DIFF PAIRS IN ARRAY.py @@ -0,0 +1,15 @@ +class Solution: + def findPairs(self, nums: List[int], k: int) -> int: + + map=set() + result=set() + + + for i in range(len(nums)): + if nums[i]-k in map: + result.add(tuple([min(nums[i],nums[i]-k),max(nums[i],nums[i]-k)])) + if nums[i]+k in map: + result.add(tuple([min(nums[i],nums[i]+k),max(nums[i],nums[i]+k)])) + map.add(nums[i]) + print(result) + return len(result) diff --git a/pascal triangle.py b/pascal triangle.py new file mode 100644 index 00000000..822fd058 --- /dev/null +++ b/pascal triangle.py @@ -0,0 +1,16 @@ +class Solution: + def generate(self, numRows: int) -> List[List[int]]: + + nums=[] + + + for i in range (numRows): + row = [1]* (i+1) + + for j in range (1,i): + row[j] = nums[i-1][j-1] + nums[i-1][j] + + nums.append(row) + return nums + + \ No newline at end of file