Status: IN
The binary search implementation uses closed-interval bounds `[left, right]` with `while left <= right`, where both endpoints are inclusive candidates — not the half-open `[left, right)` alternative.
Source: entries/2026/06/06/binary-search-solution.md
JSON