Longest Common Subsequence in Ocaml
Pergunta
Does someone know how to find the longest common subsequence of a set of strings in Ocaml language?
Solução
Look at other questions tagged "lcs", like Longest common subsequence of 3+ strings . Then you should be able to write the code in OCaml.
Licenciado em: CC-BY-SA com atribuição
Não afiliado a StackOverflow