Easy Remember Stacks & Queues Multiple Choice

What is the time complexity of getMin() in a Min Stack using an auxiliary min-stack?

Remember — Tests recall of fundamental facts and definitions.

Answer Options

A O(n)

B O(log n)

C O(1)

D O(n²)

Get the answer with a detailed explanation, plus practice 34+ more Stacks & Queues questions with adaptive quizzes and timed interviews.

This question is from the Stacks & Queues topic (Data Structures).

What does LIFO stand for and which data structure follows this principle?

Why is array.shift() O(n) in JavaScript, and how can you avoid this for a queue?

In Valid Parentheses (LC 20), why pop and compare rather than just peek?

In Daily Temperatures (LC 739), why store indices rather than temperature values in the stack?

Time complexity of the monotonic stack approach to Next Greater Element?