You are not logged in. Please login at to post your questions!


Difficulty in understanding longest common substring problem.

I have been trying to understand the longest common substring DP problem, but I am not able to understand it clearly. Anyone please explain this to me. I am more interested in theoretical aspect of this problem like what are the overllapping sub problems what is the optimal substructure how can we come up with recursive solution for this and then memoization.

I have seen lot of articles but people don't talk about aspects I am looking for.

Thanks in advance ;)

asked 09 Feb '18, 09:32

arpit728's gravatar image

accept rate: 10%

(10 Feb '18, 15:24) arpit7281★
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 09 Feb '18, 09:32

question was seen: 136 times

last updated: 10 Feb '18, 15:24