Thanks for feedback. Could you share the discord link?

Made it more interested now?
EDIT: never mind. deleted and made a new one

It's just my first kata. I made it simple and focus more on familiarize myself with the authoring tool. My next one is gonna be more interesting ig.

I found no diplicates. And for sure not for your level ;)

Just checking the available ?? 0 would be enough instead of divsion to NaN. Recipe will always have some vlaue I guess

It can be simpler. Like move Math.floor outside of the inner loop...

Fortunately JS handles division by zero :)

Ugh, those ternaries :)

Basically same as mine but all in one function.

arr3 :)

Can it be shorter?

Although, author said you can return ties in an arbitrary order, there is a test like this:
("a a c b b"), ['a','b','c'])
where a and b have both 2 occurencies, the default sorting resulted into ['b','a','c']
so I had to add localeCompare for cases where it is a tie to sort words alphabetically

Generator algorithm is awesome. I have used it as well. Why do you need an additional set? Array look up by index should be even faster than set.has()