{"id":6356,"date":"2022-06-13T23:10:00","date_gmt":"2022-06-13T17:40:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=6356"},"modified":"2022-06-13T13:30:00","modified_gmt":"2022-06-13T08:00:00","slug":"sequence-equation-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/sequence-equation-hackerrank-solution\/","title":{"rendered":"Sequence Equation &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Sequence Equation HackerRank Solution<\/strong>. This problem <strong>(Sequence Equation)<\/strong> is a part of <strong>HackerRank Algorithms<\/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-662ead7acd0a8\" 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-662ead7acd0a8\" 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\/sequence-equation-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\/sequence-equation-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\/sequence-equation-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\/sequence-equation-hackerrank-solution\/#Solution_%E2%80%93_Sequence_Equation_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Sequence Equation &#8211; HackerRank Solution\">Solution &#8211; Sequence Equation &#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\/sequence-equation-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\/sequence-equation-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\/sequence-equation-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>Given a sequence of&nbsp;<em><strong>n<\/strong><\/em>&nbsp;integers,&nbsp;<strong><em>p<\/em>(1), <em>p<\/em>(2), . . . , <em>p<\/em>(<em>n<\/em>)<\/strong>&nbsp;where each element is distinct and satisfies&nbsp;<strong>1 &lt;= <em>p<\/em>(<em>x<\/em>) &lt;= <em>n<\/em><\/strong>. For&nbsp;<em>each<\/em>&nbsp;<em><strong>x<\/strong><\/em>&nbsp;where<strong>&nbsp;1 &lt;= <em>x<\/em> &lt;= <em>n<\/em><\/strong>, that is&nbsp;<em><strong>x<\/strong><\/em>&nbsp;increments from&nbsp;<strong>1<\/strong>&nbsp;to&nbsp;<em><strong>n<\/strong><\/em>, find any integer&nbsp;<em><strong>y<\/strong><\/em>&nbsp;such that&nbsp;<strong><em>p<\/em>(<em>p<\/em>(<em>y<\/em>)) = <em>x<\/em><\/strong>&nbsp;and keep a history of the values of&nbsp;<strong>y<\/strong>&nbsp;in a return array.<\/p>\n\n\n\n<p><strong>Example<\/strong><\/p>\n\n\n\n<p><strong><em>p<\/em> = [5, 2, 1, 3, 4]<\/strong><\/p>\n\n\n\n<p>Each value of&nbsp;<em><strong>x<\/strong><\/em>&nbsp;between&nbsp;<strong>1<\/strong>&nbsp;and&nbsp;<strong>5<\/strong>, the length of the sequence, is analyzed as follows:<\/p>\n\n\n\n<ol><li><strong><em>x<\/em> = 1 = <em>p<\/em>[3],<em>p<\/em>[4] = 3<\/strong>, so<strong>&nbsp;<em>p<\/em>[<em>p<\/em>[4]] = 1<\/strong><\/li><li><strong><em>x<\/em> = 2 = <em>p<\/em>[2],<em>p<\/em>[2] = 2<\/strong>, so<strong>&nbsp;<em>p<\/em>[<em>p<\/em>[2]] = 2<\/strong><\/li><li><strong><em>x<\/em> = 3 = <em>p<\/em>[4],<em>p<\/em>[5] = 4<\/strong>, so<strong>&nbsp;<em>p<\/em>[<em>p<\/em>[5]] = 3<\/strong><\/li><li><strong><em>x<\/em> = 4 = <em>p<\/em>[5],<em>p<\/em>[1] = 5<\/strong>, so<strong>&nbsp;<em>p<\/em>[<em>p<\/em>[1]] = 4<\/strong><\/li><li><strong><em>x<\/em> = 5 = <em>p<\/em>[1],<em>p<\/em>[3] = 1<\/strong>, so<strong>&nbsp;<em>p<\/em>[<em>p<\/em>[3]] = 5<\/strong><\/li><\/ol>\n\n\n\n<p>The values for&nbsp;<em><strong>y<\/strong><\/em>&nbsp;are&nbsp;<strong>[4, 2, 5, 1, 3]<\/strong>.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>permutationEquation<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p>permutationEquation has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>int p[n]:<\/em>&nbsp;an array of integers<\/li><\/ul>\n\n\n\n<p><strong>Returns<\/strong><\/p>\n\n\n\n<ul><li><em>int[n]:<\/em>&nbsp;the values of&nbsp;<em><strong>y<\/strong><\/em>&nbsp;for all&nbsp;<em><strong>x<\/strong><\/em>&nbsp;in the arithmetic sequence&nbsp;<strong>1<\/strong>&nbsp;to&nbsp;<strong><em>n<\/em><\/strong><\/li><\/ul>\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 an integer&nbsp;<em><strong>n<\/strong><\/em>, the number of elements in the sequence.<br>The second line contains&nbsp;<em><strong>n<\/strong><\/em>&nbsp;space-separated integers&nbsp;<strong><em>p<\/em>[<em>i<\/em>]<\/strong>&nbsp;where&nbsp;<strong>1 &lt;= <em>i<\/em>  &lt;= <em>n<\/em><\/strong>.<\/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>n<\/em> &lt;= 50<\/strong><\/li><li><strong>1 &lt;= <em>p<\/em>[<em>i<\/em>] &lt;= 50<\/strong>, where&nbsp;<strong>1 &lt;= <em>i<\/em> &lt;= <em>n<\/em><\/strong>.<\/li><li>Each element in the sequence is distinct.<\/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>3\n2 3 1<\/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>2\n3\n1<\/code><\/pre>\n\n\n\n<p><strong>Explanation 0<\/strong><\/p>\n\n\n\n<p>Given the values of&nbsp;<strong><em>p<\/em>(1) = 2<\/strong>,&nbsp;<strong><em>p<\/em>(2) = 3<\/strong>, and&nbsp;<strong><em>p<\/em>(3) = 1<\/strong>, we calculate and print the following values for each&nbsp;<em><strong>x<\/strong><\/em>&nbsp;from&nbsp;1&nbsp;to&nbsp;<strong><em>n<\/em><\/strong>:<\/p>\n\n\n\n<ol><li><em><strong>x<\/strong><\/em><strong> = 1 = <em>p<\/em>(3) = <em>p<\/em>(<em>p<\/em>(2)) = <em>p<\/em>(<em>p<\/em>(y))<\/strong>, so we print the value of&nbsp;<strong><em>y<\/em> = 2<\/strong>&nbsp;on a new line.<\/li><li><em><strong>x<\/strong><\/em><strong> = 2 = <em>p<\/em>(1) = <em>p<\/em>(<em>p<\/em>(3)) = <em>p<\/em>(<em>p<\/em>(y))<\/strong>, so we print the value of&nbsp;<strong><em>y<\/em> = 3<\/strong>&nbsp;on a new line.<\/li><li><em><strong>x<\/strong><\/em><strong> = 3 = <em>p<\/em>(2) = <em>p<\/em>(<em>p<\/em>(1)) = <em>p<\/em>(<em>p<\/em>(y))<\/strong>, so we print the value of&nbsp;<strong><em>y<\/em> =1<\/strong>&nbsp;on a new line.<\/li><\/ol>\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>5\n4 3 5 1 2<\/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>1\n3\n5\n4\n2<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Sequence_Equation_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Sequence Equation &#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;bits\/stdc++.h>\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair&lt;int, int> II;\n\nint main() {\n    #ifdef LOCAL\n        freopen(\"Data.inp\", \"r\", stdin);\n        freopen(\"Data.out\", \"w\", stdout);\n    #endif\n\n    int n, a[100];\n    cin >> n;\n    for (int i = 1; i &lt;= n; ++i) cin >> a[i];\n\n    for (int i = 1; i &lt;= n; ++i) {\n        for (int j = 1; j &lt;= n; ++j) if (a[a[j]] == i) {\n            cout &lt;&lt; j &lt;&lt; endl;\n            break;\n        }\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=\"\">#!\/usr\/bin\/env python3\n\nimport sys\n\ndef permutationEquation(p):\n    output = []\n    \n    for num in range(1, max(p)+1):\n        output.append(p.index(p.index(num)+1)+1)\n        \n    return output\n    \n\nif __name__ == \"__main__\":\n    n = int(input().strip())\n    p = list(map(int, input().strip().split(' ')))\n    result = permutationEquation(p)\n    print (\"\\n\".join(map(str, result)))\n\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    public static void main(String args[] ) throws Exception {\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int arr[]=new int[n];\n        for(int i = 0 ;i&lt;n;i++)\n            arr[i]=sc.nextInt();\n        for(int i = 0 ;i&lt;n;i++)\n            {\n            int pos = 0;\n            for(int j = 0 ; j&lt;n;j++)\n                {\n                if(arr[j]==i+1)\n                {\n                pos = j+1 ;\n                    break;\n                }\n              }\n            int pos1=0;\n            for(int j = 0 ; j&lt;n;j++)\n                {\n                if(arr[j]==pos)\n                {\n                pos1 = j ;break;\n            }\n            }\n            System.out.println(pos1+1);\n        }\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/permutation-equation\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Sequence Equation<\/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>Education<\/strong> and <strong>Learning<\/strong> purpose.<\/p>\n\n\n\n<p><strong>Also Read:<\/strong><\/p>\n\n\n\n<ul><li><strong><a href=\"https:\/\/www.codingbroz.com\/circular-array-rotation-hackerrank-solution\/\">Circular Array Rotation \u2013 HackerRank Solution<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/save-the-prisoner-hackerrank-solution\/\">Save the Prisoner! \u2013 HackerRank Solution<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/viral-advertising-hackerrank-solution\/\">Viral Advertising \u2013 HackerRank Solution<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/beautiful-days-at-the-movies-hackerrank-solution\/\">Beautiful Days at the Movies \u2013 HackerRank Solution<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/angry-professor-solution\/\">Angry Professor &#8211; HackerRank Solution<\/a><\/strong><\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will solve Sequence Equation HackerRank Solution. This problem (Sequence Equation) is a part of HackerRank Algorithms 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\/6356"}],"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=6356"}],"version-history":[{"count":5,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6356\/revisions"}],"predecessor-version":[{"id":6362,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6356\/revisions\/6362"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=6356"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=6356"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=6356"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}