Importance of time

#1

unable to solve this

#2

@guptarahul3100
Take a queue
Put the initial order of elements in it
Then store the ideal order
Then while you reach end of ideal order
If element in front of queue is same as initial order element then pop it and move to next element in ideal order
Otherwise put it at end

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.