Search Insert Position

Easy
Problem Statement

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

Constraints

  • Array is sorted in ascending order
  • Time Complexity: O(log N)
  • Space Complexity: O(1)
Solution