runtime beats 94.57 %, memory usage beats 94.67 %[best][easy][c++]
\n      class Solution {\n      public:\n          int findMin(vector& nums) {\n              int start=0,end=nums.size()-1;\n              while(start<end){\n 
\n      class Solution {\n      public:\n          int findMin(vector<int>& nums) {\n              int start=0,end=nums.size()-1;\n              while(start<end){\n                  int mid=(start+end)/2;\n                  if(nums[mid]<nums[end])\n                      end=mid;\n                  else\n                      start=mid+1;\n              }\n              return nums[end];\n          }\n      };\n\t  \n**Feel free to ask any question in the comment section.\nIf you like this solution, do UPVOTE.\nHappy Coding :)**\n\t
['C', 'Binary Tree', 'C++']