Runtime: 44 ms (Top 15.83%) | Memory: 16.50 MB (Top 18.94%)

Author: AnasImloul

scripts/algorithms/I/Implement Stack using Queues/Implement Stack using Queues..py

@@ -0,0 +1,37 @@
+// Runtime: 44 ms (Top 15.83%) | Memory: 16.50 MB (Top 18.94%)
+
+class MyStack:
+
+    def __init__(self):
+        self.q1 = deque()
+        self.q2 = deque()
+
+    def push(self, x: int) -> None:
+        self.q1.append(x)
+
+    def pop(self) -> int:
+        while len(self.q1) > 1:
+            self.q2.append(self.q1.popleft())
+        
+        popped_element = self.q1.popleft()
+        
+        # Swap q1 and q2
+        self.q1, self.q2 = self.q2, self.q1
+        
+        return popped_element
+
+    def top(self) -> int:
+        while len(self.q1) > 1:
+            self.q2.append(self.q1.popleft())
+        
+        top_element = self.q1[0]
+        
+        self.q2.append(self.q1.popleft())
+        
+        # Swap q1 and q2
+        self.q1, self.q2 = self.q2, self.q1
+        
+        return top_element
+
+    def empty(self) -> bool:
+        return len(self.q1) == 0