{"id":"search-insert-equivalent-to-bisect-left","text":"`searchInsert(nums, target)` produces the same result as `bisect.bisect_left(nums, target)` for sorted distinct-integer lists — it is the canonical lower-bound binary search.","truth_value":"IN","source":"entries/2026/06/06/search-insert-position-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"search-insert-equivalent-to-bisect-left","truth_value":"IN","reason":"premise"}]}}