Neetcode Advanced DSA Course

Check the beginner course here

Contents of the course

1. Kadane's Algorithm
2. Sliding window fixed size
3. Sliding window variable size
4. Two pointers
5. Prefix sums
6. Last and Fast pointers
7. Trie
8. Union Find
9. Segment tree
10. Iterative Dfs
11. Two heaps
12. Sub-sets
13. Combination
14. Permutation
15. Dijkstra's
16. Prim's
17. Kruskal's
18. Topological sort
19. 0/1 Ksnapsack
20. Unbounded Knapsack
21. Lcs
22. Palindromes