<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Linked List on ljf12825</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/</link><description>Recent content in Linked List on ljf12825</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 31 Dec 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://ljf12825.github.io/csf/theory/algorithm/linkedlist/index.xml" rel="self" type="application/rss+xml"/><item><title>Cycles Linked List</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/checking_for_cycles_in_linked_list/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/checking_for_cycles_in_linked_list/</guid><description>determine if a linked list has a cycle</description></item><item><title>Delete the Nth node from the end</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/delete_nth_node_from_back/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/delete_nth_node_from_back/</guid><description>delete the Nth node from the end</description></item><item><title>Floyd</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/fast_slow_pointers_floyd_theorem/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/fast_slow_pointers_floyd_theorem/</guid><description>fast and slow pointers</description></item><item><title>Free List</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/free_list/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/free_list/</guid><description>free list</description></item><item><title>Intersect Linked List</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/checking_for_linked_list_intersections/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/checking_for_linked_list_intersections/</guid><description>determine if linked lists intersect</description></item><item><title>Intrusive List</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/intrusive_list/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/intrusive_list/</guid><description>intrusive list</description></item><item><title>Linked List</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/linkedlist/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/linkedlist/</guid><description>Algorithm of Linked List</description></item><item><title>LRU Cache</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/lru_cache/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/lru_cache/</guid><description>LRU Cache</description></item><item><title>Merge Two Sorted Linked List</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/merge_two_sorted_linkedlist/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/merge_two_sorted_linkedlist/</guid><description>merge two sorted linked list</description></item><item><title>Palindrome Linked List</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/check_linked_list_palindrome/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/check_linked_list_palindrome/</guid><description>determine if a linked list is a palindrome</description></item><item><title>Reverse Linked List</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/reverse_linked_list/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/reverse_linked_list/</guid><description>reverse linked list</description></item><item><title>Reverse Linked List in K Groups</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/reverse_linkedlist_in_k_groups/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/reverse_linkedlist_in_k_groups/</guid><description>reverse linked list in k groups</description></item><item><title>Sorted Linked List</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/sorting_linked_list/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/sorting_linked_list/</guid><description>sort algorithms in linked list</description></item><item><title>Swap Nodes in Pairs</title><link>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/swap_nodes_in_pairs/</link><pubDate>Wed, 31 Dec 2025 00:00:00 +0000</pubDate><guid>https://ljf12825.github.io/csf/theory/algorithm/linkedlist/swap_nodes_in_pairs/</guid><description>swap nodes in pairs</description></item></channel></rss>