[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"searchBlogPosts":3,"$fhSLoJAGzn0ZtIhEMNm7XgjxUTIIOE5wuehGnU_0i6EY":7},[4],{"_path":5,"title":6},"\u002Fblog\u002F2023\u002F09\u002F17\u002Fspring-boot-postgresql","Spring Boot with PostgreSQL & pgAdmin in Docker",{"title":8,"category":9,"problemHtml":10,"solutions":11,"repoUrl":20},"Binary Search","Data Structures & Algorithms","",[12,16],{"lang":13,"label":14,"html":15},"java","Java","\u003Cpre>\u003Ccode class=\"language-java\">class Solution {\n    public int search(int[] nums, int target) {\n        int left = 0, right = nums.length - 1;\n\n        while (left <= right) {\n            int mid = left + (right - left) \u002F 2;\n\n            if (nums[mid] == target)\n                return mid;\n            else if (nums[mid] < target)\n                left = mid + 1;\n            else\n                right = mid - 1;\n        }\n\n        return -1;\n    }\n}\u003C\u002Fcode>\u003C\u002Fpre>",{"lang":17,"label":18,"html":19},"python","Python","\u003Cpre>\u003Ccode class=\"language-python\">class Solution:\n    def search(self, nums: List[int], target: int) -> int:\n\n        start, end = 0, len(nums) - 1\n\n        while start <= end:\n            mid = start + (end - start)\n\n            if nums[mid] == target:\n                return mid\n\n            elif nums[mid] < target:\n                start = mid + 1\n            else:\n                end = mid - 1\n\n        return -1\u003C\u002Fcode>\u003C\u002Fpre>","https:\u002F\u002Fgithub.com\u002Fvishwarajsali\u002FInterviewPrep\u002Ftree\u002Fmain\u002FData%20Structures%20%26%20Algorithms%2Fbinary-search"]