<?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 Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/linked-list/</link><description>Recent content in Linked List on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 22 May 2018 09:00:00 -0700</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/linked-list/feed.xml" rel="self" type="application/rss+xml"/><item><title>Merge Two Sorted Lists</title><link>https://www.rik-kisnah.ai/teach/coding/merge-two-sorted-lists/</link><pubDate>Tue, 22 May 2018 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/merge-two-sorted-lists/</guid><description>Two sorted queues. Keep taking the smaller front. A fake first node saves you from special-casing the start. This one shape is inside merge sort, log-structured databases, and every k-way merge you will ever write.</description></item><item><title>Detect a Cycle in a Linked List</title><link>https://www.rik-kisnah.ai/teach/coding/linked-list-cycle/</link><pubDate>Tue, 28 Nov 2017 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/linked-list-cycle/</guid><description>Two runners on a track. If the track is a loop, the fast one laps the slow one. If it is a straight road, the fast one falls off the end. No memory needed.</description></item><item><title>Reverse a Linked List</title><link>https://www.rik-kisnah.ai/teach/coding/reverse-a-linked-list/</link><pubDate>Tue, 12 Apr 2016 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/reverse-a-linked-list/</guid><description>Three fingers, one loop. The first pointer problem every interviewer asks, and the first one where candidates lose the thread.</description></item></channel></rss>