@@ -2,6 +2,10 @@ Please clone the starter code linked from Canvas (with `git clone --recursive` s
# Problem 1:
In the weighted directed graph on the whiteboard, what is the shortest path from `a` to `d`?
# Problem 2:
For a certain puzzle played on a string of digits, each move may slide any digit `x` left `x` places or right `x` places, as long as there is room. For example, the `4` in `123456789` can move right four spots:
> 123456789
...
...
@@ -18,10 +22,6 @@ but it cannot move left, because trying would move it past the end of the string
How many moves does it take to reverse the string `123`?
# Problem 2:
In the weighted directed graph on the whiteboard, what is the shortest path from `a` to `d`?
