Skip to content

Commit db4cfef

Browse files
committed
fix typo and add link
1 parent ed23b92 commit db4cfef

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -159,7 +159,7 @@ would fit.
159159
For the 1-jolt gaps, you can look at it like this: how many ways are there to "hop through" the gaps when the maximum
160160
step 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
163163
of 3-jolt gaps)!
164164
How 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)).

0 commit comments

Comments
 (0)