each codes changed from bad to good practices

Author: MuraliDharan7

dsa-solutions/gfg-solutions/problems/BFS-traversal-of-graph.md

@@ -42,8 +42,8 @@ Expected Auxiliary Space: $O(V)$.
 
 ## Constraints
 
-- `$1 <= number of vertices <= 10^3$`
-- `$0 <= value of vertices <= 10^3$`
+- $1 <= number of vertices <= 10^3$
+- $0 <= value of vertices <= 10^3$
 
 ## Problem Explanation
 

dsa-solutions/gfg-solutions/problems/Check-for-balanced-tree.md

@@ -51,8 +51,8 @@ Expected Auxiliary Space: $O(h)$, where h is the height of the tree.
 
 ## Constraints
 
-- `$1 <= number of nodes <= 10^5$`
-- `$1 <= data of node <= 10^5$`
+- $1 <= number of nodes <= 10^5$
+- $1 <= data of node <= 10^5$
 
 ## Problem Explanation
 

dsa-solutions/gfg-solutions/problems/DFS-traversal-of-graph.md

@@ -42,8 +42,8 @@ Expected Auxiliary Space: $O(V)$.
 
 ## Constraints
 
-- `$1 <= number of vertices <= 10^3$`
-- `$0 <= value of vertices <= 10^3$`
+- $1 <= number of vertices <= 10^3$
+- $0 <= value of vertices <= 10^3$
 
 ## Problem Explanation
 

dsa-solutions/gfg-solutions/problems/Delete-middle-of-linked-list.md

@@ -41,8 +41,8 @@ Expected Auxiliary Space: $O(1)$.
 
 ## Constraints
 
-- `$1 <= number of nodes <= 10^3$`
-- `$1 <= value of nodes <= 10^3$`
+- $1 <= number of nodes <= 10^3$
+- $1 <= value of nodes <= 10^3$
 
 ## Problem Explanation
 

dsa-solutions/gfg-solutions/problems/Delete-without-head-pointer.md

@@ -45,8 +45,8 @@ Expected Auxiliary Space: $O(1)$.
 
 ## Constraints
 
-- `$2 <= number of nodes <= 10^3$`
-- `$1 <= value of nodes <= 10^3$`
+- $2 <= number of nodes <= 10^3$
+- $1 <= value of nodes <= 10^3$
 
 ## Problem Explanation
 

dsa-solutions/gfg-solutions/problems/Implement-two-stacks-in-an-array.md

@@ -56,8 +56,8 @@ Expected Auxiliary Space: $O(1)$ for all the operations.
 
 ## Constraints
 
-- `$1 <= N <= 100$`
-- `$1 <= x <= 100$`
+- $1 <= N <= 100$
+- $1 <= x <= 100$
 
 ## Problem Explanation
 

dsa-solutions/gfg-solutions/problems/Intersection-of-two-sorted-linked-lists.md

@@ -43,8 +43,8 @@ Expected Auxiliary Space: $O(1)$.
 
 ## Constraints
 
-- `$1 <= number of nodes <= 10^5$`
-- `$1 <= value of nodes <= 10^5$`
+- $1 <= number of nodes <= 10^5$
+- $1 <= value of nodes <= 10^5$
 
 ## Problem Explanation
 

dsa-solutions/gfg-solutions/problems/Reverse-a-doubly-linked-list.md

@@ -40,8 +40,8 @@ Expected Auxiliary Space: $O(1)$.
 
 ## Constraints
 
-- `$1 <= number of nodes <= 10^4$`
-- `$0 <= value of nodes <= 10^4$`
+- $1 <= number of nodes <= 10^4$
+- $0 <= value of nodes <= 10^4$
 
 ## Problem Explanation
 

dsa-solutions/gfg-solutions/problems/Reverse-a-linked-list.md

@@ -47,7 +47,7 @@ Expected Auxiliary Space: $O(1)$.
 
 ## Constraints
 
-- `$1 <= N <= 10^4$`
+- $1 <= N <= 10^4$
 
 ## Problem Explanation
 

dsa-solutions/gfg-solutions/problems/Square-root.md

@@ -41,7 +41,7 @@ Expected Auxiliary Space: $O(1)$.
 
 ## Constraints
 
-- `$0 <= x <= 10^9$`
+- $0 <= x <= 10^9$
 
 ## Problem Explanation