Find unique element in sorted duplicate array in O(lg n)
Filed under Cadence
The question
Given an increasing sorted list of duplicate integers with one unique element, find that element in O(log n) time.
No write-up yet. Related questions below have one.
Related Cadence questions
Collected from public candidate posts and coding forums. Updated Nov 2026.