Find First and Last Position of Element in Sorted Array || Leetcode Solution
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.
Algorithm:
Find the element through binary search and then move towards the left sub array for first position and right sub array for last position.
Modified Binary Search
Link for placement series: • Placements 2022
#leetcode #leetcodequestionandanswers #binarysearch