Added longest common substring and subsequence

can you add a small blurb about how the problem is solved in the method docs?
 and a summary of the file at the top (see [here](https://github.com/araghava/algorithms/blob/master/graphs/shortest_paths.py#L1-L11) for an example)