diff --git a/graph-search/notes.md b/graph-search/notes.md
index 5dd07c3d220f6bb23c16c3eb2f1048a69dea1133..c20043c08156e8b861e99063c0563bdec5120b7b 100644
--- a/graph-search/notes.md
+++ b/graph-search/notes.md
@@ -2,9 +2,13 @@ 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  
+>  123456789
 >      >>>>
 
 which gives
@@ -13,15 +17,11 @@ which gives
 
 but it cannot move left, because trying would move it past the end of the string:
 
->  123456789  
+>  123456789
 > <<<<
 
 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`?
-
 ---------------------------------------------------------------------
 
 # Worklist Algorithms for Graph Search