Description for today’s challenge is here.
First, let’s encapsulate the three password requirements:
1) Passwords must include one increasing straight of at least three letters, like abc, bcd, cde, and so on, up to xyz. They cannot skip letters; abd doesn’t count.
2) Passwords may not contain the letters i, o, or l, as these letters can be mistaken for other characters and are therefore confusing.
3) Passwords must contain at least two different, non-overlapping pairs of letters, like aa, bb, or zz.
Any valid password would need to satisfy all three requirements:
Now that’s taken care of, let’s focus on the matter of increasing the password:
here we have broken up the logic into two smaller chunks:
- incrChar is responsible for return the incremented characters, and looping from ‘z’ to ‘a’
- incrAt increments the char at the specified index, and recurses to increment the next index if the aforementioned char loops around
Finally, let’s generate the sequence of all future passwords with an unfold, and find the first one that is a valid password:
Almost identical to Part 1, the only change is to skip the first valid password after the initial input: