Data Structure and Algorithm Use full Links.

Hi all,
I need your help to make a list of most used data structures and algorithms along with their tutorials, implementation and some problems on them. It will be helpful to everyone in many ways. I request everyone to contribute to this list by providing links to tutorials, problems, etc. I will keep updating this list regularly.

1. Binary Search :
   Tutorial, Problems 2.7k, Tutorial, Implementation 703, Problem 743
2. Quicksort :
   Tutorial, Implementation 411, Tutorial 198
3. Merge Sort :
   Tutorial, Implementation 190, Tutorial 198
4. Suffix Array :
   Tutorial 425, Tutorial, Implementation 176, Tutorial, Implementation 74, Problem 101, Problem 51
5. Knuth-Morris-Pratt Algorithm (KMP) :
   Tutorial 320, Tutorial, Implementation 105, Tutorial 31, Problem 87
6. Rabin-Karp Algorithm :
   Tutorial, Implementation 154, Tutorial 29, Problem 30, Problem 22
7. Tries :
   Tutorial, Problems 214, Tutorial : I, 101 II 24, Tutorial 39, Problem 54, Problem 24, Problem 26
8. Depth First Traversal of a graph :
   Tutorial, Impelementation 219, Tutorial, Problems 144, Problem 79, Problem 36, Problem 24
9. Breadth First Traversal of a graph :
   Tutorial, Impelementation 83, Tutorial, Problems 144, Problem 31, Problem 17, Problem 10, Flood Fill 17
10. Dijkstra’s Algorithm :
    Tutorial, Problems 149, Problem 29, Tutorial(greedy) 31, Tutorial (with heap) 21, Implementation 28, Problem 13, Problem 15
11. Binary Indexed Tree :
    Tutorial, Problems 128, Tutorial 33, Original Paper 17, Tutorial 14, Tutorial 9, Problem 14, Problem 7,
    Problem 7, Problem 12, Problem 5, Problem 10, Problem 10
12. Segment Tree (with lazy propagation) :
    Tutorial, Implementation 109, Tutorial 34, Tutorial, Problems, Implementation 48, Tutorial, Implementation and Various Uses 30, Persistent Segment Tree: I 9, II 5, problems same as BIT, Problem 14, Problem 5/HLD is used as well/
13. Z algorithm :
    Tutorial, Problem 96, Tutorial 14, Tutorial 7, problems same as KMP.
14. Floyd Warshall Algorithm :
    Tutorial, Implementation 69, Problem 12, Problem 3
15. Sparse Table (LCP, RMQ) :
    Tutorial, Problems 48, Tutorial, Implementation(C++) 14, Java implementation 3
16. Heap / Priority Queue / Heapsort :
    Implementation, Explanation 62, Tutorial 29, Implementation 7, Problem 19, Chapter from CLRS
17. Modular Multiplicative Inverse 51
18. Binomial coefficients (nCr % M): Tutorial 32, Tutorial 5, Paper 5 (Link Not Working), Problem 8
19. Suffix Automaton :
    Detailed Paper 18, Tutorial, Implementation (I) 11, Tutorial, Implementation (II) 3, Problem, Problem 2, Problem 30, Problem 51, Tutorial, Implementation 3
20. Lowest Common Ancestor :
    Tutorial, Problems 56, Paper 10, Paper 7, Problem 10, Problem 4, Problem 8
21. Counting Inversions :
    Divide and Conquer 25, Segment Tree 11, Fenwick Tree 15, Problem 6
22. Euclid’s Extended Algorithm 28
23. Suffix Tree :
    Tutorial 25, Tutorial 4, Intro 4, Construction : I 1, II 2, Implementation 2, Implementation 1, Problem 1, Problem 1, Problem, Problem 1
24. Dynamic Programming :
    Chapter from CLRS(essential), Tutorial, Problems 108, Problem 45, Problem 11, Problem 9, Problem 7, Tutorial 14, Problem 3, Problem 3, Problem 8, Longest Increasing Subsequence 4, Bitmask DP 23, Bitmask DP 15, Optimization 6, Problem 4, Problem 4, Problem 1, Problem 1, Problem 1, Problem 2, Problem 3, DP on Trees : I 14, II 5
25. Basic Data Structures :
    Tutorial 113, Stack Implementation 61, Queue Implementation, Tutorial 25, Linked List Implementation 56
26. Logarithmic Exponentiation 31
27. Graphs :
    Definition, Representation 50, Definition, Representation 18, Problem 26, Problem 10
28. Minimum Spanning Tree :
    Tutorial 21, Tutorial, Kruskal’s Implementation 15, Prim’s Implementation 5, Problem 3, Problem 3, Problem 5, Problem 3, Problem 2
29. Efficient Prime Factorization 24
30. Combinatorics :
    Tutorial, Problems 103, Problem 17, Tutorial 27
31. Union Find/Disjoint Set :
    Tutorial 34, Tutorial, Problems 11, Problem 6, Problem 5, Problem 1
32. Knapsack problem :
    Solution, Implementation 63
