From 58171feea99ec874ab7ab8e727efe446e085a74f Mon Sep 17 00:00:00 2001 From: Satish Mallikarjun Paraddi Date: Sun, 2 Aug 2026 00:58:30 -0400 Subject: [PATCH 1/4] Completed Design - 1 --- Sample.java | 41 ++++++++++++++++++++++++++++++++++++----- 1 file changed, 36 insertions(+), 5 deletions(-) diff --git a/Sample.java b/Sample.java index 1739a9cb..04ea601e 100644 --- a/Sample.java +++ b/Sample.java @@ -1,7 +1,38 @@ -// Time Complexity : -// Space Complexity : -// Did this code successfully run on Leetcode : -// Any problem you faced while coding this : +// Time Complexity : O(1) +// Space Complexity : O(10^6) +// Did this code successfully run on Leetcode :Yes +class MyHashSet(object): + def __init__(self): + self.num_of_buckets = 1000 + self.buckets = [None] * self.num_of_buckets -// Your code here along with comments explaining your approach + def get_primary_hash(self, key): + return key % self.num_of_buckets + + def get_secondary_hash(self, key): + return key // self.num_of_buckets + + def add(self, key): + first_hash = self.get_primary_hash(key) + if self.buckets[first_hash] == None: + if first_hash == 0: + self.buckets[first_hash] = [False] * (self.num_of_buckets + 1) + else: + self.buckets[first_hash] = [False] * (self.num_of_buckets) + second_hash = self.get_secondary_hash(key) + self.buckets[first_hash][second_hash] = True + + def remove(self, key): + first_hash = self.get_primary_hash(key) + second_hash = self.get_secondary_hash(key) + if self.buckets[first_hash] != None: + self.buckets[first_hash][second_hash] = False + + def contains(self, key): + first_hash = self.get_primary_hash(key) + second_hash = self.get_secondary_hash(key) + if self.buckets[first_hash] != None: + if self.buckets[first_hash][second_hash] == True: + return True + return False From 0eed7c0d5f10c28b6ec87897d183a54b27ad468c Mon Sep 17 00:00:00 2001 From: Satish Mallikarjun Paraddi Date: Sun, 2 Aug 2026 02:25:19 -0400 Subject: [PATCH 2/4] Rename Sample.java to design_1.py --- Sample.java => design_1.py | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Sample.java => design_1.py (100%) diff --git a/Sample.java b/design_1.py similarity index 100% rename from Sample.java rename to design_1.py From dac2ff51dd35deb5a9a9cf919c52bfe167fc3107 Mon Sep 17 00:00:00 2001 From: Satish Mallikarjun Paraddi Date: Sun, 2 Aug 2026 02:29:13 -0400 Subject: [PATCH 3/4] Completed MinStack Implementation --- problem-1.py | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 problem-1.py diff --git a/problem-1.py b/problem-1.py new file mode 100644 index 00000000..a394aa66 --- /dev/null +++ b/problem-1.py @@ -0,0 +1,26 @@ +# TC = O(1) +# SC = O(n) +class MinStack(object): + + def __init__(self): + self.st=[] + self.min_st = [] + self.min = float('inf') + + def push(self, value): + if self.min >= value: + self.min_st.append(self.min) + self.min = value + self.st.append(value) + + + def pop(self): + if (self.st.pop() == self.min): + self.min = self.min_st.pop() + + def top(self): + return self.st[-1] + + def getMin(self): + return self.min + From 2b9a537911d33dbf1ca8b2262c744258bb413629 Mon Sep 17 00:00:00 2001 From: Satish Mallikarjun Paraddi Date: Sun, 2 Aug 2026 02:30:26 -0400 Subject: [PATCH 4/4] Complete design_1.py --- design_1.py | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/design_1.py b/design_1.py index 04ea601e..043a7727 100644 --- a/design_1.py +++ b/design_1.py @@ -1,6 +1,6 @@ -// Time Complexity : O(1) -// Space Complexity : O(10^6) -// Did this code successfully run on Leetcode :Yes +#Time Complexity : O(1) +#Space Complexity : O(10^6) +#Did this code successfully run on Leetcode :Yes class MyHashSet(object): def __init__(self):