*`B`[Primality Test](src/algorithms/math/primality-test) (trial division method)

*`B`[Euclidean Algorithm](src/algorithms/math/euclidean-algorithm) - calculate the Greatest Common Divisor (GCD)

*`B`[Least Common Multiple](src/algorithms/math/least-common-multiple) (LCM)

*`A`[Integer Partition](src/algorithms/math/integer-partition)

*`B`[Sieve of Eratosthenes](src/algorithms/math/sieve-of-eratosthenes) - finding all prime numbers up to any given limit

*`B`[Is Power of Two](src/algorithms/math/is-power-of-two) - check if the number is power of two (naive and bitwise algorithms)

*`B`[Pascal's Triangle](src/algorithms/math/pascal-triangle)

*`A`[Integer Partition](src/algorithms/math/integer-partition)

*`A`[Liu Hui π Algorithm](src/algorithms/math/liu-hui) - approximate π calculations based on N-gons

***Sets**

*`B`[Cartesian Product](src/algorithms/sets/cartesian-product) - product of multiple sets

*`B`[Fisher–Yates Shuffle](src/algorithms/sets/fisher-yates) - random permutation of a finite sequence

*`A`[Power Set](src/algorithms/sets/power-set) - all subsets of a set

*`A`[Permutations](src/algorithms/sets/permutations) (with and without repetitions)

*`A`[Combinations](src/algorithms/sets/combinations) (with and without repetitions)

*`B`[Fisher–Yates Shuffle](src/algorithms/sets/fisher-yates) - random permutation of a finite sequence

*`A`[Longest Common Subsequence](src/algorithms/sets/longest-common-subsequence) (LCS)

*`A`[Longest Increasing Subsequence](src/algorithms/sets/longest-increasing-subsequence)

*`A`[Shortest Common Supersequence](src/algorithms/sets/shortest-common-supersequence) (SCS)

*`A`[Knapsack Problem](src/algorithms/sets/knapsack-problem) - "0/1" and "Unbound" ones

*`A`[Maximum Subarray](src/algorithms/sets/maximum-subarray) - "Brute Force" and "Dynamic Programming" (Kadane's) versions

*`A`[Combination Sum](src/algorithms/sets/combination-sum) - find all combinations that form specific sum

***Strings**

*`A`[Levenshtein Distance](src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences

*`B`[Hamming Distance](src/algorithms/string/hamming-distance) - number of positions at which the symbols are different

*`A`[Levenshtein Distance](src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences

*`A`[Knuth–Morris–Pratt Algorithm](src/algorithms/string/knuth-morris-pratt) (KMP Algorithm) - substring search (pattern matching)

*`A`[Z Algorithm](src/algorithms/string/z-algorithm) - substring search (pattern matching)

*`A`[Rabin Karp Algorithm](src/algorithms/string/rabin-karp) - substring search

***Graphs**

*`B`[Depth-First Search](src/algorithms/graph/depth-first-search) (DFS)

*`B`[Breadth-First Search](src/algorithms/graph/breadth-first-search) (BFS)

*`B`[Kruskal’s Algorithm](src/algorithms/graph/kruskal) - finding Minimum Spanning Tree (MST) for weighted undirected graph

*`A`[Dijkstra Algorithm](src/algorithms/graph/dijkstra) - finding shortest path to all graph vertices

*`A`[Bellman-Ford Algorithm](src/algorithms/graph/bellman-ford) - finding shortest path to all graph vertices

*`A`[Detect Cycle](src/algorithms/graph/detect-cycle) - for both directed and undirected graphs (DFS and Disjoint Set based versions)

*`A`[Prim’s Algorithm](src/algorithms/graph/prim) - finding Minimum Spanning Tree (MST) for weighted undirected graph

*`B`[Kruskal’s Algorithm](src/algorithms/graph/kruskal) - finding Minimum Spanning Tree (MST) for weighted undirected graph

*`A`[Topological Sorting](src/algorithms/graph/topological-sorting) - DFS method

*`A`[Articulation Points](src/algorithms/graph/articulation-points) - Tarjan's algorithm (DFS based)

*`A`[Bridges](src/algorithms/graph/bridges) - DFS based algorithm

*`A`[Travelling Salesman Problem](src/algorithms/graph/travelling-salesman) - shortest possible route that visits each city and returns to the origin city

***Uncategorized**

*`B`[Tower of Hanoi](src/algorithms/uncategorized/hanoi-tower)

*`B`[Square Matrix Rotation](src/algorithms/uncategorized/square-matrix-rotation) - in-place algorithm

*`A`[N-Queens Problem](src/algorithms/uncategorized/n-queens)

*`A`[Knight's Tour](src/algorithms/uncategorized/knight-tour)

*`B`[Square Matrix Rotation](src/algorithms/uncategorized/square-matrix-rotation) - in-place algorithm

***Divide and Conquer** - divide the problem into smaller parts and then solve those parts

*`B`[Binary Search](src/algorithms/search/binary-search)

*`B`[Tower of Hanoi](src/algorithms/uncategorized/hanoi-tower)

*`B`[Pascal's Triangle](src/algorithms/math/pascal-triangle)

*`B`[Euclidean Algorithm](src/algorithms/math/euclidean-algorithm) - calculate the Greatest Common Divisor (GCD)

*`A`[Permutations](src/algorithms/sets/permutations) (with and without repetitions)

*`A`[Combinations](src/algorithms/sets/combinations) (with and without repetitions)

*`B`[Merge Sort](src/algorithms/sorting/merge-sort)

*`B`[Quicksort](src/algorithms/sorting/quick-sort)

*`B`[Tree Depth-First Search](src/algorithms/tree/depth-first-search) (DFS)

*`B`[Graph Depth-First Search](src/algorithms/graph/depth-first-search) (DFS)

*`A`[Permutations](src/algorithms/sets/permutations) (with and without repetitions)

*`A`[Combinations](src/algorithms/sets/combinations) (with and without repetitions)

***Dynamic Programming** - build up a solution using previously found sub-solutions

*`B`[Fibonacci Number](src/algorithms/math/fibonacci)

*`A`[Levenshtein Distance](src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences

In mathematics,**Pascal's triangle** is a triangular array of

the binomial coefficients.

The rows of Pascal's triangle are conventionally enumerated

starting with row`n = 0` at the top (the`0th` row). The

entries in each row are numbered from the left beginning

with`k = 0` and are usually staggered relative to the

numbers in the adjacent rows. The triangle may be constructed

in the following manner: In row`0` (the topmost row), there

is a unique nonzero entry`1`. Each entry of each subsequent

row is constructed by adding the number above and to the

left with the number above and to the right, treating blank

entries as`0`. For example, the initial number in the

first (or any other) row is`1` (the sum of`0` and`1`),

whereas the numbers`1` and`3` in the third row are added

to produce the number`4` in the fourth row.


The entry in the`nth` row and`kth` column of Pascal's

triangle is denoted.

For example, the unique nonzero entry in the topmost

row is.

With this notation, the construction of the previous

paragraph may be written as follows:


for any non-negative integer`n` and any

integer`k` between`0` and`n`, inclusive.

-[Wikipedia](https://en.wikipedia.org/wiki/Pascal%27s_triangle)

constleftCoefficient=(numIndex-1)>=0 ?previousLine[numIndex-1] :0;

constrightCoefficient=numIndex<previousLineSize ?previousLine[numIndex] :0;