Problem title
Difficulty
Avg time to solve

Implement a Queue
Easy
20 mins
Binary Search
Easy
15 mins
PAINT THE FENCE
Easy
20 mins
Minimum Jumps
Moderate
25 mins
Rod cutting problem
Moderate
40 mins
Partition a set into two subsets such that the difference of subset sums is minimum.
Hard
10 mins
Jumping Numbers
Moderate
15 mins
Total Salary
Easy
10 mins
Rotate Matrix
Moderate
15 mins
Unique Paths
Moderate
25 mins
81

# Implement a Queue

Difficulty: EASY
Contributed By
Avg. time to solve
20 min
Success Rate
80%

Problem Statement

#### You need to implement the following public functions :

``````1. Constructor: It initializes the data members as required.

2. enqueue(data): This function should take one argument of type integer. It enqueues the element into the queue.

3. dequeue(): It dequeues/removes the element from the front of the queue and in turn, returns the element being dequeued or removed. In case the queue is empty, it returns -1.

4. front(): It returns the element being kept at the front of the queue. In case the queue is empty, it returns -1.

5. isEmpty(): It returns a boolean value indicating whether the queue is empty or not.
``````
##### Operations Performed on the Queue :
``````Query-1(Denoted by an integer 1): Enqueues integer data to the queue.

Query-2(Denoted by an integer 2): Dequeues the data kept at the front of the queue and returns it to the caller, return -1 if no element is present in the queue.

Query-3(Denoted by an integer 3): Fetches and returns the data being kept at the front of the queue but doesn't remove it, unlike the dequeue function, return -1 if no element is present in the queue.

Query-4(Denoted by an integer 4): Returns a boolean value denoting whether the queue is empty or not.
``````
##### Input Format :
``````The first line contains an integer ‘t’ denoting the number of test cases.

For each test case, the first line contains an integer 'q' which denotes the number of queries to be run against each operation on the queue.

Every 'q' lines represent an operation that needs to be performed.

For the enQueue operation, the input line will contain two integers separated by a single space, representing the type of the operation in the integer and the integer data being enqueued into the queue.

For the rest of the operations on the queue, the input line will contain only one integer value, representing the query being performed on the queue.
``````
##### Output Format :
``````For Query-1, print the data being enqueued in the queue.
For Query-2, print the data being dequeued from the queue.
For Query-3, print the data kept on the front of the queue.
For Query-4, print 'true' or 'false'(without quotes).

Output for every query will be printed in a separate line.
``````
##### Note :
``````You are not required to print anything explicitly. It has already been taken care of. Just implement the functions.
``````
##### Constraints :
``````1 <= t <= 5
1 <= q <= 5000
1 <= x <= 4
1 <= data <= 2^31 - 1

Time Limit: 1 sec
``````
##### Sample Input 1 :
``````1
7
1 17
1 23
1 11
2
2
2
2
``````
##### Sample Output 1 :
``````17
23
11
-1
``````
##### Explanation for Sample Output 1 :
``````The first three queries are of enQueue, so we will push 17, 23, and 11 into the queue.

The next four queries are of deQueue, so we will starting removing elements from the queue, so the first element will be 17, then 23, and then 11. And after the third dequeue query, the queue is now empty so for the fourth query, we will return -1.
``````
##### Sample Input 2 :
``````1
3
2
1 10
3
``````
##### Sample Output 2 :
``````-1
10
``````
Console