File tree Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -159,7 +159,7 @@ would fit.
159159For the 1-jolt gaps, you can look at it like this: how many ways are there to "hop through" the gaps when the maximum
160160step size is 3? For example: 1-1-1 has 4 possible ways to get through: a single 3-jolt hop, 2 - 1, 1 - 2 or 1 - 1 - 1
161161
162- So the answer to the overall paths possible is the product of all 1-jolt gap runs possibilities (broken by any amount
162+ So the answer to the overall paths possible is the product of all 1-jolt gap runs' possibilities (broken by any amount
163163of 3-jolt gaps)!
164164How many are there: turns out, this is the number of compositions of the length as a sum of the values 1, 2 and 3! In math
165- this is called an A-restricted composition!
165+ this is called an [ A-restricted composition] ( https://en.wikipedia.org/wiki/Composition_(combinatorics) ) .
You can’t perform that action at this time.
0 commit comments