Update 0054.md

Author: ajay-dhangar

dsa-solutions/gfg-solutions/Basic/0054.md

@@ -13,7 +13,7 @@ description: "This document covers methods to remove consecutive duplicate chara
 
 ## Problem
 
-Given a string S. For each index i(1<=i<=N-1), erase it if s[i] is equal to s[i-1] in the string.
+Given a string S. For each index `i(1<=i<=N-1)`, erase it if s[i] is equal to s[i-1] in the string.
 
 ### Examples:
 **Example 1:**
@@ -122,4 +122,4 @@ char* removeConsecutiveCharacter(const char* S) {
 ```
 
 - **Time Complexity:** $O(|S|)$
-- **Auxiliary Space:** $O(|S|)$
+- **Auxiliary Space:** $O(|S|)$