Data Structures for Coding Interviews in Java/

...

/

Solution: Reverse First k Elements of Queue

Solution: Reverse First k Elements of Queue

Let’s solve the Reverse First k Elements of Queue problem.

We'll cover the following...

Statement

Given a queue and a number k, reverse the order of the first k elements in queue. If k is less than 00, if k exceeds queue size, or if queue is empty, return NULL. Otherwise, return the modified queue.

Constraints:

  • 0≤0 \leq queue.length ≤103\leq 10^{3}
...