Episode 5 - Arrays And Linked Lists
Listen now
Description
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 of the other. Along the way, we'll touch on memory hierarchy, caching locality, and different interview problems.
More Episodes
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...
Published 07/01/20
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-time...
Published 06/23/20
In this episode, we'll look at the very basics of type systems and their enforcement.
We'll discuss strongly and weakly typed languages. After that, we'll dig into different enforcement strategies - runtime with dynamic typing and compile-time with static typing.
Published 06/16/20
Links
Twitter
Facebook
Instagram
Patreon
Genres
Artwork or description wrong?
Request an update »
Updates may take a few minutes.
Do you host a podcast?
Track your ranks and reviews from Spotify, Apple Podcasts and more.
See hourly chart positions and more than 30 days of history.
Get Chartable Analytics »
See hourly chart positions and more than 30 days of history.
