Practice Search Insert Position
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given a sorted array of distinct integers 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. You must write an algorithm with O(log n) runtime complexity.
Source: Search Insert Position on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,3,5,6], target = 5
Output
2
# Example 2
Input
nums = [1,3,5,6], target = 2
Output
1
# Example 3
Input
nums = [1,3,5,6], target = 7
Output
4
Constraints
1 <= nums.length <= 10^4
-10^4 <= nums[i] <= 10^4
nums contains distinct values sorted in ascending order.
-10^4 <= target <= 10^4
Related LeetCode Problems
Practice more problems similar to Search Insert Position.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.