Small touch-ups to prob.md in donuts and potoroo

Author: TianLangHin

competition/donuts/prob.md

@@ -11,7 +11,7 @@ points = 20
 difficulty = 2
 ---
 
-## 🍩 Homer's Donut Run 
+# 🍩 Homer's Donut Run 
 
 Homer Simpson is on a mission to visit a series of **Krispy Kreme** locations arranged in a circle. Each Krispy Kreme offers a certain number of **donuts** for him to collect. However, running between locations costs him some of his precious supply, as Homer **eats donuts for energy while running**. If he runs out of donuts at any point, he'll **collapse** from exhaustion.
 
@@ -26,7 +26,20 @@ Your task is to pinpoint the **starting Krispy Kreme's index** that allows Homer
 
 Rest assured, there's at most one valid starting point.
 
-**Example 1:**
+## Input
+
+The input prompt for this question will be 10 rows of numbers,
+representing 5 test cases.
+In each pair of lines of the input prompt,
+the first line in the pair represents the number of donuts at each house,
+while the second line in the pair represents the cost of journeying out of the respective house.
+
+### Constraints:
+
+* `1 <= donuts.length == cost.length <= 1000`
+* `0 <= donuts[i], cost[i] <= 1000`
+
+### Example 1:
 
 Input: `donuts = [1,2,3,4]`, `cost = [2,2,4,1]`
 Output: `3`
@@ -39,7 +52,7 @@ Explanation: If Homer starts at Krispy Kreme 3 (index 3) and grabs 4 donuts:
 * Runs to Krispy Kreme 3, eating 4 donuts. His stomach: 5 - 4 + 4 (from station 3) = 5 donuts.
 Homer makes it back to his starting point with donuts to spare, successfully avoiding a collapse!
 
-**Example 2:**
+### Example 2:
 
 Input: `donuts = [1,2,3]`, `cost = [2,3,2]`
 Output: `-1`
@@ -49,8 +62,3 @@ Homer can't start at Krispy Kreme 0 or 1, because he wouldn't have enough donuts
 If he starts at Krispy Kreme 2, he can run to Krispy Kreme 0, and then Krispy Kreme 1.
 At Krispy Kreme 1, his stomach: 0 + 3 (from station 2) - 2 (eaten to 0) + 1 (from station 0) - 2 (eaten to 1) = 0 donuts.
 He's now stuck at Krispy Kreme 1 with an empty stomach. Without any donuts to power him, he'll collapse right there and won't complete the circuit. D'oh!
-
-**Constraints:**
-
-* `1 <= donuts.length == cost.length <= 1000`
-* `0 <= donuts[i], cost[i] <= 1000`

competition/potoroo/prob.md

@@ -35,21 +35,17 @@ A single integer representing the minimum number of tasty bush snacks you need t
 
 ## Example
 
-**Input:**
+### Input
 ```
-
 1 0 2
-
 ```
 
-**Output:**
+### Output
 ```
-
 5
-
 ```
 
-**Explanation:**
+### Explanation
 
 You can distribute the snacks as follows:
 -   Potoroo 1 (activity 1): 2 snacks
@@ -61,4 +57,4 @@ This distribution satisfies all the conditions:
 -   Potoroo 1 (activity 1) has more snacks than its neighbor, Potoroo 2 (activity 0).
 -   Potoroo 3 (activity 2) has more snacks than its neighbor, Potoroo 2 (activity 0).
 
-The total number of snacks is `2 + 1 + 2 = 5`.
+The total number of snacks is `2 + 1 + 2 = 5`.