⚡ Build the skills to land top-paying quant jobs. Offer ends in 17d 22h 58m 34s17 days 22 hours 58 minutes 34 seconds.
⚡ Build the skills to land top-paying quant jobs. Offer ends in 17d 22h 58m 34s17 days 22 hours 58 minutes 34 seconds.
Video course
Contest-level techniques, from Z-function to heavy-light decomposition. Short videos on contest-level techniques: string algorithms, combinatorics and games, number theory, advanced DP, graph algorithms like SCC and 2-SAT, heavy-light decomposition, segment trees and geometry, each followed by a quiz and judged practice problems.
11 modules · 67 lessons · 4 h 58 min
4:39Submask Enumeration and the 3ⁿ Bound
4:31Matrix Exponentiation and Fibonacci
4:06Extended Euclidean Algorithm
3:54Linear Diophantine Equations
4:13Linear Sieve & Smallest Prime Factor
4:38Primality Tests: Trial Division, Fermat, Miller–Rabin
2:46Linear Congruence Equations
4:22Chinese Remainder Theorem & Garner's Algorithm
5:09Euler's Totient Function and Euler's Theorem
4:21Factorials mod p and Legendre's Formula
4:17Arbitrary-Precision Integers
4:58Bridges & Articulation Points (Low-Link)
3:53Strong Orientation (Robbins' Theorem)
4:34Strongly Connected Components & Condensation
4:372-SAT
4:16Euler Paths & Circuits (Hierholzer)
5:00Bellman–Ford & SPFA
4:32Finding Negative Cycles (and Arbitrage)
4:07Paths of Fixed Length (Matrix Power, Min-Plus)
4:02Second-Best MST
5:21Kuhn's Algorithm: Maximum Bipartite Matching
4:47Sparse Table
4:38Fenwick - Range Updates, Range Queries, 2D, Prefix-Min
5:05DSU Extensions - Painting Offline, Distances and Parity, Arpa's Trick, Small-to-Large
3:44Sqrt Decomposition
4:03Mo's Algorithm
3:42Segment Tree - Custom Merges and Tree Descent
5:24Lazy Propagation
4:44Merge Sort Tree, Fractional Cascading, 2D Segment Trees
4:00Dynamic (Sparse - Implicit) Segment Tree
4:51RMQ Survey - Choosing the Structure
5:13Randomized (Meldable) Heap