Basic Algorithms and Data Structures

source : codechef

Binary Search : tutorial with problems, tutorial with implementation, problem
Quicksort : tutorial with implementation, tutorial with problems
Merge Sort : tutorial with implementation, tutorial with problems
Suffix Array : tutorial with implementation, tutorial with implementation, problem, problem, problem
Knuth-Morris-Pratt Algorithm (KMP) : tutorial, tutorial with implementation, problem, problem, problem
Rabin-Karp Algorithm : tutorial with implementation, tutorial, problem, problem
Tries : tutorial with problems, Tutorial : I, II, tutorial, problem, problem, problem
Depth First Traversal of a graph : tutorial with implementation, tutorial with problems, problem, problem, problem
Breadth First Traversal of a graph : tutorial with implementation, tutorial with problems, problem, problem, problem, Flood Fill
Dijkstra's Algorithm : tutorial with problems, problem, tutorial(greedy), tutorial (with heap), implementation, problem, problem
Binary Indexed Tree : tutorial with problems, tutorial, original paper, tutorial, tutorial, problem, problem, problem, problem,problem, problem
Segment Tree (with lazy propagation) : tutorial with implementation, tutorial, tutorial with problems and implementation,tutorial with implementation, Persistent Segment Tree, problems same as BIT, problem
Z algorithm : tutorial with problem, tutorial, problems same as KMP.
Floyd Warshall Algorithm : tutorial with implementation, problem, problem
Sparse Table(RMQ) : tutorial with problems, tutorial with implementation(C++), java implementation
Heap / Priority Queue / Heapsort : implementation with explanation, tutorial, implementation, problem, reading the chapter from clrs is highly recommended.
Modular Multiplicative Inverse
nCr % M
Suffix Automaton : detailed paper, tutorial with implementation (I), tutorial with implementation (II), problem, problem,problem, problem, tutorial with implementation
Lowest Common Ancestor : tutorial with problems, tutorial(binary tree) with implementation, detailed paper for LCA in DAGs, problem, problem
Counting Inversions : Divide and Conquer, Segment Tree, Fenwick Tree, problem
Euclid's Extended Algorithm
Suffix Tree : tutorial, tutorial, tutorial, tutorial, implementation, implementation, problem, problem, problem, problem
Dynamic Programming : chapter from clrs(essential), tutorial with problems, problem, 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 and tutorial, Linked list implementation
logarithmic exponentiation
Graphs : definition, representation, definition, representation, problem, problem
Minimum Spanning Tree : tutorial, tutorial with kruskal's implementation, Prim's implementation, problem, problem, problem,problem, problem
Efficient Prime Factorization
Combinatorics : tutorial with problems, problem
Union Find/Disjoint Set : tutorial, tutorial with problems, problem, problem, problem
Knapsack problem : solution and implementation
Aho-Corasick String Matching Algorithm : tutorial, implementation, problem, problem, problem, problem
Strongly Connected Components : tutorial with implementation, tutorial, problem, problem, problem
Bellman Ford algorithm : tutorial with implementation, tutorial with implementation, problem, problem
Heavy-light Decomposition : tutorial, tutorial, implementation, implementation, problem, problem, problem, problem, problem,problem, problem
Convex Hull : tutorial with jarvis's algorithm implementation, tutorial with graham scan, tutorial, implementation, problem,problem, problem, problem
Line Intersection : tutorial with imp., tutorial with problems
Sieve of Erastothenes
Interval Tree : tutorial with implementation, problem, problem, problem, problem, problem, problem, tutorial
Counting Sort
Probabilities
Building up the recurrence matrix to compute recurrences in O(logN) time
Network flow : (Max Flow)Tutorial : I, II, Max flow(ford-fulkerson) tutorial with implementation, (Min cut) tutorial with 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
K-d tree : tutorial, tutorial, implementation, problem
Deque
Binary Search Tree : tutorial with implementation, Searching and insertion, Deletion
Quick Select : implementation, implementation
Treap/Cartesian Tree : tutorial(detailed), tutorial with implementation, problem
Game Theory : detailed paper, tutorial with problems, Grundy numbers, Tutorial with example problems - I, II, III, IV, tutorial with problems, problem, problem, problem, problem, problem, problem, problem, problem, problem, problem, problem, Nim
STL (C++) : I, II, Crash Course
Maximum Bipartite Matching
Manacher's Algorithm : implementation, tutorial, tutorial with implementation, tutorial with implementation, problem, problem,problem
Miller-Rabin Primality Test : Code
Stable Marriage Problem
Hungarian Algorithm
Sweep line Algorithm : I, II
LCP : tutorial with implementation, tutorial with implementation
Gaussian Elimination
Pollard Rho Integer Factorization, problem
Topological Sorting
Detecting Cycles in a Graph : Directed - I, II Undirected : I
Geometry : Basics
Backtracking : N queens problem, Tug of War, Sudoku
Eulerian and Hamiltonian Paths : tutorial, tutorial, (eulerian path and cycle)implementation, (hamiltonian cycle)implementation
Graph Coloring : tutorial with implementation
Meet in the Middle : tutorial, implementation
Arbitrary Precision Integer(BigInt), II
Radix Sort, Bucket Sort
Johnson's Algorithm : tutorial, tutorial, implementation
Maximal Matching in a General Graph : Blossom/Edmond's Algorithm with implementation, Tutte Matrix, problem
Recursion : I, II, Towers of Hanoi with explanation
Inclusion and Exclusion Principle


