Write a method called reverseFirstK that accepts an integer k and a queue of integers as parameters and reverses the order of the first k elements of the queue, leaving the other elements in the same relative order. For example, if a queue named q stores [ 10 , 20, 30 , 40 , 50 , 60 , 70, 80 , 90 ],the call of reverseFirstK(4, q); should change the queue to store [40, 30, 20, 10, 50, 60, 70, 80, 90]. If k is 0 or negative, no change should be made. If the queue does not contain at least k elements, your method should throw an IllegalArgumentException. Use one queue or stack (but not both) as auxiliary storage.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.