Name of file does not match with the algorithm implemented in that file.

[RAJ8664]

It would be better to rename the file : algorithms/map/longest_common_subsequence.py to algorithms/map/longest_common_substring.py, since the file provide the implementation for longest common substring.

Note that longest common subsequence is already implemented inside algorithms/dynamic_programing/...

[keon]

Confirmed — this is a real naming bug, not just a doc issue:

• algorithms/map/longest_common_subsequence.py actually implements longest common substring (the function inside is even named max_common_sub_string, the module docstring says "Longest Common Substring", and the reference URL is Longest_common_substring_problem).
• The true longest common subsequence already lives in algorithms/dynamic_programming/longest_common_subsequence.py (returns an int length via DP).

Suggested fix:

1. Rename algorithms/map/longest_common_subsequence.py → algorithms/map/longest_common_substring.py
2. Update the import in algorithms/map/__init__.py (line 12).
3. The exported symbol max_common_sub_string already reads correctly, so no test changes needed.

Happy to take a PR for this.

[RAJ8664]

@keon

Thanks for the review.

I was not able to find the implementation for printing any longest common subsequence.

Let me know if you want this to be implemented.

[keon]

@RAJ8664 Would love to have this

[RAJ8664]

@RAJ8664 Would love to have this

It is also possible to print all the longest common subsequences.
we can implement both of them.