Dynamic Programming
Last Updated :
19 Oct, 2024
Fibonacci numbers
nth Catalan Number
Bell Numbers
Ugly numbers
Binomial Coefficient
Permutation Coefficient
Tiling Problem
Gold Mine Problem
Coin change problem
Friends Pairing Problem
Subset Sum Problem
Subset with sum divisible by m
Largest divisible pairs subset
Perfect Sum Problem
Compute nCr % p
Choice of area
Cutting a Rod
Tiling with Dominoes
Painting Fence Algorithm
Newman–Shanks–Williams prime
Assembly line scheduling
Golomb sequence
Moser-de Bruijn Sequence
Newman-Conway Sequence
Find maximum length Snake sequence
Print n terms of Newman-Conway Sequence
Print Fibonacci sequence using 2 variables
Print Fibonacci Series in reverse order
Longest Common Subsequence
Longest Repeated Subsequence
Longest Increasing Subsequence
A Space Optimized Solution of LCS
LCS (Longest Common Subsequence) of three strings
Maximum sum Bi-tonic Sub-sequence
Maximum Sum Increasing Subsequence
Maximum product of an increasing subsequence
Fractional Knapsack Problem
Maximum Length Chain of Pairs
Print Maximum Length Chain of Pairs
Path with maximum average value
Largest Sum Contiguous Subarray
Smallest sum contiguous subarray
Lobb Number
Eulerian Number
Delannoy Number
Entringer Number
Rencontres Number
Jacobsthal and Jacobsthal-Lucas numbers
Floyd Warshall Algorithm
Bellman–Ford Algorithm
0-1 Knapsack Problem
Printing Items in 0/1 Knapsack
Unbounded Knapsack (Repetition of items allowed)
Temple Offerings
Egg Dropping Puzzle
Dice Throw Problem
Word Break Problem
Vertex Cover Problem
Tile Stacking Problem
Box-Stacking Problem
Highway Billboard Problem
Largest Independent Set Problem
Partition Problem
Print equal sum sets of array (Partition problem)
Travelling Salesman Problem
Longest Bitonic Subsequence
Printing Longest Bitonic Subsequence
Longest Palindromic Subsequence
Shortest Common Supersequence
Maximum sum alternating subsequence
Longest alternating subsequence
Shortest Uncommon Subsequence
Longest Repeating Subsequence
Count Distinct Subsequences
Count distinct occurrences as a subsequence
Longest Common Increasing Subsequence (LCS + LIS)
Printing Maximum Sum Increasing Subsequence
Longest Increasing Odd Even Subsequence
Count number of increasing subsequences of size k
Printing longest Increasing consecutive subsequence
Longest Zig-Zag Subsequence
Largest sum Zigzag sequence in a matrix
Weighted job scheduling
Mithlesh Upadhyay is a Computer Science and AI expert from Madhya Pradesh with strong academic background (BE in CSE and M.Tech in AI) and over six years of experience in technical content development. He has contributed tech articles, led teams, and worked in Full Stack Development and Data Science. He founded the w3colleges.org portal for learning resources.