You are given an array scores representing the leaderboard scores of players. The array contains unique integers sorted in ascending order. You are also given a new player's score called target.

Return the index where target is located in the array. If target is not present, return the index where it should be inserted to maintain the ascending order.

Your algorithm must run in O(log n) time complexity.

Example 1:

Input: scores = [40, 50, 60, 70, 80, 90, 100, 110, 120, 130], target = 85
Output: 5
Explanation: 85 does not exist in the scores array, but it fits between 80 and 90. Insert it at index 5.

Example 2:

Input: scores = [140, 160, 180, 200], target = 180
Output: 2
Explanation: 180 is found at index 2.

Example 3:

Input: scores = [80, 85, 90, 95], target = 100
Output: 4
Explanation: 100 is greater than all scores, so insert it at the end.

Constraints

1 <= scores.length <= 10⁴

0 <= scores[i] <= 10⁴

scores is strictly increasing

0 <= target <= 10⁴

6. Find or Insert Score