Update intro-to-dp.md

mhayter · web-flow · commit d7bd15d2e1e7 · 2023-12-17T01:52:09.000-05:00
Update (mathjax) equation formatting
diff --git a/src/dynamic_programming/intro-to-dp.md b/src/dynamic_programming/intro-to-dp.md
@@ -80,7 +80,7 @@ These alternative ways of saving state are primarily useful when saving vectors
 ### *** Very important note***
 
 The layman's way of analyzing the runtime of a memoized recursive function is:
-$$** (work per subproblem) * (number of subproblems) **$$
+$${ \text{work per subproblem} * \text{number of subproblems} }$$
 
 
 Using a binary search tree (map in C++) to save states will technically result in $O(n \log n)$ as each lookup and insertion will take $O(\log n)$ work and with $O(n)$ unique subproblems we have $O(n \log n)$ time.
@@ -150,4 +150,4 @@ Of course, the most important trick is to practice.
 ## Practice Problems
 * [LeetCode - 1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/description/)
 * [LeetCode - 118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/description/)
-* [LeetCode - 1025. Divisor Game](https://leetcode.com/problems/divisor-game/description/)
+* [LeetCode - 1025. Divisor Game](https://leetcode.com/problems/divisor-game/description/)
