<commit_before>Suggest us Algorithms to add, just give us names [Here](https://docs.google.com/forms/d/16zan_258T14UBttNgXmgfAcgMU0nTRdE61l23F29EI4/viewform?usp=send_form)!
-------------------------------------------------------------
We have lots of links to add here...it will be updated soon!
### Index
* [Dynamic Programming](#dynamic-programming)
 - Matrix chain multiplication
 - Maximum SubArray Problem
 - Longest increasing Subsequece
 - Subset Sum problem
 - Dynamic Time Wrapping
 - Overlapping SubProblems
 - Word Wrap
 - Approximate String Mateching
* [Graph Algorithms](#graph-algorithms)
 - Minimum Spanning Tree
 - Coloring Algorithm
 - Bellman Ford Algorithm
 - Travelling Salesman problem
 - Iterative deepening depth-first search
 - Kruskal's algorithm
 - Longest Path Problem
 - Depth First Search
 - Prim's Algorithm
 - Topological Sorting
 - Transitive closure
* [Sort Algorithms](#sort-algorithms)
 - Bubble Sort
 - Selection Sort
 - Insertion Sort
 - Merge Sort
 - Quick Sort
* [String and String Pattern Matching](#string-and-string-pattern-matching)
 - Aho-Corasick string matching algorithm
 - Rabin-Karp Algorithm
 - Edit Distance
 - Longest Palindromic Substring
 - Longest Repeating Substring
 - Searching for Patterns
 - Knuth-Morris-Pratt Algorithm 
* [Optimization Algorithms](#optimization-algorithms)
 - AC-3 Algorithm
 - Alpha Beta Pruning
 - Ant colony optimization
 - Branch and Bound
 - Bees Algorithm
 - Chain Matrix Multiplication
 - Delayed Column Generation 
 - Constraint Satisfaction
* [Combinatorial Algorithms](#combinatorial-algorithms)
 - Binary Search Algorithm
 - Cycle Detection
 - Daitch-Mokotoff Soundex Coding
 - Double Metaphone Algorithm
 - Floyd Cycle Detection Algorithm
 - Fibonacci Search Algorithm
 - Fisher–Yates shuffle Algorithm 
 - General Problem Solver
 - Jump Point Search 
 - Kadane's Algorithm
 - Lagged Fibonacci Generators
* [Trees](#trees)
 - Andersson Tree
 - AVL Tree
 - AND/OR trees
 - Binary Tree
 - B-Tree
 - B-tree and UB-tree
 - BINARY HEAP
 * [Query Processing](#query-processing)
 - Fenwick trees
 - Segment Trees
 - Mo's Algorithm
 - Union Find Datastructure
 - Heavy Light Decomposition
* [Stack](#stack)
* [Queue](#queue)
* [Statics](#statics)
* [Heap](#heap)
* [Linked List](#linked-list)


### Dynamic Programming
* Matrix chain multiplication
 - [Article](http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Dynamic/chainMatrixMult.htm)
 - [PsuedoCode](http://en.wikipedia.org/wiki/Matrix_chain_multiplication)
 - [Video](http://www.youtube.com/watch?feature=player_embedded&v=u6Y055g4mOE)
* Maximum SubArray Problem
 - [Article](http://cs.slu.edu/~goldwasser/courses/slu/csci314/2012_Fall/lectures/maxsubarray/)
 - [Pseudocode](http://en.wikipedia.org/wiki/Maximum_subarray_problem)
 - [Video](http://www.youtube.com/watch?feature=player_embedded&v=MEPv8rP279I)
* Longest increasing Subsequece
 - [Article](http://www.lightoj.com/article_show.php?article=1000&language=english&type=pdf)
 - [Article](http://wcipeg.com/wiki/Longest_increasing_subsequence)
 - [Article](http://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/)
 - [Article](http://stackoverflow.com/questions/2631726/how-to-determine-the-longest-increasing-subsequence-using-dynamic-programming)
 - [Code](http://rosettacode.org/wiki/Longest_increasing_subsequence)
 - [Analysis](http://en.wikipedia.org/wiki/Longest_increasing_subsequence)
 - [Video](http://www.youtube.com/watch?feature=player_embedded&v=U-xOVWlcgmM)
* Subset Sum problem
 - [Article](http://www.geeksforgeeks.org/dynamic-programming-subset-sum-problem/)
 - [Article](http://en.wikipedia.org/wiki/Subset_sum_problem)
 - [Code](http://rosettacode.org/wiki/Subset_sum_problem)
 - [Analysis](http://en.wikipedia.org/wiki/Subset_sum_problem)
 - [Video](http://www.youtube.com/watch?feature=player_embedded&v=hi-Ec4jYyII#t=0)
* Dynamic Time Wrapping
 - [Article](http://web.science.mq.edu.au/~cassidy/comp449/html/ch11s02.html)
 - [Article](http://luscinia.sourceforge.net/page26/page16/page16.html)<commit_msg>fixed typo<commit_after>Suggest us Algorithms to add, just give us names [Here](https://docs.google.com/forms/d/16zan_258T14UBttNgXmgfAcgMU0nTRdE61l23F29EI4/viewform?usp=send_form)!
-------------------------------------------------------------
We have lots of links to add here...it will be updated soon!
### Index
* [Dynamic Programming](#dynamic-programming)
 - Matrix chain multiplication
 - Maximum SubArray Problem
 - Longest increasing Subsequece
 - Subset Sum problem
 - Dynamic Time Wrapping
 - Overlapping SubProblems
 - Word Wrap
 - Approximate String Mateching
* [Graph Algorithms](#graph-algorithms)
 - Minimum Spanning Tree
 - Coloring Algorithm
 - Bellman Ford Algorithm
 - Travelling Salesman problem
 - Iterative deepening depth-first search
 - Kruskal's algorithm
 - Longest Path Problem
 - Depth First Search
 - Prim's Algorithm
 - Topological Sorting
 - Transitive closure
* [Sort Algorithms](#sort-algorithms)
 - Bubble Sort
 - Selection Sort
 - Insertion Sort
 - Merge Sort
 - Quick Sort
* [String and String Pattern Matching](#string-and-string-pattern-matching)
 - Aho-Corasick string matching algorithm
 - Rabin-Karp Algorithm
 - Edit Distance
 - Longest Palindromic Substring
 - Longest Repeating Substring
 - Searching for Patterns
 - Knuth-Morris-Pratt Algorithm 
* [Optimization Algorithms](#optimization-algorithms)
 - AC-3 Algorithm
 - Alpha Beta Pruning
 - Ant colony optimization
 - Branch and Bound
 - Bees Algorithm
 - Chain Matrix Multiplication
 - Delayed Column Generation 
 - Constraint Satisfaction
* [Combinatorial Algorithms](#combinatorial-algorithms)
 - Binary Search Algorithm
 - Cycle Detection
 - Daitch-Mokotoff Soundex Coding
 - Double Metaphone Algorithm
 - Floyd Cycle Detection Algorithm
 - Fibonacci Search Algorithm
 - Fisher–Yates shuffle Algorithm 
 - General Problem Solver
 - Jump Point Search 
 - Kadane's Algorithm
 - Lagged Fibonacci Generators
* [Trees](#trees)
 - Andersson Tree
 - AVL Tree
 - AND/OR trees
 - Binary Tree
 - B-Tree
 - B-tree and UB-tree
 - BINARY HEAP
 * [Query Processing](#query-processing)
 - Fenwick trees
 - Segment Trees
 - Mo's Algorithm
 - Union Find Datastructure
 - Heavy Light Decomposition
* [Stack](#stack)
* [Queue](#queue)
* [Statics](#statics)
* [Heap](#heap)
* [Linked List](#linked-list)


### Dynamic Programming
* Matrix chain multiplication
 - [Article](http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Dynamic/chainMatrixMult.htm)
 - [PseudoCode](http://en.wikipedia.org/wiki/Matrix_chain_multiplication)
 - [Video](http://www.youtube.com/watch?feature=player_embedded&v=u6Y055g4mOE)
* Maximum SubArray Problem
 - [Article](http://cs.slu.edu/~goldwasser/courses/slu/csci314/2012_Fall/lectures/maxsubarray/)
 - [Pseudocode](http://en.wikipedia.org/wiki/Maximum_subarray_problem)
 - [Video](http://www.youtube.com/watch?feature=player_embedded&v=MEPv8rP279I)
* Longest increasing Subsequece
 - [Article](http://www.lightoj.com/article_show.php?article=1000&language=english&type=pdf)
 - [Article](http://wcipeg.com/wiki/Longest_increasing_subsequence)
 - [Article](http://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/)
 - [Article](http://stackoverflow.com/questions/2631726/how-to-determine-the-longest-increasing-subsequence-using-dynamic-programming)
 - [Code](http://rosettacode.org/wiki/Longest_increasing_subsequence)
 - [Analysis](http://en.wikipedia.org/wiki/Longest_increasing_subsequence)
 - [Video](http://www.youtube.com/watch?feature=player_embedded&v=U-xOVWlcgmM)
* Subset Sum problem
 - [Article](http://www.geeksforgeeks.org/dynamic-programming-subset-sum-problem/)
 - [Article](http://en.wikipedia.org/wiki/Subset_sum_problem)
 - [Code](http://rosettacode.org/wiki/Subset_sum_problem)
 - [Analysis](http://en.wikipedia.org/wiki/Subset_sum_problem)
 - [Video](http://www.youtube.com/watch?feature=player_embedded&v=hi-Ec4jYyII#t=0)
* Dynamic Time Wrapping
 - [Article](http://web.science.mq.edu.au/~cassidy/comp449/html/ch11s02.html)
 - [Article](http://luscinia.sourceforge.net/page26/page16/page16.html)
{'fraction_non_alphanumeric': 0.1381005037473891, 'fraction_numerical': 0.014498095589138714, 'mean_word_length': 4.334207077326344, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 2, 'lorem ipsum': 0, 'www.': 16, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1639255', 'n_tokens_mistral': 2832, 'n_tokens_neox': 2518, 'n_words': 486}