33. Aho-Corasick String Matching Algorithm :
    Tutorial 21, Implementation 15, Problem 4, Problem 1, Problem 1, Problem 1
34. Strongly Connected Components :
    Tutorial, Implementation 17, Tutorial 2, Problem 2, Problem, Problem
35. Bellman Ford algorithm :
    Tutorial, Implementation 28, Tutorial, Implementation 2, Problem 2, Problem 1
36. Heavy-light Decomposition :
    Tutorial, Problems 19, Tutorial, Implementation 6, Tutorial 7, Implementation 2, Implementation 1, Problem 1, Problem 3, Problem 1
37. Convex Hull :
    Tutorial, Jarvis Algorithm Implementation 22, Tutorial with Graham scan 2, Tutorial, Implementation 4, Problem 2, Problem 2, Problem 1, Problem, Problem 1
38. Line Intersection :
    Tutorial, Implementation 23, Tutorial, Problems 4
39. Sieve of Erastothenes 30
40. Interval Tree :
    Tutorial, Implementation 26, Problem 3, Problem, Problem, Problem, Problem, Problem 1, Tutorial 2
41. Counting Sort 16
42. Probabilities 42
43. Matrix Exponentiation :
    Tutorial 25, Tutorial 4
44. Network flow :
    (Max Flow)Tutorial : I, 17 II 4, Max Flow(Ford-Fulkerson) Tutorial, Implementation 12, (Min Cut) Tutorial, Implementation 3, (Min Cost Flow)Tutorial : I, 3 II, 2 III 1, Dinic’s Algorithm with Implementation 3, Max flow by Edmonds Karp with Implementation 4, Problem, Problem, Problem, Problem, Problem, Problem, Problem 1, Problem, Problem 1, Problem, Problem, Problem 1, Problem, Problem, Problem 2
45. K-d tree :
    Tutorial 31, Tutorial 7, Implementation 10, Problem 4
46. Deque 24
47. Binary Search Tree :
    Tutorial, Implementation 50, Searching and Insertion 9, Deletion 4
48. Quick Select :
    Implementation 10, Implementation 2
49. Treap/Cartesian Tree :
    Tutorial(detailed) 14, Tutorial, Implementation 5, Uses and Problems 7, Problem, Problem
50. Game Theory :
    Detailed Paper 35, Tutorial, Problems 16, Grundy Numbers 2, Tutorial with example problems - I, 4 II, III, IV, Tutorial, Problems 1, Problem, Problem 1, Problem 3, Problem, Problem, Problem, Problem 1, Problem 1, Problem 1, Problem 1, Problem 1, Nim 3
51. STL (C++) :
    I, 153 II 67, Crash Course 221
52. Maximum Bipartite Matching 13
53. Manacher’s Algorithm :
    Implementation 11, Tutorial 8, Tutorial, Implementation 1, Tutorial, Implementation 2, Problem 3, Problem 2, Problem 4
54. Miller-Rabin Primality Test 9 and this 3
55. Stable Marriage Problem 24
56. Hungarian Algorithm 23, Tutorial 4
57. Sweep line Algorithm : I 13, II 3
58. LCP :
    Tutorial, Implementation 22, Tutorial, Implementation 6
59. Gaussian Elimination 18
60. Pollard Rho Integer Factorization 5, problem 1
61. Topological Sorting 11
62. Detecting Cycles in a Graph : Directed - I 11, II 3
    Undirected : I 3
63. Geometry : Basics 26, Tutorial 15
64. Backtracking :
    N queens problem 31, Tug of War 6, Sudoku 7
65. Eulerian and Hamiltonian Paths :
    Tutorial 4, Tutorial, (Eulerian Path and Cycle)Implementation 1, (Hamiltonian Cycle)Implementation 4
66. Graph Coloring :
    Tutorial, Implementation 28
67. Meet in the Middle :
    Tutorial 32, Implementation 5
68. Arbitrary Precision Integer(BigInt) 5, II 1
69. Radix Sort 1, Bucket Sort 1
70. Johnson’s Algorithm :
    Tutorial 23, Tutorial 3, Implementation 4
71. Maximal Matching in a General Graph :
    Blossom/Edmond’s Algorithm, Implementation 9, Tutte Matrix, Problem 2
72. Recursion : I, 36 II 9, Towers of Hanoi 13 with explanation 7
73. Inclusion and Exclusion Principle : I 15, II 1
74. Co-ordinate Compression 12
75. Sqrt-Decomposition :
    Tutorial 22, Tutorial 7, Problem 9, Problem 5
76. Link-Cut Tree :
    Tutorial 22, Wiki 2, Tutorial, Implementation 7, Problem 2, Problem 2, Problem 1, Problem 3
77. Euler’s Totient Function :
    Explanation, Implementation, Problems 30, Explanation, Problems 6
78. Burnside Lemma :
    Tutorial 19, Tutorial 6, Problem 9
79. Edit/Levenshtein Distance :
    Tutorial 17, Introduction 7, Tutorial 8, Problem 4, Problem 5
80. Branch and Bound 33
81. Math for Competitive Programming 359
82. Mo’s Algorithm : Tutorial and Problems 145