Difficulty: Basic
Acceptance: 47.24%
Points: 10.00
Implement a Queue using an array to handle the following types of queries: 1. **Push operation (1 x):** This query adds the element x to the queue. 2. **Pop operation (2):** This query removes and returns the front element from the queue. If the queue is empty, return -1. You need to implement the push and pop functions. The rest of the program will handle the input and output operations.
Expected Time Complexity: O(1)
Expected Auxiliary Space: O(1)
