Simple Java Solution || beats 100% || Please upvote if you find it helpful. <3
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach \n- Binary search \n\n Describe your approach to solving the problem. \n\n
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach \n- Binary search \n\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: log(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: o(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int findMin(int[] nums) {\n      int start = 0;\n        int end = nums.length - 1;\n        while (start < end) {\n            int mid = start + (end - start) / 2;\n            if (nums[mid] < nums[end]) {\n                end = mid;\n            } else {\n                start = mid + 1;\n            }\n        }\n        return nums[start];\n//Do upvote please\n    }\n}\n```
['Binary Search', 'Java']