{"id":7747,"date":"2022-09-08T23:10:00","date_gmt":"2022-09-08T17:40:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=7747"},"modified":"2022-09-03T09:49:39","modified_gmt":"2022-09-03T04:19:39","slug":"weighted-uniform-strings-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/weighted-uniform-strings-hackerrank-solution\/","title":{"rendered":"Weighted Uniform Strings &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Weighted Uniform Strings HackerRank Solution<\/strong>. This problem <strong>(Weighted Uniform 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-663192d14f640\" 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-663192d14f640\" 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\/weighted-uniform-strings-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\/weighted-uniform-strings-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\/weighted-uniform-strings-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\/weighted-uniform-strings-hackerrank-solution\/#Solution_%E2%80%93_Weighted_Uniform_Strings_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Weighted Uniform Strings &#8211; HackerRank Solution\">Solution &#8211; Weighted Uniform 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-5\" href=\"https:\/\/www.codingbroz.com\/weighted-uniform-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-6\" href=\"https:\/\/www.codingbroz.com\/weighted-uniform-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-7\" href=\"https:\/\/www.codingbroz.com\/weighted-uniform-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=\"Task\"><\/span><strong>Task<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>A weighted string is a string of lowercase English letters where each letter has a\u00a0<em>weight<\/em>. Character weights are\u00a0<strong>1<\/strong>\u00a0to\u00a0<strong>26<\/strong>\u00a0from\u00a0<em><strong>a<\/strong><\/em>\u00a0to\u00a0<em><strong>z<\/strong><\/em>\u00a0as shown below:<\/p>\n\n\n\n<ul><li>The\u00a0<em>weight of a string<\/em>\u00a0is the sum of the weights of its characters. For example:<\/li><li>A\u00a0<em>uniform string<\/em>\u00a0consists of a single character repeated zero or more times. For example,\u00a0<code>ccc<\/code>\u00a0and\u00a0<code>a<\/code>\u00a0are uniform strings, but\u00a0<code>bcb<\/code>\u00a0and\u00a0<code>cd<\/code>\u00a0are not.<\/li><\/ul>\n\n\n\n<p>Given a string,\u00a0<em><strong>s<\/strong><\/em>, let\u00a0<em><strong>U<\/strong><\/em>\u00a0be the set of weights for all possible uniform contiguous\u00a0<a href=\"https:\/\/en.wikipedia.org\/wiki\/Substring\" target=\"_blank\" rel=\"noopener\">substrings<\/a>\u00a0of string\u00a0<em><strong>s<\/strong><\/em>. There will be\u00a0<em><strong>n<\/strong><\/em>\u00a0queries to answer where each query consists of a single integer. Create a return array where for each query, the value is\u00a0<code>Yes<\/code>\u00a0if\u00a0<strong><em>query<\/em>[<em>i<\/em>] \u2208 <em>U<\/em><\/strong>. Otherwise, append\u00a0<code>No<\/code>.<\/p>\n\n\n\n<p><strong>Note:<\/strong>\u00a0The\u00a0\u2208\u00a0symbol denotes that\u00a0<strong><em>x<\/em>[<em>i<\/em>]<\/strong>\u00a0is an\u00a0<a href=\"https:\/\/en.wikipedia.org\/wiki\/Element_(mathematics)\" target=\"_blank\" rel=\"noopener\">element of<\/a>\u00a0set <strong><em>U<\/em><\/strong>.<\/p>\n\n\n\n<p><strong>Example<\/strong><\/p>\n\n\n\n<p><strong><em>s<\/em> = &#8216;abbcccdddd&#8217;<\/strong><br><strong><em>queries<\/em> = [1, 7, 5, 4, 15]<\/strong><\/p>\n\n\n\n<p>Working from left to right, weights that exist are:<\/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>string  weight\r\na       1\r\nb       2\r\nbb      4\r\nc       3\r\ncc      6\r\nccc     9\r\nd       4\r\ndd      8\r\nddd     12\r\ndddd    16<\/code><\/pre>\n\n\n\n<p>Now for each value in\u00a0<em><strong>queries<\/strong><\/em>, see if it exists in the possible string weights. The return array is\u00a0<code>['Yes', 'No', 'No', 'Yes', 'No']<\/code>.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>weightedUniformStrings<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p>weightedUniformStrings has the following parameter(s):<br>&#8211;&nbsp;<em>string s:<\/em>&nbsp;a string<br>&#8211;&nbsp;<em>int queries[n]:<\/em>&nbsp;an array of integers<\/p>\n\n\n\n<p><strong>Returns<\/strong><br>&#8211;\u00a0<em>string[n]:<\/em>\u00a0an array of strings that answer the queries<\/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 contains a string\u00a0<em><strong>s<\/strong><\/em>, the original string.<br>The second line contains an integer\u00a0<em><strong>n<\/strong><\/em>, the number of queries.<br>Each of the next\u00a0<em><strong>n<\/strong><\/em>\u00a0lines contains an integer\u00a0<strong><em>queries<\/em>[<em>i<\/em>]<\/strong>, the weight of a uniform subtring of\u00a0<em><strong>s<\/strong><\/em>\u00a0that may or may not exist.<\/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>lengthofs<\/em>, <em>n<\/em> &lt;= 10<sup>5<\/sup><\/strong><\/li><li><strong>1 &lt;= <em>queries<\/em>[<em>i<\/em>] &lt;= 10<sup>7<\/sup><\/strong><\/li><li><em><strong>s<\/strong><\/em>\u00a0will only contain lowercase English letters, 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>abccddde\r\n6\r\n1\r\n3\r\n12\r\n5\r\n9\r\n10<\/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>Yes\r\nYes\r\nYes\r\nYes\r\nNo\r\nNo<\/code><\/pre>\n\n\n\n<p><strong>Explanation 0<\/strong><\/p>\n\n\n\n<p>The weights of every possible\u00a0<em>uniform substring<\/em>\u00a0in the string\u00a0<code>abccddde<\/code>\u00a0are shown below:<\/p>\n\n\n\n<p>We print\u00a0<code>Yes<\/code>\u00a0on the first four lines because the first four queries match weights of uniform substrings of\u00a0<em><strong>s<\/strong><\/em>. We print\u00a0<code>No<\/code>\u00a0for the last two queries because there are no uniform substrings in\u00a0<em><strong>s<\/strong><\/em>\u00a0that have those weights.<\/p>\n\n\n\n<p>Note that while\u00a0<code>de<\/code>\u00a0is a substring of\u00a0<em><strong>s<\/strong><\/em>\u00a0that would have a weight of\u00a0<strong>9<\/strong>, it is\u00a0<em>not a uniform substring<\/em>.<\/p>\n\n\n\n<p>Note that we are only dealing with contiguous substrings. So&nbsp;<code>ccc<\/code>&nbsp;is not a substring of the string&nbsp;<code>ccxxc<\/code>.<\/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>aaabbbbcccddd\r\n5\r\n9\r\n7\r\n8\r\n12\r\n5<\/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>Yes\r\nNo\r\nYes\r\nYes\r\nNo<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Weighted_Uniform_Strings_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Weighted Uniform 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;set>\n#include &lt;string>\n#include &lt;iostream>\n\nstatic int weight(const char&amp; c);\n\nint main(){\n    \n    std::string str;\n    std::cin >> str;\n    \n    std::set&lt;int> values;\n    for (size_t i = 0, j; i &lt; str.length(); i = j) {\n        char last = str[i];\n        int last_w = 0;\n\n        for (j = i; j &lt; str.length() &amp;&amp; str[j] == last; ++j) {\n            last_w += weight(last);\n            values.insert(last_w);\n        }\n    }\n    \n    \n    int q, tmp;\n    std::cin >> q;\n\n    while (q --> 0) {\n        std::cin >> tmp;\n        std::cout &lt;&lt; (values.find(tmp) == values.end() ? \"No\" : \"Yes\") &lt;&lt; '\\n';\n    }\n    \n    return 0;\n}\n\nstatic int weight(const char&amp; c) {\n    return c - 'a' + 1;\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 sys\nimport string\n\nsymbols = string.ascii_lowercase\n\ndef gen_uniforms(s):\n    uniforms = {}\n    \n    mult = 1\n    let_prev = ''\n    for let in s:\n        if let == let_prev:\n            mult += 1\n        else:\n            mult = 1\n        \n        let_prev = let\n        uniforms[((symbols.index(let) + 1)*mult)] = True\n            \n    return uniforms\n    \n\nif __name__ == \"__main__\":\n    s = input().strip()\n    n = int(input().strip())\n    uniforms = gen_uniforms(s)\n    \n    for a0 in range(n):\n        x = int(input().strip())\n        \n        if x in uniforms:\n            print(\"Yes\")\n        else:\n            print(\"No\")\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.util.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        String s = in.next();\n        int n = in.nextInt();\n        \n        \/\/Build a set of weights\n        Set&lt;Integer> weights = new HashSet&lt;>();\n        \n        int currentWeight = 0;\n        char prevLetter = ' ';\n        for(char letter : s.toCharArray())\n        {\n            if(letter != prevLetter)\n                currentWeight = letter - 'a' + 1;\n            else\n                currentWeight += letter - 'a' + 1;\n            \n            prevLetter = letter;\n            weights.add(currentWeight);\n        }\n        \n        for(int a0 = 0; a0 &lt; n; a0++){\n            int x = in.nextInt();\n            \n            if(weights.contains(x))\n                System.out.println(\"Yes\");\n            else\n                System.out.println(\"No\");\n        }\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/weighted-uniform-string\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Weighted Uniform 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 Weighted Uniform Strings HackerRank Solution. This problem (Weighted Uniform 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\/7747"}],"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=7747"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7747\/revisions"}],"predecessor-version":[{"id":7751,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7747\/revisions\/7751"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=7747"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=7747"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=7747"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}