Kinda 1:1 Rust port

[yarcat]

Just for fun Rust port of this solution in case you interested https://github.com/yarcat/parkerwords-rs

These is one thing I'd like to as you about though - the skipped flag. It terminates the recursion early. Is it some kind of heuristics, or is there an actual background for the early termination? We, basically, never check further than two extra letters.

UPD: I think, I get it - it's due to the fact, that there cannot be more than 1 letter missing in the set. That's the reason we don't wanna make more "holes".

Cheers

[oisyn]

Your own answer is correct 🙂. Once we have skipped the one letter we're allowed to skip, we simply need to include each subsequent letter in the list.