Skip to content

stack_using_two_queues #9992

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.

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

Closed
Changes from 1 commit
Commits
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
78 changes: 78 additions & 0 deletions data_structures/stacks/stack_by_two_queues.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,78 @@
from collections import deque
from typing import Generic, TypeVar

T = TypeVar("T")
""" Implementing stack using two arrays """

class Stack(Generic[T]):#Stack class to implement stack operations




def __init__(self) :

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide return type hint for the function: __init__. If the function does not return a value, please provide the type hint as: def function() -> None:

self.insert_Queue=deque()#First Queue to be used for inserting

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Variable and function names should follow the snake_case naming convention. Please update the following name accordingly: insert_Queue

self.suffle_Queue=deque()#Second Queue to be used for suffling

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Variable and function names should follow the snake_case naming convention. Please update the following name accordingly: suffle_Queue



def push(self,item:int):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide return type hint for the function: push. If the function does not return a value, please provide the type hint as: def function() -> None:

self.insert_Queue.append(item)#Add items into the Queue
while(self.suffle_Queue):
self.insert_Queue.append(self.suffle_Queue.popleft())#Poping the elements

self.insert_Queue,self.suffle_Queue=self.suffle_Queue,self.insert_Queue

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Variable and function names should follow the snake_case naming convention. Please update the following name accordingly: insert_Queue

Variable and function names should follow the snake_case naming convention. Please update the following name accordingly: suffle_Queue



def pop(self):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide return type hint for the function: pop. If the function does not return a value, please provide the type hint as: def function() -> None:

if(not(self.suffle_Queue)):#if the stack is empty
return None
return(self.suffle_Queue.popleft())#if not empty pop


def top(self):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide return type hint for the function: top. If the function does not return a value, please provide the type hint as: def function() -> None:

if(not(self.suffle_Queue)):
return None
return(self.suffle_Queue[0])


def printing(self):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide return type hint for the function: printing. If the function does not return a value, please provide the type hint as: def function() -> None:

print(self.suffle_Queue)


def size(self):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide return type hint for the function: size. If the function does not return a value, please provide the type hint as: def function() -> None:

return(len(self.suffle_Queue))



def test_stack():

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide return type hint for the function: test_stack. If the function does not return a value, please provide the type hint as: def function() -> None:

s = Stack()#Creating a stack in S
n=int(input("1 to push 2 to pop and 3 to peek 4 to print and 5 for size of the stack and 6 to exit:"))
while (n in (1, 2, 3, 4, 5, 6)):
match(n):
case 1:
element=int(input("Enter the element to push:"))
s.push(element)
case 2:
print(s.pop())
case 3:
print(s.top())
case 4:
s.printing()
case 5:
leng=s.size()
print(f"The size of the stack is {leng}")
case 6:
print("Exiting")
break
case _:
print("Enter properly")

n=int(input("1 to push 2 to pop and 3 to peek 4 to print and 5 for of the stack and 6 to exit:"))


if __name__=="__main__":
test_stack()#calling the test funtion