vsanjay_nitdgp's blog

horrible confusion
By vsanjay_nitdgp, history, 9 years ago, In English

i solved "longest common subsequnce" problem....there the elements need not to be contiguous....but whn i saw a video on maximum subsequence sum....he said sequnce has to be contiguous.....

i am confused which one to follow....

pls clear...

Tags dp
  • Vote: I like it
  • +2
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

When in doubt about a term, you can always use Google. For common terms, the first few links will provide the same right definition.

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

If you are interesting in dynamic programming try these videos this is a helpful playlist,it's all about dynamic programming :)

→ Reply
»
9 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

In some string problem, usually subsequence need not to be contiguous, substring need to be contiguous. Anyway, read the problem statement carefully, maybe statement has explained this.

→ Reply