Divide and conquer Dynamic Programming Backtracking Branch and Bound Greedy

Strassen's Algorithm Fibonacci Numbers N-Queens Problem Traveling Salesman Problem Minimum Spanning Tree
Karatsuba Algorithm Longest Common Subsequence Sudoku Solver Knapsack Problem Huffman Coding
Closest Pair Problem Knapsack Problem Knight's Tour Problem Job Shop Scheduling Problem Dijkstra's Algorithm
Maximum Subarray Problem Edit Distance Hamiltonian Cycle Problem Graph Coloring Problem Knapsack Problem
Counting Inversions Matrix Chain Multiplication Subset Sum Problem Integer Linear Programming Job Scheduling
Fast Fourier Transform (FFT) Coin Change Problem Graph Coloring Problem Maximum Clique Problem Fractional Knapsack Problem
Matrix Exponentiation Longest Increasing Subsequence Rat in a Maze Problem Minimum Spanning Tree Problem Activity Selection Problem
Convex Hull Maximum Subarray Sum Combination Sum Problem Set Cover Problem Interval Scheduling
Polynomial Multiplication Rod Cutting Problem Word Search Problem Bin Packing Problem Greedy Coloring
Majority Element 0/1 Knapsack Problem Cryptarithmetic Puzzle Resource-Constrained Project Scheduling Problem Prim's Algorithm
Closest Pair of Points in 2D Binomial Coefficient All Paths in a Graph Problem Vehicle Routing Problem Kruskal's Algorithm
Searching in Sorted and Rotated Arrays Traveling Salesman Problem Permutations of a String Quadratic Assignment Problem Coin Change Problem
Finding the k-th Smallest Element Subset Sum Problem Subset Generation Facility Location Problem Greedy Set Cover
Maximum Sum Subrectangle Shortest Path Problem Tug of War Problem Capacitated Facility Location Problem Greedy Graph Coloring
Tiling Problem Assembly Line Scheduling The Sum of Subsets Problem Maximum Independent Set Problem Optimal Merge Patterns
Counting Triangles Maximum Bipartite Matching Palindrome Partitioning Job Sequencing with Deadlines Greedy Load Balancing
Finding the Closest Point to a Line Partition Problem Letter Combinations of a Phone Number Resource-Constrained Shortest Path Problem Shortest Superstring Problem
Longest Common Subsequence Optimal Binary Search Tree Valid Parentheses Maximum Weighted Matching Problem Minimum Latency Problem
Finding the Closest Pair of Strings Stock Market Buy-Sell Problem Generate Parentheses Quadratic Knapsack Problem Greedy Facility Location
Optimal Binary Search Tree Minimum Cost Path Sudoku Solver with Backtracking Maximum Cut Problem Greedy Vertex Cover
Maximal Subarray Product Largest Rectangular Submatrix N-Rooks Problem Job Selection Problem Approximate String Matching
Maximum Subarray Sum Circular Longest Palindromic Subsequence Knights Tour Problem on a Chessboard Broadcast Scheduling Problem Maximum Coverage Problem
Inversion Count in an Array Word Break Problem Finding Connected Components in a Graph Sequential Ordering Problem Geometric Greedy Matching
Balanced Parentheses Problem Russian Doll Envelopes Generate All Possible IP Addresses Maximum k-Cut Problem Maximum Independent Set
Knight's Tour Problem Egg Dropping Puzzle Permutations of Unique Integers Cutting Stock Problem Minimum Dominating Set
Boolean Parenthesization Word Break Problem Multi-Objective Optimization Problems Greedy Set Packing
Largest Independent Set Solving Cryptic Crosswords Timetable Scheduling Problem Subset Sum Problem
Unique Paths Solving Crossword Puzzles Network Design Problem Greedy Sensor Placement
Largest Divisible Subset Solving Sudoku Variants (e.g., Killer Sudoku) Minimum Weighted Vertex Cover Problem Greedy Job Shop Scheduling
Bitmask DP (Subset Sum, TSP, etc.) Generating All Possible Combinations Load Balancing Problem Knapsack with Fractional Weights