not a kata issue

• your code is wrong, you are returning an array with duplicates when a word is present with varying cases, e.g. for "a A a" you return ["a", "a"] instead of ["a"]
• as of now, the description states

  Matches should be case-insensitive, and the words in the result should be lowercased.

• "mods" and other people who fix katas are volunteers, not paid employees

Node 18.0+ enabled.

I changed that fixed test in JS so that there are no ties

duplicate issue

duplicate issue

duplicate issue

I see what you mean, but usually katas do not give hints in the description (e.g. things like "hint: you can use regexes" or "a recursive approach will be helpful", or "use dynamic programming"). It is up to you, the codewarrior, to find the right tool for the job.

That being said, I just added the regular expressions tag.

In your code, this line does not make sense, Array.isArray() takes a single parameter:

  if(!Array.isArray(...args)){

it is the return value of advice() that you have to check

updated to F# 6.0 + NUnit, using tuples

you use the value 17 for the handicap threshold instead of 7, not a kata issue

indeed, the PHP, Haskell and C# version have undue (since this kata is about how to define mutually recursive functions, not how to optimize the sequence generation) performance tests

there is an open issue regarding this

indeed, the PHP, Haskell and C# version have undue (since this kata is about how to define mutually recursive functions, not how to optimize the sequence generation) performance tests

there is an open issue regarding this

i think that i have found the cause of the bug and fixed it in this fork, but i still dont know Haskell so i'd be happy if an exeperienced Haskell programmer could review it

C fork:

• proper assertion messages
• proper random tests
• it is explained what type of pointers to return
• initial code no longer crashes