Dispatches

1. Column 01

   22 August 2026

   5 min.

   Guide

   Heaps in Python: Why heapq Beats a Sorted Array

   A practical guide to min-heaps in Python: why a sorted array is the wrong tool, how heapq's methods work, and how to build a max-heap when you need one.

   • python
   • algorithms
   • data-structures

   Read dispatch

2. Column 02

   21 August 2026

   6 min.

   Guide

   Build a Trie in Python: A Practical Guide

   Learn how to implement a trie (prefix tree) from scratch in Python, with insert, search, and prefix matching operations—plus real-world use cases.

   • python
   • data-structures
   • algorithms
   • trie

   Read dispatch

3. Column 03

   21 August 2026

   6 min.

   Guide

   Dynamic Programming in Python: From Memoization to Tabulation

   A practical walkthrough of dynamic programming in Python — covering memoization, tabulation, and when the classic approach is (and isn't) the right tool.

   • python
   • algorithms
   • dynamic-programming

   Read dispatch

Return to the front page