Leetcode #33 - Search in Rotated Sorted Array
This video contains a detailed explanation of how to solve Leetcode #33 which is “Search in Rotated Sorted Array.” It also contains the code for the solution in C++.
The problem statement is as follows:
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
Your algorithm's runtime complexity must be in the order of O(log n).
If you enjoyed the video, please don't forget to like, comment, and subscribe!
Arushi Gupta | AlgoSTEM
Watch video Leetcode #33 - Search in Rotated Sorted Array online without registration, duration hours minute second in high quality. This video was added by user AlgoSTEM 19 April 2020, don't forget to share it with your friends and acquaintances, it has been viewed on our site 702 once and liked it 19 people.