Thursday, 9 July 2015

ALL_ALGO_NEED_TO_DO

  1. Knuth-Morris-Pratt Algorithm (KMP) : TutorialTutorial, ImplementationTutorialProblem
  2. Rabin-Karp Algorithm : Tutorial, ImplementationTutorialProblemProblem
  3. Depth First Traversal of a graph : Tutorial, ImpelementationTutorial, ProblemsProblemProblemProblem
  4. Breadth First Traversal of a graph : Tutorial, ImpelementationTutorial, ProblemsProblemProblemProblem,Flood Fill
  5. Segment Tree (with lazy propagation) : Tutorial, ImplementationTutorialTutorial, Problems, Implementation,Tutorial, Implementation and Various UsesPersistent Segment Tree, problems same as BIT, Problem,Problem/HLD is used as well/
  6. Z algorithm : Tutorial, ProblemTutorial, problems same as KMP.
  7. Floyd Warshall Algorithm : Tutorial, ImplementationProblemProblem
  8. Heap / Priority Queue / Heapsort : Implementation, ExplanationTutorialImplementationProblem, Chapter from CLRS
  9. Lowest Common Ancestor : Tutorial, ProblemsPaperPaperProblemProblemProblem
  10. Counting Inversions : Divide and ConquerSegment TreeFenwick TreeProblem
  11. Suffix Tree : TutorialTutorialIntro, Construction : IIIImplementationImplementationProblemProblem,ProblemProblem
  12. Dynamic Programming : Chapter from CLRS(essential), Tutorial, ProblemsProblemProblemProblem,ProblemTutorialProblemProblemProblemLongest Increasing SubsequenceBitmask DPBitmask DP,OptimizationProblemProblemProblemProblemProblemProblemProblem, DP on Trees : III
  13. Combinatorics : Tutorial, ProblemsProblemTutorial
  14. Union Find/Disjoint Set : TutorialTutorial, ProblemsProblemProblemProblem
  15. Knapsack problem : Solution, Implementation
  16. Aho-Corasick String Matching Algorithm : TutorialImplementationProblemProblemProblemProblem
  17. Strongly Connected Components : Tutorial, ImplementationTutorialProblemProblemProblem
  18. Matrix Exponentiation : TutorialTutorial
  19. Quick Select : ImplementationImplementation
  20. STL (C++) : I, IICrash Course
  21. Detecting Cycles in a Graph : Directed - III Undirected : I
  22. Geometry : BasicsTutorial
  23. Backtracking : N queens problemTug of WarSudoku
  24. Graph Coloring : Tutorial, Implementation
  25. Meet in the Middle : TutorialImplementation
  26. Johnson's Algorithm : TutorialTutorialImplementation
  27. Maximal Matching in a General Graph : Blossom/Edmond's Algorithm, ImplementationTutte MatrixProblem
  28. Recursion : I, IITowers of Hanoi with explanation
  29. Sqrt-Decomposition : TutorialTutorialProblemProblem
  30. Burnside Lemma : TutorialTutorialProblem
  31. Edit/Levenshtein Distance : TutorialIntroductionTutorialProblemProblem
  32. Mo's Algorithm : Tutorial and Problems

No comments:

Post a Comment