Given a sorted array that has been rotated by some number of positions, find the index of a target element in the array. If the target element is not found, return -1.

Rotated sorted array problem involves finding a target element in a rotated sorted array.

• Use binary search to find the pivot point where the array is rotated.

• Divide the array into two subarrays and pe...read more