TryBugHunt
rustOff-by-oneHard

Search cannot find the last item in the list

BugFind the bug and fix the code

What it should do

find_index(sorted, target) uses binary search to return the index of target in a sorted list, or -1 if it is not there. Example: find_index(&[1, 3, 5, 7, 9], 9) → 4

What happens instead

find_index(&[1, 3, 5, 7, 9], 9) returns -1 instead of 4, and find_index(&[7], 7) returns -1.

fn find_index(sorted: &[i32], target: i32) -> i32 {
    let mut lo: i32 = 0;
    let mut hi: i32 = sorted.len() as i32 - 1;
    while lo < hi {
        let mid = (lo + hi) / 2;
        let value = sorted[mid as usize];
        if value == target {
            return mid;
        }
        if value < target {
            lo = mid + 1;
        } else {
            hi = mid - 1;
        }
    }
    -1
}

Test a custom input to verify an edge case (e.g. empty lists, negative numbers, duplicates).

⏱️0:00
Hints
🏆 0 hints = Flawless Solve
Think & Test Cooldown
2:00 remaining

Take a moment to read the bug symptom and trace the code with Run & Check before unlocking Hint 1.

Hint 2
Unlocks after Hint 1
Hint 3
Unlocks after Hint 2

This bug belongs to the off-by-one errors pattern

The loop that runs one time too many, the slice that drops the last item, the index that starts in the wrong place.

What you'll practise

A hard Rust debugging exercise about off-by-one errors: the loop that runs one time too many, the slice that drops the last item, the index that starts in the wrong place.

The checks your fix must pass

Signs of this kind of bug

Spoiler: why this bug happens(try it first; the hints get warmer one at a time)

What went wrong: hi is the last valid index, so the search range lo..=hi includes both ends. When the range shrinks to one element, lo equals hi, and that element still has to be checked. while lo < hi stops right then, so the last remaining candidate is never compared. A one-item list is never searched at all.

The fix: Keep looping while the range is not empty: while lo <= hi.

Remember: match the loop condition to how you defined hi. If hi is the last index (inclusive), use lo <= hi. If hi is len() (exclusive), use lo < hi and set hi = mid.

The pattern behind it: off-by-one errors.

More off-by-one errors to practise

Embed this challenge on your site

Paste this into any web page or blog post. Visitors fix the bug right there, in their browser.

<iframe src="https://trybughunt.com/embed/04c5e4fd-6b72-4435-a6ab-4e434e0c9aa5" title="Debugging challenge: Search cannot find the last item in the list" width="100%" height="580" loading="lazy" style="border:1px solid #d4d4d8;border-radius:12px;max-width:760px"></iframe>
<p style="font-size:14px">Debugging challenge from <a href="https://trybughunt.com/challenges/04c5e4fd-6b72-4435-a6ab-4e434e0c9aa5">TryBugHunt</a></p>