I suggest to add more tests against exponential algorithms: current one can be passed by fortunately designed backtracking or heuristic.
E. g.,

wordBreak ["ab", "aba", "bab"] $ concat (replicate 100 "ab") ++ "b"

Half of current solutions fails on it.

It is, thank you.

That's issue #14. Note that kimhyunkang's last comment was three weeks ago, so it might take a while till (s)he reads your comment.

Could you please remove the issue? Some bug in codewars prevents me from ticking it as solved. :(

Thank you, for some reason I thought the last element was not included.

Sorry, I meant the test cases, where do those get a higher degree than 15?

Thanks for the feedback. Since I can't find it, could you show me where?

This should be fixed now, thanks !