Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
Array Binary Search| Runtime Error Message: | {[{ runtimeError }]} |
| Last executed input: | {[{ lastExecutedTestCase }]} |
| Input: | {[{ resultWaTestCaseInput }]} |
| Output: | {[{ resultWaTestCaseOutput }]} |
| Expected: | {[{ resultWaTestCaseExpected }]} |