Added a problem on Merge K Sorted Arrays

docs/DSA-Problem-Solution/Merge_K_Sorted_Arrays.md

@@ -16,7 +16,7 @@ The **Merge K Sorted Arrays** problem is an intuitive problem based on Priority
 
 Given:
 
-- A 2D array of integers `arr` of size k\*k.
+- A 2D array of integers `arr` of size $k\*k$.
 
 Objective:
 
@@ -35,8 +35,8 @@ Objective:
 
 ### Time Complexity
 
-- **Time Complexity**: O(K^2\* log(K)), where insertion and deletion in a Min Heap requires log K time and for all K^2 elements it takes (K^2 \* log(K)) time
-- **Space Complexity**: O(K) for the result array.
+- **Time Complexity**: $O(K^2\* log(K))$, where insertion and deletion in a Min Heap requires log K time and for all $K^2$ elements it takes $(K^2 \* log(K))$ time
+- **Space Complexity**: $O(K)$ for the result array.
 
 ### C++ Implementation
 

docs/DSA-Problem-Solution/Sliding Window Maximum.md

@@ -3,7 +3,7 @@ id: sliding-window-maximum
 title: Sliding Window Maximum
 sidebar_label: LeetCode 239
 tags: [LeetCode , Arrays, Queue , Sliding Window , Heap (Priority Queue) , Monotonic Queue]
-description: Given array of integers nums , with sliding window of size k which is moving from the very left of the array to the very right.Return the max for each sliding window.
+description: "Given array of integers nums , with sliding window of size k which is moving from the very left of the array to the very right.Return the max for each sliding window."
 ---
 
 # Sliding Window Maximum (LeetCode 239)
@@ -83,3 +83,4 @@ public:
 };
 
 ```
+