{"id":506,"date":"2025-07-02T19:02:53","date_gmt":"2025-07-02T13:32:53","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=506"},"modified":"2025-07-03T12:14:16","modified_gmt":"2025-07-03T06:44:16","slug":"find-first-and-last-position-of-element-in-sorted-array","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/find-first-and-last-position-of-element-in-sorted-array\/","title":{"rendered":"Find First and Last Position of Element in Sorted Array | Leetcode 34 | Optimal Binary Search"},"content":{"rendered":"\n

Given an array of integers nums<\/code> sorted in non-decreasing order, find the starting and ending position of a given target<\/code> value.<\/p>\n\n\n\n

If target<\/code> is not found in the array, return [-1, -1]<\/code>.<\/p>\n\n\n\n

You must write an algorithm with O(log n)<\/code> runtime complexity.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> nums = [5,7,7,8,8,10], target = 8
Output:<\/strong> [3,4]<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [5,7,7,8,8,10], target = 6
Output:<\/strong> [-1,-1]<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [], target = 0
Output:<\/strong> [-1,-1]<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n