Travelling Salesman Problem - shortest possible route that visits each city and returns to the origin city
Uncategorized
Tower of Hanoi
N-Queens Problem
Knight's Tour
Brute Force - look at all the possibilities and selects the best solution
Maximum Subarray
Travelling Salesman Problem - shortest possible route that visits each city and returns to the origin city
Greedy - choose the best option at the current time, without any consideration for the future
Unbound Knapsack Problem
Dijkstra Algorithm - finding shortest path to all graph vertices
Prim’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph
Kruskal’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph
Divide and Conquer - divide the problem into smaller parts and then solve those parts
Binary Search
Tower of Hanoi
Euclidean Algorithm - calculate the Greatest Common Divisor (GCD)
Permutations (with and without repetitions)
Combinations (with and without repetitions)
Merge Sort
Quicksort
Tree Depth-First Search (DFS)
Graph Depth-First Search (DFS)
Dynamic Programming - build up to a solution using previously found sub-solutions
Fibonacci Number
Levenshtein Distance - minimum edit distance between two sequences
Longest Common Subsequence (LCS)
Longest Common Substring
Longest Increasing subsequence
Shortest Common Supersequence
0/1 Knapsack Problem
Integer Partition
Maximum Subarray
Bellman-Ford Algorithm - finding shortest path to all graph vertices
Backtracking - similarly to brute force try to generate all possible solutions but each time you generate a solution test if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise backtrack and go on a different path of finding solution
Hamiltonian Cycle - Visit every vertex exactly once
