Find First and Last Position of Element in Sorted Array

Understand how to use modified binary search to locate the first and last indexes of a target element in a sorted array. Learn to implement an efficient O(log n) algorithm that handles edge cases and returns [-1, -1] when the target is absent.