Episode 21 - Maps, Hash Maps, Tree Maps, and ...

The episode is inspired by research I conducted a few years ago in which I interviewed hundreds of other senior engineers and architects building web applications at scale.I begin by introducing the concept of micro frontends and discussing when to use them versus relying on more ...  Show more

In this episode, we'll cover what AI agents are, how they work, common agentic implementation patterns, and how agents manage their context window. Enjoy! 

In this duo episode, Jason and Patrick introduce us to the world of hash maps, from buckets and hash functions, to differences between open and closed addressing, to minimal perfect hashes and locality sensitive hashing. A familiarity with hash maps is an oft-overlooked but hi ...

Hash tables are effective for caching, database joins, sets to check if something is in a list and even load balancing, partitioning and sharding and many other applications. Most programming languages support hash tables. However they don’t come without their cost and limitation ...  Show more

In this episode of the backend engineering show I discuss consistent hashing a very important algorithm in distributed computing specially in database systems such as Apache Cassandra and DynamoDB. 0:00 Intro 2:00 Problem of Distributed Systems 5:00 When to Distribute 7:00 Simple ...  Show more

This episode reviews the concept of k-d trees: an efficient data structure for holding multidimensional objects. Kyle gives Linhda a dictionary and asks her to look up words as a way of introducing the concept of binary search. We actually spend most of the episode talking about ...  Show more