How to reverse a queue in groups of size k without using extra stack and in time O(n)?

Revision en1, by apnakaamkar, 2020-07-02 18:16:10

How to reverse a queue in groups of size k without using extra stack and in time O(n)?

====================================================================================== Input format: [queue], [group size] input : 4 5 3 2 5 6 7 1, 3 output: 3 5 4 6 5 2 1 7

I know how to reverse a queue without using extra space but I am quite stuck here. Any help would be much appreciated?

Tags #queue, #stack, #recursion, #dynamic-programming, #cpp, #competitive-programming

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English apnakaamkar 2020-07-02 18:17:17 6 Tiny change: '\nInput form' -> 'Input form'
en2 English apnakaamkar 2020-07-02 18:16:31 264
en1 English apnakaamkar 2020-07-02 18:16:10 562 Initial revision (published)