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

Author: aaradhyasinghgaur

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

@@ -3,17 +3,6 @@ id: make-the-string-great
 title: Make The String Great (Leetcode)
 sidebar_label: 1544-MakeTheStringGreat
 description: 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.
-
-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.
-
-Return the string after making it good. The answer is guaranteed to be unique under the given constraints.
-
-Notice that an empty string is also good.
 ---
 
 ## Problem Description
@@ -42,7 +31,7 @@ Notice that an empty string is also good.
 
 #### Example 1
 
-- **Input:** $s = "leEeetcode"$
+- **Input:** s = "leEeetcode"
 - **Output:** $"leetcode"$
 - **Explanation:** In the first step, either you choose $i = 1$ or $i = 2$, both will result $"leEeetcode"$ to be reduced to $"leetcode"$.
 
@@ -52,20 +41,20 @@ Notice that an empty string is also good.
 - **Input:** $s = "abBAcC"$
 - **Output:** $""$
 - **Explanation:** We have many possible scenarios, and all lead to the same answer. For example:</br>
-$"abBAcC"$ --> $"aAcC"$ --> $"cC"$ --> $""$
-$"abBAcC"$ --> $"abBA"$ --> $"aA"$ --> $""$
+"abBAcC" --> "aAcC" --> "cC" --> ""
+"abBAcC" --> "abBA" --> "aA" --> ""
 
 #### Example 2
 
-- **Input:** $s = "s"$
-- **Output:** $"s"$
+- **Input:** s = "s"
+- **Output:** "s"
 
 
 ### Constraints
 
 
 - $1 <= s.length <= 100$
-- $s$ contains only lower and upper case English letters.
+- s contains only lower and upper case English letters.
 
 
 
@@ -180,4 +169,4 @@ public:
 
 ### Conclusion
 
-The code efficiently creates a "good" string by removing adjacent pairs of characters where one is the uppercase version of the other. It uses a StringBuilder to store and manipulate the characters, iterating through the input string and checking for adjacent pairs. If such a pair is found, the last character is removed from the StringBuilder; otherwise, the current character is appended. This approach ensures that the resulting string has no adjacent pairs of uppercase-lowercase characters, adhering to the desired output. The time complexity of this approach is $O(n)$, where $n$ is the length of the input string, as each character is processed once. The space complexity is also $O(n)$ due to the storage of the StringBuilder.
+The code efficiently creates a "good" string by removing adjacent pairs of characters where one is the uppercase version of the other. It uses a StringBuilder to store and manipulate the characters, iterating through the input string and checking for adjacent pairs. If such a pair is found, the last character is removed from the StringBuilder; otherwise, the current character is appended. This approach ensures that the resulting string has no adjacent pairs of uppercase-lowercase characters, adhering to the desired output. The time complexity of this approach is $O(n)$, where $n$ is the length of the input string, as each character is processed once. The space complexity is also $O(n)$ due to the storage of the StringBuilder.