Skip to content

Commit f17b216

Browse files
Update 2271-Maximum-White-Tiles-Covered-by-a-Carpet.md
1 parent bf1ea77 commit f17b216

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

dsa-solutions/lc-solutions/2200-2299/2271-Maximum-White-Tiles-Covered-by-a-Carpet.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ In this tutorial, we will solve the Maximum White Tiles Covered by a Carpet prob
2020

2121
### Problem Description
2222

23-
You are given a 2D integer array tiles where tiles[i] = [li, ri] represents that every tile j in the range li <= j <= ri is colored white.
23+
You are given a 2D integer array tiles where tiles[i] = [li, ri] represents that every tile j in the range `li <= j <= ri` is colored white.
2424

2525
You are also given an integer carpetLen, the length of a single carpet that can be placed anywhere.
2626

0 commit comments

Comments
 (0)