Solution: Reverse First k Elements of Queue

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

We'll cover the following


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.


  • 00 \leq queue.length 103\leq 10^{3}
  • 10310^{-3} \leq queue[i] 103\leq 10^{3}
  • 10310^{-3} \leq k 103\leq 10^{3}

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.