Search in Rotated Sorted Array | Modified Binary Search

leetcode.com Problem Statement Given a rotated sorted array nums and an integer target, return the index of target. If the target does not exist, return -1. You must solve it in: O(log N) time. Brute Force Intuition In an interview, you can explain it like this: We can scan the array from left to right and compare every element with the target. As soon as we find the target, we return its i