Skip to content
geeksforgeeks
  • Tutorials
    • Python
    • Java
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
    • Practice Coding Problems
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • DSA
  • Interview Problems on DP
  • Practice DP
  • MCQs on DP
  • Tutorial on Dynamic Programming
  • Optimal Substructure
  • Overlapping Subproblem
  • Memoization
  • Tabulation
  • Tabulation vs Memoization
  • 0/1 Knapsack
  • Unbounded Knapsack
  • Subset Sum
  • LCS
  • LIS
  • Coin Change
  • Word Break
  • Egg Dropping Puzzle
  • Matrix Chain Multiplication
  • Palindrome Partitioning
  • DP on Arrays
  • DP with Bitmasking
  • Digit DP
  • DP on Trees
  • DP on Graph
Open In App
Next Article:
DP Standard Problem Variations
Next article icon

DP Standard Problem Variations

Last Updated : 02 Dec, 2024
Comments
Improve
Suggest changes
Like Article
Like
Report

When we solve Dynamic Programming problems, we try to find a pattern by matching pattern with a standard DP problem. This is generally recommended to solve new DP problems.

Problems Based on Fibonacci

  • Nth Fibonacci Number
  • Climbing Stairs
  • Lucas Numbers
  • Dudeney's Cow
  • Tribonacci Numbers
  • Climbing Stairs with 3 Steps
  • Weighted Climbing Stairs
  • Decode Ways

Problems Based on Catalan

  • Nth Catalan Number
  • Count Unique BSTs
  • Count Valid Parenthesis
  • Dyck Words
  • Ways of Triangulation

LCS Based Problems

  • LCS of 2 Strings
  • LCS of 3 Strings
  • Printing LCS
  • Longest Palindromic Subsequence
  • Shortest Common Supersequence
  • Minimum Insertions and Deletions
  • Edit Distance
  • Minimum Insertions for Palindrome
  • Longest Common Substring
  • Longest Palindromic Substring
  • Longest Repeated Subsequence
  • Count Distinct Subsequences
  • Regular Expression Matching

LIS Based Problems

  • Length of LIS
  • LIS on Circular Array
  • Printing LIS
  • Count LISs
  • Max Sum Subsequence
  • Longest Arithmetic Subsequence
  • Longest Bitonic Subsequence
  • Longest Alternating Subsequence
  • Longest Common Increasing Subsequence
  • Building Bridges
  • Box Stacking

Partition DP Based Problem

  • Matrix Chain Multiplication
  • Boolean Parenthsization
  • Two Subsets with Equal Sum
  • Palindromic Partitioning
  • Partition Array for Max Sum
  • Burst Balloons
  • Rod Cutting

Problems Based on Knapsack

  • 0/1 Knapsack
  • Unbounded Knapsack
  • Double Knapsack
  • Subset Sum
  • Coin Change - Count Ways
  • Coin Change - Min Coins

Problems Based on Binomial Coefficient

  • Binomial Coefficient
  • Pascal's Triangle
  • Nth Row of Pascal Triangle
  • Count Paths in a Matrix

Next Article
DP Standard Problem Variations

K

kartik
Improve
Article Tags :
  • Dynamic Programming
  • DSA
  • Fibonacci
  • LIS
  • LCS
  • catalan
  • binomial coefficient
Practice Tags :
  • Dynamic Programming
  • Fibonacci
  • LCS

Similar Reads

    DP Problems Topic Wise
    DP Problems on MathsFibonacci NumbersTribonacci NumbersLucas NumberBinomial CoefficientPascal's Triangle GenerationNth Row of Pascal TriangleCatalan Number Matrix Chain MultiplicationDP Problems on StringsDecode WaysLongest Palindromic SubstringLongest Common SubstringEdit DistanceWord BreakPalindro
    1 min read
    SDE SHEET - A Complete Guide for SDE Preparation
    Here is a curated list of the most popular questions among important topics, such as Programming Languages, Data Structure and Algorithms (DSA), CS Subjects, Aptitude, etc, asked in the Software Development Engineer Interviews. This sheet contains a wide range of coding questions from different Data
    8 min read
    DP Problems Dimension Wise (1D, 2D and 3D)
    When we solve a Dynamic Programming (DP) problem, we store solution in an array. The dimensions of the array are dependent on number of variables that change in recursive (or optimal substructure) solution. If the recursive solution has only one dimension changing, then we call the problem as 1D DP
    1 min read
    IBM Placement Paper | Logical Reasoning Set - 5
    This is an IBM model placement paper on Logical Reasoning for placement preparation. This placement paper will cover logical reasoning questions that are asked in IBM recruitment drives and also strictly follows the pattern of questions asked in IBM interviews. It is recommended to solve each one of
    8 min read
    HCL Placement Paper | Logical Reasoning Set - 5
    This is an HCL model placement paper on Logical Reasoning for placement preparation. This placement paper will cover logical reasoning questions that are asked in HCL recruitment drives and also strictly follows the pattern of questions asked in HCL interviews. It is recommended to solve each one of
    7 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences