Quicksort hip-hop, educational · 3:54 Quicksort breaks down one of computer science's most powerful sorting algorithms, showing how choosing a pivot and partitioning elements into smaller and larger groups can bring order to chaos through the elegant power of recursion.
Mergesort hip-hop, educational · 2:39 Mergesort breaks down the classic divide-and-conquer sorting algorithm, showing how splitting an array into halves and recursively sorting them leads to one of the most efficient sorting strategies in computer science.
Heapsort hip-hop, educational · 2:36 Heapsort breaks down one of computer science's most elegant sorting algorithms, teaching listeners how to transform a chaotic array into an ordered structure by building a max heap from the bottom up.
Insertion sort hip-hop, educational · 2:42 Insertion sort breaks down one of programming's classic sorting algorithms, showing how elements find their rightful place by comparing and shifting values from left to right until the entire list falls in perfect order.
Bubble sort hip-hop, educational · 2:54 Dive into bubble sort, one of the simplest sorting algorithms, and learn how elements are compared and swapped as larger values "sink" and smaller ones "bubble" to the top.
Radix sort hip-hop, educational · 2:23 Radix sort breaks down the mystery of one of the fastest sorting algorithms around, showing how processing numbers digit by digit — without any comparisons — can achieve lightning-fast linear time complexity.
Counting sort hip-hop, educational · 3:01 Counting sort breaks down a clever algorithm for sorting numbers within a known range, showing how tracking the frequency of each value can lead to lightning-fast results.
Timsort hip-hop, educational · 2:43 Timsort breaks down the clever hybrid sorting algorithm that powers Python and Java, revealing how Tim Peters combined merge sort and insertion sort to create a faster, adaptive solution built for real-world data patterns.
Binary search hip-hop, educational · 2:35 Binary search breaks down one of computer science's most powerful search techniques, showing how to efficiently locate any element in a sorted list by repeatedly halving the search space instead of checking every item.
Linear search hip-hop, educational · 2:49 Linear search breaks down one of programming's most fundamental algorithms, teaching you how to scan through an array step by step until you find your target value.
Interpolation search hip-hop, educational · 2:49 Interpolation search gets a hip-hop makeover as you discover how this smart algorithm outperforms binary search by using a value's proportion to predict its position rather than always splitting down the middle.
Exponential search hip-hop, educational · 2:58 Exponential search gets broken down step by step, showing how doubling bounds by powers of two makes finding targets in sorted arrays far faster than scanning every element.
Breadth-first search (BFS) hip-hop, educational · 2:39 Breadth-first search breaks down one of programming's most essential graph traversal algorithms, teaching listeners how BFS systematically explores nodes level by level using a queue to find the shortest path between points.
Depth-first search (DFS) hip-hop, educational · 2:29 Dive deep into the mechanics of Depth-First Search, a fundamental graph traversal algorithm that explores paths fully before backtracking, and learn how it works using both recursive and iterative approaches with a stack.
Dijkstra's algorithm hip-hop, educational · 2:44 Dive into Dijkstra's algorithm, the classic graph-traversal method for finding the shortest weighted path between nodes, and learn how a priority queue and smart distance tracking make it one of the most powerful tools in a programmer's toolkit.
Bellman-Ford algorithm hip-hop, educational · 2:51 A deep dive into the Bellman-Ford algorithm, breaking down how it finds shortest paths in weighted graphs even when negative edges are involved, and how it detects negative cycles that trip up other algorithms like Dijkstra.
Floyd-Warshall algorithm hip-hop, educational · 2:23 Dive into the Floyd-Warshall algorithm, where you'll learn how to find the shortest paths between every pair of nodes in a weighted, directed graph by building and updating a distance matrix through systematic intermediate vertex checks.
A* search hip-hop, educational · 2:19 Dive into the world of A* search, an intelligent pathfinding algorithm that upgrades Dijkstra's approach by using heuristic functions to efficiently guide the search toward its goal.
Topological sort hip-hop, educational · 2:15 Dive into topological sorting, where you'll learn how to untangle complex dependency graphs and arrange tasks in the right order using Kahn's algorithm and indegree tracking.
Tarjan's algorithm (strongly connected components) hip-hop, educational · 2:41 Dive into Tarjan's algorithm as it breaks down how to find strongly connected components in a graph using depth-first search, discovery times, and low-link values. You'll learn how the stack-based traversal efficiently identifies clusters of mutually reachable nodes in a single pass.
Kosaraju's algorithm hip-hop, educational · 2:49 Dive into Kosaraju's algorithm and discover how two depth-first search passes unlock the hidden strongly connected components within a graph, revealing clusters of vertices that can all reach each other.
Prim's algorithm hip-hop, educational · 2:24 Dive into Prim's algorithm, a powerful method for finding the minimum spanning tree in a weighted graph by strategically selecting the lowest-cost edges one at a time.
Kruskal's algorithm hip-hop, educational · 3:34 Dive into Kruskal's algorithm and discover how to find the minimum spanning tree of a weighted graph by sorting edges and using Union-Find to avoid cycles.
Knuth-Morris-Pratt (KMP) hip-hop, educational · 1:59 Dive into the Knuth-Morris-Pratt algorithm, a smarter approach to pattern searching that eliminates redundant comparisons by building a failure table to pick up exactly where a mismatch left off.
Rabin-Karp hip-hop, educational · 3:02 Dive into the Rabin-Karp string searching algorithm, where rolling hash techniques replace slow brute-force methods to efficiently locate patterns within text using polynomial hashing.
Boyer-Moore hip-hop, educational · 2:31 Dive into the Boyer-Moore string search algorithm and discover how two clever rules — bad character and good suffix — let you skip unnecessary comparisons and find patterns faster than brute-force scanning ever could.
Aho-Corasick hip-hop, educational · 2:42 Aho-Corasick breaks down one of computer science's most powerful string-searching algorithms, showing how to efficiently find multiple patterns in a single text using trie structures and linear time complexity.
Levenshtein distance (edit distance) hip-hop, educational · 2:54 Levenshtein distance breaks down how to measure the difference between two strings by counting the minimum number of insertions, deletions, and substitutions needed to transform one into the other. You'll learn how dynamic programming powers this essential edit distance algorithm from the ground up.
Fibonacci (memoized) hip-hop, educational · 2:39 Dive into the problem with naive recursive Fibonacci and discover how memoization eliminates redundant calculations to transform exponential time complexity into a lightning-fast solution.
Longest common subsequence hip-hop, educational · 2:24 Dive into the longest common subsequence problem, where dynamic programming unlocks how to find shared characters between two strings, even when they aren't side by side.
Longest increasing subsequence hip-hop, educational · 2:54 Dive into the Longest Increasing Subsequence problem, where dynamic programming breaks down how to find the longest chain of strictly rising numbers in an array by building solutions step by step from left to right.
Knapsack (0/1 and unbounded) hip-hop, educational · 3:02 Dive into the classic knapsack problem as dynamic programming breaks down how to maximize value within a weight limit, covering both the zero-one (use each item once) and unbounded (use items multiple times) variations through a systematic table-building approach.
Matrix chain multiplication hip-hop, educational · 2:36 Dive into the world of matrix chain multiplication and discover why the order you group matrices dramatically affects your computation cost. You'll learn how to find the optimal parenthesization that minimizes operations and keeps your algorithm running efficiently.
Coin change hip-hop, educational · 2:41 Dive into the classic coin change problem as dynamic programming breaks down how to minimize the number of coins needed to hit a target amount, building solutions from the ground up through both bottom-up and top-down approaches.
Edit distance hip-hop, educational · 2:59 Dive into the concept of edit distance, where you'll discover how to calculate the minimum number of insertions, deletions, and substitutions needed to transform one string into another using the power of dynamic programming.
Binary search tree operations hip-hop, educational · 2:34 Dive into the world of binary search trees as this track breaks down how data is organized, navigated, and inserted using the fundamental left-smaller, right-greater rule.
AVL tree rotations hip-hop, educational · 2:46 Dive into the world of AVL tree rotations and discover how to spot and fix unbalanced binary search trees using balance factors, single rotations, and double rotations to keep your data structure running at peak efficiency.
Red-black tree balancing hip-hop, educational · 2:50 Dive into the world of red-black trees and discover how this self-balancing data structure fixes the performance pitfalls of unbalanced binary trees by strategically coloring nodes red and black to keep searches lightning fast.
B-tree insertion/deletion hip-hop, educational · 2:29 Dive into the world of B-trees as this track breaks down how these powerful balanced data structures grow and shrink through insertion and deletion, covering key concepts like minimum degree, node splitting, and merging to maintain perfect balance from root to leaf.
Trie operations hip-hop, educational · 2:37 Diving deep into the world of tries, this track breaks down how to insert and navigate through tree structures, revealing how each character maps its own path through 26 possible branches.
Huffman coding hip-hop, educational · 2:25 Huffman coding breaks down one of the most powerful data compression techniques, showing how characters are assigned shorter or longer binary codes based on how often they appear. Listeners will walk away understanding how to build a Huffman tree from the ground up, turning raw frequency counts into an optimized encoding system.
Chaining hip-hop, educational · 2:29 Dive into the power of chaining operations together to transform data in clean, efficient sequences, learning how map, filter, and reduce link up through iterator patterns and lazy evaluation to keep your code flowing smoothly.
Open addressing (linear probing, quadratic probing, double hashing) hip-hop, educational · 2:44 Dive into open addressing, the collision-handling technique that keeps all data within a single array, as you master three powerful strategies — linear probing, quadratic probing, and double hashing — to efficiently resolve hash table conflicts.
Consistent hashing hip-hop, educational · 2:46 Consistent hashing solves the chaos of traditional hash tables when servers go down, revealing a smarter way to distribute and relocate data across nodes without disrupting your entire system.
Bloom filters hip-hop, educational · 2:41 Dive into the world of Bloom filters, a space-efficient probabilistic data structure that handles massive query loads without breaking a sweat. Learn how bit arrays and multiple hash functions work together to solve membership problems faster and leaner than traditional hash tables.
Strassen's matrix multiplication hip-hop, educational · 2:53 Dive into Strassen's matrix multiplication algorithm, a groundbreaking 1969 method that slashes the number of required multiplications from eight to seven, pushing beyond the standard N-cubed complexity to make large matrix operations significantly faster.
Karatsuba multiplication hip-hop, educational · 3:08 Dive into Karatsuba multiplication, a divide-and-conquer algorithm that crushes the inefficiency of traditional n-squared multiplication by splitting large numbers in half to dramatically speed up computation.
Closest pair of points hip-hop, educational · 2:54 Dive into the closest pair of points problem as this track breaks down how to escape the inefficiency of brute force and master the elegant divide and conquer approach. You'll learn how splitting, recursively solving, and merging can dramatically cut down computation time.
Activity selection hip-hop, educational · 2:39 Dive into the activity selection problem, a classic greedy algorithm challenge where you'll learn how to maximize the number of non-overlapping tasks by sorting them smartly by finish time.
Huffman coding hip-hop, educational · 3:04 Dive into the world of data compression as Huffman coding breaks down how variable-length encoding assigns shorter codes to frequent symbols, saving valuable space by building a frequency-based tree from the ground up.