{"id":8233,"date":"2022-10-17T23:15:00","date_gmt":"2022-10-17T17:45:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=8233"},"modified":"2022-10-16T14:25:13","modified_gmt":"2022-10-16T08:55:13","slug":"3sum-leetcode-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/3sum-leetcode-solution\/","title":{"rendered":"3Sum &#8211; Leetcode Solution"},"content":{"rendered":"\n<p>In this post, we are going to solve the<strong> 15. 3Sum<\/strong> problem of Leetcode. This problem <strong>15. 3Sum<\/strong> is a Leetcode <strong>medium <\/strong>level problem. Let&#8217;s see code, <strong>15. 3Sum<\/strong>.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662c611da9250\" 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-662c611da9250\" 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\/3sum-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\/3sum-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\/3sum-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\/3sum-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\/3sum-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\/3sum-leetcode-solution\/#3Sum_%E2%80%93_Leetcode_Solution\" title=\"3Sum &#8211; Leetcode Solution\">3Sum &#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\/3sum-leetcode-solution\/#15_3Sum_%E2%80%93_Solution_in_Java\" title=\"15. 3Sum &#8211; Solution in Java\">15. 3Sum &#8211; Solution in Java<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.codingbroz.com\/3sum-leetcode-solution\/#15_3Sum_%E2%80%93_Solution_in_C\" title=\"15. 3Sum &#8211; Solution in C++\">15. 3Sum &#8211; Solution in C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/www.codingbroz.com\/3sum-leetcode-solution\/#15_3Sum_%E2%80%93_Solution_in_Python\" title=\"15. 3Sum &#8211; Solution in Python\">15. 3Sum &#8211; Solution in Python<\/a><\/li><\/ul><\/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 integer array nums, return all the triplets <code>[nums[i], nums[j], nums[k]]<\/code> such that <code>i != j<\/code>, <code>i != k<\/code>, and <code>j != k<\/code>, and <code>nums[i] + nums[j] + nums[k] == 0<\/code>.<\/p>\n\n\n\n<p>Notice that the solution set must not contain duplicate triplets.<\/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>\nInput: nums = &#91;-1,0,1,2,-1,-4]\r\nOutput: &#91;&#91;-1,-1,2],&#91;-1,0,1]]\r\nExplanation: \r\nnums&#91;0] + nums&#91;1] + nums&#91;2] = (-1) + 0 + 1 = 0.\r\nnums&#91;1] + nums&#91;2] + nums&#91;4] = 0 + 1 + (-1) = 0.\r\nnums&#91;0] + nums&#91;3] + nums&#91;4] = (-1) + 2 + (-1) = 0.\r\nThe distinct triplets are &#91;-1,0,1] and &#91;-1,-1,2].\r\nNotice that the order of the output and the order of the triplets does not matter.\n<\/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>\nInput: nums = &#91;0,1,1]\r\nOutput: &#91;]\r\nExplanation: The only possible triplet does not sum up to 0.\n<\/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>\nInput: nums = &#91;0,0,0]\r\nOutput: &#91;&#91;0,0,0]]\r\nExplanation: The only possible triplet sums up to 0.\n<\/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><code>3 &lt;= nums.length &lt;= 3000<\/code><\/li><li><code>-10<sup>5<\/sup> &lt;= nums[i] &lt;= 10<sup>5<\/sup><\/code><\/li><\/ul>\n\n\n\n<p>Now, let&#8217;s see the code of <strong><strong>15. 3Sum<\/strong><\/strong> &#8211; Leetcode Solution.<\/p>\n\n\n\n<h1 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"3Sum_%E2%80%93_Leetcode_Solution\"><\/span><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong>3Sum<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong> &#8211; Leetcode Solution<span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"15_3Sum_%E2%80%93_Solution_in_Java\"><\/span><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong>15. 3Sum<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong> &#8211; Solution in Java<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\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 List&lt;List&lt;Integer>> threeSum(int[] arr) {\n        Arrays.sort(arr);\n        int n = arr.length;\n        List&lt;List&lt;Integer>> ans = new ArrayList&lt;>();\n        for (int i = 0; i &lt; n; i++) {\n            if (arr[i] > 0) break; \/\/ Since arr[i] &lt;= arr[l] &lt;= arr[r], if a[i] > 0 then sum=arr[i]+arr[l]+arr[r] > 0\n            int l = i + 1, r = n - 1;\n            while (l &lt; r) {\n                int sum = arr[i] + arr[l] + arr[r];\n                if (sum &lt; 0) l++;\n                else if (sum > 0) r--;\n                else {\n                    ans.add(Arrays.asList(arr[i], arr[l], arr[r]));\n                    while (l+1 &lt;= r &amp;&amp; arr[l] == arr[l+1]) l++; \/\/ Skip duplicate nums[l]\n                    l++;\n                    r--;\n                }\n            }\n            while (i+1 &lt; n &amp;&amp; arr[i+1] == arr[i]) i++; \/\/ Skip duplicate nums[i]\n        }\n        return ans;\n    }\n}<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"15_3Sum_%E2%80%93_Solution_in_C\"><\/span><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong>15. 3Sum<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong> &#8211; Solution in <\/strong>C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\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;vector&lt;int>> threeSum(vector&lt;int>&amp; nums) {\n        sort(nums.begin() , nums.end());     \n        if(nums.size() &lt; 3){               \n            return {};\n        }\n        if(nums[0] > 0){                   \n            return {};\n        }\n        unordered_map&lt;int , int> hashMap;\n        for(int i = 0 ; i &lt; nums.size() ; ++i){    \n            hashMap[nums[i]] = i;\n        }\n        vector&lt;vector&lt;int>> answer;\n        for(int i = 0 ; i &lt; nums.size() - 2 ; ++i){ \n            if(nums[i] > 0){    \n                break;\n            }\n            for(int j = i + 1 ; j &lt; nums.size() - 1 ; ++j){    \n                int required = -1*(nums[i] + nums[j]);   \n                if(hashMap.count(required) &amp;&amp; hashMap.find(required)->second > j){ \n                    answer.push_back({nums[i] , nums[j] , required});\n                }\n                j = hashMap.find(nums[j])->second; \n            }\n            i = hashMap.find(nums[i])->second;     \n        }\n        return answer; \n    }\n};<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"15_3Sum_%E2%80%93_Solution_in_Python\"><\/span><strong>15. 3Sum<\/strong> <strong><strong><strong>&#8211; Solution in <\/strong><\/strong>Python<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\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:\n    def threeSum(self, nums: List[int]) -> List[List[int]]:\n        nums.sort()\n        ans = []\n        n = len(nums)\n        i = 0\n        while i &lt; n:\n            if nums[i] > 0: break  # Since arr[i] &lt;= arr[l] &lt;= arr[r], if arr[i] > 0 then sum=arr[i]+arr[l]+arr[r] > 0\n            l = i + 1\n            r = n - 1\n            while l &lt; r:\n                sum3 = nums[i] + nums[l] + nums[r]\n                if sum3 == 0:\n                    ans.append([nums[i], nums[l], nums[r]])\n                    while l+1 &lt; n and nums[l+1] == nums[l]: l += 1  # Skip duplicates nums[l]\n                    l += 1\n                    r -= 1\n                elif sum3 &lt; 0: l += 1\n                else: r -= 1\n                \n            while i+1 &lt; n and nums[i+1] == nums[i]: i += 1  # Skip duplicates nums[i]\n            i += 1\n        return ans<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong><a href=\"https:\/\/leetcode.com\/problems\/3sum\/\" target=\"_blank\" rel=\"noreferrer noopener\">15. 3Sum<\/a><\/strong> 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 15. 3Sum problem of Leetcode. This problem 15. 3Sum is a Leetcode medium level problem. Let&#8217;s see code, 15. 3Sum.<\/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":[802,130,689],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8233"}],"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=8233"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8233\/revisions"}],"predecessor-version":[{"id":8235,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8233\/revisions\/8235"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=8233"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=8233"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=8233"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}