Update 1544-make-the-string-great.md

Author: aaradhyasinghgaur

dsa-solutions/lc-solutions/1500-1599/1544-make-the-string-great.md

@@ -19,7 +19,7 @@ Given a string $s$ of lower and upper case English letters.
 A good string is a string which doesn't have two adjacent characters $s[i]$ and $s[i + 1]$ where:
 
 - $0 <= i <= s.length - 2$
-- $s[i]$ is a lower-case letter and $s[i + 1]$ is the same letter but in upper-case or vice-versa.
+- s[i] is a lower-case letter and s[i + 1] is the same letter but in upper-case or vice-versa.
 
 To make the string good, you can choose two adjacent characters that make the string bad and remove them. You can keep doing this until the string becomes good.
 
@@ -32,7 +32,7 @@ Notice that an empty string is also good.
 #### Example 1
 
 - **Input:** s = "leEeetcode"
-- **Output:** $"leetcode"$
+- **Output:** "leetcode"
 - **Explanation:** In the first step, either you choose $i = 1$ or $i = 2$, both will result $"leEeetcode"$ to be reduced to $"leetcode"$.