<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Sorting on Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/sorting/</link><description>Recent content in Sorting on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 16 May 2023 09:00:00 -0700</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/sorting/feed.xml" rel="self" type="application/rss+xml"/><item><title>Meeting Rooms: How Many Rooms Do You Need</title><link>https://www.rik-kisnah.ai/teach/coding/meeting-rooms/</link><pubDate>Tue, 16 May 2023 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/meeting-rooms/</guid><description>A list of meetings with start and end times. What is the smallest number of rooms so nobody has to share? Sort by start, keep a heap of end times, and the size of the heap at its biggest is your answer.</description></item><item><title>Merge Intervals</title><link>https://www.rik-kisnah.ai/teach/coding/merge-intervals/</link><pubDate>Tue, 07 May 2019 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/merge-intervals/</guid><description>Sort your meetings by start time, then walk the calendar once. If the next one starts before the current one ends, stretch. This one shape covers half of all scheduling questions.</description></item><item><title>Intervals</title><link>https://www.rik-kisnah.ai/teach/coding/intervals/</link><pubDate>Tue, 27 Mar 2018 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/intervals/</guid><description>Start and end pairs: meetings, bookings, ranges. Sort them and the mess becomes a line you walk once. Sort by start to merge. Sort by end to pick the most that fit. The only question at each step is whether the next one starts before the current one ends.</description></item></channel></rss>