- Quicksort : Tutorial, Implementation, Tutorial
- Merge Sort : Tutorial, Implementation, Tutorial
- Depth First Traversal of a graph : Tutorial, Impelementation, Tutorial, Problems, Problem, Problem, Problem
- Breadth First Traversal of a graph : Tutorial, Impelementation, Tutorial, Problems, Problem, Problem, Problem,Flood Fill
- Dijkstra's Algorithm : Tutorial, Problems, Problem, Tutorial(greedy), Tutorial (with heap), Implementation,Problem, Problem
- Segment Tree (with lazy propagation) : Tutorial, Implementation, Tutorial, Tutorial, Problems, Implementation,Tutorial, Implementation and Various Uses, Persistent Segment Tree, problems same as BIT, Problem,Problem/HLD is used as well/
- Z algorithm : Tutorial, Problem, Tutorial, problems same as KMP.
- Heap / Priority Queue / Heapsort : Implementation, Explanation, Tutorial, Implementation, Problem, Chapter from CLRS
- Suffix Automaton : Detailed Paper, Tutorial, Implementation (I), Tutorial, Implementation (II), Problem,Problem, Problem, Problem, Tutorial, Implementation
- Dynamic Programming : Chapter from CLRS(essential), Tutorial, Problems, Problem, Problem, Problem,Problem, Tutorial, Problem, Problem, Problem, Longest Increasing Subsequence, Bitmask DP, Bitmask DP,Optimization, Problem, Problem, Problem, Problem, Problem, Problem, Problem, DP on Trees : I, II
- Basic Data Structures : Tutorial, Stack Implementation, Queue Implementation, Tutorial, Linked List Implementation
- Minimum Spanning Tree : Tutorial, Tutorial, Kruskal's Implementation, Prim's Implementation, Problem,Problem, Problem, Problem, Problem
- Knapsack problem : Solution, Implementation
- Heavy-light Decomposition : Tutorial, Problems, Tutorial, Implementation, Tutorial, Implementation,Implementation, Problem, Problem, Problem
- Line Intersection : Tutorial, Implementation, Tutorial, Problems
- Network flow : (Max Flow)Tutorial : I, II, Max Flow(Ford-Fulkerson) Tutorial, Implementation, (Min Cut) Tutorial, Implementation, (Min Cost Flow)Tutorial : I, II, III, Dinic's Algorithm with Implementation, Max flow by Edmonds Karp with Implementation, Problem, Problem, Problem, Problem, Problem, Problem, Problem, Problem,Problem, Problem, Problem, Problem, Problem, Problem, Problem
- Quick Select : Implementation, Implementation
- Treap/Cartesian Tree : Tutorial(detailed), Tutorial, Implementation, Uses and Problems, Problem, Problem
- Game Theory : Detailed Paper, Tutorial, Problems, Grundy Numbers, Tutorial with example problems - I, II, III,IV, Tutorial, Problems, Problem, Problem, Problem, Problem, Problem, Problem, Problem, Problem, Problem,Problem, Problem, Nim
- Manacher's Algorithm : Implementation, Tutorial, Tutorial, Implementation, Tutorial, Implementation, Problem,Problem, Problem
- Eulerian and Hamiltonian Paths : Tutorial, Tutorial, (Eulerian Path and Cycle)Implementation, (Hamiltonian Cycle)Implementation
- Graph Coloring : Tutorial, Implementation
- Meet in the Middle : Tutorial, Implementation
- Maximal Matching in a General Graph : Blossom/Edmond's Algorithm, Implementation, Tutte Matrix, Problem
- Euler's Totient Function : Explanation, Implementation, Problems, Explanation, Problems
- Mo's Algorithm : Tutorial and Problems
Thursday, 9 July 2015
ALL_ALGO_NEED_TO_DO
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment