<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Linked-List on Hitesh Patel</title><link>https://hiteshbuilds.com/tags/linked-list/</link><description>Recent content in Linked-List on Hitesh Patel</description><generator>Hugo -- 0.155.3</generator><language>en-us</language><lastBuildDate>Fri, 06 Mar 2026 00:00:00 +0530</lastBuildDate><atom:link href="https://hiteshbuilds.com/tags/linked-list/index.xml" rel="self" type="application/rss+xml"/><item><title>Remove Nth Node from the End of the Linked List (Blind 75)</title><link>https://hiteshbuilds.com/blind-75/remove-nth-node-from-end-of-list/</link><pubDate>Fri, 06 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/remove-nth-node-from-end-of-list/</guid><description>Learn how to remove the Nth node from the end of a linked list in a single pass using the two-pointer (Tortoise and Hare) technique.</description></item><item><title>Merge two sorted linked list (Blind 75)</title><link>https://hiteshbuilds.com/blind-75/merge-two-sorted-list/</link><pubDate>Wed, 04 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/merge-two-sorted-list/</guid><description>Step-by-step guide to merge two sorted linked lists efficiently. Compare nodes one by one, handle edge cases, and build a single sorted list.</description></item><item><title>How to Detect a Cycle in a Linked List (Blind 75)</title><link>https://hiteshbuilds.com/blind-75/linked-list-cycle/</link><pubDate>Mon, 02 Mar 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/linked-list-cycle/</guid><description>Explanation how to efficiently detect a cycle in a linked list using Floyd’s Cycle Detection algorithm.</description></item><item><title>How to Reverse a Linked List (Blind 75)</title><link>https://hiteshbuilds.com/blind-75/reverse-linked-list/</link><pubDate>Sat, 28 Feb 2026 00:00:00 +0530</pubDate><guid>https://hiteshbuilds.com/blind-75/reverse-linked-list/</guid><description>Detailed guide to reversing a linked list using the three-pointer approach, both recursively and iteratively.</description></item></channel></rss>