Java: In Java, which comparison about Monotonic Stack is accurate?

Difficulty:

Easy

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

In Java, which comparison about Monotonic Stack is accurate?

  1. It trades a little invariant complexity for linear performance, while brute force rescans neighbors repeatedly.
  2. There is no practical difference in behavior, performance, or API design when Monotonic Stack is involved.
  3. The oldest option related to Monotonic Stack is always the right production choice regardless of context.
  4. Differences around Monotonic Stack are mostly cosmetic, so correctness and maintainability do not change.

Hint

Focus on the behavior or tradeoff, not just the keyword.

Answer and rationale

Correct answer: A. It trades a little invariant complexity for linear performance, while brute force rescans neighbors repeatedly.

It trades a little invariant complexity for linear performance, while brute force rescans neighbors repeatedly. This is the comparison that usually separates memorization from understanding.

Track: Java