This site uses different types of cookies, including analytics and functional cookies (its own and from other sites). To change your cookie settings or find out more, click here. If you continue browsing our website, you accept these cookies.
A block with steps 113 can have the first 1 removed => so 2 possibilities A block with steps 1113 can have the first 1, second 1 or both removed => so 4 possibilities A block with steps 11113 can have first, second, third, first & second, first & third or second & third removed => so 7 possibilities
My data set had no 111113 but think would be 13 possibilities
You can then product these possibilities together to get the total number of possibilities
Still feels a little shonky though as it wouldn't automatically handle longer chains of 1's up to a 3. I went through a few different approaches in the disabled container but got lost until seeking help on the maths/logic.
Still working on Part 2, I am currently stuck down a rabbit hole of thinking there is a brute force binary solution to it by trying to generate a series of 1,0s between record 1 and 104 to act as a T|F flag and then to run my multi row. However that's too big, so trying to slim it down by spotting patterns, for example I know my start and end are fixed. and there are repeating 1,1,3 and 1,1,1,3s and know from experience with some of the previous AoCs now looking for patterns.
Took the idea of finding the patterns using regexcountmatch and then unwinding the fact that 3,1,1 appears in 3,1,1,1. It did mean to get the right answer I needed to hard code for sole 1,1 which occurs at the start of my workflow.
Check out my collaboration with fellow ACE Joshua Burkhow at AlterTricks.com