The problem statement is missing a couple of constraints. One is stated as "obvious" in the video (no repeated paths), but strictly speaking, the problem is asking for the *shortest* possible paths. Getting from (0, 0) to (6, 6) in 18 steps is also a path, for example.
Yes it is obvious because if we could repeat paths, then the answer would be infinite. For your second point, there is no shortest possible path, all paths are moving 6 spaces to the right and 6 spaces up. (the questions not missing anything)
The problem statement is missing a couple of constraints. One is stated as "obvious" in the video (no repeated paths), but strictly speaking, the problem is asking for the *shortest* possible paths. Getting from (0, 0) to (6, 6) in 18 steps is also a path, for example.
Yes it is obvious because if we could repeat paths, then the answer would be infinite.
For your second point, there is no shortest possible path, all paths are moving 6 spaces to the right and 6 spaces up. (the questions not missing anything)
Hope this helps :)
cartesian cords has my pixel cord system brain scrambled
pixel coord is insane 😆
(12 choose 6)