Get App

Java: In Java, which comparison about LRU Cache with LinkedHashMap is accurate?

Difficulty:

Easy

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

In Java, which comparison about LRU Cache with LinkedHashMap is accurate?

  1. A plain HashMap cannot track recency by itself, while LinkedHashMap can maintain recency order alongside lookup.
  2. There is no practical difference in behavior, performance, or API design when LRU Cache with LinkedHashMap is involved.
  3. The oldest option related to LRU Cache with LinkedHashMap is always the right production choice regardless of context.
  4. Differences around LRU Cache with LinkedHashMap 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. A plain HashMap cannot track recency by itself, while LinkedHashMap can maintain recency order alongside lookup.

A plain HashMap cannot track recency by itself, while LinkedHashMap can maintain recency order alongside lookup. This is the comparison that usually separates memorization from understanding.

Track: Java