LC 35
Search Insert Position
Easy · LC 1–100
Candidate solution routes
Primary
FreeBinary-Search Boundary / First True
Invariant: The first True always lies in [lo,hi]; indexes left of lo are proven False, while hi remains a feasible candidate.
candidate confidence: 0.609 · metadata_only
Alternate 1
FreeBinary Search on a Sorted Domain
Invariant: At loop entry, an existing target lies inside closed interval [lo,hi]; every outside index has been disproved by sorted comparisons.
candidate confidence: 0.637 · metadata_only
How to use this page
Read the statement and constraints first, then validate recognition signals, invariant, and complexity. Candidate score is not correctness evidence.