# AoC 2015 Puzzle 11

###### Info

I solved this puzzle. You can find the code here, but I have yet to write a good explanation of the solution here. I will do this shortly, thank you for your patience.

## Day 11: Corporate Policy

Santa's previous password expired, and he needs help choosing a new one.

To help him remember his new password after the old one expires, Santa has devised a method of coming up with a password based on the previous one. Corporate policy dictates that passwords must be exactly eight lowercase letters (for security reasons), so he finds his new password by incrementing his old password string repeatedly until it is valid.

Incrementing is just like counting with numbers: xx, xy, xz, ya, yb, and so on. Increase the rightmost letter one step; if it was z, it wraps around to a, and repeat with the next letter to the left until one doesn't wrap around.

Unfortunately for Santa, a new Security-Elf recently started, and he has imposed some additional password requirements:

• 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.
• Passwords may not contain the letters i, o, or l, as these letters can be mistaken for other characters and are therefore confusing.
• Passwords must contain at least two different, non-overlapping pairs of letters, like aa, bb, or zz.

For example:

• hijklmmn meets the first requirement (because it contains the straight hij) but fails the second requirement requirement (because it contains i and l).
• abbceffg meets the third requirement (because it repeats bb and ff) but fails the first requirement.
• abbcegjk fails the third requirement, because it only has one double letter (bb).
• The next password after abcdefgh is abcdffaa.
• The next password after ghijklmn is ghjaabcc, because you eventually skip all the passwords that start with ghi…, since i is not allowed.

### Part 2

Santa's password expired again. What's the next one?

### Complete Solution

```boolean containsStraight(String candidate) {
return Pattern.matches(".*(abc|bcd|cde|def|efg|fgh|pqr|qrs|rst|stu|tuv|uvw|vwx|wxy|xyz).*", candidate);
}

boolean noForbiddenChars(String candidate) {
return !Pattern.matches(".*[iol].*", candidate);
}

boolean containsTwoPairs(String candidate) {
return Pattern.matches(".*(.)\\1.*(.)\\2.*", candidate);
}

boolean isValid(String candidate) {
if (containsStraight(candidate) &&
noForbiddenChars(candidate) &&
containsTwoPairs(candidate)) {
return true;
}
return false;
}

String increment(String candidate) {
return Long.toString(Long.parseLong(candidate, 36) + 1, 36).replace('0', 'a');
}

@Override
public String part1(List<String> input) {

}

}

@Override
public String part2(List<String> input) {