beats 100% || c++ solution ||
thanks to love babbar\n\n\n\n\tint findMin(vector& nums) {\n        int s = 0;\n        int e = nums.size()-1;\n        while(s < e)\n        {\n            int
**thanks to love babbar**\n\n\n\n\tint findMin(vector<int>& nums) {\n        int s = 0;\n        int e = nums.size()-1;\n        while(s < e)\n        {\n            int m = s + (e-s)/2;\n            if(nums[m] > nums[e])\n            {\n                s = m +1;\n            }\n            else{\n                e = m;\n            }\n        }\n        return nums[s];\n    }\n\n\n**hope u find it helpfull : - )  dont forgot to upvote**\n
[]