Resolved issues

Author: thevijayshankersharma

dsa-solutions/lc-solutions/0000-0099/0021-Merge-two-sorted-lists.md

@@ -38,7 +38,7 @@ Merge two sorted linked lists and return it as a sorted list. The list should be
 ### Constraints
 
 - The number of nodes in both lists is in the range [0, 50].
-- -100 <= Node.val <= 100
+- `-100 <= Node.val <= 100`
 - Both `list1` and `list2` are sorted in non-decreasing order.
 
 ### Approach