{"id":1196,"date":"2020-07-14T23:06:41","date_gmt":"2020-07-14T23:06:41","guid":{"rendered":"https:\/\/www.projectimmerse.com\/blog\/?p=1196"},"modified":"2025-09-30T14:17:02","modified_gmt":"2025-09-30T14:17:02","slug":"move-last-node-to-front-of-a-linear-linked-list","status":"publish","type":"post","link":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/","title":{"rendered":"Move Last Node to Front of a Linear Linked List"},"content":{"rendered":"\n<figure class=\"wp-block-image size-full\"><a href=\"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/\"><img loading=\"lazy\" decoding=\"async\" width=\"1024\" height=\"1024\" src=\"https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list.png\" alt=\"Flat illustration of a programmer at a laptop with colorful linked list nodes, showing the last node being moved to the front\" class=\"wp-image-1335\" srcset=\"https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list.png 1024w, https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list-300x300.png 300w, https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list-150x150.png 150w, https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list-768x768.png 768w, https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list-100x100.png 100w\" sizes=\"auto, (max-width: 767px) 89vw, (max-width: 1000px) 54vw, (max-width: 1071px) 543px, 580px\" \/><\/a><figcaption class=\"wp-element-caption\">Move the last node to the front of a linked list \u2013 a classic data structure problem explained with step-by-step code.<\/figcaption><\/figure>\n\n\n\n<p>Linked lists are one of the fundamental data structures in computer science. A common interview question (and practical exercise) is how to take the last node of a singly linked list and move it to the front.<\/p>\n\n\n\n<p>Let\u2019s walk through the logic, example code, and why this operation matters.<\/p>\n\n\n\n<!--more-->\n\n\n\n<h2 class=\"wp-block-heading\">Understanding the Problem<\/h2>\n\n\n\n<p>A <strong>singly linked list<\/strong> is a sequence of nodes where each node points to the next one. The last node (called the tail) has a <code>next<\/code> pointer set to <code>null<\/code>.<\/p>\n\n\n\n<p>The task is simple:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Take the last node<\/li>\n\n\n\n<li>Place it at the beginning of the list<\/li>\n\n\n\n<li>Adjust the pointers so the list remains valid<\/li>\n<\/ul>\n\n\n\n<p>Example:<br>Before \u2192 <code>10 \u2192 20 \u2192 30 \u2192 40<\/code><br>After \u2192 <code>40 \u2192 10 \u2192 20 \u2192 30<\/code><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Step-by-Step Approach<\/h2>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Traverse the list until you reach the second-to-last node.<\/li>\n\n\n\n<li>Keep a pointer to the last node.<\/li>\n\n\n\n<li>Break the link from the second-to-last node to the last node.<\/li>\n\n\n\n<li>Make the last node point to the current head.<\/li>\n\n\n\n<li>Update the head pointer to the last node.<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\">Example Implementation in Python<\/h2>\n\n\n\n<p>Here\u2019s a simple implementation:<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: plain; title: ; notranslate\" title=\"\">\nclass Node:\n    def __init__(self, data):\n        self.data = data\n        self.next = None\n\nclass LinkedList:\n    def __init__(self):\n        self.head = None\n\n    def push(self, new_data):\n        new_node = Node(new_data)\n        new_node.next = self.head\n        self.head = new_node\n\n    def move_last_to_front(self):\n        if not self.head or not self.head.next:\n            return  # List is empty or has only one node\n\n        second_last = None\n        last = self.head\n\n        # Traverse to the last node\n        while last.next:\n            second_last = last\n            last = last.next\n\n        # Adjust pointers\n        second_last.next = None\n        last.next = self.head\n        self.head = last\n\n    def print_list(self):\n        temp = self.head\n        while temp:\n            print(temp.data, end=\" \u2192 \")\n            temp = temp.next\n        print(\"None\")\n\n# Example usage\nllist = LinkedList()\nfor value in &#x5B;10, 20, 30, 40]:\n    llist.push(value)\n\nprint(\"Original List:\")\nllist.print_list()\n\nllist.move_last_to_front()\n\nprint(\"Modified List:\")\nllist.print_list()\n\n<\/pre><\/div>\n\n\n<h3 class=\"wp-block-heading\">Output<\/h3>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: plain; title: ; notranslate\" title=\"\">\nOriginal List:\n40 \u2192 30 \u2192 20 \u2192 10 \u2192 None\n\nModified List:\n10 \u2192 40 \u2192 30 \u2192 20 \u2192 None\n\n<\/pre><\/div>\n\n\n<h2 class=\"wp-block-heading\">Time Complexity<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Traversal<\/strong>: O(n), since we must reach the last node.<\/li>\n\n\n\n<li><strong>Pointer changes<\/strong>: O(1).<\/li>\n\n\n\n<li><strong>Overall<\/strong>: O(n).<\/li>\n<\/ul>\n\n\n\n<p>This is efficient for a single pass through the list.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Why This Matters<\/h2>\n\n\n\n<p>This exercise teaches you to:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Manipulate pointers safely<\/li>\n\n\n\n<li>Handle edge cases (empty lists, single-node lists)<\/li>\n\n\n\n<li>Think like an interviewer: break problems into steps and code defensively<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Final Thoughts<\/h2>\n\n\n\n<p>Moving the last node to the front of a linked list is a classic linked list manipulation problem. While simple, it builds the foundation for tackling more advanced problems like reversing lists, rotating nodes, and merging sorted lists.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Linked lists are one of the fundamental data structures in computer science. A common interview question (and practical exercise) is how to take the last node of a singly linked list and move it to the front. Let\u2019s walk through the logic, example code, and why this operation matters.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[56],"tags":[41,39],"class_list":["post-1196","post","type-post","status-publish","format-standard","hentry","category-programming-fundamentals","tag-data-structures","tag-python"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.3 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Move Last Node to Front of a Linear Linked List - Project Immerse<\/title>\n<meta name=\"description\" content=\"Learn how to move the last node of a linked list to the front using Python. Includes step-by-step explanation, code implementation, and time complexity analysis.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Move Last Node to Front of a Linear Linked List - Project Immerse\" \/>\n<meta property=\"og:description\" content=\"Learn how to move the last node of a linked list to the front using Python. Includes step-by-step explanation, code implementation, and time complexity analysis.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/\" \/>\n<meta property=\"og:site_name\" content=\"Project Immerse\" \/>\n<meta property=\"article:published_time\" content=\"2020-07-14T23:06:41+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-09-30T14:17:02+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1024\" \/>\n\t<meta property=\"og:image:height\" content=\"1024\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"projectimmerse\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"projectimmerse\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/\"},\"author\":{\"name\":\"projectimmerse\",\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/#\\\/schema\\\/person\\\/c53f2864be524ee6fa08a7e4800dd1e5\"},\"headline\":\"Move Last Node to Front of a Linear Linked List\",\"datePublished\":\"2020-07-14T23:06:41+00:00\",\"dateModified\":\"2025-09-30T14:17:02+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/\"},\"wordCount\":291,\"commentCount\":0,\"image\":{\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/wp-content\\\/uploads\\\/2020\\\/07\\\/move-last-node-front-linked-list.png\",\"keywords\":[\"data structures\",\"python\"],\"articleSection\":[\"Programming Fundamentals\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/\",\"url\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/\",\"name\":\"Move Last Node to Front of a Linear Linked List - Project Immerse\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/wp-content\\\/uploads\\\/2020\\\/07\\\/move-last-node-front-linked-list.png\",\"datePublished\":\"2020-07-14T23:06:41+00:00\",\"dateModified\":\"2025-09-30T14:17:02+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/#\\\/schema\\\/person\\\/c53f2864be524ee6fa08a7e4800dd1e5\"},\"description\":\"Learn how to move the last node of a linked list to the front using Python. Includes step-by-step explanation, code implementation, and time complexity analysis.\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/#primaryimage\",\"url\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/wp-content\\\/uploads\\\/2020\\\/07\\\/move-last-node-front-linked-list.png\",\"contentUrl\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/wp-content\\\/uploads\\\/2020\\\/07\\\/move-last-node-front-linked-list.png\",\"width\":1024,\"height\":1024},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/move-last-node-to-front-of-a-linear-linked-list\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Move Last Node to Front of a Linear Linked List\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/\",\"name\":\"Project Immerse\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/#\\\/schema\\\/person\\\/c53f2864be524ee6fa08a7e4800dd1e5\",\"name\":\"projectimmerse\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/4d06955033d6227bfdcf30014e457e4334f7deeb73907de49b65ec2484921931?s=96&d=mm&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/4d06955033d6227bfdcf30014e457e4334f7deeb73907de49b65ec2484921931?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/4d06955033d6227bfdcf30014e457e4334f7deeb73907de49b65ec2484921931?s=96&d=mm&r=g\",\"caption\":\"projectimmerse\"},\"url\":\"https:\\\/\\\/www.projectimmerse.com\\\/blog\\\/author\\\/projectimmerse\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Move Last Node to Front of a Linear Linked List - Project Immerse","description":"Learn how to move the last node of a linked list to the front using Python. Includes step-by-step explanation, code implementation, and time complexity analysis.","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:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/","og_locale":"en_US","og_type":"article","og_title":"Move Last Node to Front of a Linear Linked List - Project Immerse","og_description":"Learn how to move the last node of a linked list to the front using Python. Includes step-by-step explanation, code implementation, and time complexity analysis.","og_url":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/","og_site_name":"Project Immerse","article_published_time":"2020-07-14T23:06:41+00:00","article_modified_time":"2025-09-30T14:17:02+00:00","og_image":[{"width":1024,"height":1024,"url":"https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list.png","type":"image\/png"}],"author":"projectimmerse","twitter_card":"summary_large_image","twitter_misc":{"Written by":"projectimmerse","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/#article","isPartOf":{"@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/"},"author":{"name":"projectimmerse","@id":"https:\/\/www.projectimmerse.com\/blog\/#\/schema\/person\/c53f2864be524ee6fa08a7e4800dd1e5"},"headline":"Move Last Node to Front of a Linear Linked List","datePublished":"2020-07-14T23:06:41+00:00","dateModified":"2025-09-30T14:17:02+00:00","mainEntityOfPage":{"@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/"},"wordCount":291,"commentCount":0,"image":{"@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list.png","keywords":["data structures","python"],"articleSection":["Programming Fundamentals"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/","url":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/","name":"Move Last Node to Front of a Linear Linked List - Project Immerse","isPartOf":{"@id":"https:\/\/www.projectimmerse.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/#primaryimage"},"image":{"@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list.png","datePublished":"2020-07-14T23:06:41+00:00","dateModified":"2025-09-30T14:17:02+00:00","author":{"@id":"https:\/\/www.projectimmerse.com\/blog\/#\/schema\/person\/c53f2864be524ee6fa08a7e4800dd1e5"},"description":"Learn how to move the last node of a linked list to the front using Python. Includes step-by-step explanation, code implementation, and time complexity analysis.","breadcrumb":{"@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/#primaryimage","url":"https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list.png","contentUrl":"https:\/\/www.projectimmerse.com\/blog\/wp-content\/uploads\/2020\/07\/move-last-node-front-linked-list.png","width":1024,"height":1024},{"@type":"BreadcrumbList","@id":"https:\/\/www.projectimmerse.com\/blog\/move-last-node-to-front-of-a-linear-linked-list\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.projectimmerse.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Move Last Node to Front of a Linear Linked List"}]},{"@type":"WebSite","@id":"https:\/\/www.projectimmerse.com\/blog\/#website","url":"https:\/\/www.projectimmerse.com\/blog\/","name":"Project Immerse","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.projectimmerse.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/www.projectimmerse.com\/blog\/#\/schema\/person\/c53f2864be524ee6fa08a7e4800dd1e5","name":"projectimmerse","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/4d06955033d6227bfdcf30014e457e4334f7deeb73907de49b65ec2484921931?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/4d06955033d6227bfdcf30014e457e4334f7deeb73907de49b65ec2484921931?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/4d06955033d6227bfdcf30014e457e4334f7deeb73907de49b65ec2484921931?s=96&d=mm&r=g","caption":"projectimmerse"},"url":"https:\/\/www.projectimmerse.com\/blog\/author\/projectimmerse\/"}]}},"_links":{"self":[{"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/posts\/1196","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/comments?post=1196"}],"version-history":[{"count":7,"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/posts\/1196\/revisions"}],"predecessor-version":[{"id":1338,"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/posts\/1196\/revisions\/1338"}],"wp:attachment":[{"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/media?parent=1196"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/categories?post=1196"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.projectimmerse.com\/blog\/wp-json\/wp\/v2\/tags?post=1196"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}