{"id":1994,"date":"2021-05-29T11:03:14","date_gmt":"2021-05-29T05:33:14","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=1994"},"modified":"2021-06-20T22:44:59","modified_gmt":"2021-06-20T17:14:59","slug":"day-20-sorting-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/day-20-sorting-solution\/","title":{"rendered":"Day 20: Sorting | 30 Days Of Code | HackerRank Solution"},"content":{"rendered":"\n<p>Hello coders, today we are going to solve <strong>Day 20: Sorting HackerRank Solution<\/strong> in<strong> C++<\/strong>, <strong>Java<\/strong> and <strong>Python<\/strong>.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1200\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/day-20-sorting-30-days-of-code-solution-codingbroz.png\" alt=\"Day 20: Sorting\" class=\"wp-image-1996\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/day-20-sorting-30-days-of-code-solution-codingbroz.png 1200w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/day-20-sorting-30-days-of-code-solution-codingbroz-768x432.png 768w\" sizes=\"(max-width: 1200px) 100vw, 1200px\" \/><\/figure>\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-662e894edad7b\" 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-662e894edad7b\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/day-20-sorting-solution\/#Objective\" title=\"Objective\">Objective<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/day-20-sorting-solution\/#Task\" title=\"Task\">Task<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/day-20-sorting-solution\/#Input_Format\" title=\"Input Format\">Input Format<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/day-20-sorting-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/day-20-sorting-solution\/#Output_Format\" title=\"Output Format\">Output Format<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/day-20-sorting-solution\/#Solution_%E2%80%93_Day_20_Sorting\" title=\"Solution &#8211; Day 20: Sorting\">Solution &#8211; Day 20: Sorting<\/a><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\/day-20-sorting-solution\/#C\" title=\"C++\">C++<\/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\/day-20-sorting-solution\/#Java\" title=\"Java\">Java<\/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\/day-20-sorting-solution\/#Python\" title=\"Python\">Python<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Objective\"><\/span><strong>Objective<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Today, we&#8217;re discussing a simple sorting algorithm called&nbsp;<em>Bubble Sort<\/em>.<\/p>\n\n\n\n<p>Consider the following version of Bubble Sort:<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>for (int i = 0; i &lt; n; i++) {\n    \/\/ Track number of elements swapped during a single array traversal\n    int numberOfSwaps = 0;\n    \n    for (int j = 0; j &lt; n - 1; j++) {\n        \/\/ Swap adjacent elements if they are in decreasing order\n        if (a&#91;j] &gt; a&#91;j + 1]) {\n            swap(a&#91;j], a&#91;j + 1]);\n            numberOfSwaps++;\n        }\n    }\n    \n    \/\/ If no elements were swapped during a traversal, array is sorted\n    if (numberOfSwaps == 0) {\n        break;\n    }\n}<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Task\"><\/span><strong>Task<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Given an array,&nbsp;<em><strong>a<\/strong><\/em>, of size&nbsp;<strong><em>n<\/em><\/strong>&nbsp;distinct elements, sort the array in&nbsp;<em>ascending<\/em>&nbsp;order using the&nbsp;<em>Bubble Sort<\/em>&nbsp;algorithm above. Once sorted, print the following&nbsp;<strong>3<\/strong>&nbsp;lines:<\/p>\n\n\n\n<ol><li><code>Array is sorted in numSwaps swaps.<\/code><br>where&nbsp;<strong><em>numSwaps<\/em><\/strong>&nbsp;is the number of swaps that took place.<\/li><li><code>First Element: firstElement<\/code><br>where&nbsp;<em><strong>firstElement<\/strong><\/em>&nbsp;is the&nbsp;<em>first<\/em>&nbsp;element in the sorted array.<\/li><li><code>Last Element: lastElement<\/code><br>where&nbsp;<em><strong>lastElement<\/strong><\/em>&nbsp;is the&nbsp;<em>last<\/em>&nbsp;element in the sorted array.<\/li><\/ol>\n\n\n\n<p><strong>Hint:<\/strong>&nbsp;To complete this challenge, you will need to add a variable that keeps a running tally of&nbsp;<em>all<\/em>&nbsp;swaps that occur during execution.<\/p>\n\n\n\n<p><strong>Example<\/strong><br><strong><em>a<\/em> = [4, 3, 1, 2]<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>original a: 4 3 1 2\nround 1  a: 3 1 2 4 swaps this round: 3\nround 2  a: 1 2 3 4 swaps this round: 2\nround 3  a: 1 2 3 4 swaps this round: 0<\/code><\/pre>\n\n\n\n<p>In the first round, the&nbsp;<strong>4<\/strong>&nbsp;is swapped at each of the&nbsp;<strong>3<\/strong>&nbsp;comparisons, ending in the last position. In the second round, the&nbsp;<strong>3<\/strong>&nbsp;is swapped at&nbsp;<strong>2<\/strong>&nbsp;of the&nbsp;<strong>3<\/strong>&nbsp;comparisons. Finally, in the third round, no swaps are made so the iterations stop. The output is the following:<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Array is sorted in 5 swaps.\nFirst Element: 1\nLast Element: 4<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Input_Format\"><\/span><strong>Input Format<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>The first line contains an integer,&nbsp;<strong><em>n<\/em><\/strong>, the number of elements in array&nbsp;<strong><em>a<\/em><\/strong>.<br>The second line contains&nbsp;<strong><em>n<\/em><\/strong>&nbsp;space-separated integers that describe&nbsp;<strong><em>a<\/em>[0], <em>a<\/em>[1], . . .<em>a<\/em>[<em>n<\/em> &#8211; 1]<\/strong>.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<ul><li><strong>2 &lt;= <em>n<\/em> &lt;= 600<\/strong><\/li><li><strong>1 &lt;= <em>a<\/em>[<em>i<\/em>] &lt;= 2 x10<sup>6<\/sup>, <\/strong>where <strong>0 &lt;= <em>i<\/em> &lt; <em>n<\/em> <\/strong><\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Output_Format\"><\/span><strong>Output Format<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Print the following three lines of output:<\/p>\n\n\n\n<ol><li><code>Array is sorted in numSwaps swaps.<\/code><br>where&nbsp;<em><strong>numSwaps<\/strong><\/em>&nbsp;is the number of swaps that took place.<\/li><li><code>First Element: firstElement<\/code><br>where&nbsp;<em><strong>firstElement<\/strong><\/em>&nbsp;is the&nbsp;<em>first<\/em>&nbsp;element in the sorted array.<\/li><li><code>Last Element: lastElement<\/code><br>where&nbsp;<em><strong>lastElement<\/strong><\/em>&nbsp;is the&nbsp;<em>last<\/em>&nbsp;element in the sorted array.<\/li><\/ol>\n\n\n\n<p><strong>Sample Input 0<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>3\n1 2 3<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 0<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\">Array is sorted in 0 swaps.\nFirst Element: 1\nLast Element: 3<\/pre>\n\n\n\n<p><strong>Explanation 0<\/strong><\/p>\n\n\n\n<p>The array is already sorted, so&nbsp;<strong>0<\/strong>&nbsp;swaps take place and we print the necessary&nbsp;<strong>3<\/strong>&nbsp;lines of output shown above.<\/p>\n\n\n\n<p><strong>Sample Input 1<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>3\n3 2 1<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 1<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Array is sorted in 3 swaps.\nFirst Element: 1\nLast Element: 3<\/code><\/pre>\n\n\n\n<p><strong>Explanation 1<\/strong><\/p>\n\n\n\n<p>The array&nbsp;<strong><em>a<\/em> = [3, 2, 1]<\/strong>&nbsp;is&nbsp;<em>not sorted<\/em>, so we perform the following&nbsp;<strong>3<\/strong>&nbsp;swaps. Each line shows&nbsp;<strong><em>a<\/em><\/strong>&nbsp;after each single element is swapped.<\/p>\n\n\n\n<ol><li><strong>[3, 2, 1] = [2, 3, 1]<\/strong><\/li><li><strong>[2, 3, 1] =<\/strong> <strong>[2, 1, 3]<\/strong><\/li><li><strong>[2, 1, 3] = [1 , 2, 3]<\/strong><\/li><\/ol>\n\n\n\n<p>After&nbsp;<strong>3<\/strong>&nbsp;swaps, the array is sorted.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Day_20_Sorting\"><\/span><strong>Solution &#8211; Day 20: Sorting<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C\"><\/span><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=\"\">#include &lt;bits\/stdc++.h>\n\n\nusing namespace std;\n\nint main() {\n    int n;\n    cin >> n;\n    vector&lt;int> a(n);\n    for(int a_i = 0; a_i &lt; n; a_i++){\n        cin >> a[a_i];\n    }\n    \/\/ Write Your Code Here\n    int swap=0;\n    for(int i=0;i&lt;n;i++){\n        for(int j=0;j&lt;n-i-1;j++){\n            if(a[j]>a[j+1]){\n                int temp = a[j];\n                a[j]=a[j+1];\n                a[j+1]=temp;\n                swap++;\n            }\n        }\n    }\n    cout&lt;&lt;\"Array is sorted in \"&lt;&lt;swap&lt;&lt;\" swaps.\"&lt;&lt;endl;\n    cout&lt;&lt;\"First Element: \"&lt;&lt;a[0]&lt;&lt;endl;\n    cout&lt;&lt;\"Last Element: \"&lt;&lt;a[n-1]&lt;&lt;endl;\n    return 0;\n}<\/pre>\n\n\n\n<script async src=\"https:\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js\"><\/script>\n<ins class=\"adsbygoogle\"\n     style=\"display:block; text-align:center;\"\n     data-ad-layout=\"in-article\"\n     data-ad-format=\"fluid\"\n     data-ad-client=\"ca-pub-5246141430412355\"\n     data-ad-slot=\"8798433565\"><\/ins>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Java\"><\/span><strong>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=\"\">import java.io.*;\nimport java.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        int n = in.nextInt();\n        int[] arr = new int[n];\n        for(int i=0;i&lt;n;i++){\n            arr[i]=in.nextInt();\n        }\n        int temp=0;\n        int swapCount=0;\n        for(int i=0;i&lt;n;i++){\n            for(int j=0;j&lt;n-1;j++){\n                if(arr[j]>arr[j+1]){\n                    temp=arr[j];\n                    arr[j]=arr[j+1];\n                    arr[j+1]=temp;\n                    swapCount++;   \n                }\n                \n            }\n            if(swapCount==0){\n                break;\n            }\n        }\n                System.out.println(\"Array is sorted in \"+swapCount+\" swaps.\");\n                System.out.println(\"First Element: \"+arr[0]);\n                System.out.println(\"Last Element: \"+arr[arr.length-1]);\n            \n        }\n    }<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Python\"><\/span><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=\"\">n = int(input())\narr = [int(x) for x in input().split(\" \")]\n\nnum_swaps = 0\n\nfor i in range(n):\n    for j in range(n - 1):\n        if arr[j] > arr[j + 1]:\n            tmp = arr[j]\n            arr[j] = arr[j + 1]\n            arr[j + 1] = tmp\n            num_swaps += 1\n\n    if num_swaps == 0:\n        break\n\nprint(\"Array is sorted in \" + str(num_swaps) + \" swaps.\")\nprint(\"First Element: \" + str(arr[0]))\nprint(\"Last Element: \" + str(arr[len(arr) - 1]))\n<\/pre>\n\n\n\n<script async src=\"https:\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js\"><\/script>\n<ins class=\"adsbygoogle\"\n     style=\"display:block; text-align:center;\"\n     data-ad-layout=\"in-article\"\n     data-ad-format=\"fluid\"\n     data-ad-client=\"ca-pub-5246141430412355\"\n     data-ad-slot=\"8798433565\"><\/ins>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script>\n\n\n\n<p><strong>Disclaimer:<\/strong> The above Problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/30-sorting\/problem\" target=\"_blank\" rel=\"noreferrer noopener\" class=\"rank-math-link\">Day 20: Sorting<\/a>)<\/strong> is generated by <strong>Hacker Rank<\/strong> but the Solution in Provided by <strong>CodingBroz<\/strong>. This tutorial is only for <strong>Educational<\/strong> and <strong>Learning<\/strong> Purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Hello coders, today we are going to solve Day 20: Sorting HackerRank Solution in C++, Java and Python.<\/p>\n","protected":false},"author":1,"featured_media":1996,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","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":"default","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":[9,160],"tags":[171,80,18],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/day-20-sorting-30-days-of-code-solution-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/1994"}],"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\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=1994"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/1994\/revisions"}],"predecessor-version":[{"id":3534,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/1994\/revisions\/3534"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/1996"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=1994"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=1994"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=1994"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}