please use the spoiler flag when posting anything related to the solution

The first run only uses 3 entries. Note the take(3) call.

thousandth!:)

I've learnd a lot by watching at your solution. Thank you!

Approved

Several issues:

• Needs to be updated to the latest version.
• Solution set up doesn't compile, with different errors in sample tests and attempt tests. The reference solution used in attempt tests isn't correctly set and relies on the user's code (missing imports...).

I've adapted @My-'s code to Rust 1.60 and rand::Rng +0.8.0 (Changelog 'gen_range(a, b) was replaced with gen_range(a..b)" ir order to compile the battery of tests.

very interesting challenge.. thank you ..

You can use find_map and destructuring (using |&n|) to make this more succint.

I have test my code with online compilers,even with diferent IDE's, and my shorter solution works, Idk why doesn't work here :/

Because:

For empty string return 0

Plus generated number should be the smallest possible number you can get.

So, any single letter -> 1