{"article":{"slug":"challenging-algorithms-and-data-structures-every-programmer-should-try","title":"Challenging algorithms and data structures every programmer should try","subtitle":null,"summary":"Austin Z. Henley recommends algorithms and data structures worth wrestling with beyond the usual interview set—pieces that stretch intuition about performance, representation, and problem shape.","content_type":"essay","language":"en","canonical_url":"https://austinhenley.com/blog/challengingalgorithms.html","author":{"name":"Austin Z. Henley","url":"https://austinhenley.com/","person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"austinhenley.com","url":null,"listing_slug":null,"listing":null},"topics":[{"name":"Programming","slug":"programming","url":"https://listedarticles.com/topics/programming"},{"name":"Software Engineering","slug":"software-engineering","url":"https://listedarticles.com/topics/software-engineering"},{"name":"Education","slug":"education","url":"https://listedarticles.com/topics/education"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":870,"reading_minutes":4,"published_at":"2026-10-16T08:11:02.398Z","added_at":"2026-10-16T08:11:02.398Z","updated_at":"2026-10-16T08:11:02.398Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/challenging-algorithms-and-data-structures-every-programmer-should-try","markdown_url":"https://listedarticles.com/articles/challenging-algorithms-and-data-structures-every-programmer-should-try.md","example":false,"citation":"Austin Z. Henley, austinhenley.com. \"Challenging algorithms and data structures every programmer should try.\" 16 Oct 2026. https://austinhenley.com/blog/challengingalgorithms.html (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://austinhenley.com/blog/challengingalgorithms.html"},"body_markdown":"## Austin Z. Henley\n\nI build tools for people\n\n[austin.henley@microsoft.com]() \n[@austinzhenley]() \n[github/AZHenley]() \n\n* * *\n\n[Home](<../index.html>) | [Publications](<../publications.html>) | [Teaching](<../teaching.html>) | [Blog](<../blog.html>)\n\n* * *\n\n# Challenging algorithms and data structures every programmer should try\n\n12/21/2022 \n \n\n_See the discussion of this post on[Reddit]() and [Hacker News]()._\n\nAlright, so we are all spending our leisure time reading about algorithms, right?\n\nWell, back when I was a student, my algorithms courses regularly put me to sleep. This is unfortunate because there are some _really_ interesting algorithms and data structures out there. Not only have they come up during job interviews, but learning them changed how I think about problems. Plus they're useful even if you don't work on Google-scale problems.\n\nFollowing my other popular posts, [challenging projects every programmer should try]() and [more challenging projects every programmer should try](), I made a list of interesting algorithms and data structures you should try:\n\n * Topological sort\n * Recursive descent parsing\n * Myers string difference\n * Bloom filter\n * Piece table\n * Splay tree\n\n**Note:** If you need an introduction to algorithms, I recommend Jeff Erickson's _Algorithms_ ([Amazon](), [web]()) or Daniel Zingaro's _Algorithmic Thinking_ ([Amazon]()). If you want a giant reference, then the classic is _Introduction to Algorithms_ by CLRS ([Amazon]()). Not enough? Watch MIT's Advanced Data Structures ([YouTube]()) to blow your mind.\n\n## Topological sort\n\nAnytime you need to sort items that are dependent on other items, you use topological sort. Common scenarios include determining the order of tasks for build systems, the evaluation order of cells in a spreadsheet, which classes a student should take each semester to graduate, and a variety of scheduling problems.\n\n![](images/toposort.png)\n\nI even used it in graduate school to rearrange graphs to be easier to read.\n\n * Topological sorting ([Wikipedia]())\n * Topological sort interactive visualization ([web]())\n\n## Recursive descent parsing\n\nThis one felt like unlocking a super power when it clicked for me. If you ever need to ingest a recursive data format or make a programming language, this is the tool for you. Sketch out a grammar then map each grammar rule to a code function. Bam! It feels like it codes itself.\n\n![](images/teenyparser.png)\n\nYou could have a simple compiler whipped up in a few hours with it.\n\n * Let's make a Teeny Tiny compiler ([my tutorial series]())\n * Crafting Interpreters ([web](), [Amazon]())\n * Recursive descent parser ([Wikipedia]())\n\n## Myers string diff\n\nProcessing strings is such a common programming task, but I can usually get away with brute forcing whatever it is I need to calculate. We've all learned about Levenshtein distance, but what if you need to show the differences between two strings in a sensible way?\n\n![](images/codediff.png)\n\nThe default algorithm used by git for showing diffs is the Myers diff algorithm.\n\n * [The Myers diff algorithm]()\n * [Myers diff algorithm - Code and interactive visualization]()\n\n## Bloom filter\n\nThe most known unknown data structure. In fact, I polled some friends at Big Tech about what data structure they'd suggest I add to this list and _all of them_ said bloom filter!\n\nIt really only helps with large-scale problem, such as when you need a really big hash table, but it is a great introduction to _probabilistic data structures_. With very little memory, it can tell you if an item is _not_ present in the table, otherwise it can only tell you _maybe_ the item is present.\n\nGoogle asked me two interview problems involving these back when I was in college. Have I ever needed this in practice? Nope!\n\n * Bloom filter ([Wikipedia]())\n * Let's implement a bloom filter ([web]())\n * Bloom filters by example ([web]())\n\n## Piece table\n\nWhen I first tried making my own text editor, I stored all of the text in an array. But that hits performance problems right away (e.g., when the user inserts text anywhere but the end). Years later I even got asked how to implement a performant text buffer at an internship interview.\n\nWhat should I have used? Well, there are a few options with different tradeoffs: rope, gap buffer, or piece table. With a piece table, you track the edits performed on text rather than only keeping the resulting text. It makes a lot of other features trivial to add (e.g., undo support and incremental saving).\n\nPiece tables aren't only useful for text editors though. You can use it whenever you have a large buffer of data that can be arbitrarily modified.\n\n * Piece table ([Wikipedia]())\n * VS Code's text buffer story ([web]())\n * The piece table ([web]())\n\n## Splay tree\n\nHow about a self-optimizing data structure? Splay trees are binary trees that will tend to have the more recently accessed elements closer to the root, and it does so without maintaining any additional metadata. Each time an element is accessed, it gets moved to the root.\n\n![](images/algorithmsbook.jpg)\n\nIt's a tree with a builtin cache and it is beautifully simple to implement! As a student, I had a really hard time implementing red-black trees (we wrote the code on paper, ugh) so I was pleasantly surprised when splay trees just clicked for me.\n\n * Splay tree interactive visualization ([web]())\n * Splay tree ([Wikipedia]())\n * Implementation in TypeScript ([GitHub]())\n\n* * *\n\nIf you are still craving more, here are the honorable mentions that I cut from the list:\n\n * Trie\n * Segment tree\n * Operational transformation\n * Fibonacci heap\n * Skip list\n * Union find\n\nTry these out, and let me know if I missed any!\n\n \n \nThere are Amazon affiliate links on this page.","body_html":"

Austin Z. Henley

\n

I build tools for people

\n

austin.henley@microsoft.com
\n@austinzhenley
\ngithub/AZHenley

\n
  • * *
\n

Home | Publications | Teaching | Blog

\n
  • * *
\n

Challenging algorithms and data structures every programmer should try

\n

12/21/2022

\n

See the discussion of this post onReddit and Hacker News.

\n

Alright, so we are all spending our leisure time reading about algorithms, right?

\n

Well, back when I was a student, my algorithms courses regularly put me to sleep. This is unfortunate because there are some really interesting algorithms and data structures out there. Not only have they come up during job interviews, but learning them changed how I think about problems. Plus they're useful even if you don't work on Google-scale problems.

\n

Following my other popular posts, challenging projects every programmer should try and more challenging projects every programmer should try, I made a list of interesting algorithms and data structures you should try:

\n
  • Topological sort
  • Recursive descent parsing
  • Myers string difference
  • Bloom filter
  • Piece table
  • Splay tree
\n

Note: If you need an introduction to algorithms, I recommend Jeff Erickson's Algorithms (Amazon, web) or Daniel Zingaro's Algorithmic Thinking (Amazon). If you want a giant reference, then the classic is Introduction to Algorithms by CLRS (Amazon). Not enough? Watch MIT's Advanced Data Structures (YouTube) to blow your mind.

\n

Topological sort

\n

Anytime you need to sort items that are dependent on other items, you use topological sort. Common scenarios include determining the order of tasks for build systems, the evaluation order of cells in a spreadsheet, which classes a student should take each semester to graduate, and a variety of scheduling problems.

\n

\n

I even used it in graduate school to rearrange graphs to be easier to read.

\n
  • Topological sorting (Wikipedia)
  • Topological sort interactive visualization (web)
\n

Recursive descent parsing

\n

This one felt like unlocking a super power when it clicked for me. If you ever need to ingest a recursive data format or make a programming language, this is the tool for you. Sketch out a grammar then map each grammar rule to a code function. Bam! It feels like it codes itself.

\n

\n

You could have a simple compiler whipped up in a few hours with it.

\n
  • Let's make a Teeny Tiny compiler (my tutorial series)
  • Crafting Interpreters (web, Amazon)
  • Recursive descent parser (Wikipedia)
\n

Myers string diff

\n

Processing strings is such a common programming task, but I can usually get away with brute forcing whatever it is I need to calculate. We've all learned about Levenshtein distance, but what if you need to show the differences between two strings in a sensible way?

\n

\n

The default algorithm used by git for showing diffs is the Myers diff algorithm.

\n\n

Bloom filter

\n

The most known unknown data structure. In fact, I polled some friends at Big Tech about what data structure they'd suggest I add to this list and all of them said bloom filter!

\n

It really only helps with large-scale problem, such as when you need a really big hash table, but it is a great introduction to probabilistic data structures. With very little memory, it can tell you if an item is not present in the table, otherwise it can only tell you maybe the item is present.

\n

Google asked me two interview problems involving these back when I was in college. Have I ever needed this in practice? Nope!

\n
  • Bloom filter (Wikipedia)
  • Let's implement a bloom filter (web)
  • Bloom filters by example (web)
\n

Piece table

\n

When I first tried making my own text editor, I stored all of the text in an array. But that hits performance problems right away (e.g., when the user inserts text anywhere but the end). Years later I even got asked how to implement a performant text buffer at an internship interview.

\n

What should I have used? Well, there are a few options with different tradeoffs: rope, gap buffer, or piece table. With a piece table, you track the edits performed on text rather than only keeping the resulting text. It makes a lot of other features trivial to add (e.g., undo support and incremental saving).

\n

Piece tables aren't only useful for text editors though. You can use it whenever you have a large buffer of data that can be arbitrarily modified.

\n
  • Piece table (Wikipedia)
  • VS Code's text buffer story (web)
  • The piece table (web)
\n

Splay tree

\n

How about a self-optimizing data structure? Splay trees are binary trees that will tend to have the more recently accessed elements closer to the root, and it does so without maintaining any additional metadata. Each time an element is accessed, it gets moved to the root.

\n

\n

It's a tree with a builtin cache and it is beautifully simple to implement! As a student, I had a really hard time implementing red-black trees (we wrote the code on paper, ugh) so I was pleasantly surprised when splay trees just clicked for me.

\n
  • Splay tree interactive visualization (web)
  • Splay tree (Wikipedia)
  • Implementation in TypeScript (GitHub)
  • * *
\n

If you are still craving more, here are the honorable mentions that I cut from the list:

\n
  • Trie
  • Segment tree
  • Operational transformation
  • Fibonacci heap
  • Skip list
  • Union find
\n

Try these out, and let me know if I missed any!

\n

There are Amazon affiliate links on this page.

","headings":[{"level":2,"text":"Austin Z. Henley","id":"austin-z-henley"},{"level":1,"text":"Challenging algorithms and data structures every programmer should try","id":"challenging-algorithms-and-data-structures-every-programmer-shou"},{"level":2,"text":"Topological sort","id":"topological-sort"},{"level":2,"text":"Recursive descent parsing","id":"recursive-descent-parsing"},{"level":2,"text":"Myers string diff","id":"myers-string-diff"},{"level":2,"text":"Bloom filter","id":"bloom-filter"},{"level":2,"text":"Piece table","id":"piece-table"},{"level":2,"text":"Splay tree","id":"splay-tree"}]}}