Episode 9 - Sorting. Counting Sort.
Have you ever been frustrated during interviews thinking that your interviewer expects you to have memorized a bunch of sorting algorithms you'd never need in real life? In this episode of the podcas...
26 Helmi 202013min
Episode 8 - Decorator Pattern
Today you'll learn how at runtime, you can enhance the behavior or existing objects using the decorator pattern. In this episode, we'll discuss the advantages of decorators over inheritance and look ...
18 Helmi 202013min
Episode 7 - Tries
In the episode today, we'll talk about the trie data structure. You'll learn what tries are, how you can use them in practice, and how to implement them in your favorite programming language!
11 Helmi 202011min
Episode 6 - Graphs and Graph Traversal
In this episode, we'll discuss graphs. You'll learn how this data structure looks like and what are its applications. Later on, we'll talk about algorithms for traversing graphs. You'll understand how...
4 Helmi 202021min
Episode 5 - Arrays and Linked Lists
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 w...
26 Tammi 202019min
Episode 4 - Quickselect
Today we're going to talk about quickselect. This algorithm helps us quickly find the n-th smallest element in unsorted arrays. It'll not only help you improve the performance of your applications, bu...
21 Tammi 202010min
Episode 3 - Partial Application (not Currying)
Today we'll discuss partial application and currying. By the end of the episode, you'll understand what these two different concepts are how they are different from each other, and where you can apply...
14 Tammi 20209min
Episode 2 - Binary Search
Today we'll discuss the binary search algorithm. We'll go through several examples when the algorithm makes sense and discuss in detail how it works. By the end of the episode, you'll know when to app...
5 Tammi 202019min
