You should return the NEXT biggernumber with the smae digits, not necessary the biggest one

Mentally tiring!

To aleviate any potential confusion for future warriors attempting the kata:

Path components of more than one word are given hyphenated. When creating the text content of a breadcrumb, you should:

• Initialize the path component without hyphens for path components with length greater than 30: (e.g. EEUU not E-E-U-U)
• Replace the hyphens with spaces for path components with 30 characters or less.

a url composed of more words separated by - and equal or less than 30 characters long needs to be just uppercased with hyphens replaced by spaces.

Looks like it is specified.

Why is this problem marked with a "recursion" tag? Did anyone at all use recursion for the solution? Seems that iterative is so straight forward, there's no need.

Then it's already reported as an issue here: https://www.codewars.com/kata/56f3ed90de254a2ca7000e20/discuss#62c5a34d1c2a720058b4d888

And the post below yours too mentions that.

golang, the number series must be sorted

Which language? Which error? Help us help you.

Error in random tests

I really appreciated this challenge—it truly made me think about sequential accumulation and iteration. Thanks for a well-designed problem!

Rejecting this so you can fork the right verson.

I thought the idea was to figure out the algorithm. Why do I have to deal with cases like this that are not mentioned in the description?

Index 9 out of bounds for length 9

expected:<1.1207839543935296E16> but was:<1.12078395439353E16>

What value do these add? First of all, we're talking about Fibonacci style sequences, so why are we working with doubles in the first place?

score of 0 wants score of 10-11

I think this is the best and simplest way.

• Made description language-agnostic + revamped with more examples taken from fixed tests

• Scrutinized tests

• Added useful assertion messages

• Removed reference solution

• Updated to Node 18. with mocha + chai assertions