{"id":6785,"date":"2022-06-30T23:25:00","date_gmt":"2022-06-30T17:55:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=6785"},"modified":"2022-06-24T20:22:13","modified_gmt":"2022-06-24T14:52:13","slug":"two-sum-leetcode-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/","title":{"rendered":"Two Sum &#8211; Leetcode Solution"},"content":{"rendered":"\n<p>In this post, we are going to solve the<strong> 1. Two Sum &#8211; Leetcode Solution<\/strong> problem of Leetcode. This problem <strong>1. Two Sum &#8211; Leetcode Solution<\/strong> is a Leetcode <strong>easy <\/strong>level problem. Let&#8217;s see the code, <strong>1. Two Sum &#8211; Leetcode Solution<\/strong> <strong>&#8211; Leetcode Solution<\/strong>.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_66_1 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-66487de63fdc1\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-66487de63fdc1\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><ul class='ez-toc-list-level-2' ><li class='ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/#Problem\" title=\"Problem\">Problem<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/#Example_1\" title=\"Example 1 :\">Example 1 :<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/#Example_2\" title=\"Example 2 :\">Example 2 :<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/#Example_3\" title=\"Example 3 :\">Example 3 :<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><\/ul><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/#Two_Sum_%E2%80%93_Leetcode_Solution\" title=\"Two Sum &#8211; Leetcode Solution\">Two Sum &#8211; Leetcode Solution<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/#1_Two_Sum_%E2%80%93_Solution_in_Java\" title=\"1. Two Sum &#8211; Solution in Java\">1. Two Sum &#8211; Solution in Java<\/a><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/#1_Two_Sum_%E2%80%93_Solution_in_C\" title=\"1. Two Sum &#8211; Solution in C++\">1. Two Sum &#8211; Solution in C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/www.codingbroz.com\/two-sum-leetcode-solution\/#1_Two_Sum_%E2%80%93_Solution_in_Python\" title=\"1. Two Sum &#8211; Solution in Python\">1. Two Sum &#8211; Solution in Python<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Problem\"><\/span><strong>Problem<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Given an array of integers <code>nums<\/code> and an <code>integer<\/code> target, return indices of the two numbers such that they add up to <code><em>target<\/em><\/code>.<\/p>\n\n\n\n<p>You may assume that each input would have <strong><em>exactly one solution<\/em><\/strong>, and you may not use the same element twice.<\/p>\n\n\n\n<p>You can return the answer in any order.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_1\"><\/span><strong>Example 1 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>Input: nums = &#91;2,7,11,15], target = 9\r\nOutput: &#91;0,1]\r\nExplanation: Because nums&#91;0] + nums&#91;1] == 9, we return &#91;0, 1].<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_2\"><\/span><strong>Example 2 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>Input: nums = &#91;3,2,4], target = 6\r\nOutput: &#91;1,2]<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_3\"><\/span><strong>Example 3 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>Input: nums = &#91;3,3], target = 6\r\nOutput: &#91;0,1]<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<ul><li>2 &lt;= nums.length &lt;= 10<sup>4<\/sup><\/li><li>-10<sup>9<\/sup> &lt;= nums[i] &lt;= 10<sup>9<\/sup><\/li><li>-10<sup>9<\/sup> &lt;= target &lt;= 10<sup>9<\/sup><\/li><li><strong>Only one valid answer exists.<\/strong><\/li><\/ul>\n\n\n\n<p>Now, let&#8217;s see the leetcode solution of <strong>1. Two Sum &#8211; Leetcode Solution<\/strong>. <\/p>\n\n\n\n<h1 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Two_Sum_%E2%80%93_Leetcode_Solution\"><\/span><strong>Two Sum &#8211; Leetcode Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<p>We are going to solve the problem using <strong>Priority Queue<\/strong> or<strong> Heap<\/strong> Data structure ( <strong>Max Heap<\/strong> ). Let&#8217;s see the solution.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"1_Two_Sum_%E2%80%93_Solution_in_Java\"><\/span><strong><strong><strong>1. Two Sum<\/strong><\/strong> &#8211; Solution<\/strong> <strong>in Java<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<p>This is an<strong> O(N) <\/strong>complexity solution.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">class Solution {\n    public int[] twoSum(int[] nums, int target) {\n        HashMap&lt;Integer, Integer> map = new HashMap();\n        for (int i = 0; i &lt; nums.length; i++) {\n            int t = target - nums[i];\n            if (map.containsKey(t)) {\n                return new int[] {map.get(t), i};\n            }\n            map.put(nums[i], i);\n        }\n    }\n}<\/pre>\n\n\n\n<p>This is an<strong> O(N^2)<\/strong> complexity solution.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">class Solution {\n    public int[] twoSum(int[] nums, int target) {\n        for (int i = 0; i &lt; nums.length; i++) {\n        \tfor (int j = i + 1; j &lt; nums.length; j++) {\n        \t\tif (nums[i] + nums[j] == target) {\n        \t\t\treturn new int[] {i, j};\n        \t\t}\n        \t}\n        }\n    }\n}<\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"1_Two_Sum_%E2%80%93_Solution_in_C\"><\/span><strong><strong><strong><strong><strong>1. Two Sum<\/strong><\/strong><\/strong><\/strong> &#8211; Solution<\/strong> <strong>in C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>This is an<strong> O(N) <\/strong>complexity solution.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">class Solution {\npublic:\n    vector&lt;int> twoSum(vector&lt;int>&amp; nums, int target) {\n        vector&lt;int> ans;\n        map&lt;int, int> d;\n        for (int i = 0; i &lt; nums.size(); i++) {\n            int t = target - nums[i];\n            if (d.find(t) != d.end()) {\n                ans.push_back(d[t]);\n                ans.push_back(i);\n                break;\n            }\n            d[nums[i]] = i;\n        }\n        return ans;\n    }\n};<\/pre>\n\n\n\n<p>This is an<strong> O(N^2)<\/strong> complexity solution.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">class Solution {\npublic:\n    vector&lt;int> twoSum(vector&lt;int>&amp; nums, int target) {\n        vector&lt;int> ans;\n        for (int i = 0; i &lt; nums.size(); i++) {\n            for (int j = i + 1; j &lt; nums.size(); j++) {\n                if (nums[i] + nums[j] == target) {\n                    ans.push_back(i);\n                    ans.push_back(j);\n                    break;\n                }\n            }\n        }\n        return ans;\n    }\n};<\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"1_Two_Sum_%E2%80%93_Solution_in_Python\"><\/span><strong><strong><strong><strong><strong><strong>1. Two Sum<\/strong><\/strong><\/strong><\/strong><\/strong> &#8211; Solution in Python<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>This is an<strong> O(N) <\/strong>complexity solution.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">class Solution(object):\n    def twoSum(self, nums, target):\n        d = {}\n        for i, num in enumerate(nums):\n            t = target - num\n            if t in d:\n                return [d[t], i]\n            d[num] = i\n        return []<\/pre>\n\n\n\n<p>This is an<strong> O(N^2)<\/strong> complexity solution.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">class Solution(object):\n    def twoSum(self, nums, target):\n        for i in range(len(nums)):\n            for j in range(i + 1, len(nums)):\n                if nums[i] + nums[j] == target:\n                    return [i, j]\n        return []<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem<a href=\"https:\/\/leetcode.com\/problems\/two-sum\/\" target=\"_blank\" rel=\"noreferrer noopener\"> <strong><strong><strong><strong><strong><strong>1. Two Sum<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/a> is generated by <strong><a href=\"https:\/\/leetcode.com\/\" target=\"_blank\" rel=\"noreferrer noopener\">Leetcode<\/a> <\/strong>but the solution is provided by <strong><a href=\"https:\/\/www.codingbroz.com\/\">CodingBroz<\/a><\/strong>. This tutorial is only for <strong>Educational<\/strong> and <strong>Learning<\/strong> purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we are going to solve the 1. Two Sum &#8211; Leetcode Solution problem of Leetcode. This problem 1. Two Sum &#8211; Leetcode Solution is a Leetcode easy level problem. Let&#8217;s see the code, 1. Two Sum &#8211; Leetcode Solution &#8211; Leetcode Solution.<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[688],"tags":[130,689,693],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6785"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=6785"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6785\/revisions"}],"predecessor-version":[{"id":6787,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6785\/revisions\/6787"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=6785"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=6785"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=6785"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}