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 , if k
exceeds queue
size, or if queue
is empty, return NULL. Otherwise, return the modified queue
.
Constraints:
-
queue.length
-
queue[i]
-
k
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.