Ask AI Problems Learn C++TCS Core CS HR Progress

Problems Binary Search

Search Insert Position

Easy

2/3

EasyBinary SearchLeetCode #35

Search Insert Position

Lower bound: first index where nums[i] >= target.

Examples

Example 1

Input

4 5
1 3 5 6

Output

Example 2

Input

4 2
1 3 5 6

Output

Stuck? Take a nudge

C++17Autosaves