From fd97368e3ee8779f1dcba4cdf0e1a8b06d5c843f Mon Sep 17 00:00:00 2001 From: Shakthi Nandana Date: Mon, 27 Apr 2026 20:21:14 -0400 Subject: [PATCH] Solution for interview problems --- kdiff.py | 30 ++++++++++++++++++++++++++++++ pascalstriangle.py | 23 +++++++++++++++++++++++ 2 files changed, 53 insertions(+) create mode 100644 kdiff.py create mode 100644 pascalstriangle.py diff --git a/kdiff.py b/kdiff.py new file mode 100644 index 00000000..4eb506d4 --- /dev/null +++ b/kdiff.py @@ -0,0 +1,30 @@ +# // Time Complexity : O(n) +# // Space Complexity : O(n) +# // Did this code successfully run on Leetcode : yes + +class Solution(object): + def findPairs(self, nums, k): + """ + :type nums: List[int] + :type k: int + :rtype: int + """ + frqmap={} + c=0 + for n in nums: + if n in frqmap: + frqmap[n]+=1 + else: + frqmap[n]=1 + + for n in frqmap: + check=n+k + if check in frqmap: + if k==0 and frqmap[check]>1: + c+=1 + elif k!=0: + c+=1 + + return c + + \ No newline at end of file diff --git a/pascalstriangle.py b/pascalstriangle.py new file mode 100644 index 00000000..d506c361 --- /dev/null +++ b/pascalstriangle.py @@ -0,0 +1,23 @@ +# // Time Complexity : O(n^2) +# // Space Complexity : O(1) excluding output +# // Did this code successfully run on Leetcode : Yes + +class Solution(object): + def generate(self, numRows): + """ + :type numRows: int + :rtype: List[List[int]] + """ + if numRows==1: + return [[1]] + res=[[1],[1,1]] + for i in range(3,numRows+1): + newrow = [1] + prev=res[-1] + for j in range(len(prev)-1): + newrow.append(prev[j]+prev[j+1]) + newrow.append(1) + res.append(newrow) + + return res + \ No newline at end of file