Skip to content

Commit 6456b6a

Browse files
samarthswami1016idoocs
authored andcommitted
style: format code and docs with prettier
1 parent ae77af9 commit 6456b6a

File tree

2 files changed

+7
-7
lines changed

2 files changed

+7
-7
lines changed

solution/1900-1999/1960.Maximum Product of the Length of Two Palindromic Substrings/README.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -5,9 +5,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1900-1999/1960.Ma
55
rating: 2690
66
source: 第 58 场双周赛 Q4
77
tags:
8-
- 字符串
9-
- 哈希函数
10-
- 滚动哈希
8+
- 字符串
9+
- 哈希函数
10+
- 滚动哈希
1111
---
1212

1313
<!-- problem:start -->
@@ -292,4 +292,4 @@ func min(a, b int) int {
292292

293293
<!-- solution:end -->
294294

295-
<!-- problem:end -->
295+
<!-- problem:end -->

solution/1900-1999/1960.Maximum Product of the Length of Two Palindromic Substrings/README_EN.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -5,9 +5,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1900-1999/1960.Ma
55
rating: 2690
66
source: Biweekly Contest 58 Q4
77
tags:
8-
- String
9-
- Hash Function
10-
- Rolling Hash
8+
- String
9+
- Hash Function
10+
- Rolling Hash
1111
---
1212

1313
<!-- problem:start -->

0 commit comments

Comments
 (0)