dynamic programming: videos

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶Every Dynamic Programming Problem Is the Same 5 PatternsTech With NikolaNotes
   +Watch later
2. 2▶Why Does TCP Handshake Need 3 Messages? (Not 2, Not 1)Tech With NikolaNotes
   +Watch later
3. 3▶This tiny data structure saves incident.io millions of queriesTech With NikolaNotes
   +Watch later
4. 4▶What's Actually Happening Inside Your SSD?Tech With NikolaNotes
   +Watch later
5. 5▶Master Consistent Hashing for System Design InterviewsTech With NikolaNotes
   +Watch later
6. 6▶The enduring legacy of Google File System (GFS)Tech With NikolaNotes
   +Watch later
7. 7▶Optimal Control (CMU 16-745) 2024 Lecture 14: Optimizing RotationsOptimal Control 2024Notes
   +Watch later
8. 8▶Optimal Control (CMU 16-745) 2024 Lecture 13: Dealing with 3D RotationsOptimal Control 2024Notes
   +Watch later
9. 9▶Optimal Control (CMU 16-745) 2024 Lecture 12: Direct Trajectory OptimizationOptimal Control 2024Notes
   +Watch later
10. 10▶Optimal Control (CMU 16-745) 2024 Lecture 11: Differential Dynamic ProgrammingOptimal Control 2024Notes
    +Watch later
11. 11▶Can you earn money playing Blackjack? (The software engineer's approach)Tech With NikolaNotes
    +Watch later
12. 12▶Optimal Control (CMU 16-745) 2024 Lecture 10: Nonlinear Trajectory OptimizationOptimal Control 2024Notes
    +Watch later
13. 13▶Optimal Control (CMU 16-745) 2024 Lecture 9: Convex Model-Predictive ControlOptimal Control 2024Notes
    +Watch later
14. 14▶Optimal Control (CMU 16-745) 2024 Lecture 8: Controllability and Dynamic ProgrammingOptimal Control 2024Notes
    +Watch later
15. 15▶Optimal Control (CMU 16-745) 2024 Lecture 7: The Linear Quadratic Regulator Three WaysOptimal Control 2024Notes
    +Watch later
16. 16▶Optimal Control (CMU 16-745) 2024 Lecture 6: Deterministic Optimal Control IntroOptimal Control 2024Notes
    +Watch later
17. 17▶Optimal Control (CMU 16-745) 2024 Lecture 5: Optimization Pt. 3Optimal Control 2024Notes
    +Watch later
18. 18▶What's the algorithm behind git diff?Tech With NikolaNotes
    +Watch later
19. 19▶But, what is Virtual Memory?Tech With NikolaNotes
    +Watch later
20. 20▶Manual Neural Network plays Snake #coding #neat #ai #machinelearning #reinforcementlearningTech With NikolaNotes
    +Watch later
21. 21▶Snake learns with NEUROEVOLUTION (implementing NEAT from scratch in C++)Tech With NikolaNotes
    +Watch later
22. 22▶Mastering Dynamic Programming - How to solve any interview problemTech With NikolaNotes
    +Watch later
23. 23▶RSA Algorithm Explained + implementationTech With NikolaNotes
    +Watch later
24. 24▶How GIT works under the HOOD?Tech With NikolaNotes
    +Watch later
25. 25▶Introduction to Hash MapsTech With NikolaNotes
    +Watch later
26. 26▶Optimal Control (CMU 16-745) - Lecture 14: Optimization with QuaternionsOptimal Control 2022Notes
    +Watch later
27. 27▶Optimal Control (CMU 16-745) - Lecture 13: Dealing with 3D RotationsOptimal Control 2022Notes
    +Watch later
28. 28▶Optimal Control (CMU 16-745) - Lecture 12: Direct Trajectory Optimization MethodsOptimal Control 2022Notes
    +Watch later
29. 29▶Optimal Control (CMU 16-745) - Lecture 11: Differential Dynamic ProgrammingOptimal Control 2022Notes
    +Watch later
30. 30▶CSE201, Lec 15: Karatsuba multiplication and Strassen's matrix multiplicationCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
31. 31▶CSE201, Lec 14: Linear time selection using divide and conquerCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
32. 32▶Optimal Control (CMU 16-745) - Lecture 10: Nonlinear Trajectory OptimizationOptimal Control 2022Notes
    +Watch later
33. 33▶CSE201, Lec 13: Introduction to divide and conquer, Mergesort and the stock market problemCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
34. 34▶Optimal Control (CMU 16-745) - Lecture 9: Convex Model-Predictive ControlOptimal Control 2022Notes
    +Watch later
35. 35▶CSE201, Lec 12: Dijkstra's algorithms, All Pairs Shortest Paths, and matrix multiplicationCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
36. 36▶Optimal Control (CMU 16-745) - Lecture 8: Controllability and Dynamic ProgrammingOptimal Control 2022Notes
    +Watch later
37. 37▶CSE201, Lec 11: Single source shortest paths and the Bellman-Ford algorithmCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
38. 38▶Optimal Control (CMU 16-745) - Lecture 7: The Linear-Quadratic Regulator 3 WaysOptimal Control 2022Notes
    +Watch later
39. 39▶CSE201, Lec 10: Minimum Spanning TreesCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
40. 40▶Optimal Control (CMU 16-745) - Lecture 6: Deterministic Optimal ControlOptimal Control 2022Notes
    +Watch later
41. 41▶CSE201, Lec 9: Huffman codingCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
42. 42▶Optimal Control (CMU 16-745) - Lecture 5: Optimization Pt. 3Optimal Control 2022Notes
    +Watch later
43. 43▶CSE201, Lec 8: Greedy Algorithms; the Fractional Knapsack Problem and introduction to Huffman CodingCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
44. 44▶CSE201, Lec 7: Dynamic Programming for the Longest Common Subsequence and Optimal BST problemsCSE201, Winter 2022: Analysis of AlgorithmsNotes
    +Watch later
45. 45▶RL Chapter 5 Part3 (On-policy Monte-Carlo methods)Reinforcement Learning CourseNotes
    +Watch later
46. 46▶RL Chapter 5 Part2 (Monte-Carlo methods with exploring starts for control)Reinforcement Learning CourseNotes
    +Watch later
47. 47▶RL Chapter 5 Part1 (Monte-Carlo methods in Reinforcement Learning)Reinforcement Learning CourseNotes
    +Watch later
48. 48▶RL Chap4 Part2 (Dynamic Programming)Reinforcement Learning CourseNotes
    +Watch later
49. 49▶RL Chap4 Part1 (Dynamic Programming)Reinforcement Learning CourseNotes
    +Watch later
50. 50▶RL Chapter 3 Part3 (Bellman optimality equation and optimal policies)Reinforcement Learning CourseNotes
    +Watch later