Deque Implementations
Submissions: 2198   Accuracy:


  Difficulty: Easy   Marks: 2
Associated Course(s):   Fork CPP   C++ STL

A deque is a double-ended queue that allows enqueue and dequeue operations from both the ends.

Given a deque and Q queries. The task is to perform some operation on dequeue according to the queries as given below:
1. pb : query to push back the element x (given with query) to deque and print the back.
2. pf : query to push element x(given with query) to the front of the deque and print the front.
3. pp_b : query to delete element from back of the deque and print the size of deque.
4. f : query to return front element from the deque if not empty else return -1.

Input Format:
First line of input contains number of testcases T. For each testcase, first line of input contains Q, number of queries. Next Q line contains Q queries.

Your Task:
Your task is to complete the functions push_back_pb(), push_front_pf(), pop_back_ppb() and front_dq()  so that queries can be perfromed as required.

Output Format:
For each testcase, perfrom the required operation on given deque.

1 <= T <= 100
1 <= Q <= 100


pf 5
pf 10
pb 6


Testcase 1:
5 is pushed to front of the queue and printed, 10 is again pushed front of the queue and printed. 6 is pushed back into the queue and printed. Now, front element is 10. Popping back element from the queue, size decreases to 2.

** For More Input/Output Examples Use 'Expected Output' option **

Author: Dhiman Mayank

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Need help with your code? Please use, generate link and share the link here.

to report an issue on this page.