<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>GyanDev</title>
    <link>https://gyandev.org</link>
    <description>Deep technical notes for modern developers.</description>
    <language>en-US</language>
    <lastBuildDate>Fri, 24 Apr 2026 00:00:00 GMT</lastBuildDate>
    <atom:link href="https://gyandev.org/rss.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Heaps &amp; Priority Queues</title>
      <link>https://gyandev.org/courses/dsa/</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Pattern-first mastery of heap problems — the complete-binary-tree mental model, canonical templates, and 16 FAANG-grade patterns in Python and TypeScript.]]></description>

    </item>
    <item>
      <title>Frequency-based</title>
      <link>https://gyandev.org/courses/dsa/heaps</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Heap ordered by counts — top-K elements by frequency or reorderings that respect frequency caps.]]></description>

    </item>
    <item>
      <title>Frequency Sort</title>
      <link>https://gyandev.org/courses/dsa/heaps/frequency-based</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/frequency-based</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Sort array elements by descending frequency — count with a hash map, then pop from an uncapped max-heap and emit each value that many times.]]></description>

    </item>
    <item>
      <title>Top K Frequent Elements</title>
      <link>https://gyandev.org/courses/dsa/heaps/frequency-based</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/frequency-based</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Return the K most frequently occurring values in an array — count with a hash map, then Top-K with a min-heap keyed on frequency.]]></description>

    </item>
    <item>
      <title>Heaps — Fundamentals</title>
      <link>https://gyandev.org/courses/dsa/heaps</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Foundations of binary heaps and priority queues — index arithmetic, operations, recognition signals, and the five templates that unlock every heap problem.]]></description>

    </item>
    <item>
      <title>Greedy Combine</title>
      <link>https://gyandev.org/courses/dsa/heaps</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Repeatedly extract the two smallest, combine, and reinsert — Huffman-style accumulation.]]></description>

    </item>
    <item>
      <title>Connect Ropes with Minimum Cost</title>
      <link>https://gyandev.org/courses/dsa/heaps/greedy-combine</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/greedy-combine</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Repeatedly merge the two shortest ropes into one — a Huffman-style greedy that minimises total joining cost using a min-heap.]]></description>

    </item>
    <item>
      <title>K-way Merge</title>
      <link>https://gyandev.org/courses/dsa/heaps</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Merge K sorted sequences or matrix cells by maintaining a heap of active heads.]]></description>

    </item>
    <item>
      <title>Kth Smallest in Sorted Matrix</title>
      <link>https://gyandev.org/courses/dsa/heaps/k-way-merge</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/k-way-merge</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Find the K-th smallest value in a row- and column-sorted matrix by treating rows as K sorted lists and applying the K-way merge template.]]></description>

    </item>
    <item>
      <title>Merge K Sorted Lists</title>
      <link>https://gyandev.org/courses/dsa/heaps/k-way-merge</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/k-way-merge</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Merge K sorted linked lists or arrays into one sorted output using a min-heap seeded with the head of each source — the canonical K-way merge.]]></description>

    </item>
    <item>
      <title>Scheduling with Heap</title>
      <link>https://gyandev.org/courses/dsa/heaps</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Greedy task/interval picks driven by a priority queue — cooldowns, deadlines, room assignment.]]></description>

    </item>
    <item>
      <title>Maximum Beauty with Deadlines</title>
      <link>https://gyandev.org/courses/dsa/heaps/scheduling-with-heap</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/scheduling-with-heap</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Maximise total beauty of toys sold within per-toy deadlines — sort by deadline, then use a min-heap as capacity-bounded beauty tracker.]]></description>

    </item>
    <item>
      <title>Meeting Rooms II (Heap)</title>
      <link>https://gyandev.org/courses/dsa/heaps/scheduling-with-heap</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/scheduling-with-heap</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Find the minimum conference rooms needed for a meeting list — sort by start, keep end-times in a min-heap, reuse the earliest-free room.]]></description>

    </item>
    <item>
      <title>Reorganize String</title>
      <link>https://gyandev.org/courses/dsa/heaps/scheduling-with-heap</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/scheduling-with-heap</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Rearrange a string so no two adjacent characters are equal by greedily emitting the most-frequent available character and deferring the one just used.]]></description>

    </item>
    <item>
      <title>Task Scheduler</title>
      <link>https://gyandev.org/courses/dsa/heaps/scheduling-with-heap</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/scheduling-with-heap</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Compute the minimum CPU cycles to finish a task list with a same-task cooldown using a max-heap of remaining counts plus a cooldown queue.]]></description>

    </item>
    <item>
      <title>Top K Selection</title>
      <link>https://gyandev.org/courses/dsa/heaps</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Bounded-size heap + linear scan. Opposite-polarity rule: min-heap for K-largest, max-heap for K-smallest.]]></description>

    </item>
    <item>
      <title>K Closest Elements to X</title>
      <link>https://gyandev.org/courses/dsa/heaps/top-k-selection</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/top-k-selection</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Return the K values closest to target X by absolute difference using a size-K max-heap keyed on distance.]]></description>

    </item>
    <item>
      <title>K Closest Points to Origin</title>
      <link>https://gyandev.org/courses/dsa/heaps/top-k-selection</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/top-k-selection</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Find the K points closest to (0, 0) using a size-K max-heap on squared Euclidean distance — no sqrt required.]]></description>

    </item>
    <item>
      <title>Kth Largest Element</title>
      <link>https://gyandev.org/courses/dsa/heaps/top-k-selection</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/top-k-selection</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Find the K-th largest element in an unsorted array using a bounded min-heap of size K — the canonical Top-K template.]]></description>

    </item>
    <item>
      <title>Kth Smallest Element</title>
      <link>https://gyandev.org/courses/dsa/heaps/top-k-selection</link>
      <guid isPermaLink="true">https://gyandev.org/courses/dsa/heaps/top-k-selection</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <author>noreply@gyandev.org (Sonu Shahuji)</author>
      <description><![CDATA[Find the K-th smallest element in an unsorted array with a bounded max-heap of size K — the mirror of the K-th largest template.]]></description>

    </item>
  </channel>
</rss>
