Clean JavaScript solution
\nconst findMin = (nums) => {\n  let l = 0;\n  let r = nums.length - 1;\n  while (l < r) {\n    const m = ~~((l + r) / 2);\n    if (nums[m] > nums[r]) l = m + 1
```\nconst findMin = (nums) => {\n  let l = 0;\n  let r = nums.length - 1;\n  while (l < r) {\n    const m = ~~((l + r) / 2);\n    if (nums[m] > nums[r]) l = m + 1;\n    else r = m;\n  }\n  return nums[l];\n};\n```\n
['Binary Tree', 'JavaScript']