{"id":1690,"date":"2021-05-24T22:11:09","date_gmt":"2021-05-24T16:41:09","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=1690"},"modified":"2021-06-20T17:02:15","modified_gmt":"2021-06-20T11:32:15","slug":"permutations-of-strings-c-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/permutations-of-strings-c-solution\/","title":{"rendered":"Permutations of Strings in C | HackerRank Solution"},"content":{"rendered":"\n<p>Hello coders, today we are going to solve <strong>Permutations of Strings HackerRank Solution in C<\/strong>.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1167\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/permutations-of-strings-in-c-solution-codingbroz.png\" alt=\"Permutations of Strings\" class=\"wp-image-1692\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/permutations-of-strings-in-c-solution-codingbroz.png 1167w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/permutations-of-strings-in-c-solution-codingbroz-768x444.png 768w\" sizes=\"(max-width: 1167px) 100vw, 1167px\" \/><\/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-662afac6b318e\" 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-662afac6b318e\" 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\/permutations-of-strings-c-solution\/#Problem\" title=\"Problem\">Problem<\/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\/permutations-of-strings-c-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\/permutations-of-strings-c-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\/permutations-of-strings-c-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-5\" href=\"https:\/\/www.codingbroz.com\/permutations-of-strings-c-solution\/#Solution_%E2%80%93_Permutations_of_Strings_in_C\" title=\"Solution &#8211; Permutations of Strings in C\">Solution &#8211; Permutations of Strings in C<\/a><\/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>Strings are usually ordered in lexicographical order. That means they are ordered by comparing their leftmost different characters. For example,&nbsp;<strong><em>abc &lt; abd<\/em><\/strong>&nbsp;because&nbsp;<em><strong>c &lt; d<\/strong><\/em>. Also&nbsp;<em><strong>z &gt;yyy<\/strong><\/em>&nbsp;because&nbsp;<em><strong>z &gt;y<\/strong><\/em>. If one string is an exact prefix of the other it is lexicographically smaller, e.g.,<em><strong>&nbsp;gh &gt;ghij<\/strong><\/em>.<\/p>\n\n\n\n<p>Given an array of strings sorted in lexicographical order, print all of its permutations in strict lexicographical order. If two permutations look the same, only print one of them. See the &#8216;note&#8217; below for an example.<\/p>\n\n\n\n<p>Complete the function&nbsp;<code>next_permutation<\/code>&nbsp;which generates the permutations in the described order.<\/p>\n\n\n\n<p>For example,&nbsp;<strong>s =<\/strong> <strong>[<em>ab, bc, cd<\/em>]<\/strong>. The six permutations in correct order are:<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>ab bc cd\nab cd bc\nbc ab cd\nbc cd ab\ncd ab bc\ncd bc ab<\/code><\/pre>\n\n\n\n<p><strong>Note:<\/strong>&nbsp;There may be two or more of the same string as elements of&nbsp;<strong><em>s<\/em><\/strong>.<br>For example,&nbsp;<strong><em>s<\/em> = [<em>ab, ab, bc<\/em>]<\/strong>. Only one instance of a permutation where all elements match should be printed. In other words, if&nbsp;<strong><em>s<\/em>[0] == <em>s<\/em>[1]<\/strong>, then print either&nbsp;<strong>s[0]<\/strong> <strong>s[1]<\/strong>&nbsp;or&nbsp;<strong>s[1]<\/strong>&nbsp;<strong>s[0]<\/strong> but not both.<\/p>\n\n\n\n<p>A three element array having three distinct elements has six permutations as shown above. In this case, there are three matching pairs of permutations where&nbsp;<strong>s[0]<\/strong> <em><strong>= ab<\/strong><\/em>&nbsp;and&nbsp;<strong>s[1]<\/strong> <strong>= ab<\/strong>&nbsp;are switched. We only print the three visibly unique permutations:<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>ab ab bc\nab bc ab\nbc ab ab<\/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 of each test file contains a single integer&nbsp;<em><strong>n<\/strong><\/em>, the length of the string array&nbsp;<em><strong>s<\/strong><\/em>.<\/p>\n\n\n\n<p>Each of the next&nbsp;<strong><em>n<\/em><\/strong>&nbsp;lines contains a string&nbsp;<strong><em>s[i]<\/em><\/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;= 9<\/strong><\/li><li><strong>1 &lt;= |<em>s[i]<\/em>| &lt;= 10<\/strong><\/li><li><strong><em>s[i] <\/em><\/strong>contains only lowercase English letters.<\/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 each permutation as a list of space-separated strings on a single line.<\/p>\n\n\n\n<p><strong>Sample Input 0<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>2\nab\ncd<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 0<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>ab cd\ncd ab<\/code><\/pre>\n\n\n\n<p><strong>Sample Input 1<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>3\na\nbc\nbc<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 1<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\">a bc bc\nbc a bc\nbc bc a<\/pre>\n\n\n\n<p><strong>Explanation 1<\/strong><\/p>\n\n\n\n<p>This is similar to the&nbsp;<strong>note<\/strong>&nbsp;above. Only three of the six permutations are printed to avoid redundancy in output.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Permutations_of_Strings_in_C\"><\/span><strong>Solution &#8211; Permutations of Strings in C<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">#include &lt;stdio.h>\n#include &lt;stdlib.h>\n#include &lt;string.h>\n\nvoid swap(char **s, int i, int j)\n{\n    char * tmp = s[i];\n    s[i] = s[j];\n    s[j] = tmp;\n}\n\nvoid reverse(char **s, int start, int end)\n{\n    while(start&lt;end)\n    {\n        swap(s,start++,end--);\n    }\n}\n\nint next_permutation(int n, char **s)\n{\n\t\/**\n\t* Complete this method\n\t* Return 0 when there is no next permutation and 1 otherwise\n\t* Modify array s to its next permutation\n\t*\/\n    for(int i=n-2;i>-1;i--)\n    {\n        if(strcmp(s[i+1],s[i])>0)\n        {\n            \/\/get min max\n            for(int j=n-1;j>i;j--)\n            {\n                if(strcmp(s[j],s[i])>0)\n                {\n                    \/\/do swap\n                    swap(s,i,j);\n                    \/\/ do reverse\n                    reverse(s,i+1,n-1);\n                    return 1;\n                }\n            }\n        }\n    }\n    return 0;\n}\n\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\/permutations-of-strings\/problem\" target=\"_blank\" rel=\"noreferrer noopener\" class=\"rank-math-link\">Permutations of Strings<\/a>)<\/strong> is generated by <strong>Hacker Rank<\/strong> but the Solution is 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 Permutations of Strings HackerRank Solution in C.<\/p>\n","protected":false},"author":1,"featured_media":1692,"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,158],"tags":[80,82,18],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/permutations-of-strings-in-c-solution-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/1690"}],"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=1690"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/1690\/revisions"}],"predecessor-version":[{"id":3384,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/1690\/revisions\/3384"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/1692"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=1690"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=1690"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=1690"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}