Data Structures
Follow this map to review the data structure and algorithm, the knowledge points inside are thorough, interview data structure problems.

 The importance of data structures and algorithms must be emphasized. No matter what programming language you learn, no matter you are engaged in front-end, back-end, algorithm, data mining, machine learning, artificial intelligence and other positions, data structures and algorithms can not be bypassed. Language independence, position independence. Data structures and algorithms also appear frequently during interviews. Basically, more than 50% of the interview time will ask about this content. In this regard, do you dare not learn The following is the directory structure of the map.

Data Structures and Algorithms
Basic concepts & terminology
Data & Data Elements & Data Items & Data Objects
Logical structure & storage structure
Logical structure

Linear structure

Linear table

General linear table

Linear table
Special linear table

Stack and queue
String
Generalization of linear tables

Array
Generalized table
Nonlinear structure

Tree structure

tree

Binary tree

Graph structure

Directed graph

Undirected graph

Storage structure

Sequential storage structure

Chain storage structure

Data types & abstract data types
Algorithm & Algorithm Analysis
The algorithm is a limited sequence of operations specified to solve certain types of problems

Algorithm characteristics

Finite

Certainty

feasibility

Valid input

Algorithm output

Evaluation algorithm

Correctness

readability

Robustness

High efficiency

Algorithm efficiency analysis

Algorithm time complexity

Algorithm space complexity

Linear structure
Linear table
Sequential representation

Sequence table: logical & physical sequence are adjacent

Chain representation

Single list

Doubly linked list

Circular list

Comparison of linked list and sequence list

Spatial dimension comparison

Time dimension comparison

Interview questions for linked lists and sequence lists

Generalization of linear tables

Array

Generalized table

Stack
Definition & characteristics of stack

Last in first out

Stack representation & common operations

Sequential stack & chain stack

Stacking & Unstacking

Stack and recursion

Stack application

queue
Queue definition & characteristics

First in first out

Representation of queue & common operations

Circular queue & chain queue

Dequeue & Enqueue

Queue application

string
Concept of string

The structure of the string

Sequential storage

Chain storage

String matching algorithm

BF algorithm

KMP algorithm

Nonlinear structure
tree
Basic concepts of trees

Binary tree

Properties & storage structure

Binary tree traversal

Linear binary tree

The establishment of binary tree

Huffman tree

basic concept

Construction algorithm

Huffman coding

AVL tree

B tree

Fig
concept

Storage structure

Adjacency list

Adjacency matrix

Cross list

Adjacency multiple table

Edge set array

Traverse

Depth-first traversal

Breadth-first traversal

application

Minimum spanning tree

Shortest path

Topological sorting

Critical Path

Advanced data structure
Top-down stretch tree
Red black tree
insert

Rotate frequently when inserting

delete

Deterministic jump table
AA tree
treap tree
kd tree
Paired heap
algorithm
Find
concept

Linear table lookup

Sequential search

Binary search

Block search

Tree search

Binary tree lookup

AVL tree lookup

B-tree

B + tree

Hash lookup

concept

Conflict resolution

Sort
concept
Bubble Sort
Select sort
Insert sort
Hill Sort
Heap sort
Merge sort
Quick sort
Cardinality sorting
Bucket sorting
Sorting of large data structures
External sorting (non-memory sorting)
Graph theory algorithm
Greedy algorithm
Divide and conquer algorithm
Dynamic programming
Randomization algorithm
Backtracking algorithm
————————————————
https://blog.csdn.net/qq_38646470/java/article/details/104547401

Baidu search Dragon twelve can find my article.
————————————————
https://blog.csdn.net/qq_38646470/java/article/details/104547401