Longest Common Subsequence in Ocaml
Question
Does someone know how to find the longest common subsequence of a set of strings in Ocaml language?
Solution
Look at other questions tagged "lcs", like Longest common subsequence of 3+ strings . Then you should be able to write the code in OCaml.
Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow