Updated 0073-Set-Matrix-Zeroes.md!

Author: debangi29

dsa-solutions/lc-solutions/0000-0099/0073-Set-Matrix-Zeroes.md

@@ -17,7 +17,7 @@ tags:
 
 ## Problem Description
 
-Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's.
+Given an $m \times n$ integer matrix matrix, if an element is 0, set its entire row and column to 0's.
 
 You must do it in place.
 
@@ -28,22 +28,33 @@ You must do it in place.
 #### Example 1:
 
 **Input**: 
+```
 Matrix = [[1,1,1],[1,0,1],[1,1,1]]
+```
 
-**Output**: [[1,0,1],[0,0,0],[1,0,1]]
+**Output**: 
+```
+[[1,0,1],[0,0,0],[1,0,1]]
+```
 
 #### Example 2:
-**Input**: matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]
+**Input**: 
+```
+matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]
+```
 
-**Output**: [[0,0,0,0],[0,4,5,0],[0,3,1,0]]
+**Output**:
+```
+[[0,0,0,0],[0,4,5,0],[0,3,1,0]]
+```
 
 
 ### Constraints
 
 - m == matrix.length
 - n == matrix[0].length
 - 1 <= m, n <= 200
-- -2^31 <= matrix[i][j] <= 2^31 - 1
+- -2<sup>31</sup> <= matrix[i][j] <=2<sup>31</sup> - 1
 
 ### Approach
 
@@ -201,4 +212,4 @@ class Solution {
 
   Reason: In this approach, we are also traversing the entire matrix 2 times and each traversal is taking $O(N*M)$ time complexity.
 
-- Space Complexity: $O(1)$ as we are not using any extra space.
+- Space Complexity: $O(1)$ as we are not using any extra space.