{"id":7724,"date":"2022-09-06T23:10:00","date_gmt":"2022-09-06T17:40:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=7724"},"modified":"2022-09-01T10:55:03","modified_gmt":"2022-09-01T05:25:03","slug":"quicksort-1-partition-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/quicksort-1-partition-hackerrank-solution\/","title":{"rendered":"Quicksort 1 &#8211; Partition &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Quicksort 1 &#8211; Partition HackerRank Solution<\/strong>. This problem <strong>(Quicksort 1 &#8211; Partition)<\/strong> is a part of <strong>HackerRank Problem Solving<\/strong> series.<\/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-6643340536add\" 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-6643340536add\" 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\/quicksort-1-partition-hackerrank-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-2\" href=\"https:\/\/www.codingbroz.com\/quicksort-1-partition-hackerrank-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-3\" href=\"https:\/\/www.codingbroz.com\/quicksort-1-partition-hackerrank-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-4\" href=\"https:\/\/www.codingbroz.com\/quicksort-1-partition-hackerrank-solution\/#Solution_%E2%80%93_Quicksort_1_%E2%80%93_Partition_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Quicksort 1 &#8211; Partition &#8211; HackerRank Solution\">Solution &#8211; Quicksort 1 &#8211; Partition &#8211; HackerRank Solution<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/quicksort-1-partition-hackerrank-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-6\" href=\"https:\/\/www.codingbroz.com\/quicksort-1-partition-hackerrank-solution\/#Python\" title=\"Python\">Python<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.codingbroz.com\/quicksort-1-partition-hackerrank-solution\/#Java\" title=\"Java\">Java<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\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>The previous challenges covered\u00a0<a href=\"https:\/\/en.wikipedia.org\/wiki\/Insertion_sort\" target=\"_blank\" rel=\"noopener\">Insertion Sort<\/a>, which is a simple and intuitive sorting algorithm with a running time of\u00a0<strong><em>O<\/em>(<em>n<\/em><sup>2<\/sup>)<\/strong>. In these next few challenges, we&#8217;re covering a\u00a0<em>divide-and-conquer<\/em>\u00a0algorithm called\u00a0<a href=\"https:\/\/en.wikipedia.org\/wiki\/Quicksort\" target=\"_blank\" rel=\"noopener\">Quicksort<\/a>\u00a0(also known as\u00a0<em>Partition Sort<\/em>). This challenge is a modified version of the algorithm that only addresses partitioning. It is implemented as follows:<\/p>\n\n\n\n<p><strong>Step 1: Divide<\/strong><br>Choose some pivot element,\u00a0<em><strong>p<\/strong><\/em>, and partition your unsorted array,\u00a0<em><strong>arr<\/strong><\/em>, into three smaller arrays:\u00a0<em><strong>left<\/strong><\/em>,\u00a0<em><strong>right<\/strong><\/em>, and\u00a0<em><strong>equal<\/strong><\/em>, where each element in\u00a0<strong><em>left<\/em> &lt; <em>p<\/em><\/strong>, each element in\u00a0<em><strong>right > p<\/strong><\/em>, and each element in\u00a0<strong><em>equal<\/em> = p<\/strong>.<\/p>\n\n\n\n<p><strong>Example<\/strong><\/p>\n\n\n\n<p><strong><em>arr<\/em> = [5, 7, 4, 3, 8]<\/strong><\/p>\n\n\n\n<p>In this challenge, the pivot will always be at\u00a0<strong><em>arr<\/em>[0]<\/strong>, so the pivot is\u00a0<strong>5<\/strong>.<\/p>\n\n\n\n<p><em><strong>arr<\/strong><\/em>\u00a0is divided into\u00a0<strong><em>left<\/em> = {4, 3}<\/strong>,\u00a0<strong><em>equal<\/em> = {5}<\/strong>, and\u00a0<strong><em>right<\/em> = {7, 8}<\/strong>.<br>Putting them all together, you get\u00a0<strong>{4, 3, 5, 7, 8}<\/strong>. There is a flexible checker that allows the elements of\u00a0<em><strong>left<\/strong><\/em>\u00a0and\u00a0<em><strong>right<\/strong><\/em>\u00a0to be in any order. For example,\u00a0<strong>{3, 4, 5, 8, 7}<\/strong>\u00a0is valid as well.<\/p>\n\n\n\n<p>Given\u00a0<em><strong>arr<\/strong><\/em>\u00a0and\u00a0<strong>p = <em>arr<\/em>[0]<\/strong>, partition\u00a0<em><strong>arr<\/strong><\/em>\u00a0into\u00a0<em><strong>left<\/strong><\/em>,\u00a0<em><strong>right<\/strong><\/em>, and\u00a0<em><strong>equal<\/strong><\/em>\u00a0using the\u00a0<em>Divide<\/em>\u00a0instructions above. Return a 1-dimensional array containing each element in\u00a0<em><strong>left<\/strong><\/em>\u00a0first, followed by each element in\u00a0<em><strong>equal<\/strong><\/em>, followed by each element in\u00a0<em><strong>right<\/strong><\/em>.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>quickSort<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p>quickSort has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>int arr[n]:<\/em>\u00a0<strong><em>arr<\/em>[0]<\/strong>\u00a0is the pivot element<\/li><\/ul>\n\n\n\n<p><strong>Returns<\/strong><\/p>\n\n\n\n<ul><li><em>int[n]:<\/em>\u00a0an array of integers as described above<\/li><\/ul>\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\u00a0<em><strong>n<\/strong><\/em>, the size of\u00a0<em><strong>arr<\/strong><\/em>.<br>The second line contains\u00a0<em><strong>n<\/strong><\/em>\u00a0space-separated integers\u00a0<strong><em>arr<\/em>[<em>i<\/em>]<\/strong>\u00a0(the unsorted array). The first integer,\u00a0<strong><em>arr<\/em>[0]<\/strong>, is the pivot element,\u00a0<em><strong>p<\/strong><\/em>.<\/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>1 &lt;= <em>n<\/em> &lt;= 1000<\/strong><\/li><li><strong>-1000 &lt;= <em>arr<\/em>[<em>i<\/em>] &lt;= 1000 <\/strong>where<strong> 0 &lt;= <em>i<\/em> &lt; <em>n<\/em><\/strong><\/li><li>All elements are distinct.<strong> <\/strong><\/li><\/ul>\n\n\n\n<p><strong>Sample Input<\/strong><\/p>\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>STDIN       Function\r\n-----       --------\r\n5           arr&#91;] size n =5\r\n4 5 3 7 2   arr =&#91;4, 5, 3, 7, 2]<\/code><\/pre>\n\n\n\n<p><strong>Sample Output<\/strong><\/p>\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>3 2 4 5 7<\/code><\/pre>\n\n\n\n<p><strong>Explanation<\/strong><\/p>\n\n\n\n<p><strong><em>arr<\/em> = [4, 5, 3, 7, 2]<\/strong>\u00a0<em>Pivot<\/em>:\u00a0<strong><em>p<\/em> = <em>arr<\/em>[0] = 4<\/strong>.<br><strong><em>left<\/em> = {}<\/strong>;\u00a0<em><strong>equal<\/strong><\/em><strong> = {4}<\/strong>; <strong><em>right<\/em> = {}<\/strong>\u00a0<\/p>\n\n\n\n<p><strong><em>arr<\/em>[1] = 5 > <em>p<\/em><\/strong>, so it is added to <em><strong>right<\/strong><\/em>.<br><strong><em>left<\/em> = {}; <em>equal<\/em> = {4}; <em>right<\/em> = {5}<\/strong><\/p>\n\n\n\n<p><strong><em>arr<\/em>[2] = 3 &lt; <em>p<\/em><\/strong>, so it is added to\u00a0<em><strong>left<\/strong><\/em>.<br><strong><em>left<\/em> = {3}<\/strong>;\u00a0<strong><em>equal<\/em> = {4}<\/strong>;\u00a0<strong><em>right<\/em> = {5}<\/strong><\/p>\n\n\n\n<p><strong><em>arr<\/em>[3] = 7 > <em>p<\/em><\/strong>, so it is added to\u00a0<em><strong>right<\/strong><\/em>.<br><strong><em>left<\/em> = {3}<\/strong>;\u00a0<strong><em>equal<\/em> = {4}<\/strong>;\u00a0<strong><em>right<\/em> = {5, 7}<\/strong><\/p>\n\n\n\n<p><strong><em>arr<\/em>[4] = 2 &lt; <em>p<\/em><\/strong>, so it is added to\u00a0<em><strong>left<\/strong><\/em>.<br><strong><em>left<\/em> = {3, 2}<\/strong>;\u00a0<strong><em>equal<\/em> = {4}<\/strong>;\u00a0<strong><em>right<\/em> = {5, 7}<\/strong><\/p>\n\n\n\n<p>Return the array\u00a0<strong>{32457}<\/strong>.<\/p>\n\n\n\n<p>The order of the elements to the left and right of\u00a0<strong>4<\/strong>\u00a0does not need to match this answer. It is only required that\u00a0<strong>3<\/strong>\u00a0and\u00a0<strong>2<\/strong>\u00a0are to the left of\u00a0<strong>4<\/strong>, and\u00a0<strong>5<\/strong>\u00a0and\u00a0<strong>7<\/strong>\u00a0are to the right.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Quicksort_1_%E2%80%93_Partition_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Quicksort 1 &#8211; Partition &#8211; HackerRank Solution<\/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;vector>\n#include &lt;iostream>\n#include &lt;algorithm>\n\nusing namespace std;\n\nvoid partition(vector&lt;int> arr) {\n    \n    int length = arr.size() - 1; \/\/ store length modded to be without p in next steps\n    int p = arr.front(); \/\/ declare pivot\n    arr.erase(arr.begin()); \/\/ erases pivot from array\n    \n    vector&lt;int> left;\n    vector&lt;int> right;\n    \n    int i, n;\n    \n    for (i = 0; i &lt; length; i++) {  \n        (arr[i] > p) ? right.push_back(arr[i]) : left.push_back(arr[i]); \n    }\n    \n    for (i = 0, n = left.size(); i &lt; n; i++)\n        cout &lt;&lt; left[i] &lt;&lt; \" \";\n    \n    cout &lt;&lt; p &lt;&lt; \" \";\n    \n    for (i = 0, n = right.size(); i &lt; n; i++)\n        cout &lt;&lt; right[i] &lt;&lt; \" \";\n    cout &lt;&lt; \"\\n\";\n    \n}\nint main(void) {\n   vector &lt;int>  _ar;\n   int _ar_size;\ncin >> _ar_size;\nfor(int _ar_i=0; _ar_i&lt;_ar_size; _ar_i++) {\n   int _ar_tmp;\n   cin >> _ar_tmp;\n   _ar.push_back(_ar_tmp); \n}\n\npartition(_ar);\n   \n   return 0;\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=\"\">import sys\n\ndef quickSort(arr):\n    left = []\n    equal = []\n    right = []\n    pivot = arr[0]\n    \n    for el in arr:\n        if el &lt; pivot:\n            left.append(el)\n        elif el == pivot:\n            equal.append(el)\n        elif el > pivot:\n            right.append(el)\n            \n    return left + equal + right\n\nif __name__ == \"__main__\":\n    n = int(input().strip())\n    arr = list(map(int, input().strip().split(' ')))\n    result = quickSort(arr)\n    print (\" \".join(map(str, result)))\n<\/pre>\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.util.Scanner;\n\npublic class Solution {\n    public static void main(String[] args) {\n        Scanner scan = new Scanner(System.in);\n        int s = scan.nextInt();\n        int[] array = new int[s];\n        for (int i = 0; i &lt; s; i++) {\n            array[i] = scan.nextInt(); \n        }\n        scan.close();\n        partition(array);\n        printArray(array);\n    }\n    \n    \/* Partitions array into 2 parts. \n     *      1) Left side has values smaller than pivotValue\n     *      2) Right side has values larger than pivotValue\n     * Returns pivotIndex\n     *\/\n    public static int partition(int [] array) {\n        int pivotIndex = 0; \/\/ not a great choice of pivot.\n        int pivotValue = array[pivotIndex];\n        \n        swap(array, pivotIndex, array.length - 1); \/\/ put pivot at end for now.\n        \n        \/* Linear search, comparing all elements to pivotValue and swapping as necessary *\/\n        int indexToReturn = 0;\n        for (int i = 0; i &lt; array.length; i++){\n            if (array[i] &lt; pivotValue){\n                swap(array, i, indexToReturn);\n                indexToReturn++;\n            }\n        }\n        \n        swap(array, indexToReturn, array.length - 1); \/\/ puts pivot where it belongs\n        return indexToReturn;\n    }\n    \n    private static void swap(int [] array, int i, int j) {\n        int temp = array[i];\n        array[i] = array[j];\n        array[j] = temp;\n    }\n    \n    private static void printArray(int[] array) {\n        for (int num: array) {\n            System.out.print(num + \" \");\n        }\n        System.out.println();\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/quicksort1\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Quicksort 1 &#8211; Partition<\/a>)<\/strong> is generated by <strong><a href=\"https:\/\/www.hackerrank.com\/\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">HackerRank<\/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 will solve Quicksort 1 &#8211; Partition HackerRank Solution. This problem (Quicksort 1 &#8211; Partition) is a part of HackerRank Problem Solving series.<\/p>\n","protected":false},"author":2,"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":[9,190],"tags":[191],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7724"}],"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\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=7724"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7724\/revisions"}],"predecessor-version":[{"id":7728,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7724\/revisions\/7728"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=7724"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=7724"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=7724"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}