Time complexity

#1

Can you please explain the time complexity of this solution?

#2

hello @sahazeer123,
it will be O(n)
reason-> we are pushing and popping each element into stack exactly once (i.e 2 operations on each elements).

so for n elements we will perform 2*n operations . so time complexity will be O(N).

#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.