Find First and Last Position of Element in Sorted Array
Subscribe to my channel --- / @codersbyyutish3249
Link to Ultimate Leetcode Challenge Playlist --- • Ultimate Leetcode Challenge
Also checkout my playlist on Coding Interview Problems --- • Coding Interview Problems for Beginners
-------------------------------------------------------------------------------------------------------------------
Problem Statement - Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
If target is not found in the array, return [-1, -1].
You must write an algorithm with O(log n) runtime complexity.
Example 1:
Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]
Example 2:
Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]
Example 3:
Input: nums = [], target = 0
Output: [-1,-1]
Constraints:
nums.length = [ 0, 105]
nums[i] = [ -109, 109 ]
nums is a non-decreasing array.
target = [ -109, 109 ]
Link to the problem --- https://leetcode.com/problems/find-fi...
#CodersbyYutish #ultimateleetcodechallenge #topinterviewquestions #leetcode #softwareengineering #placementtest