[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"searchBlogPosts":3,"$ffe5dM-GG3dfDYmFdiYmwUlFYSmCDJ_NEnKJ5015Shfg":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},"Two Integer Sum","Data Structures & Algorithms","",[12,16],{"lang":13,"label":14,"html":15},"java","Java","\u003Cpre>\u003Ccode class=\"language-java\">class Solution {\n    public int[] twoSum(int[] nums, int target) {\n        \n\n        Map<Integer, Integer> map = new HashMap<>();\n\n        for(int i = 0; i < nums.length; i++){\n            \n            if(map.containsKey(nums[i])) return new int[]{map.get(nums[i]), i};\n\n            map.put(target - nums[i] , i);\n        }\n\n\n        return new int[] {-1, -1};\n    }\n}\u003C\u002Fcode>\u003C\u002Fpre>",{"lang":17,"label":18,"html":19},"python","Python","\u003Cpre>\u003Ccode class=\"language-python\">class Solution:\n    def twoSum(self, nums: List[int], target: int) -> List[int]:\n\n        sumDict = {}\n\n        for i in range(len(nums)):\n            sum = target - nums[i]\n\n            if sum in sumDict:\n                return [sumDict[sum], i]\n\n            sumDict[nums[i]] = i\n\n        return [-1, -1]\u003C\u002Fcode>\u003C\u002Fpre>","https:\u002F\u002Fgithub.com\u002Fvishwarajsali\u002FInterviewPrep\u002Ftree\u002Fmain\u002FData%20Structures%20%26%20Algorithms%2Ftwo-integer-sum"]