|
| 1 | +# Java Template and Algorrithms |
| 2 | + |
| 3 | +Compilation of all the Java Algorithms, Datastrutures, Dynamic Programming, and Graph Theory templates that I currently know of |
| 4 | + |
| 5 | +Under the Java_Templates_Algorithms, you will find my Java template Algorithms to various types of questions (e.g. 0-1 Knapsack, which uses dp). The |
| 6 | +Algorithms are organized under the type of algorithm they use (Dp, Graph, etc...) |
| 7 | + |
| 8 | +Algorithm sets are organized into different folders |
| 9 | + |
| 10 | + > Algorithms |
| 11 | + |
| 12 | + - Array Rotation |
| 13 | + - Backtracking |
| 14 | + - Binary Search |
| 15 | + - Closest Two Points |
| 16 | + - Count Inversions |
| 17 | + - Cycle Detection (Brent and Floyd) |
| 18 | + - Majority |
| 19 | + - Meet In The Middle |
| 20 | + - Permutation Index |
| 21 | + - Sort |
| 22 | + - Ternary Search |
| 23 | + - Two Sat & an example |
| 24 | + |
| 25 | + > Datastructures |
| 26 | + - Arne Andersson Tree |
| 27 | + - Adelson-Velskii and Landis Tree |
| 28 | + - BTree |
| 29 | + - Binary Heap (EXTENDED) |
| 30 | + - Binary Indexed Tree (2D) |
| 31 | + - Deque |
| 32 | + - Difference Array (2D) |
| 33 | + - HashMap |
| 34 | + - Implicit Segment Tree |
| 35 | + - Implicit Treap |
| 36 | + - Interval Tree |
| 37 | + - KdTree |
| 38 | + - Link Cut Tree |
| 39 | + - Merge Tree |
| 40 | + - MinQueue |
| 41 | + - Peristent Binary Search Tree |
| 42 | + - Persistent Linked List |
| 43 | + - Persistent Segment Tree |
| 44 | + - Prefix Sum (2D) |
| 45 | + - Quad Tree |
| 46 | + - Randomized Queue |
| 47 | + - Range Tree |
| 48 | + - Red Black Tree |
| 49 | + - Segment Tree (recursive and non-recursive) |
| 50 | + - Size Balanced Tree |
| 51 | + - Skip List |
| 52 | + - Sparse Table |
| 53 | + - Splay Tree (complex and simple) |
| 54 | + - Treap (complex and simple) |
| 55 | + - Union Find |
| 56 | + |
| 57 | + |
| 58 | + > Dynamic Programming |
| 59 | + |
| 60 | + - Binomial Coefficients |
| 61 | + - Catalan Numbers |
| 62 | + - Coin Chang |
| 63 | + - Divide and Conquer |
| 64 | + - Domino Fill |
| 65 | + - Edit Distance |
| 66 | + - Egg Dropping |
| 67 | + - Hamming Sequence |
| 68 | + - 0-1 Knapsack |
| 69 | + - LCS (subsequence and substring) |
| 70 | + - LIS |
| 71 | + - Maximal Zero Submatrix |
| 72 | + - Maximum Subarray |
| 73 | + - Minimum Cost Triangulation |
| 74 | + - Minimum Matrix Chin Multiplication |
| 75 | + - Shortest Hamiliton Cycle & Path |
| 76 | + |
| 77 | + > Graph Theory |
| 78 | + |
| 79 | + - Bron Kerbsch |
| 80 | + - Centers |
| 81 | + - DFS Biconnected Components |
| 82 | + - DFS Bipartite |
| 83 | + - DFS Cycle Detection |
| 84 | + - DFS Eulerian |
| 85 | + - DFS Topological Sorting |
| 86 | + - LCA DP |
| 87 | + - LCA Euler |
| 88 | + - LCA HLd |
| 89 | + - Rooted Treelsome Morphism |
| 90 | + - Strongly Connected Components Ksaruju |
| 91 | + - Strongly Connected Components Tarjan |
| 92 | + - Topological Sorting (Simple edition) |
| 93 | + |
| 94 | + |
| 95 | + |
| 96 | + |
| 97 | + |
0 commit comments