LeetCode 33 | Search in Rotated Sorted Array | Algorithm Explained (Java)

Published: 16 March 2020
on channel: Xavier Elon

361

The description reads:
"Given an integer array nums sorted in ascending order, and an integer target.

Suppose that nums 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 should search for target in nums and if you found return its index, otherwise return -1.

Example 1:

Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4
Example 2:

Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1
Example 3:

Input: nums = [1], target = 0
Output: -1"

Github: https://github.com/xavierelon1
Github HackerRank Solutions: https://github.com/XavierElon1/Hacker...
Github Leetcode Solutions: https://github.com/XavierElon1/LeetCo...
Facebook:   / xavier.hollingsworth.3
Instagram:   / xavierelon
LinkedIn:   / xavier-hollingsworth-524144127
Twitter:   / elon_xavier

On this page of the site you can watch the video online LeetCode 33 | Search in Rotated Sorted Array | Algorithm Explained (Java) with a duration of hours minute second in good quality, which was uploaded by the user Xavier Elon 16 March 2020, share the link with friends and acquaintances, this video has already been watched 361 times on youtube and it was liked by 11 viewers. Enjoy your viewing!