careercup / CtCI-6th-Edition

Cracking the Coding Interview 6th Ed. Solutions
11.33k stars 4.41k forks source link

Update Search in rotated array Question.java #212

Open AshishJainMSRIT opened 3 years ago

AshishJainMSRIT commented 3 years ago

Since nums=[3,1,1], x=1 is also a valid test case for this problem. But currently, the output of the code is -1 as condition (a[left]==a[mid]) is false and there is not condition for (a[mid]==a[right]). So, I have removed this condition and it works fine in Leetcode.