{"id":286,"date":"2021-01-23T22:59:00","date_gmt":"2021-01-23T17:29:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=286"},"modified":"2021-06-21T11:54:24","modified_gmt":"2021-06-21T06:24:24","slug":"variable-sized-hackerrank-solution-in-cpp","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/variable-sized-hackerrank-solution-in-cpp\/","title":{"rendered":"Variable Sized Arrays in C++ | HackerRank Solution"},"content":{"rendered":"\n<p>Hello, Coderz, today we are going to solve <strong>Variable Sized HackerRank Solution in C++<\/strong>.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1167\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/01\/variable-sized-arrays-in-c-hackerrank-solution-codingbroz.png\" alt=\"Variable Sized Arrays Hackerrank Solution in C++\" class=\"wp-image-299\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/01\/variable-sized-arrays-in-c-hackerrank-solution-codingbroz.png 1167w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/01\/variable-sized-arrays-in-c-hackerrank-solution-codingbroz-768x444.png 768w\" sizes=\"(max-width: 1167px) 100vw, 1167px\" \/><\/figure>\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-662d4d366ff51\" 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-662d4d366ff51\" 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\/variable-sized-hackerrank-solution-in-cpp\/#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\/variable-sized-hackerrank-solution-in-cpp\/#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\/variable-sized-hackerrank-solution-in-cpp\/#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\/variable-sized-hackerrank-solution-in-cpp\/#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\/variable-sized-hackerrank-solution-in-cpp\/#Explanation\" title=\"Explanation\">Explanation<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/variable-sized-hackerrank-solution-in-cpp\/#Solution_%E2%80%93_Variable_Sized_Arrays_Hackerrank_Solution_in_C\" title=\"Solution &#8211; Variable Sized Arrays Hackerrank Solution in C++\">Solution &#8211; Variable Sized Arrays Hackerrank Solution in C++<\/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>Consider an n-element array, a, where each index i in the array contains a reference to an array of k<sub>i <\/sub>integers (where the value of varies from array to array). See the Explanation section below for a diagram.<\/p>\n\n\n\n<p>Given a, you must answer q queries. Each query is in the format i j, where i denotes an index in array a and j denotes an index in the array located at a[i]. For each query, find and print the value of element j in the array at location a[i] on a new line.<\/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 two space-separated integers denoting the respective values of n (the number of variable-length arrays) and q (the number of queries).<\/p>\n\n\n\n<p>Each line i of the n subsequent lines contains a space-separated sequence in the format k a[i]<sub>0<\/sub> a[i]<sub>1<\/sub> \u2026 a[i]<sub>k-1<\/sub> describing the k-element array located at a[i].<\/p>\n\n\n\n<p>Each of the q subsequent lines contains two space-separated integers describing the respective values of i (an index in array a) and j (an index in the array referenced by a[i]) for a query.<\/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>1 &lt;= n &lt;= 10<sup>5<\/sup><\/li><li>1 &lt;= q &lt;= 10<sup>5<\/sup><\/li><li>1 &lt;= k &lt;= 3 . 10<sup>5<\/sup><\/li><li>n &lt;= \u03a3k &lt;= 3 . 10<sup>5<\/sup><\/li><li>0 &lt;= i &lt; n<\/li><li>0 &lt;= j &lt; k<\/li><li>All indices in this challenge are zero-based.<\/li><li>All the given numbers are non negative and are not greater than 10<sup>6<\/sup>.<\/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 pair of i and j values (i.e., for each query), print a single integer that denotes the element located at index j of the array referenced by a[i]. There should be a total of q lines of output.<\/p>\n\n\n\n<p><strong>Sample Input<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>2 2\n3 1 5 4\n5 1 2 8 9 3\n0 1\n1 3\n<\/code><\/pre>\n\n\n\n<p><strong>Sample Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>5\n9\n<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Explanation\"><\/span><strong>Explanation<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>The diagram below depicts our assembled Sample Input:<\/p>\n\n\n\n<p>We perform the following q=2 queries:<\/p>\n\n\n\n<ol><li>&nbsp;Find the array located at index i = 0 , which corresponds to a[i] = [1,5,4]. We must print the value at index j=1 of this array which, as you can see, is 5.<\/li><li>Find the array located at index i=1 , which corresponds to a[i] = [1,2,8,9,3]. We must print the value at index j=3 of this array which, as you can see, is 9.<\/li><\/ol>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Variable_Sized_Arrays_Hackerrank_Solution_in_C\"><\/span><strong>Solution &#8211; Variable Sized Arrays Hackerrank Solution in C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\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;iostream>\n#include &lt;vector>\n\nusing namespace std;\n\nint main() {\n    \/\/ get length of array 'a' and number of queries\n    int n, q;\n    cin >> n >> q;\n\n    \/\/ create vector of vectors\n    vector&lt;vector&lt;int>> a(n);\n\n    \/\/ fill each 2D vector i with k_i values\n    for (int i = 0; i &lt; n; i++) {\n        \/\/ get the length k of the vector at a[i]\n        int k;\n        cin >> k;\n\n        \/\/ fill the vector with k values\n        a[i].resize(k);\n        for (int j = 0; j &lt; k; j++) {\n            cin >> a[i][j];\n        }\n    }\n\n    \/\/ run queries on a\n    for (int q_num = 0; q_num &lt; q; q_num++) {\n        \/\/ get i, j as the 'query' to get a value from a\n        int i, j;\n        cin >> i >> j;\n        cout &lt;&lt; a[i][j] &lt;&lt; endl;\n    }\n\n    return 0;\n}\n<\/pre>\n\n\n\n<script async src=\"https:\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js\"><\/script>\n<ins class=\"adsbygoogle\"\n     style=\"display:block; text-align:center;\"\n     data-ad-layout=\"in-article\"\n     data-ad-format=\"fluid\"\n     data-ad-client=\"ca-pub-5246141430412355\"\n     data-ad-slot=\"8798433565\"><\/ins>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script>\n\n\n\n<p><strong>Disclaimer:<\/strong> The above problem (<strong><a href=\"https:\/\/www.hackerrank.com\/challenges\/variable-sized-arrays\/problem\" target=\"_blank\" aria-label=\"Variable Sized Arrays (opens in a new tab)\" rel=\"noreferrer noopener nofollow\" class=\"rank-math-link\">Variable Sized Arrays<\/a><\/strong>) is generated by <strong><a href=\"https:\/\/www.hackerrank.com\/\" target=\"_blank\" aria-label=\"Hacker Rank (opens in a new tab)\" rel=\"noreferrer noopener\" class=\"rank-math-link\">Hacker Rank<\/a><\/strong> but the Solution is provided by<strong> <a href=\"https:\/\/www.codingbroz.com\/\" class=\"rank-math-link\">CodingBroz<\/a><\/strong>.<\/p>\n\n\n\n<p><strong>Broz Who Code<\/strong><\/p>\n\n\n\n<p><strong>CodingBroz<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Hello, Coderz, today we are going to solve Variable Sized HackerRank Solution in C++. Task Consider an n-element array, a, where each index i in the array contains a reference to an array of ki integers (where the value of varies from array to array). See the Explanation section below for a diagram. Given a, [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":299,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","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":"default","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,159],"tags":[22,80,18],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/01\/variable-sized-arrays-in-c-hackerrank-solution-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/286"}],"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\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=286"}],"version-history":[{"count":4,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/286\/revisions"}],"predecessor-version":[{"id":3590,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/286\/revisions\/3590"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/299"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=286"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=286"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=286"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}