Search In Rotated Sorted Array | Leetcode Problem 33 | C++ Solution | Optimal

Problem Name: Search in Rotated Sorted Array

Problem Description: There is an integer array nums sorted in ascending order (with distinct values).

Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2].

Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.

You must write an algorithm with O(log n) runtime complexity.

I've explained the thought process and logic behind the solution and show how to implement it in code. Please like, share and subscribe if you found the video useful. Feel free to ask in the comments section if you have any doubts.

00:00 : Introduction
00:07: Understanding Question
01:32 : Understanding Example
03:16 : Understanding Binary Search
04:54 : Understanding Approach
10:09 : Coding

#leetcode #leetcodequestionandanswers #leetcodesolution #optimal #leetcodequestions

[Shubhamkumar-wlrd]

for better understanding
Start with o(n*n) approach
then o(n)
then o(nlogn) --- (Question demands)