implement-queue-using-stacks

class MyQueue:

    def __init__(self):
        #intializing stack
        self.stack1 = []
        self.stack2 = []

    def push(self, x: int) -> None:
        self.stack1.append(x)

    def pop(self) -> int:
        return self.stack1.pop(0)    

    def peek(self) -> int:
        if self.stack1:
            return self.stack1[0]

    def empty(self) -> bool:
        return not self.stack1 and not self.stack2


# Your MyQueue object will be instantiated and called as such:
# obj = MyQueue()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.peek()
# param_4 = obj.empty()


#Time Complexity : O(1)
#Space Complexity : O(n)
#Code run successfully on Leetcode