{"id":4668,"date":"2021-09-02T08:47:34","date_gmt":"2021-09-02T08:47:34","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=4668"},"modified":"2022-11-25T13:11:59","modified_gmt":"2022-11-25T13:11:59","slug":"squarerootn-th-node-in-a-linked-list","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/","title":{"rendered":"Squareroot(n)-th node in a Linked List"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png\" alt=\"\" \/><\/p>\n<p>In this blog, we will see a linked list problem \u201dsquare root of nth node of linked list\u201d. Linked lists play a major role in the placements and having a good grasp of Linked Lists can be a huge plus point in a coding interview.<\/p>\n<h2>How to find square root of nth node of linked list <\/h2>\n<p> We have been given a linked list in this problem. Our task is to write a function that accepts the head node of the linked list as a parameter and returns the value of the node present at <strong>(floor(sqrt(n)))<\/strong><sup>th<\/sup> position in the linked list.<\/p>\n<p>Here n is the count of the number of nodes present in the linked list.<\/p>\n<p>Let\u2019s try to understand the problem with help of examples by referring to online coding classes.<\/p>\n<p>Suppose we are given a linked list A \u2192 B \u2192 C \u2192 D \u2192 E \u2192 F and now according to the problem statement we have to find the node at <strong>(floor(sqrt(n)))<\/strong><sup>th<\/sup> position in the linked list and return its value as output.<\/p>\n<p>For the above given linked list n = 6, as there are 6 nodes in the linked list, so<\/p>\n<ul>\n<li><strong>(floor(sqrt(n))) = floor(sqrt(6)) = 2<\/strong>, it means that we have to return the value of 2<sup>nd<\/sup> node of the linked list as output.<\/li>\n<\/ul>\n<p><strong>Output:<\/strong> B<br \/>\n<strong>Explanation:<\/strong> We will return B in output as B is the value of (floor(sqrt(n)))th node of the above given linked list.<\/p>\n<p>If the linked list is:<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/example-2-4.png\" alt=\"\" \/><\/p>\n<p>For the above linked list n = 9 (as there are 9 nodes in the linked list), then the value of <strong>(floor(sqrt(n)))<\/strong> is:<\/p>\n<ul>\n<li><strong>(floor(sqrt(n))) = (floor(sqrt(9))) = 3<\/strong>, so we will return the value of 3<sup>rd<\/sup> node of the linked list as output.<\/li>\n<\/ul>\n<p><strong>Output:<\/strong> C<\/p>\n<p><strong>Note:<\/strong> Here in this problem we are considering 1 based indexing.<\/p>\n<h5>Some more Examples:<\/h5>\n<p>Input : <\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/example-3-2.png\" alt=\"\" \/><\/p>\n<p>Output : 3<\/p>\n<p>Input : <\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/example-4-2.png\" alt=\"\" \/><\/p>\n<p>Output : 60<\/p>\n<p>Input :<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/example-5-2.png\" alt=\"\" \/><\/p>\n<p>Output : 14<\/p>\n<p>Now I think from the above examples the problem is clear, and now we have to think about how we can approach it.<\/p>\n<h2>Approach 1 of the square root of nth node of linked list<\/h2>\n<p>A simple approach is:<\/p>\n<ul>\n<li>First, loop through the linked list to find the number of nodes <strong>n<\/strong> in the linked list.<\/li>\n<li>Then calculate the value of <strong>floor(sqrt(n))<\/strong>, where <strong>n<\/strong> is the total number of nodes in the linked list. <\/li>\n<li>Now starting from the first node of the list traverse to this position given by <strong>floor(sqrt(n))<\/strong> and return the data of the node at this position.<\/li>\n<\/ul>\n<p><strong>Time Complexity of the square root of nth node of linked list :<\/strong> O(n), as we are traversing the complete length of the list<br \/>\n<strong>Space Complexity of the square root of nth node of linked list:<\/strong> O(1).<\/p>\n<p>This approach traverses the linked list 2 times. Let&#8217;s try to think, can we do better than this? Can we find out the <strong>(floor(sqrt(n)))<\/strong><sup>th<\/sup> node of the linked list in one single traversal?<\/p>\n<p>Let\u2019s see approach 2 to get the answers to the above questions.<\/p>\n<h2>Approach 2 of the square root of nth node of linked list<\/h2>\n<p>As we know that: <\/p>\n<ul>\n<li>sqrt(1) = 1<\/li>\n<li>sqrt(4) = 2<\/li>\n<li>sqrt(9) = 3<\/li>\n<li>sqrt(16) = 4 &#8230;&#8230;&#8230;.<\/li>\n<\/ul>\n<p>One little conclusion which we can make about floor(sqrt(n)) is that:<\/p>\n<ul>\n<li>Every number in range from 1 to 3 will have floor(sqrt(n)) equal to 1.<\/li>\n<li>Every number in range from 4 to 8 will have floor(sqrt(n)) equal to 2.<\/li>\n<li>Similarly, every number in range from 9 to 15 will have floor(sqrt(n)) equal to 3.<\/li>\n<li>It goes on like this for range of numbers between every consequtive perfect squares.<\/li>\n<\/ul>\n<p><strong>Note:<\/strong> The final conclusion is that every number <strong>num<\/strong> between two consequtive perfect squares (a,b) (excluding the bigger perfect square b) have <strong>(floor(sqrt(num))) = sqrt(a)<\/strong>.<\/p>\n<p>Now we will try to utilize the above conclusion to solve this problem, and it will help us to find the <strong>(floor(sqrt(n)))<\/strong><sup>th<\/sup> node of the linked list in single traversal.<\/p>\n<p>The complete algorithm for this approach is explained below.<\/p>\n<h2>Algorithm of the square root of nth node of linked list <\/h2>\n<ul>\n<li>Firstly, we will initialize 2 pointers <strong>x<\/strong> and <strong>y<\/strong> both to 1 and a pointer <strong>req_node<\/strong> to NULL to traverse till the required position in the list is reached.<\/li>\n<li>We will start traversing the list using the head node until the last node is reached.<\/li>\n<li>While traversing the list, we will check if the value of <strong>y<\/strong> is equal to <strong>sqrt(x)<\/strong>.\n<ul>\n<li>If the value is equal,we will  increment both <strong>x<\/strong> and <strong>y<\/strong> by 1 and make <strong>req_node<\/strong> to <strong>req_node-&gt;next<\/strong>.<\/li>\n<li>Otherwise, we will increment only <strong>x<\/strong>.<\/li>\n<\/ul>\n<\/li>\n<li>Now, when we reach the last node of the list x will contain the value of <strong>n<\/strong>, <strong>y<\/strong> will contain the value of <strong>sqrt(x)<\/strong> and <strong>req_node<\/strong> will point to the node at yth position.<\/li>\n<li>Finally, we will return the data contained in the node pointed by pointer <strong>req_node<\/strong>.<\/li>\n<\/ul>\n<h3>Dry Run of the square root of nth node of linked list <\/h3>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/Squarerootn-th-node-in-a-Linked-List-1-1.png\" alt=\"\" \/><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/Squarerootn-th-node-in-a-Linked-List-2-1.png\" alt=\"\" \/><\/p>\n<p>## Code Implementation of the square root of nth node of linked list<\/p>\n\t\t\t\t\t\t<style>\r\n\t\t\t\t\r\n\t\t\t\t\t#tab_container_4324 {\r\n\toverflow:hidden;\r\n\tdisplay:block;\r\n\twidth:100%;\r\n\tborder:0px solid #ddd;\r\n\tmargin-bottom:30px;\r\n\t}\r\n\r\n#tab_container_4324 .tab-content{\r\n\tpadding:20px;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n\tmargin-top: 0px;\r\n\tbackground-color:#ffffff !important;\r\n\tcolor: #000000 !important;\r\n\tfont-size:16px !important;\r\n\tfont-family: Open Sans !important;\r\n\t\r\n\t\tborder: 1px solid #e6e6e6 !important;\r\n\t}\r\n#tab_container_4324 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_4324 .wpsm_nav-tabs > li.active > a, #tab_container_4324 .wpsm_nav-tabs > li.active > a:hover, #tab_container_4324 .wpsm_nav-tabs > li.active > a:focus {\r\n\tcolor: #000000 !important;\r\n\tcursor: default;\r\n\tbackground-color: #ffffff !important;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n}\r\n\r\n#tab_container_4324 .wpsm_nav-tabs > li > a {\r\n    margin-right: 0px !important; \r\n    line-height: 1.42857143 !important;\r\n    border: 1px solid #d5d5d5 !important;\r\n    border-radius: 0px 0px 0 0 !important; \r\n\tbackground-color: #e8e8e8 !important;\r\n\tcolor: #000000 !important;\r\n\tpadding: 15px 18px 15px 18px !important;\r\n\ttext-decoration: none !important;\r\n\tfont-size: 14px !important;\r\n\ttext-align:center !important;\r\n\tfont-family: Open Sans !important;\r\n}\r\n#tab_container_4324 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_4324 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_4324 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_4324 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_4324 .wpsm_nav-tabs > li > a:hover , #tab_container_4324 .wpsm_nav-tabs > li > a:focus {\r\n    color: #000000 !important;\r\n    background-color: #e8e8e8 !important;\r\n\tborder: 1px solid #d5d5d5 !important;\r\n\t\r\n}\r\n#tab_container_4324 .wpsm_nav-tabs > li > a .fa{\r\n\r\nmargin-right:5px !important;\r\n\r\nmargin-left:5px !important;\r\n\r\n\r\n}\r\n\r\n\t\t#tab_container_4324 .wpsm_nav-tabs a{\r\n\t\t\tbackground-image: none;\r\n\t\t\tbackground-position: 0 0;\r\n\t\t\tbackground-repeat: repeat-x;\r\n\t\t}\r\n\t\t\t\r\n\r\n\r\n#tab_container_4324 .wpsm_nav-tabs > li {\r\n    float: left;\r\n    margin-bottom: -1px !important;\r\n\tmargin-right:0px !important; \r\n}\r\n\r\n\r\n#tab_container_4324 .tab-content{\r\noverflow:hidden !important;\r\n}\r\n\r\n\r\n@media (min-width: 769px) {\r\n\r\n\t#tab_container_4324 .wpsm_nav-tabs > li{\r\n\t\tfloat:left !important ;\r\n\t\t\t\tmargin-right:-1px !important;\r\n\t\t\t\t\t}\r\n\t#tab_container_4324 .wpsm_nav-tabs{\r\n\t\tfloat:none !important;\r\n\t\tmargin:0px !important;\r\n\t}\r\n\r\n\t#tab_container_4324 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_4324 .wpsm_nav{\r\n\t\t\t}\r\n\r\n}\r\n\r\n\r\n\r\n@media (max-width: 768px) {\r\n\t#tab_container_4324 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_4324 .wpsm_nav{\r\n\t\t\t}\r\n}\r\n\r\n\r\n\t.wpsm_nav-tabs li:before{\r\n\t\tdisplay:none !important;\r\n\t}\r\n\r\n\t@media (max-width: 768px) {\r\n\t\t\t\t\r\n\t\t\t\t.wpsm_nav-tabs{\r\n\t\t\tmargin-left:0px !important;\r\n\t\t\tmargin-right:0px !important; \r\n\t\t\t\r\n\t\t}\r\n\t\t\t\t#tab_container_4324 .wpsm_nav-tabs > li{\r\n\t\t\tfloat:none !important;\r\n\t\t}\r\n\t\t\t\r\n\t}\t\t\t\t<\/style>\r\n\t\t\t\t<div id=\"tab_container_4324\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_4324\">\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  class=\"active\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_4324_1\" aria-controls=\"tabs_desc_4324_1\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>C<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_4324_2\" aria-controls=\"tabs_desc_4324_2\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>C++<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_4324_3\" aria-controls=\"tabs_desc_4324_3\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>Java<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_4324_4\" aria-controls=\"tabs_desc_4324_4\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>Python<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\t\t\t\t <\/ul>\r\n\r\n\t\t\t\t\t  <!-- Tab panes -->\r\n\t\t\t\t\t  <div class=\"tab-content\" id=\"tab-content_4324\">\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane  in active \" id=\"tabs_desc_4324_1\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"c\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\n#include&lt;stdio.h&gt;\r\n#include&lt;stdlib.h&gt;\r\n \r\n\/\/ Linked list node\r\nstruct Node\r\n{\r\n    int data;\r\n    struct Node* next;\r\n};\r\n \r\n\/\/ Function to get the sqrt(n)th\r\n\/\/ node of a linked list\r\nint printsqrtn(struct Node* head)\r\n{\r\n    struct Node* sqrtn = NULL;\r\n    int i = 1, j = 1;\r\n     \r\n    \/\/ Traverse the list\r\n    while (head!=NULL)\r\n    {  \r\n        \/\/ check if j = sqrt(i)\r\n        if (i == j*j)\r\n        {  \r\n            \/\/ for first node\r\n            if (sqrtn == NULL)\r\n                sqrtn = head;\r\n            else\r\n                sqrtn = sqrtn-&gt;next;\r\n             \r\n            \/\/ increment j if j = sqrt(i)   \r\n            j++;\r\n        }\r\n        i++;\r\n         \r\n        head=head-&gt;next;\r\n    }\r\n     \r\n    \/\/ return node's data\r\n    return sqrtn-&gt;data;\r\n}\r\n \r\nvoid print(struct Node* head)\r\n{\r\n    while (head != NULL)\r\n    {\r\n        printf(&quot;%d &quot;, head-&gt;data);\r\n        head = head-&gt;next;\r\n    }\r\n    printf(&quot;&#92;n&quot;);\r\n}\r\n \r\n\/\/ function to add a new node at the\r\n\/\/ beginning of the list\r\nvoid push(struct Node** head_ref, int new_data)\r\n{\r\n    \/\/ allocate node\r\n    struct Node* new_node =\r\n            (struct Node*) malloc(sizeof(struct Node));\r\n     \r\n    \/\/ put in the data\r\n    new_node-&gt;data = new_data;\r\n     \r\n    \/\/ link the old list off the new node\r\n    new_node-&gt;next = (*head_ref);\r\n     \r\n    \/\/ move the head to point to the new node\r\n    (*head_ref) = new_node;\r\n}\r\n \r\n\/* Driver program to test above function*\/\r\nint main()\r\n{\r\n    \/* Start with the empty list *\/\r\n    struct Node* head = NULL;\r\n    push(&amp;head, 40);\r\n    push(&amp;head, 30);\r\n    push(&amp;head, 20);\r\n    push(&amp;head, 10);\r\n    printf(&quot;Given linked list is:&quot;);\r\n    print(head);\r\n    printf(&quot;sqrt(n)th node is %d &quot;,printsqrtn(head));\r\n     \r\n    return 0;\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane \" id=\"tabs_desc_4324_2\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"cpp\"} -->\r\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=\"\">\r\n#include &lt;bits\/stdc++.h&gt;\r\nusing namespace std;\r\n\r\nclass Node\r\n{\r\n    public:\r\n    int data;\r\n    Node* next;\r\n};\r\n\r\nint printsqrtn(Node* head)\r\n{\r\n    Node* req_node = NULL;\r\n    int x = 1, y = 1;\r\n    while (head!=NULL)\r\n    {\r\n        if (x == y*y)\r\n        {\r\n            if (req_node == NULL)\r\n                req_node = head;\r\n            else\r\n                req_node = req_node-&gt;next;\r\n            y++;\r\n        }\r\n        x++;\r\n        head=head-&gt;next;\r\n    }\r\n    return req_node-&gt;data;\r\n}\r\nvoid printList(Node* head)\r\n{\r\n    while (head != NULL)\r\n    {\r\n        cout &lt;&lt; head-&gt;data &lt;&lt; &quot; &quot;;\r\n        head = head-&gt;next;\r\n    }\r\n    cout&lt;&lt;endl;\r\n}\r\n\r\nvoid push(Node** head_ref, int new_data)\r\n{\r\n    Node* new_node = new Node();\r\n    new_node-&gt;data = new_data;\r\n    new_node-&gt;next = (*head_ref);\r\n    (*head_ref) = new_node;\r\n}\r\n\r\nint main()\r\n{\r\n    Node* head = NULL;\r\n    push(&amp;head, 4);\r\n    push(&amp;head, 3);\r\n    push(&amp;head, 2);\r\n    push(&amp;head, 1);\r\n    cout &lt;&lt; &quot;Given linked list is: &quot;;\r\n    printList(head);\r\n    cout &lt;&lt; &quot;sqrt(n)th node is &quot; &lt;&lt; printsqrtn(head);\r\n    \r\n    return 0;\r\n}\r\n\r\n\r\n\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane \" id=\"tabs_desc_4324_3\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"Java\"} -->\r\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=\"\">\r\n\r\nclass SquareRoot\r\n{\r\n    static class Node\r\n    {\r\n\t    int data;\r\n\t    Node next;\r\n    }\r\n    static Node head = null;\r\n    \/\/ Function to get the sqrt(n)th node of a linked list\r\n    static int printsqrtn(Node head)\r\n    {\r\n\t    Node sqrtn = null;\r\n\t    int i = 1, j = 1;\r\n\t\r\n\t    \/\/ Traverse the list\r\n\t    while (head != null)\r\n\t    {\r\n\t\t    \/\/ check if j = sqrt(i)\r\n\t\t    if (i == j * j)\r\n\t\t    {\r\n\t\t\t    \/\/ for first node\r\n\t\t\t    if (sqrtn == null)\r\n\t\t\t\t    sqrtn = head;\r\n\t\t\t    else\r\n\t\t\t    \tsqrtn = sqrtn.next;\r\n\t\t\t\r\n\t\t\t    \/\/ increment j if j = sqrt(i)\r\n\t\t\t    j++;\r\n\t\t    }\r\n\t\t    i++;\r\n\t\t    head=head.next;\r\n\t    }\r\n\t    return sqrtn.data;\r\n    }\r\n    static void print(Node head)\r\n    {\r\n\t    while (head != null)\r\n\t    {\r\n\t\t    System.out.print( head.data + &quot; &quot;);\r\n\t\t    head = head.next;\r\n\t    }\r\n\t    System.out.println();\r\n    }\r\n    static void push( int new_data)\r\n    {\r\n\t    \r\n\t    Node new_node = new Node();\r\n\t    new_node.data = new_data;\r\n\t    new_node.next = head;\r\n\t    head = new_node;\r\n    }\r\n    \/* Driver code*\/\r\n    public static void main(String[] args)\r\n    {\r\n\t    push( 40);\r\n\t    push( 30);\r\n\t    push( 20);\r\n\t    push( 10);\r\n\t    System.out.print(&quot;Given linked list is:&quot;);\r\n\t    print(head);\r\n\t    System.out.print(&quot;sqrt(n)th node is &quot; +printsqrtn(head));\r\n    }\r\n}\r\n\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane \" id=\"tabs_desc_4324_4\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"Python\"} -->\r\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=\"\">\r\nclass Node:\r\n\r\n\tdef __init__(self, data):\r\n\t\tself.data = data\r\n\t\tself.next = None\r\n\r\ndef printsqrtn(head) :\r\n\r\n\tsqrtn = None\r\n\ti = 1\r\n\tj = 1\r\n\t\r\n\twhile (head != None) :\r\n\t\r\n\t\tif (i == j * j) :\r\n\t\t\r\n\t\t\tif (sqrtn == None) :\r\n\t\t\t\tsqrtn = head\r\n\t\t\telse:\r\n\t\t\t\tsqrtn = sqrtn.next\r\n\t\t\t\r\n\t\t\tj = j + 1\r\n\t\t\r\n\t\ti = i + 1\r\n\t\t\r\n\t\thead = head.next\r\n\t\r\n\treturn sqrtn.data\r\n\r\ndef print_1(head) :\r\n\r\n\twhile (head != None) :\r\n\t\tprint( head.data, end = &quot; &quot;)\r\n\t\thead = head.next\r\n\tprint(&quot; &quot;)\r\n\r\ndef push(head_ref, new_data) :\r\n\r\n\tnew_node = Node(0)\r\n\tnew_node.data = new_data\r\n\tnew_node.next = (head_ref)\r\n\t(head_ref) = new_node\r\n\treturn head_ref\r\n\r\nif __name__=='__main__':\r\n\r\n\thead = None\r\n\thead = push(head, 4)\r\n\thead = push(head, 3)\r\n\thead = push(head, 2)\r\n\thead = push(head, 1)\r\n\tprint(&quot;Given linked list is:&quot;)\r\n\tprint_1(head)\r\n\tprint(&quot;sqrt(n)th node is &quot;, printsqrtn(head))\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t <\/div>\r\n\t\t\t\t\t \r\n\t\t\t\t <\/div>\r\n <script>\r\n\t\tjQuery(function () {\r\n\t\t\tjQuery('#myTab_4324 a:first').tab('show')\r\n\t\t});\r\n\t\t\r\n\t\t\t\tjQuery(function(){\r\n\t\t\tvar b=\"fadeIn\";\r\n\t\t\tvar c;\r\n\t\t\tvar a;\r\n\t\t\td(jQuery(\"#myTab_4324 a\"),jQuery(\"#tab-content_4324\"));function d(e,f,g){\r\n\t\t\t\te.click(function(i){\r\n\t\t\t\t\ti.preventDefault();\r\n\t\t\t\t\tjQuery(this).tab(\"show\");\r\n\t\t\t\t\tvar h=jQuery(this).data(\"easein\");\r\n\t\t\t\t\tif(c){c.removeClass(a);}\r\n\t\t\t\t\tif(h){f.find(\"div.active\").addClass(\"animated \"+h);a=h;}\r\n\t\t\t\t\telse{if(g){f.find(\"div.active\").addClass(\"animated \"+g);a=g;}else{f.find(\"div.active\").addClass(\"animated \"+b);a=b;}}c=f.find(\"div.active\");\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\r\n\t\tfunction do_resize(){\r\n\r\n\t\t\tvar width=jQuery( '.tab-content .tab-pane iframe' ).width();\r\n\t\t\tvar height=jQuery( '.tab-content .tab-pane iframe' ).height();\r\n\r\n\t\t\tvar toggleSize = true;\r\n\t\t\tjQuery('iframe').animate({\r\n\t\t\t    width: toggleSize ? width : 640,\r\n\t\t\t    height: toggleSize ? height : 360\r\n\t\t\t  }, 250);\r\n\r\n\t\t\t  toggleSize = !toggleSize;\r\n\t\t}\r\n\r\n\r\n\t<\/script>\r\n\t\t\t\t\r\n\t\t\t\n<p>    Output<br \/>\n    Given linked list is: 1 2 3 4<br \/>\n    sqrt(n)th node is 2<\/p>\n<p><strong>Time Complexity of the square root of nth node of linked list :<\/strong> O(n), as we are traversing the complete length of the list.<\/p>\n<p>**Conclusion**<\/p>\n<p>So, in this article, you have learned how to the square root of nth node of linked list. Also, you can solve more questions on Linked List, which is curated by our expert mentors at PrepBytes, you can follow this link <a href=\"https:\/\/mycode.prepbytes.com\/interview-coding\/practice\/linked-list\">Linked List<\/a>.<\/p>\n<p>## FAQs on the square root of nth node of linked list<\/p>\n<p>**1. What is getNode and Freenode?**<br \/>\nWe have a getnode() function that creates an empty. node for us. We have a freenode() function that deallocates the. memory pointed to by p.<\/p>\n<p>**2. What is the meaning of Freenode?**<br \/>\nFreenode, stylized as Freenode and formerly known as Open Projects Network, is an IRC network that was previously used to discuss peer-directed projects. Their servers are accessible from the hostname chat.freenode.net, which load balances connections by using round-robin DNS.<\/p>\n<p>**3. Is the linked list an ADT?**<br \/>\nYes, a linked list is an Abstract Data type i.e ADT.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this blog, we will see a linked list problem \u201dsquare root of nth node of linked list\u201d. Linked lists play a major role in the placements and having a good grasp of Linked Lists can be a huge plus point in a coding interview. How to find square root of nth node of linked [&hellip;]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[125],"tags":[],"class_list":["post-4668","post","type-post","status-publish","format-standard","hentry","category-linked-list"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v25.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Squareroot(n)-th node in a Linked List<\/title>\n<meta name=\"description\" content=\"Learn the most efficient way to return the value of node present at (floor(sqrt(n)))th position in the Linked List.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Squareroot(n)-th node in a Linked List\" \/>\n<meta property=\"og:description\" content=\"Learn the most efficient way to return the value of node present at (floor(sqrt(n)))th position in the Linked List.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/\" \/>\n<meta property=\"og:site_name\" content=\"PrepBytes Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prepbytes0211\/\" \/>\n<meta property=\"article:published_time\" content=\"2021-09-02T08:47:34+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-11-25T13:11:59+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png\" \/>\n<meta name=\"author\" content=\"PrepBytes\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"PrepBytes\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/\"},\"author\":{\"name\":\"PrepBytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e\"},\"headline\":\"Squareroot(n)-th node in a Linked List\",\"datePublished\":\"2021-09-02T08:47:34+00:00\",\"dateModified\":\"2022-11-25T13:11:59+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/\"},\"wordCount\":1024,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png\",\"articleSection\":[\"Linked list articles\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/\",\"name\":\"Squareroot(n)-th node in a Linked List\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png\",\"datePublished\":\"2021-09-02T08:47:34+00:00\",\"dateModified\":\"2022-11-25T13:11:59+00:00\",\"description\":\"Learn the most efficient way to return the value of node present at (floor(sqrt(n)))th position in the Linked List.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Linked list articles\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/linked-list\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Squareroot(n)-th node in a Linked List\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\/\/43.205.93.38\/#website\",\"url\":\"http:\/\/43.205.93.38\/\",\"name\":\"PrepBytes Blog\",\"description\":\"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING\",\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/43.205.93.38\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"http:\/\/43.205.93.38\/#organization\",\"name\":\"Prepbytes\",\"url\":\"http:\/\/43.205.93.38\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"contentUrl\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"width\":160,\"height\":160,\"caption\":\"Prepbytes\"},\"image\":{\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/prepbytes0211\/\",\"https:\/\/www.instagram.com\/prepbytes\/\",\"https:\/\/www.linkedin.com\/company\/prepbytes\/\",\"https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA\"]},{\"@type\":\"Person\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e\",\"name\":\"PrepBytes\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/850669d326db1e1531f04db0c63145d941c2a26792aaeee226a9e6675b0ac698?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/850669d326db1e1531f04db0c63145d941c2a26792aaeee226a9e6675b0ac698?s=96&d=mm&r=g\",\"caption\":\"PrepBytes\"},\"url\":\"https:\/\/prepbytes.com\/blog\/author\/prepbytes\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Squareroot(n)-th node in a Linked List","description":"Learn the most efficient way to return the value of node present at (floor(sqrt(n)))th position in the Linked List.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/","og_locale":"en_US","og_type":"article","og_title":"Squareroot(n)-th node in a Linked List","og_description":"Learn the most efficient way to return the value of node present at (floor(sqrt(n)))th position in the Linked List.","og_url":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2021-09-02T08:47:34+00:00","article_modified_time":"2022-11-25T13:11:59+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png","type":"","width":"","height":""}],"author":"PrepBytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"PrepBytes","Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/"},"author":{"name":"PrepBytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e"},"headline":"Squareroot(n)-th node in a Linked List","datePublished":"2021-09-02T08:47:34+00:00","dateModified":"2022-11-25T13:11:59+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/"},"wordCount":1024,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png","articleSection":["Linked list articles"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/","url":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/","name":"Squareroot(n)-th node in a Linked List","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png","datePublished":"2021-09-02T08:47:34+00:00","dateModified":"2022-11-25T13:11:59+00:00","description":"Learn the most efficient way to return the value of node present at (floor(sqrt(n)))th position in the Linked List.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926430629-115.Squareroot%28n%29-th%20node%20in%20a%20Linked%20List-04.png"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/squarerootn-th-node-in-a-linked-list\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Linked list articles","item":"https:\/\/prepbytes.com\/blog\/category\/linked-list\/"},{"@type":"ListItem","position":3,"name":"Squareroot(n)-th node in a Linked List"}]},{"@type":"WebSite","@id":"http:\/\/43.205.93.38\/#website","url":"http:\/\/43.205.93.38\/","name":"PrepBytes Blog","description":"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING","publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/43.205.93.38\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"http:\/\/43.205.93.38\/#organization","name":"Prepbytes","url":"http:\/\/43.205.93.38\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/","url":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","contentUrl":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","width":160,"height":160,"caption":"Prepbytes"},"image":{"@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/prepbytes0211\/","https:\/\/www.instagram.com\/prepbytes\/","https:\/\/www.linkedin.com\/company\/prepbytes\/","https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA"]},{"@type":"Person","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e","name":"PrepBytes","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/850669d326db1e1531f04db0c63145d941c2a26792aaeee226a9e6675b0ac698?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/850669d326db1e1531f04db0c63145d941c2a26792aaeee226a9e6675b0ac698?s=96&d=mm&r=g","caption":"PrepBytes"},"url":"https:\/\/prepbytes.com\/blog\/author\/prepbytes\/"}]}},"_links":{"self":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/4668","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/comments?post=4668"}],"version-history":[{"count":6,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/4668\/revisions"}],"predecessor-version":[{"id":10775,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/4668\/revisions\/10775"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=4668"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=4668"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=4668"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}