DP Problems Dimension Wise (1D, 2D and 3D) Last Updated : 23 Jul, 2025 Comments Improve Suggest changes Like Article Like Report 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 because we need only dimensional array to store solutions of subproblems. Similarly, we define 2D and 3D DP. Below is classification of DP problems based on number of dimensions.1D Dynamic ProgrammingFibonacci numbersTribonacci NumbersLucas NumberClimbing StairsClimbing Stairs with 3 MovesWeighted Climbing Stairsnth Catalan NumberCount Unique BSTsCount Valid ParenthesisMin Sum in a TriangleHouse RobberDecode WaysWays to Partition a SetBinomial CoefficientPascal's TriangleNth Row of Pascal TriangleCutting a RodPartition a SetLongest Increasing SubsequenceNumber of LISs2D Dynamic ProgrammingPermutations with K InversionsLCS of 2 StringsPrinting LCSLongest Palindromic SubsequenceShortest Common SupersequenceMinimum Insertions and Deletions to TransformEdit DistanceMinimum Insertions for PalindromeLongest Common SubstringLongest Repeated SubsequenceWildcard MatchingRegular Expression Matching0/1 Knapsack Problem3D Dynamic ProgrammingLongest Subset with m 0s and n 1sLCS of 3 StringsCount Paths in a 3D GridDouble Knapsack Introduction to DP Visit Course Introduction to DP Dynamic Programming - Memoization Dynamic Programming - Tabulation Comment K kartik Follow Improve K kartik Follow Improve Article Tags : Dynamic Programming DSA Explore DSA FundamentalsLogic Building Problems 2 min read Analysis of Algorithms 1 min read Data StructuresArray Data Structure 3 min read String in Data Structure 2 min read Hashing in Data Structure 2 min read Linked List Data Structure 2 min read Stack Data Structure 2 min read Queue Data Structure 2 min read Tree Data Structure 2 min read Graph Data Structure 3 min read Trie Data Structure 15+ min read AlgorithmsSearching Algorithms 2 min read Sorting Algorithms 3 min read Introduction to Recursion 14 min read Greedy Algorithms 3 min read Graph Algorithms 3 min read Dynamic Programming or DP 3 min read Bitwise Algorithms 4 min read AdvancedSegment Tree 2 min read Binary Indexed Tree or Fenwick Tree 15 min read Square Root (Sqrt) Decomposition Algorithm 15+ min read Binary Lifting 15+ min read Geometry 2 min read Interview PreparationInterview Corner 3 min read GfG160 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding Platform 6 min read Problem of The Day - Develop the Habit of Coding 5 min read Like