Problem Submissions Solution

Implement Queue using Arrays

Difficulty: Basic

Acceptance: %

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.

Topics

Companies

Articles

Examples:

Expected Time Complexity: O(1)

Expected Auxiliary Space: O(1)

Constraints:
  • 1 <= number of query<= 10^5
  • 0 <= x <= 10^5
Companies:
Amazon Goldman Sachs
Topics:
Queue
Locked Content
Access Restricted: Please Login to access the code editor and test cases.