{"id":4335,"date":"2021-08-25T08:55:10","date_gmt":"2021-08-25T08:55:10","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=4335"},"modified":"2022-11-28T07:03:44","modified_gmt":"2022-11-28T07:03:44","slug":"find-the-fractional-or-n-k-th-node-in-linked-list","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/","title":{"rendered":"Find the fractional (or n\/k \u2013 th) node in linked list"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png\" alt=\"\" \/><\/p>\n<p>This article discusses an important topic \u201cfind n\/k th node in linked list\u201d. \u201cfind n\/k th node in linked list\u201d is a good topic if you want to master the data structures. Linked List always remain the main bone of data structures and by conquering \u201cfind n\/k th node in linked list\u201d will make your linked list even more stronger and make it crystal clear to you.<\/p>\n<\/p>\n<h2>How To Find n\/k Th Node In Linked List<\/h2>\n<p>In this problem, we have been given a linked list and positive integer k. 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>(ceil(n\/k))<\/strong><sup>th<\/sup> position in the linked list.<\/p>\n<p>Here, n is the count of the number of nodes in the linked list.<\/p>\n<p>Let\u2019s try to understand the problem with help of examples.<\/p>\n<p>Suppose we are given a linked list<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/example-1-2.png\"><\/p>\n<p>Now according to the problem statement we have to find the node at <strong>(ceil(n\/k))<\/strong><sup>th<\/sup> position in the linked list and return its value.<\/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>(ceil(n\/k)) = (ceil(6\/4)) = 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<\/p>\n<p><strong>Explanation:<\/strong> We will return B in output as B is the value of <strong>(ceil(n\/k))<\/strong><sup>th<\/sup> 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-2.png\"><\/p>\n<p>For the above linked list n = 9 (as there are 9 nodes in the linked list), then the value of (ceil(n\/k)) is:<\/p>\n<ul>\n<li><strong>(ceil(n\/k)) = (ceil(9\/3)) = 3<\/strong>, so we will return the value of the 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><strong>Input:<\/strong> <\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/example-3.png\" alt=\"\" \/><\/p>\n<p><strong>Output:<\/strong> 5<\/p>\n<p><strong>Input:<\/strong> <\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/example-4.png\" alt=\"\" \/><\/p>\n<p><strong>Output:<\/strong> 60<\/p>\n<p><strong>Input:<\/strong> <\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/example-5.png\" alt=\"\" \/><\/p>\n<p><strong>Output:<\/strong> 18<\/p>\n<p>Now I think from the above examples the problem is clear, and now we have to think how we can approach it.<\/p>\n<h2>Approach 1 To Find n\/k Th Node In Linked List<\/h2>\n<p>A simple approach is:<\/p>\n<ul>\n<li>First, loop through the linked list to find the count of number of nodes <strong>n<\/strong> present in the linked list.<\/li>\n<li>Then calculate the value of (ceil(n\/k)). <\/li>\n<li>Now starting from the first node of the list traverse to this position given by <strong>(ceil(n\/k))<\/strong> and return the data of the node at this position.<\/li>\n<\/ul>\n<p><strong>Time Complexity To Find n\/k Th Node In Linked List:<\/strong> O(n), as we are traversing the complete length of the list.<\/p>\n<p>\n<strong>Space Complexity To Find n\/k Th Node In 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>(ceil(n\/k))<\/strong><sup>th<\/sup> node of the linked list in one single traversal?<\/p>\n<p>Let\u2019s see the approach 2 to get the answers to the above questions.<\/p>\n<h2>Approach 2 To Find n\/k Th Node In Linked List<\/h2>\n<p>In this approach, we can get the required node by traversing the list once only. The complete algorithm for this approach is explained below.<\/p>\n<h3>Algorithm To Find n\/k Th Node In Linked List<\/h3>\n<ul>\n<li>If <strong>k&lt;=0<\/strong> or our <strong>head==NULL<\/strong>, then return NULL.<\/li>\n<li>We will take two pointers <strong>temp<\/strong> and <strong>req_node<\/strong> and initialize <strong>temp<\/strong> with <strong>head<\/strong> and <strong>req_node<\/strong> with NULL.<\/li>\n<li>For every <strong>k<\/strong> jumps of the temp pointer, we will make one jump of the <strong>req_node<\/strong> pointer.<\/li>\n<li>Now when <strong>temp<\/strong> will be at NULL, <strong>req_node<\/strong> will be at <strong>(ceil(n\/k))<\/strong><sup>th<\/sup> node of the linked list.<\/li>\n<li>Finally, we will return the <strong>req_node-&gt;data<\/strong> as output.<\/li>\n<\/ul>\n<h3>Dry Run To Find n\/k Th Node In Linked List<\/h3>\n<p>![](https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/Find-the-fractional-node-in-linked-list-1.png)<\/p>\n<p>![](https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/Find-the-fractional-node-in-linked-list-2.png)<\/p>\n<p>## Code Implementation To Find n\/k Th Node In 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_4336 {\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_4336 .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_4336 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_4336 .wpsm_nav-tabs > li.active > a, #tab_container_4336 .wpsm_nav-tabs > li.active > a:hover, #tab_container_4336 .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_4336 .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_4336 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_4336 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_4336 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_4336 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_4336 .wpsm_nav-tabs > li > a:hover , #tab_container_4336 .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_4336 .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_4336 .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_4336 .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_4336 .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_4336 .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_4336 .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_4336 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_4336 .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_4336 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_4336 .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_4336 .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_4336\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_4336\">\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_4336_1\" aria-controls=\"tabs_desc_4336_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_4336_2\" aria-controls=\"tabs_desc_4336_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_4336_3\" aria-controls=\"tabs_desc_4336_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_4336_4\" aria-controls=\"tabs_desc_4336_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_4336\">\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_4336_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<stdio.h>\r\n#include<stdlib.h>\r\n\r\nstruct Node {\r\n    int data;\r\n    struct Node* next;\r\n};\r\nstruct Node* newNode(int x)\r\n{\r\n    struct Node* node = malloc(sizeof(struct Node*));\r\n    node->data = x;\r\n    node->next = NULL;\r\n    return node;\r\n}\r\nstruct Node* fractionalNodes(struct Node* head, int k)\r\n{\r\n    if (k <= 0 || head == NULL)\r\n        return NULL;\r\n    struct Node* req_node = NULL;\r\n    \r\n    int i = 0;\r\n    for (struct Node* temp = head; temp != NULL; temp = temp->next) {\r\n        if (i % k == 0) {\r\n            if (req_node == NULL)\r\n                req_node = head;\r\n            else\r\n                req_node = req_node->next;\r\n        }\r\n        i++;\r\n    }\r\n    return req_node;\r\n}\r\nvoid printList(struct Node* node)\r\n{\r\n    while (node != NULL) {\r\n        printf(\"%d \", node->data);\r\n        node = node->next;\r\n    }\r\n    printf(\"&#92;n\");\r\n}\r\nint main(void)\r\n{\r\n    struct Node* head = newNode(3);\r\n    head->next = newNode(5);\r\n    head->next->next = newNode(7);\r\n    head->next->next->next = newNode(9);\r\n    head->next->next->next->next = newNode(11);\r\n    int k = 2;\r\n    printf(\"List is \");\r\n    printList(head);\r\n    struct Node* answer = fractionalNodes(head, k);\r\n    printf(\"&#92;nFractional node is \");\r\n    printf(\"%d&#92;n\", answer->data);\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_4336_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 <bits stdc++.h=\"\">\r\nusing namespace std;\r\n\r\nstruct Node {\r\n    int data;\r\n    Node* next;\r\n};\r\n\r\nNode* newNode(int data)\r\n{\r\n    Node* new_node = new Node;\r\n    new_node->data = data;\r\n    new_node->next = NULL;\r\n    return new_node;\r\n}\r\nNode* fractionalNodes(Node* head, int k)\r\n{\r\n    if (k <= 0 || head == NULL)\r\n        return NULL;\r\n\r\n    Node* req_node = NULL;\r\n    \r\n    int i = 0;\r\n    for (Node* temp = head; temp != NULL; temp = temp->next) {\r\n\r\n        if (i % k == 0) {\r\n\r\n            if (req_node == NULL)\r\n                req_node = head;\r\n\r\n            else\r\n                req_node = req_node->next;\r\n        }\r\n        i++;\r\n    }\r\n    return req_node;\r\n}\r\n\r\nvoid printList(Node* node)\r\n{\r\n    while (node != NULL) {\r\n        printf(\"%d \", node->data);\r\n        node = node->next;\r\n    }\r\n    printf(\"&#92;n\");\r\n}\r\n\r\nint main(void)\r\n{\r\n    Node* head = newNode(3);\r\n    head->next = newNode(5);\r\n    head->next->next = newNode(7);\r\n    head->next->next->next = newNode(9);\r\n    head->next->next->next->next = newNode(11);\r\n    int k = 2;\r\n\r\n    printf(\"List is \");\r\n    printList(head);\r\n\r\n    Node* answer = fractionalNodes(head, k);\r\n    printf(\"&#92;nFractional node is \");\r\n    printf(\"%d&#92;n\", answer->data);\r\n\r\n    return 0;\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_4336_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\npublic class FractionalNode\r\n{\r\n    static class Node{\r\n        int data;\r\n        Node next;\r\n        Node (int data){\r\n            this.data = data;\r\n        }\r\n    }\r\n    static Node fractionalNodes(Node head, int k)\r\n    {\r\n        \/\/ Corner cases\r\n        if (k <= 0 || head == null)\r\n            return null;\r\n\r\n        Node fractionalNode = null;\r\n\r\n        \/\/ Traverse the given list\r\n        int i = 0;\r\n        for (Node temp = head; temp != null;temp = temp.next)\r\n        {\r\n            if (i % k == 0){\r\n                \/\/ First time we see a multiple of k\r\n                if (fractionalNode == null)\r\n                    fractionalNode = head;\r\n                else\r\n                    fractionalNode = fractionalNode.next;\r\n            }\r\n            i++;\r\n        }\r\n        return fractionalNode;\r\n    }\r\n    static void printList(Node node)\r\n    {\r\n        while (node != null)\r\n        {\r\n            System.out.print(node.data+\" \");\r\n            node = node.next;\r\n        }\r\n        System.out.println();\r\n    }\r\n    public static void main(String[] args) {\r\n        Node head = new Node(3);\r\n        head.next = new Node(5);\r\n        head.next.next = new Node(7);\r\n        head.next.next.next = new Node(9);\r\n        head.next.next.next.next = new Node(11);\r\n        int k =2;\r\n\r\n        System.out.print(\"List is \");\r\n        printList(head);\r\n\r\n        Node answer = fractionalNodes(head, k);\r\n        System.out.println(\"Fractional node is \"+answer.data);\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_4336_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    def __init__(self, data):\r\n        self.data = data\r\n        self.next = None\r\n\r\ndef newNode(data):\r\n    new_node = Node(data)\r\n    new_node.data = data\r\n    new_node.next = None\r\n    return new_node\r\n\r\ndef fractionalNodes(head, k):\r\n    \r\n    if (k <= 0 or head == None):\r\n        return None\r\n\r\n    fractionalNode = None\r\n    i = 0\r\n    temp = head\r\n    while (temp != None):\r\n\r\n        if (i % k == 0):\r\n\r\n            if (fractionalNode == None):\r\n                fractionalNode = head\r\n\r\n            else:\r\n                fractionalNode = fractionalNode.next\r\n\r\n        i = i + 1\r\n        temp = temp.next\r\n\r\n    return fractionalNode\r\n\r\ndef printList(node):\r\n    while (node != None):\r\n        print(node.data, end = ' ')\r\n        node = node.next\r\n\r\nif __name__ == '__main__':\r\n    head = newNode(3)\r\n    head.next = newNode(5)\r\n    head.next.next = newNode(7)\r\n    head.next.next.next = newNode(9)\r\n    head.next.next.next.next = newNode(11)\r\n    k = 2\r\n\r\n    print(\"List is\", end = ' ')\r\n    printList(head)\r\n\r\n    answer = fractionalNodes(head, k)\r\n    print(\"&#92;nFractional node is\", end = ' ')\r\n    print(answer.data)\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_4336 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_4336 a\"),jQuery(\"#tab-content_4336\"));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    List is 3 5 7 9 11<br \/>\n    Fractional node is 7<\/p>\n<p>**Time Complexity To Find n\/k Th Node In Linked List:** O(n), as we are traversing the complete length of the list<\/p>\n<p>This article discusses the question \u201cFind n\/k Th Node In Linked List\u201d by two different approaches. Coding Questions like \u201cFind n\/k Th Node In Linked List\u201d will always help in achieving the long term goals. Don\u2019t stop here for practicing more questions of linked list, you can follow this link <a href=\"https:\/\/mycode.prepbytes.com\/interview-coding\/practice\/linked-list\">Linked List<\/a>.<\/p>\n<p>## FAQ<\/p>\n<p>**1. How do you find the kth node from the end in a linked list?**<br \/>\nWe will use the following property to find the kth node from the end. Kth node from end = (cnt-k+1)th node from the beginning. Let us store the value of cnt-k+1 in a variable &#8216;n&#8217;. Now traverse the linked list again and return the pointer to the &#8216;nth&#8217; node.<\/p>\n<p>**2. How do you find the common node between two linked lists?**<br \/>\nCompare every node of list A with every node of list B. If the node is a match then increment the count and return count after all the nodes get compared.<\/p>\n<p>**3. Which companies have recently asked &#8220;Find n\/k Th Node In Linked List&#8221; in their interviews?**<br \/>\nTech Companies Samsung, Reliance JIO, TCS, Amazon, Accenture and Infosys have recently asked this question in the interview round for freshers.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>This article discusses an important topic \u201cfind n\/k th node in linked list\u201d. \u201cfind n\/k th node in linked list\u201d is a good topic if you want to master the data structures. Linked List always remain the main bone of data structures and by conquering \u201cfind n\/k th node in linked list\u201d will make your [&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-4335","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>Find the fractional (or n\/k \u2013 th) node in linked list | Linked List | Prepbytes<\/title>\n<meta name=\"description\" content=\"Learn the most efficient way to return the value of node present at (n\/k)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\/find-the-fractional-or-n-k-th-node-in-linked-list\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Find the fractional (or n\/k \u2013 th) node in linked list | Linked List | Prepbytes\" \/>\n<meta property=\"og:description\" content=\"Learn the most efficient way to return the value of node present at (n\/k)th position in the Linked List.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-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-08-25T08:55:10+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-11-28T07:03:44+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.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=\"4 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/\"},\"author\":{\"name\":\"PrepBytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e\"},\"headline\":\"Find the fractional (or n\/k \u2013 th) node in linked list\",\"datePublished\":\"2021-08-25T08:55:10+00:00\",\"dateModified\":\"2022-11-28T07:03:44+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/\"},\"wordCount\":899,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png\",\"articleSection\":[\"Linked list articles\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/\",\"name\":\"Find the fractional (or n\/k \u2013 th) node in linked list | Linked List | Prepbytes\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png\",\"datePublished\":\"2021-08-25T08:55:10+00:00\",\"dateModified\":\"2022-11-28T07:03:44+00:00\",\"description\":\"Learn the most efficient way to return the value of node present at (n\/k)th position in the Linked List.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-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\":\"Find the fractional (or n\/k \u2013 th) node in 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":"Find the fractional (or n\/k \u2013 th) node in linked list | Linked List | Prepbytes","description":"Learn the most efficient way to return the value of node present at (n\/k)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\/find-the-fractional-or-n-k-th-node-in-linked-list\/","og_locale":"en_US","og_type":"article","og_title":"Find the fractional (or n\/k \u2013 th) node in linked list | Linked List | Prepbytes","og_description":"Learn the most efficient way to return the value of node present at (n\/k)th position in the Linked List.","og_url":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2021-08-25T08:55:10+00:00","article_modified_time":"2022-11-28T07:03:44+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png","type":"","width":"","height":""}],"author":"PrepBytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"PrepBytes","Est. reading time":"4 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/"},"author":{"name":"PrepBytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e"},"headline":"Find the fractional (or n\/k \u2013 th) node in linked list","datePublished":"2021-08-25T08:55:10+00:00","dateModified":"2022-11-28T07:03:44+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/"},"wordCount":899,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png","articleSection":["Linked list articles"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/","url":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/","name":"Find the fractional (or n\/k \u2013 th) node in linked list | Linked List | Prepbytes","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png","datePublished":"2021-08-25T08:55:10+00:00","dateModified":"2022-11-28T07:03:44+00:00","description":"Learn the most efficient way to return the value of node present at (n\/k)th position in the Linked List.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-linked-list\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186177041-Find%20the%20fractional_Artboard%203.png"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/find-the-fractional-or-n-k-th-node-in-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":"Find the fractional (or n\/k \u2013 th) node in 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\/4335","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=4335"}],"version-history":[{"count":6,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/4335\/revisions"}],"predecessor-version":[{"id":10780,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/4335\/revisions\/10780"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=4335"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=4335"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=4335"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}