C++ two-pointer solution
\n    int findMin(vector& nums) {\n        int l = 0, r = nums.size()-1;\n        while (l < r) {\n            int mid = (r-l)/2 + l;\n            if (nums[mid]
\n    int findMin(vector<int>& nums) {\n        int l = 0, r = nums.size()-1;\n        while (l < r) {\n            int mid = (r-l)/2 + l;\n            if (nums[mid] < nums[r])\n                r = mid;\n            else\n                l = mid + 1;\n        }\n        return nums[l];\n    }
['Two Pointers', 'C++']