{"id":7188,"date":"2022-08-03T23:00:53","date_gmt":"2022-08-03T17:30:53","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=7188"},"modified":"2022-07-28T23:53:36","modified_gmt":"2022-07-28T18:23:36","slug":"password-cracker-fp-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/password-cracker-fp-hackerrank-solution\/","title":{"rendered":"Password Cracker FP &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Password Cracker FP HackerRank Solution<\/strong>. This problem <strong>(Password Cracker FP)<\/strong> is a part of <strong>HackerRank Functional Programming<\/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-6639c1b8b790c\" 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-6639c1b8b790c\" 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\/password-cracker-fp-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\/password-cracker-fp-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\/password-cracker-fp-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\/password-cracker-fp-hackerrank-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\/password-cracker-fp-hackerrank-solution\/#Solution_%E2%80%93_Password_Cracker_FP_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Password Cracker FP &#8211; HackerRank Solution\">Solution &#8211; Password Cracker FP &#8211; HackerRank Solution<\/a><\/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>There are&nbsp;<em>N<\/em>&nbsp;users registered on a website&nbsp;<em>CuteKittens.com<\/em>. Each of them have a unique password represented by&nbsp;<em>pass[1], pass[2], &#8230;, pass[N]<\/em>. As this a very lovely site, many people want to access those awesomely cute pics of the kittens. But the adamant admin don&#8217;t want this site to be available for general public. So only those people with passwords can access it.<\/p>\n\n\n\n<p><em>Yu<\/em>&nbsp;being an awesome hacker finds a loophole in their password verification system. A string which is&nbsp;<em>concatenation<\/em>&nbsp;of one or more passwords, in any order, is also accepted by the password verification system. Any password can appear 0 or more times in that string. He has access to each of the&nbsp;<em>N<\/em>&nbsp;passwords, and also have a string&nbsp;<em>loginAttempt<\/em>, he has to tell whether this string be accepted by the password verification system of the website.<\/p>\n\n\n\n<p>For example, if there are&nbsp;<em>3<\/em>&nbsp;users with password {<code>\"abra\"<\/code>,&nbsp;<code>\"ka\"<\/code>,&nbsp;<code>\"dabra\"<\/code>}, then some of the valid combinations are&nbsp;<code>\"abra\"<\/code>&nbsp;<em>(pass[1])<\/em>,&nbsp;<code>\"kaabra\"<\/code>&nbsp;<em>(pass[2]+pass[1])<\/em>,&nbsp;<code>\"kadabraka\"<\/code>&nbsp;<em>(pass[2]+pass[3]+pass[2])<\/em>,&nbsp;<code>\"kadabraabra\"<\/code>&nbsp;<em>(pass[2]+pass[3]+pass[1])<\/em>&nbsp;and so on.<\/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>First line contains an integer&nbsp;<em>T<\/em>, the total number of test cases. Then&nbsp;<em>T<\/em>&nbsp;test cases follow.<br>First line of each test case contains&nbsp;<em>N<\/em>, the number of users with passwords. Second line contains&nbsp;<em>N<\/em>&nbsp;space separated strings,&nbsp;<em>pass[1] pass[2] &#8230; pass[N]<\/em>, representing the passwords of each user. Third line contains a string,&nbsp;<em>loginAttempt<\/em>, for which&nbsp;<em>Yu<\/em>&nbsp;has to tell whether it will be accepted or not.<\/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<\/strong><\/li><li><strong>1 &lt;= <em>N<\/em> &lt;= 10<\/strong><\/li><li><strong><em>pass<\/em>[<em>i<\/em>] != <em>pass<\/em>[<em>j<\/em>], 1 &lt;= <em>i<\/em> &lt; <em>j<\/em> &lt;= <em>N<\/em><\/strong><\/li><li><strong>1 &lt;= <em>length<\/em>(<em>pass<\/em>[<em>i<\/em>]) &lt;= 10<\/strong>, where <strong><em>i<\/em> = [1, <em>N<\/em>]<\/strong><\/li><li>1 &lt;&nbsp;<em>length(loginAttempt)<\/em>&nbsp;&lt;= 2000<\/li><li><em>loginAttempt<\/em>&nbsp;and&nbsp;<em>pass[i]<\/em>&nbsp;contains only lowercase latin characters (<em>&#8216;a&#8217;-&#8216;z&#8217;<\/em>).<\/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>For each valid string,&nbsp;<em>Yu<\/em>&nbsp;has to print the actual order of passwords, separated by space, whose concatenation results into&nbsp;<em>loginAttempt<\/em>. If there are multple solutions, print any of them. If&nbsp;<em>loginAttempt<\/em>&nbsp;can&#8217;t be accepted by the password verification system, then print&nbsp;<code>WRONG PASSWORD<\/code>.<\/p>\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>3\n6\nbecause can do must we what\nwedowhatwemustbecausewecan\n2\nhello planet\nhelloworld\n3\nab abcd cd\nabcd<\/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>we do what we must because we can\nWRONG PASSWORD\nab cd<\/code><\/pre>\n\n\n\n<p><strong>Explanation 0<\/strong><\/p>\n\n\n\n<p><em>Sample Case #00:<\/em>&nbsp;<code>\"wedowhatwemustbecausewecan\"<\/code>&nbsp;is the concatenation of passwords {<code>\"we\"<\/code>,&nbsp;<code>\"do\"<\/code>,&nbsp;<code>\"what\"<\/code>,&nbsp;<code>\"we\"<\/code>,&nbsp;<code>\"must\"<\/code>,&nbsp;<code>\"because\"<\/code>,&nbsp;<code>\"we\"<\/code>,&nbsp;<code>\"can\"<\/code>}. That is<\/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>loginAttempt = pass&#91;5] + pass&#91;3] + pass&#91;6] + pass&#91;5] +  pass&#91;4] + pass&#91;1] + pass&#91;5] + pass&#91;2]<\/code><\/pre>\n\n\n\n<p>Note that any password can repeat any number of times.<\/p>\n\n\n\n<p><em>Sample Case #01:<\/em>&nbsp;We can&#8217;t create string&nbsp;<code>\"helloworld\"<\/code>&nbsp;using the strings {<code>\"hello\"<\/code>,&nbsp;<code>\"planet\"<\/code>}.<\/p>\n\n\n\n<p><em>Sample Case #02:<\/em>&nbsp;There are two ways to create&nbsp;<em>loginAttempt (<code>\"abcd\"<\/code>)<\/em>. Both&nbsp;<code>pass[2] = \"abcd\"<\/code>&nbsp;and&nbsp;<code>pass[1] + pass[3] = \"ab cd\"<\/code>&nbsp;are valid answers.<\/p>\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>3\n4\nozkxyhkcst xvglh hpdnb zfzahm\nzfzahm\n4\ngurwgrb maqz holpkhqx aowypvopu\ngurwgrb\n10\na aa aaa aaaa aaaaa aaaaaa aaaaaaa aaaaaaaa aaaaaaaaa aaaaaaaaaa\naaaaaaaaaab<\/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>zfzahm\ngurwgrb\nWRONG PASSWORD<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Password_Cracker_FP_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Password Cracker FP &#8211; HackerRank Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p><strong>Scala<\/strong><\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"scala\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.util.Scanner\n\nimport scala.collection.mutable\n\nobject Solution {\n  private val data = mutable.Map[String, List[String]]()\n\n  def main(args: Array[String]): Unit = {\n    val sc = new Scanner(System.in)\n\n    val t = sc.nextInt\n    (0 until t).foreach(_ => {\n      sc.nextInt\n      sc.nextLine\n      val passwords = sc.nextLine.split(\" \")\n      val loginAttempt = sc.nextLine\n\n      println(solve(loginAttempt, passwords.toIndexedSeq))\n      data.clear()\n    })\n\n    sc.close()\n  }\n\n  def solve(loginAttempt: String, passwords: Seq[String]): String = {\n\n    def inner(loginAttempt: String, acc: List[String]): List[String] = data.getOrElseUpdate(loginAttempt,\n      if (loginAttempt.isEmpty) acc\n      else {\n        passwords.foldLeft(List[String]())((list, password) => if (list.isEmpty) {\n          val isPrefix = loginAttempt.startsWith(password)\n\n          val rest = if (isPrefix) inner(loginAttempt.substring(password.length), password :: acc) else Nil\n\n          if (isPrefix &amp;&amp; rest.nonEmpty) rest else Nil\n        } else list)\n      })\n\n    val answer = inner(loginAttempt, Nil).reverse\n    if (answer.isEmpty) \"WRONG PASSWORD\" else answer.mkString(\" \")\n  }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/password-cracker-fp\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Password Cracker FP<\/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 Password Cracker FP HackerRank Solution. This problem (Password Cracker FP) is a part of HackerRank Functional Programming 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,684],"tags":[692],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7188"}],"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=7188"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7188\/revisions"}],"predecessor-version":[{"id":7191,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7188\/revisions\/7191"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=7188"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=7188"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=7188"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}