Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Binary search

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Binary search

Search in Rotated Sorted Array II

advancedlayer B6 · Binary search4 tests

Same setup as the rotated-array search, except values may now repeat. Given the rotated array and a target, return true if the target is present and false otherwise.

  • Duplicates break the trick that told you which half was sorted: in [1,1,1,1,1,2,1,1] the left, middle and right values are all 1
  • When you cannot tell the halves apart, shrink the window by one and continue
  • Because of that, the worst case degrades to O(n) — that is expected, and understanding why is the point of this exercise

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen