AlgorithmsThread 0: Hungarian for non Hungarians
The first broadcast of Algorithms Dead! This week I talk about the Hungarian algorithm, how to do Dijkstras in n^2, and alternating paths. Here is BenQ's USACO repository as mentioned in the video: https://github.com/bqi343/USACO Here is a solid Codeforces problem to test your implementation/understanding of how to use the algorithm as I mention at the end of the video: https://codeforces.com/contest/1354/p... And finally, here is Matt Fontaine's amazing 'Algorithms Live!' channel that inspired this video: / @algorithmslive

▶︎
The Munkres Assignment Algorithm (Hungarian Algorithm)

▶︎
Mastering Dynamic Programming - How to solve any interview problem

▶︎
The Strange Math That Predicts (Almost) Anything

▶︎
I implemented the `md5` algorithm in Bash with 0 external utilities

▶︎
How do we OPTIMALLY assign drivers to riders? (Hungarian Algorithm) | Bipartite Matchings

▶︎
Zig 2026: No-AI Policy, $670K Foundation, Left GitHub & Why Zig Isn’t 1.0 - Andrew Kelley Explains

▶︎
How To Think SO CLEARLY People Assume You're A Genius

▶︎
Everything you need to know about MEX operation

▶︎
Can we assign everyone a job? (maximum matchings) | Bipartite Matchings

▶︎
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup

▶︎
The French Do Not Care About Work
![A Deep Understanding of Dynamic Programming [Intro / Overview]](https://i.ytimg.com/vi/Clp5c7HvLqs/hqdefault.jpg?sqp=-oaymwEjCNACELwBSFryq4qpAxUIARUAAAAAGAElAADIQj0AgKJDeAE=&rs=AOn4CLB0iZLxgdGjY1Z2q48hYhSCBONKIQ)
▶︎
A Deep Understanding of Dynamic Programming [Intro / Overview]

▶︎
Dijkstras Shortest Path Algorithm Explained | With Example | Graph Theory

▶︎
40Hz Binaural Gamma Waves - Ultra Deep Concentration

▶︎
Algo Talk with SecondThread: Parade

▶︎
Co-Creator of Haskell: Functional Programming, Thinking in Types, Useless Languages | Simon Jones

▶︎
Training Sand to Think: Artificial General Intelligence & Future of Physics

▶︎
AlgorithmsThread 4: Segment Tree Beats

▶︎
