Skip to content

Done #2622

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
nagasai67 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Done #2622

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
51 changes: 51 additions & 0 deletions designHashSet.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,51 @@
# Time Complexity: O(1) average
# Space Complexity: O(n) where n is the number of keys
# Did this code successfully run on LeetCode: Yes
# Any problem faced while coding: No
# Approach: Used chaining with linked list for collision


class Node:
def __init__(self,key):
self.key = key
self.next = None

class MyHashSet:
def __init__(self):
self.hset = [Node(0) for i in range(10**4)]

def add(self, key: int) -> None:
curr = self.hset[key % len(self.hset)]
while curr.next:
if curr.next.key == key:
return
curr = curr.next
curr.next = Node(key)

def remove(self, key: int) -> None:
curr = self.hset[key % len(self.hset)]
while curr.next:
if curr.next.key == key:
curr.next = curr.next.next
return
curr = curr.next

def contains(self, key: int) -> bool:
curr = self.hset[key % len(self.hset)]
while curr.next:
if curr.next.key == key:
return True
curr = curr.next
return False



# Your MyHashSet object will be instantiated and called as such:
# obj = MyHashSet()
# obj.add(key)
# obj.remove(key)
# param_3 = obj.contains(key)




33 changes: 33 additions & 0 deletions minStack.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
# Time Complexity : O(1) for all operations
# Space Complexity : O(n) -> n is no of elements in stack
# Did this code successfully run on Leetcode : Yes
# Any problem you faced while coding this : No
# Approach: Store each value along with the minimum value seen so far at that point.


class MinStack:
def __init__(self):
self.st = []

def push(self, val: int) -> None:
curr_min = self.getMin()
if curr_min == None or curr_min > val:
curr_min = val
self.st.append([val,curr_min])

def pop(self) -> None:
self.st.pop()

def top(self) -> int:
return self.st[-1][0]

def getMin(self) -> int:
return self.st[-1][1] if self.st else None


# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(val)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()