{"id":8210,"date":"2022-10-09T23:05:00","date_gmt":"2022-10-09T17:35:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=8210"},"modified":"2022-11-26T18:12:36","modified_gmt":"2022-11-26T12:42:36","slug":"ashton-and-string-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/ashton-and-string-hackerrank-solution\/","title":{"rendered":"Ashton and String &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Ashton and String HackerRank Solution<\/strong>. This problem <strong>(Ashton and String)<\/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-662b648170fc8\" 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-662b648170fc8\" 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\/ashton-and-string-hackerrank-solution\/#Ashton_and_String_%E2%80%93_HackerRank_Solution\" title=\"Ashton and String &#8211; HackerRank Solution\">Ashton and String &#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-2\" href=\"https:\/\/www.codingbroz.com\/ashton-and-string-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-3\" href=\"https:\/\/www.codingbroz.com\/ashton-and-string-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-4\" href=\"https:\/\/www.codingbroz.com\/ashton-and-string-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=\"Ashton_and_String_%E2%80%93_HackerRank_Solution\"><\/span><strong>Ashton and String &#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;string>\n#include &lt;iostream>\n#include &lt;algorithm>\nusing namespace std;\n\nconst int MAX_N = 100005;\ntypedef long long LL;\nint n, k, sa[MAX_N], rk[MAX_N], lcp[MAX_N], tmp[MAX_N];\n\nbool compare_sa(int i, int j) {\n    if (rk[i] != rk[j]) return rk[i] &lt; rk[j];\n    int ri = i + k &lt;= n ? rk[i + k] : -1;\n    int rj = j + k &lt;= n ? rk[j + k] : -1;\n    return ri &lt; rj;\n}\n\nvoid construct_sa(const string &amp;S, int *sa) {\n    n = S.length();\n    for (int i = 0; i &lt;= n; i++) {\n        sa[i] = i;\n        rk[i] = (i &lt; n ? S[i] : -1);\n    }\n    \n    for (k = 1; k &lt;= n; k *= 2) {\n        sort(sa, sa + n + 1, compare_sa);\n        \n        tmp[sa[0]] = 0;\n        for (int i = 1; i &lt;= n; i++) {\n            tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);\n        }\n        for (int i = 0; i &lt;= n; i++) rk[i] = tmp[i];\n    }\n}\n\nvoid construct_lcp(const string &amp;S, int *sa, int *lcp) {\n    n = S.length();\n    for (int i = 0; i &lt;= n; i++) rk[sa[i]] = i;\n    \n    int h = 0;\n    lcp[0] = 0;\n    for (int i = 0; i &lt; n; i++) {\n        int j = sa[rk[i] - 1];\n        \n        if (h > 0) h--;\n        for (; i + h &lt; n &amp;&amp; j + h &lt; n; h++) if (S[i + h] != S[j + h]) break;\n        \n        lcp[rk[i] - 1] = h;\n    }\n} \n\nstring S;\n\nvoid solve(LL k) {\n    n = S.length();\n    construct_sa(S, sa);\n    construct_lcp(S, sa, lcp);   \n    \n    for (int i = 0; i &lt; n; i++) {\n        int L = lcp[i];\n        int left = n - sa[i + 1];\n        LL sum = (L + 1 + left) * (LL)(left - L) \/ 2;\n        if (k > sum) {k -= sum;}\n        else {\n            for (int j = L + 1; j &lt;= left; j++) {\n                if (k &lt;= j) {\n                   int index = sa[i + 1] + k;\n                   cout &lt;&lt; S[index - 1] &lt;&lt; endl;\n                   return ;\n                } else {\n                    k -= j;\n                }\n            }\n        }\n    }\n}\nint main(void) {\n    ios::sync_with_stdio(false);\n    int T;\n    cin >> T;\n    while (T--) {\n        LL k;\n        cin >> S >> k;\n        solve(k);\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 os\nimport sys\n\ndef ashtonString(s, k):\n    kv = k - 1\n    N = len(s)\n    sr = [[0 for _ in range(N)] for __ in range(17)]\n    sr[0] = [ord(c)-97 for c in s]\n    \n    L = [0]*N\n    cnt = 1\n    kf = lambda x: x[0]*(N+1) + x[1]\n    for i in range(1, 17):\n        for j in range(N):\n            L[j] = (sr[i-1][j], sr[i-1][j+cnt] if j+cnt &lt; N else -1, j)\n        L.sort(key=kf)\n        \n        sr[i][L[0][2]] = 0\n        cr = 0\n        for j in range(1, N):\n            if L[j-1][0] != L[j][0] or L[j-1][1] != L[j][1]:\n                cr += 1\n            sr[i][L[j][2]] = cr\n        cnt *= 2\n        if cnt >= N:\n            break\n        \n    sa = [l[2] for l in L]\n    rank = [0]*N\n    lcp = [0]*N\n    \n    for i in range(N):\n        rank[sa[i]] = i\n        \n    k = 0\n    for i in range(N):\n        if rank[i] == N-1:\n            k = 0\n            continue\n        j = sa[rank[i] + 1]\n        while j + k &lt; N and i + k &lt; N and s[i+k] == s[j+k]:\n            k += 1\n        lcp[rank[i]] = k\n        if k > 0:\n            k -= 1\n        \n    numprev = 0\n    tri = lambda x: ((x+1)*x)>>1\n    print(sa)\n    print(lcp)\n    for i in range(N):\n        mylen = N - sa[i]\n        tt = tri(mylen) - tri(numprev)\n        if kv &lt; tt:\n            for j in range(1 + numprev, 1 + mylen):\n                if kv &lt; j:\n                    return s[sa[i]+kv]\n                kv -= j\n        kv -= tt\n        numprev = lcp[i]\n        \n    return ''\n        \nif __name__ == '__main__':\n    fptr = open(os.environ['OUTPUT_PATH'], 'w')\n\n    t = int(input())\n\n    for t_itr in range(t):\n        s = input()\n\n        k = int(input())\n\n        res = ashtonString(s, k)\n\n        fptr.write(str(res) + '\\n')\n\n    fptr.close()\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.*;\nimport java.math.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.regex.*;\n\npublic class Solution {\n    \n    static char ashtonString(String a, int k) {\n\n        TreeSet&lt;String> subStringSet = new TreeSet&lt;>();\n        \/\/TreeSet&lt;String> nextSubStringSet = new TreeSet&lt;>();\n        TreeSet&lt;String> resultSet = new TreeSet&lt;>();\n\n        int index = -1;\n        long len   = a.length();\n        int tempIndex = 1;\n        String str = a;\n        int charIndex = -1;\n        int finalLen = 0;\n        for(int i=97; i&lt;123; i++){\n\n            \/\/System.out.println(i+\"-----\"+i);\n            str = a;\n            int fromIndex = 0;\n            while ((charIndex=str.indexOf(i,fromIndex)) != -1){\n                str = str.substring(charIndex);\n                subStringSet.add(str);\n                fromIndex=1;\n                \/\/str = str.replaceFirst(\"[\"+((char)i)+\"]\", \"\");\n            }\n            while((str=subStringSet.pollFirst())!=null) {\n                if (str.length() > 1) {\n                    \/\/char ch = str.charAt(0);\n                    if (str.charAt(1) == i) {\n                        \/\/subStringSet.add(str.replaceFirst(\"[\"+ch+\"]\", \"\"));\n                    }else if (str.charAt(0) != i) {\n                        \/\/nextSubStringSet.add(str.substring(1));\n                        subStringSet.clear();\n                        resultSet.clear();\n                        break;\n                    }\n                }\n\n                len = str.length();\n                tempIndex = 0;\n                long totLen = (len*(len+1))\/2;\n                if(totLen >= k){\n                \/\/if((len*(len+1))\/2 >= k){\n                    int lenFnd = 0;\n                    for(String strFnd : resultSet){\n                        if(str.startsWith(strFnd)){\n                            lenFnd += strFnd.length();\n                        }\n                    }\n                    k+=lenFnd;\n                    for (int n=1;n&lt;=len;n++){\n                        if((n*(n+1))\/2 > k){\n                            int diff = k-((n-1)*n)\/2;\n                            return str.charAt(diff-1);\n                        } else if((n*(n+1))\/2 == k){\n                            return str.charAt(n-1);\n                        }\n                    }\n                } else {\n                    while (tempIndex++ &lt; (len > 100 ? 100 : len)) {\n                        String res = str.substring(0, tempIndex);\n                        if (resultSet.add(res)) {\n                            k -= res.length();\n                        }\n                    }\n\n                    for(int n=tempIndex;n&lt;len+1;n++){\n                        k-=n;\n                    }\n                    resultSet.add(str);\n                }\n            }\n        }\n\n        return '$';\n    }\n    \n    static char ashtonString7(String a, int k) {\n\n        TreeSet&lt;String> subStringSet = new TreeSet&lt;>();\n        \/\/TreeSet&lt;String> nextSubStringSet = new TreeSet&lt;>();\n        TreeSet&lt;String> resultSet = new TreeSet&lt;>();\n\n        int index = -1;\n        int len   = a.length();\n        int tempIndex = 1;\n        String str = a;\n        int charIndex = -1;\n        int finalLen = 0;\n        for(int i=97; i&lt;123; i++){\n\n            \/\/System.out.println(i+\"-----\"+i);\n            str = a;\n            while ((charIndex=str.indexOf(i)) != -1){\n                str = str.substring(charIndex+1);\n                subStringSet.add((char)i+str);\n            }\n\n            while((str = subStringSet.pollFirst())!=null) {\n\n                if (str.length() > 1) {\n                     if (str.charAt(1) == i) {\n                        subStringSet.add(str.substring(1));\n                    }else if (str.charAt(0) != i) {\n                        \/\/nextSubStringSet.add(str.substring(1));\n                        subStringSet.clear();\n                        resultSet.clear();\n                        break;\n                    }\n                }\n\n                len = str.length();\n                tempIndex = 0;\n\n                while (tempIndex++ &lt; len) {\n                    String res = str.substring(0, tempIndex);\n                    if (resultSet.add(res)) {\n                        if (res.length() >= k) {\n                            char ch = res.charAt(k - 1);\n                            resultSet.clear();\n                            subStringSet.clear();\n                            \/\/nextSubStringSet.clear();\n                            resultSet = null;\n                            subStringSet = null;\n                            \/\/nextSubStringSet = null;\n                            return ch;\n                        } else {\n                            k -= res.length();\n                        }\n                    }\n                }\n\n            }\n        }\n\n        return '$';\n    }\n    \n    static char ashtonString1(String a, int k) {\n\n        TreeSet&lt;String> subStringSet = new TreeSet&lt;>();\n        TreeSet&lt;String> resultSet = new TreeSet&lt;>();\n\n        int index = 0;\n        int len   = a.length();\n        int tempIndex = 1;\n\n        while (index &lt; len){\n            subStringSet.add(a.substring(index++));\n        }\n        StringBuilder stringBuilder = new StringBuilder();\n        while (true){\n\n            String str = subStringSet.pollFirst();\n\n            if(str.length() > 1){\n                subStringSet.add(str.substring(1));\n            }\n\n            len   = str.length();\n            tempIndex = 0;\n\n            while (tempIndex++ &lt; len){\n                String res = str.substring(0, tempIndex);\n                if(resultSet.add(res)){\n                    stringBuilder.append(res);\n                }\n            }\n\n            int strLen = stringBuilder.length();\n            if(strLen > k){\n                char ch = stringBuilder.charAt(k-1);\n                resultSet.clear();\n                subStringSet.clear();\n                resultSet = null;\n                subStringSet = null;\n                stringBuilder = null;\n                return ch;\n            }\n        }\n    }\n    \n    private static final Scanner scanner = new Scanner(System.in);\n\n    public static void main(String[] args) throws IOException {\n        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n        int t = Integer.parseInt(scanner.nextLine().trim());\n\n        for (int tItr = 0; tItr &lt; t; tItr++) {\n            String s = scanner.nextLine();\n\n            int k = Integer.parseInt(scanner.nextLine().trim());\n\n            char res = ashtonString(s, k);\n\n            bufferedWriter.write(String.valueOf(res));\n            bufferedWriter.newLine();\n        }\n\n        bufferedWriter.close();\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/ashton-and-string\/problem?h_r=next-challenge&amp;h_v=zen\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Ashton and String<\/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 Ashton and String HackerRank Solution. This problem (Ashton and String) 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\/8210"}],"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=8210"}],"version-history":[{"count":4,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8210\/revisions"}],"predecessor-version":[{"id":8345,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8210\/revisions\/8345"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=8210"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=8210"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=8210"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}