Why is the brute-force approach less ideal here?

Question

Why is the brute-force approach less ideal here?

Option A — Correct answer

Sorting costs O(n log n) and repeated expansion wastes work.

Option B

It is always constant time

Option C

It uses no repeated work

Option D

It requires binary tree recursion

Explanation

Sorting costs O(n log n) and repeated expansion wastes work.

Longest Consecutive Sequence - Hash Set Pattern Practice Quiz