hotfix sweet_potatoes

data/course-revision/1511-22T3/sweet_potatoes.mdx

@@ -23,7 +23,7 @@ You know that everyone will want to taste your sweet potatoes as long as you can
 For each testcase, print three integers - the row and column index (starting from **0**) of the best position to place your cart, and the total number of people you will serve.
 
 The first line contains integer **m, n**.
-The next **m** lines will have **n** integers **r<sub>1</sub>, r*<sub>2</sub>, ...,r*<sub>n</sub>** denoting the density of people at that coordinate.
+The next **m** lines will have **n** integers **r<sub>1</sub>, r<sub>2</sub>, ...,r<sub>n</sub>** denoting the density of people at that coordinate.
 
 The output from your program should look **exactly** like this:
 
@@ -41,7 +41,7 @@ $ ./sweet_potatoes
 ### Assumptions/Restrictions/Clarifications
 
 $3 \leq m,   n \leq 10^5$  
- $0 \leq r<sub>i</sub> \leq 10^5$ for any $1 \leq i \leq n$.
+$0 \leq r<sub>i</sub> \leq 10^5$ for any $1 \leq i \leq n$.
 Note that this means your inputs will fit inside an `int`.
 
 If there exists multiple places where it is best to place your cart, any applicable answer is accepted.