Algorithms

• Greedy Algorithms
• Breadth First Search (BFS)
• Depth First Search (DFS)
• Minimum Spanning Tree - Kruskal Algorithm
• Minimum Spanning Tree - Prim Algorithm
• Single Source Shortest Path (SSSP) - Dijkstra Algorithm
• Strongly Connected Components - Kosaraju Algorithm
• Topological Sorting
• Finding Cycles in an Undirected Graph
• Detect Strong Connectivity
• Detecting an Odd Cycle
• Connected Components in an Undirected Graph
• Huffman Encoding
• Maximum Flow Minimum Cut - Ford Fulkerson Algorithm
• Divide and Conqure Algorithms
• Quick Sort
• Merge Sort
• Quick Select
• Closest Points
• Squaring Integers
• Dynamic Programming Algorithms
• Knapsack Problem
• Subset Sum with Repetition (Knapsack Variation)
• Subset Sum without Repetition (Knapsack Variation)
• Edit Distance
• Bellman-Ford
• Other
• Bubble Sort