[English] Advent of code Day 9 Part 2 - O(nlogn) solution
27:01
[English] Reaching the O(Ef) time complexity upper bound - Ford-Fulkerson with DFS
46:01
Keynote: Advent of Code, Behind the Scenes - Eric Wastl
56:02
[English] 3348. Smallest Divisible Digit Product II Q4 Biweekly 143 [Hard]
31:33
The Oldest Unsolved Problem in Math
34:50
2024 Advent of Code, day 7
57:45
Visualizing transformers and attention | Talk for TNG Big Tech Day '24
23:03
[English] 3287. Find the Maximum Sequence Value of Array - Q3 Biweekly 139 [Hard]
4:50