Update 0111-Maximum-Number-of-coins.md

Author: Damini2004

dsa-solutions/gfg-solutions/Hard/0101-0200/0111-Maximum-Number-of-coins.md

@@ -42,8 +42,8 @@ Expected Time Complexity: $O(N^3)$
 Expected Space Complexity: $O(N^2)$
 
 ## Constraints
-- 1 <= N <= 400
-- 0 <= a[i] <= 100
+- `1 <= N <= 400`
+- `0 <= a[i] <= 100`
 
 ## Problem Explanation
 
@@ -115,4 +115,4 @@ $$O(N^2)$$.
 - **LeetCode Problem:** [LeetCode Problem](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/description/)
 - **Author's Geeks for Geeks Profile:**  | [DaminiChachane](https://leetcode.com/u/divcxl15/) |
 
-This format ensures that all necessary details about the problem and its solution are clearly presented and easy to follow.
+This format ensures that all necessary details about the problem and its solution are clearly presented and easy to follow.