Open 4ndrelim opened 1 year ago
Soft deadline: Reading week Hard deadline: 16th Dec
Trees - BST, AVL, RB, Orthogonal Range Searching, kd-trees, interval trees Graphs - Bellman-ford, MST (Prim's, Kruskal's, Boruvska), topological sort & kahn's algor, Union Find
DP - Knapsack problems and bitmasking
Soft deadline: Reading week Hard deadline: 16th Dec
Trees - BST, AVL, RB, Orthogonal Range Searching, kd-trees, interval trees Graphs - Bellman-ford, MST (Prim's, Kruskal's, Boruvska), topological sort & kahn's algor, Union Find
DP - Knapsack problems and bitmasking