Search insert position
Given a sorted array and a target, return the index if found, otherwise the index where it would be inserted to keep the array sorted.
Implement
search_insert(nums: list[int], target: int) → intExamples
in
[[1,3,5,6],5]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 15 min
solution.py
InputExpectedGot
[[1,3,5,6],5]2not run yetsample