Update 0074-Search-a-2D-Matrix.md

Author: debangi29

dsa-solutions/lc-solutions/0000-0099/0074-Search-a-2D-Matrix.md

@@ -2,7 +2,7 @@
 id: search-a-2D-matrix
 title: Search a 2D matrix
 difficulty: Medium
-sidebar_label: 0073-search2Dmatrix
+sidebar_label: 0074-search2Dmatrix
 tags:
   - Array
   - Binary Search
@@ -17,7 +17,7 @@ tags:
 
 ## Problem Description
 
-You are given an m x n integer matrix matrix with the following two properties:
+You are given an $m \times n$ integer matrix matrix with the following two properties:
 
 - Each row is sorted in non-decreasing order.
 - The first integer of each row is greater than the last integer of the previous row.
@@ -32,13 +32,19 @@ You must write a solution in $O(log(m * n))$ time complexity.
 #### Example 1:
 
 **Input**: 
-Matrix = [[1,3,5,7], [10,11,16,20], [23,30,34,60]], target = 3
+```
+Matrix = [[1,3,5,7], [10,11,16,20], [23,30,34,60]]
+Target = 3
+```
 
 **Output**: true
 
 #### Example 2:
 **Input**: 
-Matrix = [[1,3,5,7], [10,11,16,20], [23,30,34,60]], target = 13
+```
+Matrix = [[1,3,5,7], [10,11,16,20], [23,30,34,60]]
+Target = 13
+```
 
 **Output**: false
 
@@ -48,7 +54,7 @@ Matrix = [[1,3,5,7], [10,11,16,20], [23,30,34,60]], target = 13
 - m == matrix.length
 - n == matrix[i].length
 - 1 <= m, n <= 100
-- -10^4 <= matrix[i][j], target <= 10^4
+- -10<sup>4</sup> <= matrix[i][j], target <= 10<sup>4</sup>
 
 ### Approach
 
@@ -146,8 +152,8 @@ class Solution {
 
 Complexity Analysis
 
-- Time Complexity: $O(log(NxM))$, where N = given row number, M = given column number.
+- Time Complexity: $O(log(N.M))$, where N = given row number, M = given column number.
 
     Reason: We are applying binary search on the imaginary 1D array of size NxM.
 
-- Space Complexity: $O(1)$ as we are not using any extra space.
+- Space Complexity: $O(1)$ as we are not using any extra space.