Java: Which practice avoids a common mistake with LinkedHashMap and Iteration Order?

Difficulty:

Medium

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

Which practice avoids a common mistake with LinkedHashMap and Iteration Order?

  1. Ignore the LinkedHashMap and Iteration Order issue and rely on team discipline instead of APIs or contracts.
  2. Do not promise sorted order from LinkedHashMap, because its order is linked traversal order, not comparator-based order.
  3. Silence the LinkedHashMap and Iteration Order problem by using raw types, broad catches, or shared mutable state.
  4. Prefer the version of LinkedHashMap and Iteration Order that makes behavior less predictable as long as the code compiles.

Hint

Look for the option that protects correctness instead of hiding the problem.

Answer and rationale

Correct answer: B. Do not promise sorted order from LinkedHashMap, because its order is linked traversal order, not comparator-based order.

Do not promise sorted order from LinkedHashMap, because its order is linked traversal order, not comparator-based order. This is a common failure mode in real Java code and a frequent interview follow-up.

Track: Java