-
A* Search / IDA* Search
- Article:
- Video:
- https://www.youtube.com/watch?v=DhtSZhakyOo
- https://www.youtube.com/watch?v=l9tWYsUnzkw (Heuristic value )
- https://www.youtube.com/watch?v=b19e0_NlD-U (8 Puzzle Problem )
- http://en.wikipedia.org/wiki/IDA* (Difference between A* & IDA*)
-
Bellman Ford
-
Euler Circuit/Path Print
-
Max Flow - Min Cut
-
Strongly Connected Component: (Kosaraju + Tarjan )
- Article :
- Article:
- Video:
Another way to find Max Sub-array by use 2 pointer : Suppose i & j 2 point . i+1 = left point of a sub array , j=right point of sub-array . We iterate j from left to right over our array and update our answer variable by max(answer, q_sum[j]-q_sum[i] ) . We update i if (array[i] > array[j] ) coz we all time try to cut out less value from our answer . R8 ?
-
Knuth morris pratt:
- Article:
- Video :
Note : In failure function of KMP , we build an array lps. lps[i] = the longest proper prefix of pat[0..i] which is also a suffix of pat[0..i].
-
Z algo
-
Suffix Array
-
String Hashing :
Double hashing with unordered_map require hash function to overload. Here is the function.
-
Article:
-
Problem Link:
-
Nim Game:
-
Staircase Case Nim:
-
Problem:
-
Segment Tree
- Article:
- (Segement Tree) http://www.shafaetsplanet.com/planetcoding/?p=1557
- (Lazy Propagation) http://www.shafaetsplanet.com/planetcoding/?p=1591
- Article:
-
Two Pointer
-
MO’s Algorithm
- Article:
- Video:
- [MO's with Update] (https://www.youtube.com/watch?v=gUpfwVRXhNY)
-
Trie / Prefix Tree / Radix Tree
-
Centroid Decomposition
-
Calculate (a^b)^c % mod
-
Gaussian Elimination