Radio and PodcastLive Radio & PodcastsOpening Radio and Podcast...
Radio and PodcastLive Radio & PodcastsFetching podcast shows and categories...
Radio and PodcastLive Radio & PodcastsFetching podcast episodes...
Beginner-friendly computer science lessons based on Vaidehi Joshi's base.cs blog series, produced by CodeNewbie.
For our final episode, we answer your burning questions including the Base.cs origin story, Saron and Vaidehi's favorite niche data structur...
We've been talking a lot about the differences between compilers and interpreters, and how both of them work, and the ways that allowed one...
We have been talking a lot about compilers, and in this episode we discuss the differences between compilation versus interpretation. An int...
In this episode, we take our parse tree, an illustrated, pictorial version of the grammatical structure of a sentence, and we take a metapho...
In this episode, we get into what a compiler is and does. In short, a compiler is a program that reads our code (or any code, in any program...
In this episode, we get into parse trees, an illustrated, pictorial version of the grammatical structure of a sentence, which is important t...
We continue our journey with the Traveling Salesman Problem (TSP), where this we imagine a salesperson has to travel to every single city in...
We start our season off with something that often pops up in technical interviews: the Traveling Salesman Problem (TSP). In this problem, a...
In this last episode of the season we continue our discussion of dynamic programming, and show just how efficient it can be by using the Fib...
In this episode we talk about different paradigms and approaches to algorithmic design: the Divide and Conquer Algorithm, the Greedy Algorit...
We continue our talk about Dijkstra's algorithm, which can be used to determine the shortest path from one node in a graph to every other no...
In this episode, we talk about Dijkstra's algorithm, which can be used to determine the shortest path from one node in a graph to every othe...
We end our section of the DFS algorithm with a discussion on DAGs (directed acyclic graphs), because most implementations of depth-first sea...
Throughout our exploration of graphs, we’ve focused mostly on representing graphs, and how to search through them. We also learned about edg...
Last episode, we talked about traversing through a graph with the depth-first search (DFS) algorithm, which helps us determine one (of somet...
We ended last season by starting our discussion of searching, or traversing, through a graph with breadth-first search (BFS). The breadth-fi...
In this episode, we start our discussion of searching, or traversing, through a graph with breadth-first search (BFS). The breadth-first sea...
In this episode, we continue our discussion of representing graphs with adjacency lists -- a hybrid between an edge list and an adjacency ma...
Graphs come from mathematics, and are nothing more than a way to formally represent a network, which is a collection of objects that are all...
In last episode, we talked about 2-3 trees, where the nodes of every tree contain data in the form of keys, as well as potential child nodes...
We continue our discussion of tree data structures with 2-3 trees, where the nodes of every tree contain data in the form of keys, as well a...
In this episode, we are looking at a different type of self-balancing tree: red-black trees. By following four very important rules while we...
Last episode, we learned about AVL trees, a type of self-balancing binary search tree that follows a golden rule: no single leaf in the tree...
When you're dealing with data structures like trees, the balance of its "leaves" (data/nodes) matters. The moment a tree becomes unbalanced,...
In this episode, we continue our talk on Radix Trees and introduce the Practical Algorithm To Retrieve Information Coded In Alphanumeric tre...
In this episode, join us as we adventure into the safari that is radix trees, where parent nodes eat their offspring nodes as they chomp the...
In this episode we continue our talk on pies and tries, and how this data structure is used to power such things as auto-complete! Based on...
In this episode we go through some trie-als and tribulations to retrieve and build words using tries! Based on Vaidehi Joshi's blog post, "T...
This episode we're diving into radix sort! The word has no relation to Raid, so it is definitely non-toxic and you don't have to bug out. It...
You may have noticed that it's really hard to sort things efficiently. Well, that's where counting sort comes in! Based on Vaidehi Joshi's b...
We've gotten acquainted with heaps as arrays, now we're diving into heap sort with some help from a few condiments! Based on Vaidehi Joshi's...
So we've talked about heaps, but how do you represent heaps as arrays? And why would you want to? We break it down step by step! Based on Va...
Now that you've got your heap, what do you do with it? Shrink and grow it of course! We talk about how to add and remove values from a heap...
What are heaps? How are they related to binary trees? We use losers, winners, and some cards to help us get to the bottom of heaps! Based on...
How does quicksort perform? And how do variables, like the pivot number, affect it? We walk through three examples to find out! Based on Vai...
We learn all about our second "divide and conquer" algorithm, quick sort! We walk through how it works with help from a queendom, a few poin...
Finally, a sorting algorithm that doesn't suck! We explore how merge sort works and why it performs better than insertion, bubble, and selec...
We dig into how insertion sort works, how we know where to do our inserting, and how this sorting algorithm performs, all with the help of o...
We are super bubbly about bubble sort! We dig into our second sorting algorithm and break down how it works and why it's actually not a grea...
What is selection sort? How does this algorithm work? And just as importantly, how does it perform? We use broken books and cookies to tell...
We're at the end of the season! And to wrap things up, we're breaking down the last two ways to classify sorting algorithms: recursive vs. n...
Last week, we talked about two ways of classifying sorting algorithms: time complexity and space usage. This episode, we dig into two more!...
You probably sort things all the time -- files, clothes, dishes. But have you thought about how to categorize your sorting? How do your sort...
Sets are everywhere! If you've worked with relational databases, made a venn diagram, maybe touched some relational algebra, then you've alr...
Set theory might sound like a scary, super-math thing, but it's not! Well, it is a math thing, but it doesn't have to be super scary. In fac...
We're back in our hash table classroom with our multiple Brians that need their own tables! But don't you worry, we've got a brand new colli...
School is in session, and the teacher is directing students to their assigned seat. Each unique name gets its own unique table. But there's...
We're kicking off a new season with a brand new topic: hash tables! This episode is full of bookshelves, pizza toppings, and helpful fridge...
Let's break down how breadth-first search (BFS) actually works! We'll walk through a real example, explain the Big O notation of this algori...
We're going broad with breadth-first search! Well, actually, we're getting in line, or enqueuing ;) We walk through the steps of how breadth...