Register

Dynamic Programming: How to Approach these type of recurrence problems in DP?

• retagged by
478 views

1 Answer

1 votes
1 votes
Its  the algorithm of longest common subsequence

u have to learn the algorithms how they work

then u can understand what recurrence relation suits
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
kalpish asked Apr 8, 2015
1,055 views
common data Linked quetion :- 1) which of the following is correct recurrence formula of I(j) 2)how to evaluate this R.R
At the end of it's 5th Successful season,The siruseri Permier league is planning to give an award to most improved bowler over 5 years . For this an important Index will ...
User Avatar
1 votes
1 votes
0 answers
4
Nidhi Budhraja asked Sep 10, 2018
382 views
Ace Test Series: Algorithms - Dynamic Programming OBST
Consider an OBST with n=4, p[1..4]={3,3,1,1} q[0..4]={2,3,1,1,1} Cost of OBST=___? Pls give the solution for this question.
Consider an OBST with n=4,p[1..4]={3,3,1,1} q[0..4]={2,3,1,1,1}Cost of OBST=___?Pls give the solution for this question.
User Avatar
Link Copied!