how the time complexity is O(n) because we are using two loops
About time complexity
Each element is pushed into the queue only once and popped out only once…so complexity will be linear and it is O(n)
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.