Scribd
Upload
3 views7 pages

Leetcode

The document provides a comprehensive list of dynamic programming problems categorized into various types such as Linear DP, Knapsack, Multi Dimensions DP, and more. Each category includes links to specific problems on LeetCode for practice. It is intended as a resource for individuals looking to enhance their understanding and skills in dynamic programming algorithms.

Uploaded by

iammayank965
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views7 pages

Leetcode

The document provides a comprehensive list of dynamic programming problems categorized into various types such as Linear DP, Knapsack, Multi Dimensions DP, and more. Each category includes links to specific problems on LeetCode for practice. It is intended as a resource for individuals looking to enhance their understanding and skills in dynamic programming algorithms.

Uploaded by

iammayank965
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DATA STRUCTURE

ALGORITHMS

Dynamic Programming On

Just simplified my experience here…


@himanshu_shekhar16
Hope it goona help you all…

Save this pdf and thanks me later


Linear DP
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Knapsack

[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Multi Dimensions DP
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Interval DP
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Bit DP
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Digit DP
[Link]
[Link]
[Link]

Probability DP
[Link]
[Link]
[Link]

DP + Alpha (Tricks/DS)
[Link]
[Link]
[Link]
[Link]

Classic DP Problem
Cadane's Algorithm
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

LCS
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

LIS
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

2D Grid Traversal
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Cumulative Sum
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

DP on Trees

[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

String DP
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Memoization
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Math
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Feel Free to connect with me –


[Link]

You might also like