33. Search in Rotated Sorted Array

Here is the link.

I had practice on binary search algorithm Rotated sorted array on pramp.com more than 10 times back in 2017. But I still could not clear the interview on 2019 August on this algorithm. I wrote the code with bugs, and then I did not pay attention to possible bugs like TLE, index-out-range, wrong answer.

What I like to do is to work on various ideas as possible this time, remove bias; Give every idea a chance to live, try to code it and make it work.

Time Line: 2019 August 20
Onsite interview, whiteboard version with bugs on August 20, 2019, California, MPK, here is the link.

Time Line: 2019 August 22
Optimal solution, avoid middle - 1 or middle + 1, practice on August 22, 2019. Here is the link.

Time Line: 2019 August 23
Work on idea to define left half [start, middle - 1], practice on August 23, 2019. here is the link.
Time Line: 2017
My practice in 2017. Here is the link.

Time Line: 2017
Common mistakes in binary search is my favorite research topic in 2017. Here is the blog.

My mock interview practice in 2017, here is the blog with source code link in the blog as well.

pramp.com 10 rounds of mock interview
https://github.com/jianminchen/Mock-interviews
Algorithm is called shifted array search, here is the folder to contain all practice for mock interviews.

2017 07 1st round June - July, here is the link.

2017 2nd round July - Sept, here is the link.

2017 3rd round Nov - Dec, here is the link.

2018 Jan - Feb, here is the link.

2018 Feb 7 - Feb 25, here is the link.

2018 March 30 - May 4, here is the link.

2018 June 16, here is the link.