Lower bound returns wrong index
Review this Go binary search that returns the index of the first element >= target (lower bound).
What a strong answer looks like
Separate real bugs from style. Rank issues by severity, point at the root cause rather than the symptom, and suggest a concrete fix, specific and kind.
0:00 of about 20 min
Mark a line and say what kind of problem it is.0 findings
1func lowerBound(a []int, target int) int {
2 lo, hi := 0, len(a)-1
3 for lo < hi {
4 mid := (lo + hi) / 2
5 if a[mid] < target {
6 lo = mid + 1
7 } else {
8 hi = mid
9 }
10 }
11 return lo
12}
Which questions mattered is sealed until you submit. Telling you now would just be handing over the edge cases.
Run or narrate your approach, then ask the coach.