question 13
please explain the question
how it works
C++ STL quiz -1
Hey Shrey
maybe your question 13 and mine could be different so it would be better if you could post the exact question.
Like for me the 13th question is this:
What are the time complexities of stack::top() and stack::push() in C++ STL?
The answer to this would be O(1) and O(1) as both are constant time access operations since they operate at the top element of the stack and are not related to its size.
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.