Which optimized pattern solves this lesson cleanly?

Question

Which optimized pattern solves this lesson cleanly?

Option A — Correct answer

Disjoint set union with path compression and union by size.

Option B

Nested loops without visited state

Option C

Two pointers on a sorted array

Option D

Character frequency counting only

Explanation

Disjoint set union with path compression and union by size.

Union Find Components - Disjoint Set Pattern Practice Quiz