> For the complete documentation index, see [llms.txt](https://mayanktyagi3111.gitbook.io/interview-prep/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming.md).

# Dynamic Programming

- [Stone Game V](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/stone-game-v.md)
- [Maximum Sum Increasing Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-sum-increasing-subsequence.md)
- [Minimum Path Sum](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-path-sum.md)
- [Grid Unique Paths](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/grid-unique-paths.md)
- [Unique Paths II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/unique-paths-ii.md)
- [Climbing Stairs](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/climbing-stairs.md)
- [Total number of different staircase that can made from N boxes](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/total-number-of-different-staircase-that-can-made-from-n-boxes.md)
- [Number of Ways to Paint N × 3 Grid](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/number-of-ways-to-paint-n-3-grid.md)
- [Ways to color a 3xN Board](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/ways-to-color-a-3xn-board.md)
- [Unique Paths III](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/unique-paths-iii.md)
- [Decode Ways](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/decode-ways.md)
- [Decode Ways II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/decode-ways-ii.md)
- [Dungeon Game](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/dungeon-game.md)
- [Kingdom War](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/kingdom-war.md)
- [Coin Change](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled.md)
- [Triangle](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/triangle.md)
- [Minimum Falling Path Sum](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-falling-path-sum.md)
- [Minimum Falling Path Sum II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-falling-path-sum-ii.md)
- [Minimum Score Triangulation of Polygon](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-score-triangulation-of-polygon.md)
- [Minimum Cost For Tickets](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-cost-for-tickets.md)
- [Best Time to Buy and Sell Stock](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/best-time-to-buy-and-sell-stock.md)
- [Best Time to Buy and Sell Stock II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/best-time-to-buy-and-sell-stock-ii.md)
- [Best Time to Buy and Sell Stock III](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled-1.md)
- [Best Time to Buy and Sell Stock IV](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/best-time-to-buy-and-sell-stock-iv.md)
- [Best Time to Buy and Sell Stock with Cooldown](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/best-time-to-buy-and-sell-stock-with-cooldown.md)
- [Best Time to Buy and Sell Stock with Transaction Fee](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/best-time-to-buy-and-sell-stock-with-transaction-fee.md)
- [2 Keys Keyboard](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/2-keys-keyboard.md)
- [Perfect Squares](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/perfect-squares.md)
- [Longest Increasing Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/longest-increasing-subsequence.md)
- [Longest Bitonic Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/longest-bitonic-subsequence.md)
- [Maximal Rectangle](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximal-rectangle.md)
- [Maximal Square](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximal-square.md)
- [Maximum sum rectangle in a 2D matrix](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-sum-rectangle-in-a-2d-matrix.md)
- [Max Sum of Rectangle No Larger Than K](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/max-sum-of-rectangle-no-larger-than-k.md)
- [Coin Sum Infinite](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/coin-sum-infinite.md)
- [House Robber](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/house-robber.md)
- [House Robber II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/house-robber-ii.md)
- [House Robber III](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/house-robber-iii.md)
- [Jump Game](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/jump-game.md)
- [Jump Game II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/jump-game-ii.md): Remember stairs and ladder video from IDeserve
- [Jump Game III](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/jump-game-iii.md)
- [Integer Break](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/integer-break.md)
- [Edit Distance](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/edit-distance.md)
- [Rod Cutting](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/rod-cutting.md)
- [Number of Submatrices That Sum to Target](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/number-of-submatrices-that-sum-to-target.md)
- [Maximum Product Subarray](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-product-subarray.md)
- [Subarray Product Less Than K](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/subarray-product-less-than-k.md)
- [Arrange II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/arrange-ii.md)
- [Longest Common Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/longest-common-subsequence.md)
- [Shortest Common Supersequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/shortest-common-supersequence.md)
- [Longest Repeating Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/longest-repeating-subsequence.md)
- [Distinct Subsequences](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled-2.md)
- [Distinct Subsequences II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/distinct-subsequences-ii.md)
- [Constrained Subsequence Sum](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/constrained-subsequence-sum.md)
- [Max Sum Without Adjacent Elements](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/max-sum-without-adjacent-elements.md)
- [Maximum Points You Can Obtain from Cards](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-points-you-can-obtain-from-cards.md)
- [Largest area of rectangle with permutations](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/largest-area-of-rectangle-with-permutations.md)
- [Regular Expression Matching](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/regular-expression-matching.md)
- [Unique Binary Search Trees](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/unique-binary-search-trees.md)
- [Unique Binary Search Trees II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/unique-binary-search-trees-ii.md)
- [Count Balanced Binary Trees of Height h](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/count-balanced-binary-trees-of-height-h.md)
- [Word Break](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/word-break.md)
- [Word Break II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/word-break-ii.md)
- [Interleaving String](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/interleaving-string.md)
- [Longest Arithmetic Sequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/longest-arithmetic-sequence.md)
- [N digit numbers with digit sum S](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/n-digit-numbers-with-digit-sum-s.md)
- [Kth Manhattan Distance Neighbourhood](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/kth-manhattan-distance-neighbourhood.md)
- [Wildcard Matching](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/wildcard-matching.md)
- [Scramble String](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/scramble-string.md)
- [Palindrome Partitioning II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/palindrome-partitioning-ii.md)
- [Evaluate Expression To True](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/evaluate-expression-to-true.md)
- [0-1 Knapsack Problem](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/0-1-knapsack-problem.md)
- [Subset Sum Problem](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/subset-sum-problem.md)
- [Last Stone Weight II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/last-stone-weight-ii.md)
- [Target Sum](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/target-sum.md)
- [Ugly Number II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/ugly-number-ii.md)
- [Matrix Block Sum](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/matrix-block-sum.md)
- [Count Square Submatrices with All Ones](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/count-square-submatrices-with-all-ones.md)
- [Russian Doll Envelopes](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled-3.md)
- [Box Stacking Problem](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/box-stacking-problem.md)
- [Counting Bits](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled-4.md)
- [Longest Palindromic Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled-5.md)
- [Count Different Palindromic Subsequences](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/count-different-palindromic-subsequences.md)
- [Airplane Seat Assignment Probability](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/airplane-seat-assignment-probability.md)
- [Tushar's Birthday Party](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/tushars-birthday-party.md)
- [Flip Array](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/flip-array.md)
- [Intersecting Chords in a Circle](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/intersecting-chords-in-a-circle.md)
- [Stone Game](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/stone-game.md)
- [Numbers With Same Consecutive Differences](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/numbers-with-same-consecutive-differences.md)
- [Super Ugly Number](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/super-ugly-number.md)
- [LCS of three strings](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/lcs-of-three-strings.md)
- [Building Bridges](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/building-bridges.md)
- [Partition Equal Subset Sum](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/partition-equal-subset-sum.md)
- [Paint House](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/paint-house.md)
- [Paint House II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/paint-house-ii.md)
- [Paint House III](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/paint-house-iii.md)
- [Burst Balloons](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/burst-balloons.md)
- [Minimum and Maximum values of an expression with \* and +](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-and-maximum-values-of-an-expression-with-and-+.md)
- [Friends Pairing Problem](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/friends-pairing-problem.md)
- [Partition to K Equal Sum Subsets](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/partition-to-k-equal-sum-subsets.md)
- [Maximum sum Bi-tonic Sub-sequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-sum-bi-tonic-sub-sequence.md)
- [Number of Longest Increasing Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/number-of-longest-increasing-subsequence.md)
- [Maximum Length of Pair Chain](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-length-of-pair-chain.md)
- [Increasing Triplet Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/increasing-triplet-subsequence.md)
- [Cutting a Rod](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/cutting-a-rod.md)
- [Maximum Product Cutting](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-product-cutting.md)
- [Minimum insertions to form a palindrome](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-insertions-to-form-a-palindrome.md)
- [Optimal Binary Search Tree](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/optimal-binary-search-tree.md)
- [Count number of ways to partition a set into k subsets](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/count-number-of-ways-to-partition-a-set-into-k-subsets.md)
- [Egg Dropping Puzzle](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/egg-dropping-puzzle.md)
- [Optimal Strategy for a Game](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/optimal-strategy-for-a-game.md)
- [Mobile Numeric Keypad Problem](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/mobile-numeric-keypad-problem.md)
- [Find number of solutions of a linear equation of n variables](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/find-number-of-solutions-of-a-linear-equation-of-n-variables.md)
- [Count number of binary strings without consecutive 1’s](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/count-number-of-binary-strings-without-consecutive-1s.md)
- [Non-negative Integers without Consecutive Ones](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/non-negative-integers-without-consecutive-ones.md)
- [Ones and Zeroes](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/ones-and-zeroes.md)
- [Probability of Knight to remain in the chessboard](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/probability-of-knight-to-remain-in-the-chessboard.md)
- [Find if string is K-Palindrome or not](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/find-if-string-is-k-palindrome-or-not.md)
- [Shortest Uncommon Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/shortest-uncommon-subsequence.md)
- [Minimum Sum Path In 3-D Array](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-sum-path-in-3-d-array.md)
- [Longest Common Increasing Subsequence (LCS + LIS)](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/longest-common-increasing-subsequence-lcs-+-lis.md)
- [Perfect Sum Problem (Print all subsets with given sum)](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/perfect-sum-problem-print-all-subsets-with-given-sum.md)
- [Largest sum subarray with at-least k numbers](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/largest-sum-subarray-with-at-least-k-numbers.md)
- [Program to find amount of water in a given glass](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/program-to-find-amount-of-water-in-a-given-glass.md)
- [Number of Ways of Cutting a Pizza](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/number-of-ways-of-cutting-a-pizza.md)
- [Longest Increasing Path in a Matrix](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/longest-increasing-path-in-a-matrix.md)
- [Form Largest Integer With Digits That Add up to Target](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/form-largest-integer-with-digits-that-add-up-to-target.md)
- [Filling Bookcase Shelves](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/filling-bookcase-shelves.md)
- [Minimum ASCII Delete Sum for Two Strings](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-ascii-delete-sum-for-two-strings.md)
- [Arithmetic Slices II - Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/arithmetic-slices-ii-subsequence.md)
- [Beautiful Arrangement](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/beautiful-arrangement.md)
- [Count All Valid Pickup and Delivery Options](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/count-all-valid-pickup-and-delivery-options.md)
- [Largest Sum of Averages](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/largest-sum-of-averages.md)
- [Equal Average Partition](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled-7.md)
- [Maximum Length of Repeated Subarray](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-length-of-repeated-subarray.md)
- [Delete and Earn](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/delete-and-earn.md)
- [Find Eventual Safe States](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/find-eventual-safe-states.md)
- [Length of Longest Fibonacci Subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/length-of-longest-fibonacci-subsequence.md)
- [Max Dot Product of Two Subsequences](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/max-dot-product-of-two-subsequences.md)
- [Number of Dice Rolls With Target Sum](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/number-of-dice-rolls-with-target-sum.md)
- [Binary Trees With Factors](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/binary-trees-with-factors.md)
- [Predict the Winner](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/predict-the-winner.md)
- [Can I Win](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/can-i-win.md)
- [Delete Operation for Two Strings](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/delete-operation-for-two-strings.md)
- [Longest Arithmetic Subsequence of Given Difference](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/longest-arithmetic-subsequence-of-given-difference.md)
- [Cherry Pickup II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/cherry-pickup-ii.md)
- [Out of Boundary Paths](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/out-of-boundary-paths.md)
- [Two City Scheduling](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled-8.md)
- [Uncrossed Lines](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/uncrossed-lines.md)
- [Number of Ways to Wear Different Hats to Each Other](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/number-of-ways-to-wear-different-hats-to-each-other.md)
- [Largest 1-Bordered Square](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled-9.md)
- [Largest Divisible Subset](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/largest-divisible-subset.md)
- [Number of Music Playlists](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/number-of-music-playlists.md)
- [Jump Game V](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/jump-game-v.md)
- [Longest repeating and non-overlapping substring](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/longest-repeating-and-non-overlapping-substring.md)
- [Number of Paths with Max Score](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/number-of-paths-with-max-score.md)
- [Coin Path](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/coin-path.md)
- [Frog Jump](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/frog-jump.md)
- [Delete Columns to Make Sorted III](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/delete-columns-to-make-sorted-iii.md)
- [Equalize](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/equalize.md)
- [Maximum sum alternating subsequence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-sum-alternating-subsequence.md)
- [Minimum number of increasing subsequences](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-number-of-increasing-subsequences.md)
- [Paint Fence](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/paint-fence.md)
- [Count possible ways to construct buildings](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/count-possible-ways-to-construct-buildings.md)
- [Count Submatrices With All Ones](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/count-submatrices-with-all-ones.md)
- [Cherry Pickup](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/cherry-pickup.md)
- [Count of integers of length N and value less than K such that they contain digits only from the set](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/untitled-6.md)
- [Stone Game IV](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/stone-game-iv.md)
- [Number of subsequences of the form a^i b^j c^k](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/number-of-subsequences-of-the-form-a-i-b-j-c-k.md)
- [Highway Billboard Problem](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/highway-billboard-problem.md)
- [Tiling with Dominoes](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/tiling-with-dominoes.md)
- [Unbounded Knapsack (Repetition of items allowed)](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/unbounded-knapsack-repetition-of-items-allowed.md)
- [String Compression II](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/string-compression-ii.md)
- [Get the Maximum Score](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/get-the-maximum-score.md)
- [Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target.md)
- [Minimum Number of Days to Eat N Oranges](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/minimum-number-of-days-to-eat-n-oranges.md)
- [Odd Even Jump](https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming/odd-even-jump.md)


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://mayanktyagi3111.gitbook.io/interview-prep/dynamic-programming.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.