Deque-STL C++: Double ended queue or Deque(part of C++ STL) are sequence containers with dynamic sizes that can be expanded or contracted on both ends (either its front or its back). The member functions of deque that are mainly used are:

Deque Template:

std::deque 

Declaration:

deque mydeque; //Creates a double ended queue of deque of int type 

Size

int length = mydeque.size(); //Gives the size of the deque 

Push

mydeque.push_back(1); //Pushes element at the end mydeque.push_front(2); //Pushes element at the beginning 

Pop

mydeque.pop_back(); //Pops element from the end mydeque.pop_front(); //Pops element from the beginning 

Empty

mydeque.empty() //Returns a boolean value which tells whether the deque is empty or not 

Example: 1 7 4 3 4 5 8 1 4 10 here 1 is the total number of test cases and 7 is the size of an array and 4 is a size of sub-array formed by array, so for a given array sub-array will be {3, 4, 5, 8 }, {4, 5, 8, 1 }, {5, 8, 1, 4 }, {8, 1, 4, 10 }. Now our task is to print the largest number of these sub-array, So finally our output should be {8, 8, 8, 10 }.

In your source code make sure to include code comments. The code comments have to explain the entire source code. For example, you would need to add comments to the following code:

#include #include using namespace std; //Add comments explaining the printKMax method, etc void printKMax(int arr[], int n, int k) {