1
1.1kviews
Time complexity testing

func hacker(Queue Q) read stack S While (Q is not empty) Push(front of Q) into S Pop top element of Q

 While ( S is not empty)
         Push( top of S) into Q
          Pop top element S
Please log in to add an answer.