logo
episode-header-image
Jul 2020
16m 30s

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

Minko Gechev
About this episode
Today in less than 20 minutes, we'll explore what maps are and how they work under the hood. We'll talk about the differences between treemaps, hash maps, and hash tables. We'll dig pretty in-depth...By the end of the episode, you'll understand how to implement hash tables using an array, hash function, and a linked list! 
Up next
Jan 2025
Episode 23 - Building a minimal reactive framework
This episode explores building a minimal reactive framework using signals as a reactivity primitive. We'll look into implementing a simple component model, composing components, separating the view into static and dynamic parts, and implementing fine-grained reactivity. 
17m 54s
Jan 2025
Episode 22 - Signals
In this episode, we'll explore a concept called Signal that has been getting a lot of traction in JavaScript over the past few years. I'll describe a simple implementation so you can understand the internals and then see how it relates to the traditional object-oriented design pa ... Show More
11m 19s
Jun 2020
Episode 20 - Static and Dynamic Systems
Today we'll look into static and dynamic systems. We'll discuss what does it mean for a programming language or a framework to be static or dynamic. In the second part of the podcast, we'll focus on some of the properties of static systems and how they can help in better compile- ... Show More
13m 29s
Recommended Episodes
Mar 2022
The cost of Hash tables | The Backend Engineering Show
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
26m 14s
Aug 2022
Consistent Hashing | The Backend Engineering Show
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
24m 42s
Feb 2023
Better Science Volume 2: Maps, Metadata, and the Pyramid
Jump in on a second episode of the Better Science series with guest host and Technical Evangelist Justin Emerson interviewing FlashArray engineer Feng Wang about how Pure maps data at scale with a single, scalable data structure. Managing storage in modern times requires a strate ... Show More
46m 3s
Jun 2021
B-tree vs B+ tree in Database Systems
In this episode of the backend engineering show I'll discuss the difference between b-tree and b+tree why they were invented, what problems do they solve, and the advantages and disadvantages of both. I'll also discuss the limitation of implementing b-tree over b+tree and how Dis ... Show More
32m 38s
May 2022
Let’s talk sitemaps
A sitemap is a file where you provide information about the pages, videos, and other files on your site, and the relationships between them. In this episode of Search Off the Record, we sit down with Gary Illyes, John Mueller, and Lizzi Sassman to discuss all things sitemaps. How ... Show More
28m 21s
Feb 2016
[MINI] k-d trees
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
14m 11s
Dec 2022
Hashing It Out Personals: Dee Ferguson
In this Hashing It Out Personals episode, we flip the script and talk to Hashing It Out host, Dee Ferguson. You can also watch on YouTube. 
1h 1m
Jul 2020
#111 – Richard Karp: Algorithms and Computational Complexity
Richard Karp is a professor at Berkeley and one of the most important figures in the history of theoretical computer science. In 1985, he received the Turing Award for his research in the theory of algorithms, including the development of the Edmonds–Karp algorithm for solving th ... Show More
2h 8m
Feb 2024
What Is an ABA Contingency Map?
It can be tough for our learners to understand what they may have done wrong and how they can do it better. One of the best ways to guide them is with a contingency map. Here, we walk through the ins and outs of ABA contingency maps and how to utilize them in practice. We often u ... Show More
11m 23s