{"id":6653,"date":"2022-06-30T23:10:00","date_gmt":"2022-06-30T17:40:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=6653"},"modified":"2022-06-20T17:53:37","modified_gmt":"2022-06-20T12:23:37","slug":"bigger-is-greater-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/bigger-is-greater-hackerrank-solution\/","title":{"rendered":"Bigger is Greater &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Bigger is Greater HackerRank Solution<\/strong>. This problem <strong>(Bigger is Greater)<\/strong> is a part of <strong>HackerRank Algorithms<\/strong> series.<\/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-6648331c152e3\" 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-6648331c152e3\" 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\/bigger-is-greater-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\/bigger-is-greater-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\/bigger-is-greater-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\/bigger-is-greater-hackerrank-solution\/#Solution_%E2%80%93_Bigger_is_Greater_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Bigger is Greater &#8211; HackerRank Solution\">Solution &#8211; Bigger is Greater &#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\/bigger-is-greater-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\/bigger-is-greater-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\/bigger-is-greater-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><em><a href=\"https:\/\/en.wikipedia.org\/wiki\/Lexicographical_order\" target=\"_blank\" rel=\"noopener\">Lexicographical order<\/a><\/em>&nbsp;is often known as alphabetical order when dealing with strings. A string is&nbsp;<em>greater<\/em>&nbsp;than another string if it comes later in a lexicographically sorted list.<\/p>\n\n\n\n<p>Given a word, create a new word by swapping some or all of its characters. This new word must meet two criteria:<\/p>\n\n\n\n<ul><li>It must be greater than the original word<\/li><li>It must be the smallest word that meets the first condition<\/li><\/ul>\n\n\n\n<p><strong>Example<\/strong><br><strong><em>w<\/em> = abcd<\/strong><\/p>\n\n\n\n<p>The next largest word is\u00a0<strong>abdc<\/strong>.<\/p>\n\n\n\n<p>Complete the function&nbsp;<em>biggerIsGreater<\/em>&nbsp;below to create and return the new string meeting the criteria. If it is not possible, return&nbsp;<code>no answer<\/code>.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>biggerIsGreater<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p>biggerIsGreater has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>string w<\/em>: a word<\/li><\/ul>\n\n\n\n<p><strong>Returns<\/strong><br>&#8211;\u00a0<em>string:<\/em>\u00a0the smallest lexicographically higher string possible or\u00a0<code>no answer<\/code><\/p>\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 input contains\u00a0<em><strong>T<\/strong><\/em>, the number of test cases.<br>Each of the next\u00a0<em><strong>T<\/strong><\/em>\u00a0lines contains\u00a0<em><strong>w<\/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>T<\/em> &lt;= 10<sup>5<\/sup><\/strong><\/li><li><strong>1 &lt;= <em>lengthofw<\/em> &lt;= 100<\/strong><\/li><li><em><strong>w<\/strong><\/em> will contain only letters in the range ascii[a..z].<\/li><\/ul>\n\n\n\n<p><strong>Sample Input 0<\/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>5\r\nab\r\nbb\r\nhefg\r\ndhck\r\ndkhc<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 0<\/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>ba\r\nno answer\r\nhegf\r\ndhkc\r\nhcdk<\/code><\/pre>\n\n\n\n<p><strong>Explanation 0<\/strong><\/p>\n\n\n\n<ul><li><em>Test case 1:<\/em><br><code>ba<\/code>\u00a0is the only string which can be made by rearranging\u00a0<code>ab<\/code>. It is greater.<\/li><li><em>Test case 2:<\/em><br>It is not possible to rearrange\u00a0<code>bb<\/code>\u00a0and get a greater string.<\/li><li><em>Test case 3:<\/em><br><code>hegf<\/code>\u00a0is the next string greater than\u00a0<code>hefg<\/code>.<\/li><li><em>Test case 4:<\/em><br><code>dhkc<\/code>\u00a0is the next string greater than\u00a0<code>dhck<\/code>.<\/li><li><em>Test case 5:<\/em><br><code>hcdk<\/code>\u00a0is the next string greater than\u00a0<code>dkhc<\/code>.<\/li><\/ul>\n\n\n\n<p><strong>Sample Input 1<\/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>6\r\nlmno\r\ndcba\r\ndcbb\r\nabdc\r\nabcd\r\nfedcbabcd<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 1<\/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>lmon\r\nno answer\r\nno answer\r\nacbd\r\nabdc\r\nfedcbabdc<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Bigger_is_Greater_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Bigger is Greater &#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;cmath>\n#include &lt;cstdio>\n#include &lt;vector>\n#include &lt;iostream>\n#include &lt;algorithm>\nusing namespace std;\n\n string s;\n\nint main() {\n    int tc;\n    scanf(\"%d\", &amp;tc);\n    while (tc--) {\n        cin >> s;\n        if (next_permutation(s.begin(), s.end())) printf(\"%s\\n\", s.c_str());\n        else printf(\"no answer\\n\");\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=\"\">#!\/bin\/python3\n\nimport sys\nfrom itertools import permutations\n\ndef biggerIsGreater(w):\n    arr = list(w)\n    # Find non-increasing suffix\n    i = len(arr) - 1\n    while i > 0 and arr[i - 1] >= arr[i]:\n            i -= 1\n    if i &lt;= 0:\n        return 'no answer'\n    \n    # Find successor to pivot\n    j = len(arr) - 1\n    while arr[j] &lt;= arr[i - 1]:\n        j -= 1\n    arr[i - 1], arr[j] = arr[j], arr[i - 1]\n    \n    # Reverse suffix\n    arr[i : ] = arr[len(arr) - 1 : i - 1 : -1]\n       \n    return \"\".join(arr)\n     \n\nif __name__ == \"__main__\":\n    T = int(input().strip())\n    for a0 in range(T):\n        w = input().strip()\n        result = biggerIsGreater(w)\n        print(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.io.ByteArrayInputStream;\nimport java.io.IOException;\nimport java.io.InputStream;\nimport java.io.PrintWriter;\nimport java.util.Arrays;\nimport java.util.InputMismatchException;\n\npublic class Solution {\n    static InputStream is;\n    static PrintWriter out;\n    static String INPUT = \"\";\n    \n    static void solve()\n    {\n        outer:\n        for(int T = ni();T >= 1;T--){\n            char[] s = ns().toCharArray();\n            int n = s.length;\n            int[] has = new int[26];\n            for(int i = n-1;i >= 0;i--){\n                has[s[i]-'a']++;\n                for(int j = s[i]-'a'+1;j &lt; 26;j++){\n                    if(has[j] > 0){\n                        s[i] = (char)('a'+j);\n                        has[j]--;\n                        int p = 0;\n                        for(int k = i+1;k &lt; n;k++){\n                            while(p &lt; 26 &amp;&amp; has[p] == 0)p++;\n                            s[k] = (char)('a'+p);\n                            has[p]--;\n                        }\n                        out.println(new String(s));\n                        continue outer;\n                    }\n                }\n            }\n            out.println(\"no answer\");\n        }\n    }\n    \n    public static void main(String[] args) throws Exception\n    {\n        long S = System.currentTimeMillis();\n        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());\n        out = new PrintWriter(System.out);\n        \n        solve();\n        out.flush();\n        long G = System.currentTimeMillis();\n        tr(G-S+\"ms\");\n    }\n    \n    private static boolean eof()\n    {\n        if(lenbuf == -1)return true;\n        int lptr = ptrbuf;\n        while(lptr &lt; lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;\n        \n        try {\n            is.mark(1000);\n            while(true){\n                int b = is.read();\n                if(b == -1){\n                    is.reset();\n                    return true;\n                }else if(!isSpaceChar(b)){\n                    is.reset();\n                    return false;\n                }\n            }\n        } catch (IOException e) {\n            return true;\n        }\n    }\n    \n    private static byte[] inbuf = new byte[1024];\n    static int lenbuf = 0, ptrbuf = 0;\n    \n    private static int readByte()\n    {\n        if(lenbuf == -1)throw new InputMismatchException();\n        if(ptrbuf >= lenbuf){\n            ptrbuf = 0;\n            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }\n            if(lenbuf &lt;= 0)return -1;\n        }\n        return inbuf[ptrbuf++];\n    }\n    \n    private static boolean isSpaceChar(int c) { return !(c >= 33 &amp;&amp; c &lt;= 126); }\n    private static int skip() { int b; while((b = readByte()) != -1 &amp;&amp; isSpaceChar(b)); return b; }\n    \n    private static double nd() { return Double.parseDouble(ns()); }\n    private static char nc() { return (char)skip(); }\n    \n    private static String ns()\n    {\n        int b = skip();\n        StringBuilder sb = new StringBuilder();\n        while(!(isSpaceChar(b))){ \/\/ when nextLine, (isSpaceChar(b) &amp;&amp; b != ' ')\n            sb.appendCodePoint(b);\n            b = readByte();\n        }\n        return sb.toString();\n    }\n    \n    private static char[] ns(int n)\n    {\n        char[] buf = new char[n];\n        int b = skip(), p = 0;\n        while(p &lt; n &amp;&amp; !(isSpaceChar(b))){\n            buf[p++] = (char)b;\n            b = readByte();\n        }\n        return n == p ? buf : Arrays.copyOf(buf, p);\n    }\n    \n    private static char[][] nm(int n, int m)\n    {\n        char[][] map = new char[n][];\n        for(int i = 0;i &lt; n;i++)map[i] = ns(m);\n        return map;\n    }\n    \n    private static int[] na(int n)\n    {\n        int[] a = new int[n];\n        for(int i = 0;i &lt; n;i++)a[i] = ni();\n        return a;\n    }\n    \n    private static int ni()\n    {\n        int num = 0, b;\n        boolean minus = false;\n        while((b = readByte()) != -1 &amp;&amp; !((b >= '0' &amp;&amp; b &lt;= '9') || b == '-'));\n        if(b == '-'){\n            minus = true;\n            b = readByte();\n        }\n        \n        while(true){\n            if(b >= '0' &amp;&amp; b &lt;= '9'){\n                num = num * 10 + (b - '0');\n            }else{\n                return minus ? -num : num;\n            }\n            b = readByte();\n        }\n    }\n    \n    private static long nl()\n    {\n        long num = 0;\n        int b;\n        boolean minus = false;\n        while((b = readByte()) != -1 &amp;&amp; !((b >= '0' &amp;&amp; b &lt;= '9') || b == '-'));\n        if(b == '-'){\n            minus = true;\n            b = readByte();\n        }\n        \n        while(true){\n            if(b >= '0' &amp;&amp; b &lt;= '9'){\n                num = num * 10 + (b - '0');\n            }else{\n                return minus ? -num : num;\n            }\n            b = readByte();\n        }\n    }\n    \n    private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }\n}\n<\/pre>\n\n\n\n<p><strong>Note: <\/strong>This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/bigger-is-greater\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Bigger is Greater<\/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 Bigger is Greater HackerRank Solution. This problem (Bigger is Greater) is a part of HackerRank Algorithms 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\/6653"}],"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=6653"}],"version-history":[{"count":6,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6653\/revisions"}],"predecessor-version":[{"id":6661,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6653\/revisions\/6661"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=6653"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=6653"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=6653"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}