#265, #266 leetcode problems 001289-minimum-falling-path-sum-ii submi…

…ssions 1242590175 Co-authored-by: kovatz <[email protected]> Co-authored-by: topugit <[email protected]> Co-authored-by: basharul-siddike <[email protected]> Co-authored-by: hafijul233 <[email protected]>
mah-shamim · Jan 11, 2025 · a6dfd29 · a6dfd29
1 parent 07763b6
commit a6dfd29
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/algorithms/001289-minimum-falling-path-sum-ii/README.md b/algorithms/001289-minimum-falling-path-sum-ii/README.md
@@ -16,13 +16,13 @@ A **falling path with non-zero shifts** is a choice of exactly one element from
 - **Input:** `grid = [[1,2,3],[4,5,6],[7,8,9]]`
 - **Output:** `13`
 - **Explanation:** 
-````
+```
 The possible falling paths are:
 [1,5,9], [1,5,7], [1,6,7], [1,6,8],
 [2,4,8], [2,4,9], [2,6,7], [2,6,8],
 [3,4,8], [3,4,9], [3,5,7], [3,5,9]
 The falling path with the smallest sum is [1,5,7], so the answer is 13.
-````
+```
 **Example 2:**
 
 - **Input:** grid = [[7]]