Array Upper Bound - Video Solutions

Easy

BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil

32:26443,441 views

10 video solutions available

Array Upper Bound - Video Solution

Watch 10 video solutions for Array Upper Bound, a easy level problem. This walkthrough by take U forward has 443,441 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.

Problem Statement

Write code that enhances all arrays such that you can call the upperBound() method on any array and it will return the last index of a given target number. nums is a sorted ascending array of numbers that may contain duplicates. If the target number is not found in the array, return -1.

Example 1:

Input: nums = [3,4,5], target = 5
Output: 2
Explanation: Last index of target value is 2

Example 2:

Input: nums = [1,4,5], target = 2
Output: -1
Explanation: Because there is no digit 2 in the array, return -1.

Example 3:

Input: nums = [3,4,6,6,6,6,7], target = 6
Output: 5
Explanation: Last index of target value is 5

Constraints:

1 <= nums.length <= 10⁴
-10⁴ <= nums[i], target <= 10⁴
nums is sorted in ascending order.

Follow up: Can you write an algorithm with O(log n) runtime complexity?

Read full problem with examples

Continue Learning

Practice this problem

Solve it on FleetCode

Read Solution & Explanation

Detailed text walkthrough

Array Upper Bound - Video Solutions

BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil

Search in rotated sorted array - Leetcode 33 - Python

First and Last Position of Element in Sorted Array - Binary Search - Leetcode 34

Contiguous Array - Leetcode 525 - Python

Single Element in a Sorted Array - Leetcode 540 - Python

Shuffle the Array (Constant Space) - Leetcode 1470 - Python

Find in Mountain Array - Leetcode 1095 - Python

Add to Array-Form of Integer - Leetcode 989 - Python

Lower bound & upper bound binary search in Python

Minimum Operations to Make Binary Array Elements Equal to One I - Leetcode 3191 - Python

Array Upper Bound - Video Solution

Problem Statement

Continue Learning

Array Upper Bound - Video Solutions

BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil

Search in rotated sorted array - Leetcode 33 - Python

First and Last Position of Element in Sorted Array - Binary Search - Leetcode 34

Contiguous Array - Leetcode 525 - Python

Single Element in a Sorted Array - Leetcode 540 - Python

Shuffle the Array (Constant Space) - Leetcode 1470 - Python

Find in Mountain Array - Leetcode 1095 - Python

Add to Array-Form of Integer - Leetcode 989 - Python

Lower bound & upper bound binary search in Python

Minimum Operations to Make Binary Array Elements Equal to One I - Leetcode 3191 - Python

Array Upper Bound - Video Solution

Problem Statement

Continue Learning