logo
episode-header-image
Jan 2020
19m 11s

Episode 5 - Arrays and Linked Lists

Minko Gechev
About this episode
In this episode, we'll discuss two fundamental data structures in computer science - arrays and linked lists. Their understanding is essential not only in your day to day job but also for performing well on your next coding interview. We'll discuss implementation details for both data structures, and we'll talk about when it's better to choose one instead o ... Show More
Up next
Dec 2025
Episode 25 - Micro Frontends Patterns
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
24m 51s
Dec 2025
Episode 24 - AI Agents
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! 
18m 38s
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
Recommended Episodes
Nov 2024
Mastering Algorithms: From Binary Search Trees to Dynamic Programming and Greedy Strategies
In this episode, we explore foundational algorithms and data structures that every developer and computer science enthusiast should know. Covering everything from Binary Search Trees (BSTs) to advanced concepts like Dynamic Programming and Greedy Algorithms, this episode is packe ... Show More
28m 3s
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
Aug 2021
Episode 55 - I Have A Little List
<p>When we have a list of information to display on the web or on a mobile device, there are a variety of tools that we can use to manage that list. But when it comes to voice - how do we make sure that list sounds correct (and something a user will listen to)? Allen and Mark dis ... Show More
29m 29s
Oct 2023
S3E5: The tastiest peach
<p>In this episode: It&#39;s a job interview special, packed with our tips for preparing for interviews so you can really excel, followed by our listeners&#39; tips so you can do the best on the day.</p> <p>- Shared passwords: <a href="https://support.apple.com/guide/iphone/share ... Show More
42m 47s
Jun 2021
B-tree vs B+ tree in Database Systems
<p><br></p> <p>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+t ... Show More
32m 38s
Jun 2025
Networks and Complexity
In this episode, Kyle does an overview of the intersection of graph theory and computational complexity theory. In complexity theory, we are about the runtime of an algorithm based on its input size. For many graph problems, the interesting questions we want to ask take longer an ... Show More
17m 49s
Dec 2017
Episode 01 - Sync vs aSync
We discuss two programming styles both have their advantages and disadvantages. Enjoy 
14m 59s
Oct 2016
1.2 Hardware Architecture
In this lecture we learn abut how the computer processes and stores programs. We learn about the CPU, Memory, Storage and Input / Output devices are brought together to write a program. 
12m 15s