{"id":8270,"date":"2022-10-22T23:00:00","date_gmt":"2022-10-22T17:30:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=8270"},"modified":"2022-11-26T18:03:48","modified_gmt":"2022-11-26T12:33:48","slug":"find-strings-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/find-strings-hackerrank-solution\/","title":{"rendered":"Find Strings &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Find Strings HackerRank Solution<\/strong>. This problem <strong>(Find Strings)<\/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-662c3d73e6af4\" 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-662c3d73e6af4\" 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\/find-strings-hackerrank-solution\/#Solution_%E2%80%93_Find_Strings_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Find Strings &#8211; HackerRank Solution\">Solution &#8211; Find Strings &#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\/find-strings-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\/find-strings-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\/find-strings-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=\"Solution_%E2%80%93_Find_Strings_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Find Strings &#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;cstdio>\n#include &lt;cstdlib>\n#include &lt;iostream>\n#include &lt;sstream>\n#include &lt;cmath>\n#include &lt;string>\n#include &lt;cstring>\n#include &lt;cctype>\n#include &lt;algorithm>\n#include &lt;vector>\n#include &lt;bitset>\n#include &lt;queue>\n#include &lt;stack>\n#include &lt;utility>\n#include &lt;list>\n#include &lt;set>\n#include &lt;map>\nusing namespace std;\n\n#define MAXN 1000005\nint n,t;  \nint p[MAXN],r[MAXN],h[MAXN];\nstring s;\nvoid fix_index(int *b, int *e) {\n   int pkm1, pk, np, i, d, m;\n   pkm1 = p[*b + t];\n   m = e - b; d = 0;\n   np = b - r;\n   for(i = 0; i &lt; m; i++) {\n      if (((pk = p[*b+t]) != pkm1) &amp;&amp; !(np &lt;= pkm1 &amp;&amp; pk &lt; np+m)) {\n         pkm1 = pk;\n         d = i;\n      }\n      p[*(b++)] = np + d;\n   }\n}\n\nbool comp(int i, int j) {\n   return p[i + t] &lt; p[j + t];\n}\nvoid suff_arr() {\n   int i, j, bc[256];\n   t = 1;\n   for(i = 0; i &lt; 256; i++) bc[i] = 0;  \/\/alfabeto\n   for(i = 0; i &lt; n; i++) ++bc[int(s[i])]; \/\/counting sort inicial del alfabeto\n   for(i = 1; i &lt; 256; i++) bc[i] += bc[i - 1];\n   for(i = 0; i &lt; n; i++) r[--bc[int(s[i])]] = i;\n   for(i = n - 1; i >= 0; i--) p[i] = bc[int(s[i])];\n   for(t = 1; t &lt; n; t *= 2) {\n      for(i = 0, j = 1; i &lt; n; i = j++) {\n         while(j &lt; n &amp;&amp; p[r[j]] == p[r[i]]) ++j;\n         if (j - i > 1) {\n            sort(r + i, r + j, comp);\n            fix_index(r + i, r + j);\n         }\n      }\n   }\n}\n\/\/Longest Common Preffix\nvoid lcp() {\n   int tam = 0, i, j;\n   for(i = 0; i &lt; n; i++)if (p[i] > 0) {\n      j = r[p[i] - 1];\n      while(s[i + tam] == s[j + tam]) ++tam;\n      h[p[i]] = tam;\n      if (tam > 0) --tam;\n   }\n   h[0] = 0;\n}\n\nint main(){\n    int numS=0; scanf(\"%d\",&amp;numS);\n    int res=numS;\n    string sTemp;\n    while(res--){\n        cin>>sTemp;\n        s +=sTemp+char(res+1);\n    }\n    n=s.size();\n    suff_arr();\n    lcp();\n    vector&lt;int> l(n);\n    \/\/Compute the l'\n    for (int i = n-1,acum=1; i >= 0; --i)\n    {\n        if(s[i]&lt;'a')\n            acum=0;\n        l[p[i]]=acum;\n        acum++;\n\n    }\n    int q;scanf(\"%d\",&amp;q);\n    while(q--){\n        int k,i=1;\n         scanf(\"%d\",&amp;k);\n         for (; i &lt; n; ++i)\n         {\n             int comp = l[i]-h[i];\n             if(comp>=k){\n                 cout&lt;&lt;s.substr(r[i],h[i]+k)&lt;&lt;endl;\n                 break;\n             }else{\n                 k-=comp;\n             }\n         }\n         if(i==n)\n             cout&lt;&lt;\"INVALID\"&lt;&lt;endl;\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=\"\">from operator import attrgetter\n\ndef lcp(s, t):\n    length = min(len(s), len(t))\n    for i in range(length):\n        if s[i] != t[i]:\n            return i\n    return length\n\nclass Suffix(object):\n    def __init__(self, s):\n        self.t = s\n        self.start = 0\n        self.c = -1\n\n    def count(self, s):\n        if s:\n            self.start = lcp(self.t, s.t)\n        self.c = len(self.t) - self.start\n        \nclass SuffixArray(object):\n    def __init__(self):\n        self.suffixes = []\n\n    def add(self, s):\n        for i in range(len(s)):\n            self.suffixes.append(Suffix(s[i:]))\n    \n    def select(self, i):\n        for j in range(len(self.suffixes)):\n            suffix = self.suffixes[j]\n            if suffix.c == -1:\n                if j == 0:\n                    suffix.count(None)\n                else:\n                    suffix.count(self.suffixes[j - 1])\n            if i &lt;= suffix.c:\n                return suffix.t[:suffix.start + i]\n            else:\n                i = i - suffix.c\n        return 'INVALID'\n\ndef makeSuffixArray():\n    sa = SuffixArray()\n    n = int(input())\n    for i in range(n):\n        w = input()\n        sa.add(w)\n    sa.suffixes.sort(key = attrgetter('t'))\n    return sa\n\ndef selectOutput():\n    sa = makeSuffixArray()\n    q = int(input())\n    for i in range(q):\n        k = int(input())\n        print(sa.select(k))\n\nselectOutput()\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.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.TreeSet;\n\npublic class Solution {\n    static TreeSet&lt;String>t;\n    public static void main(String[] args) {\n        try{\n        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));\n        t=new TreeSet&lt;String>();\n        int n=Integer.parseInt(br.readLine());\n        for(int i=0;i&lt;n;i++){\n        String s=br.readLine();\n        for(int j=0;j&lt;s.length();j++){\n        t.add(s.substring(j,s.length()));\n        }\n        }\n        Object [] suffix1=(t.toArray());\n        String suffix[]=new String[suffix1.length];\n        for(int l=0;l&lt;suffix.length;l++){\n        suffix[l]=(String)suffix1[l];\n        \/\/System.out.println(suffix[l]);\n        }\n        int len[]=new int[suffix.length];\n        int lcp[]=new int[suffix.length];\n        len[0]=suffix[0].toString().length();\n        lcp[0]=0;\n        for(int j=1;j&lt;suffix.length;j++){\n        int count=0;\n        try{\n        while(true){\n        if(suffix[j-1].charAt(count)==suffix[j].charAt(count)){\n        count++;\n        }\n        else{\n        break;\n        }        \n        }}catch(StringIndexOutOfBoundsException e){}\n        len[j]=suffix[j].length()-count;\n        lcp[j]=count;\n        }\n       int q=Integer.parseInt(br.readLine());\n       for(int i=0;i&lt;q;i++){\n       int a=Integer.parseInt(br.readLine());\n       int a1=0;\n       int j=0;\n       int count=0;\n       try{\n       while(j&lt;a){\n       a1=j;\n       j=j+len[count++];\n       }\n       count--;\n       System.out.println(suffix[count].substring(0, lcp[count]+a-a1));\n       }catch(ArrayIndexOutOfBoundsException e){\n       System.out.println(\"INVALID\");\n       }\n       }         \n        }catch(IOException e){\n        System.out.println(e);        \n        }\n\n    }\n\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/find-strings\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Find Strings<\/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 Find Strings HackerRank Solution. This problem (Find Strings) 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\/8270"}],"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=8270"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8270\/revisions"}],"predecessor-version":[{"id":8337,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8270\/revisions\/8337"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=8270"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=8270"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=8270"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}