Update 0023-Merge-k-Sorted-Lists.md as per given

Author: VaishnaviMankala19

dsa-solutions/lc-solutions/0000-0099/0023-Merge-k-Sorted-Lists.md

@@ -24,13 +24,13 @@ Merge all the linked-lists into one sorted linked-list and return it.
 - **Input:** `lists = [[1,4,5],[1,3,4],[2,6]]`
 - **Output:** `[1,1,2,3,4,4,5,6]`
 - **Explanation:** The linked-lists are:
-  [
+  `[
     1->4->5,
     1->3->4,
     2->6
-  ]
+  ]`
   merging them into one sorted list:
-  1->1->2->3->4->4->5->6
+  `1->1->2->3->4->4->5->6`
 
 #### Example 2
 
@@ -187,4 +187,4 @@ public:
 ```
 
 #### Conclusion
-The above solutions effectively merge k sorted linked lists into a single sorted list using a min-heap. This approach ensures that the smallest element is always added next to the merged list, maintaining sorted order. This solution efficiently handles edge cases and returns the correct merged list for various input configurations.
+The above solutions effectively merge k sorted linked lists into a single sorted list using a min-heap. This approach ensures that the smallest element is always added next to the merged list, maintaining sorted order. This solution efficiently handles edge cases and returns the correct merged list for various input configurations.