#Binary Search

Solve DSA problems that utilize the sliding window technique and binary search. Focus on implementing algorithms using these strategies.

In a sorted array, determine the first and last index of a specified element. Your solution should be efficient, utilizing binary search where appropriate.

Implement a solution that uses Binary Search to efficiently find a target element in a sorted array. Ensure optimal runtime complexity.

Explain the concept of finding a peak element in an array, where an element is considered a peak if it is greater than or equal to its neighbors. Describe an efficient algorithm using binary search to achieve this.

How would you implement a binary search algorithm? Please explain the logic behind it.