The "Advanced Algorithms" course is a comprehensive guide to fundamental data structures and algorithms required to excel in technical interviews. This course is suitable for both beginners and those looking to deepen their knowledge of algorithms and data structures. Upon completion, you'll be well-prepared for successful technical interviews and proficient in solving a wide range of problems using advanced algorithms.
Advanced Algorithms
7h 36m 10s
English
Paid
About the Author: neetcode.io
Hi, I'm Navi. I created NeetCode in 2020 when I was unemployed and couldn't find a job. While I was struggling myself, it was still rewarding for me to make videos. I received so many messages from others who got jobs after watching my videos. It felt so gratifying and kept me going. About a year later I managed to get a job at Google.
Watch Online 22 lessons
0:00
/ #1: 0. Kadanes Algorithm
All Course Lessons (22)
| # | Lesson Title | Duration | Access |
|---|---|---|---|
| 1 | 0. Kadanes Algorithm Demo | 08:27 | |
| 2 | 1. Sliding Window Fixed Size | 21:42 | |
| 3 | 2. Sliding Window Variable Size | 16:04 | |
| 4 | 3. Two Pointers | 10:14 | |
| 5 | 4. Prefix Sums | 12:34 | |
| 6 | 5. Fast and Slow Pointers | 24:26 | |
| 7 | 6. Trie | 16:09 | |
| 8 | 7 - Union-Find | 20:22 | |
| 9 | 8 - Segment Tree | 27:15 | |
| 10 | 9 - Iterative DFS | 24:05 | |
| 11 | 10 - Two Heaps | 22:25 | |
| 12 | 11 - Subsets | 22:15 | |
| 13 | 12 - Combinations | 17:02 | |
| 14 | 13 - Permutations | 17:33 | |
| 15 | 14 - Dijkstra's | 22:45 | |
| 16 | 15 - Prim's | 23:53 | |
| 17 | 16 - Kruskal's | 11:20 | |
| 18 | 17 - Topological Sort | 30:05 | |
| 19 | 18 - 0 / 1 Knapsack | 28:15 | |
| 20 | 19 - Unbounded Knapsack | 29:58 | |
| 21 | 20 - LCS | 32:25 | |
| 22 | 21 - Palindromes | 16:56 |
Unlock unlimited learning
Get instant access to all 21 lessons in this course, plus thousands of other premium courses. One subscription, unlimited knowledge.
Learn more about subscription