100% BEATS optimized Java Solutions🔥|| Clean and easy to understand code|| look at once
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n# simple binary search\
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n# ***simple binary search***\n# Complexity\n- Time complexity:  O(logn)\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\n        int start = 0, end = nums.length-1;\n\n        while(start < end){\n\n          int  mid = (start+end) / 2;\n            if(mid > 0 && nums[mid] < nums[mid-1])\n             return nums[mid];\n            if(nums[start] <= nums[mid] && nums[mid] > nums[end])\n             start = mid + 1;\n            else\n             end = mid - 1;\n        }\n        return nums[start];\n    }\n}\n```\nplease upvote this for better solution of other questions![download.jfif](https://assets.leetcode.com/users/images/bf5cd63c-9675-4342-9274-d78b9df40867_1679927428.7317824.jpeg)\n
['Two Pointers', 'Binary Search', 'Java']