0/1 Knapsack

Note: This is a hard problem and not a straightforward DP Problem. Dependent problem — Men in Middle. Refer below videos

https://youtu.be/JUFHwaZjO_M

https://youtu.be/UoKGRTIZvM0

Unbounded knapsack

Fibonacci

LCS — Longest common subsequence

Longest Palindromic Subsequence

LIS — Longest increasing subsequence

Kadane’s algorithms

Matrix Chain Multiplication

Rod cutting

DP on trees

DP on graphs

DP on Grid

Sign up to discover human stories that deepen your understanding of the world.

Free

Distraction-free reading. No ads.

Organize your knowledge with lists and highlights.

Tell your story. Find your audience.

Membership

Read member-only stories

Support writers you read most

Earn money for your writing

Listen to audio narrations

Read offline with the Medium app

--

--

Responses (1)

Write a response