Skip to content

Commit 8c8f4a3

Browse files
committed
Fix JSON syntax errors: remove duplicate link fields and add missing commas
1 parent 7dd702b commit 8c8f4a3

File tree

1 file changed

+60
-13
lines changed

1 file changed

+60
-13
lines changed

data/leetcode-problems.json

Lines changed: 60 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -24022,8 +24022,10 @@
2402224022
"title": "Find the Power of K-Size Subarrays I",
2402324023
"difficulty": "Medium",
2402424024
"link": "https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/",
24025-
"tags": ["array", "sliding-window"]
24026-
"link": "https://leetcode.com/problems/count-partitions-with-even-sum-difference/"
24025+
"tags": [
24026+
"array",
24027+
"sliding-window"
24028+
]
2402724029
},
2402824030
"3433": {
2402924031
"id": 3433,
@@ -26173,8 +26175,10 @@
2617326175
"title": "Find Minimum Operations to Make All Elements Divisible by Three",
2617426176
"difficulty": "Easy",
2617526177
"link": "https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/",
26176-
"tags": ["array", "math"]
26177-
"link": "https://leetcode.com/problems/count-subarrays-with-majority-element-ii/"
26178+
"tags": [
26179+
"array",
26180+
"math"
26181+
]
2617826182
},
2617926183
"3740": {
2618026184
"id": 3740,
@@ -26203,7 +26207,12 @@
2620326207
"title": "Count the Number of Beautiful Subarrays",
2620426208
"difficulty": "Medium",
2620526209
"link": "https://leetcode.com/problems/count-the-number-of-beautiful-subarrays/",
26206-
"tags": ["array", "hash-table", "bit-manipulation", "prefix-sum"]
26210+
"tags": [
26211+
"array",
26212+
"hash-table",
26213+
"bit-manipulation",
26214+
"prefix-sum"
26215+
]
2620726216
},
2620826217
"3744": {
2620926218
"id": 3744,
@@ -26232,15 +26241,28 @@
2623226241
"title": "Count Beautiful Substrings I",
2623326242
"difficulty": "Medium",
2623426243
"link": "https://leetcode.com/problems/count-beautiful-substrings-i/",
26235-
"tags": ["hash-table", "math", "string", "enumeration", "number-theory", "prefix-sum"]
26244+
"tags": [
26245+
"hash-table",
26246+
"math",
26247+
"string",
26248+
"enumeration",
26249+
"number-theory",
26250+
"prefix-sum"
26251+
]
2623626252
},
2623726253
"3748": {
2623826254
"id": 3748,
2623926255
"category": "String",
2624026256
"title": "Count Beautiful Substrings II",
2624126257
"difficulty": "Hard",
2624226258
"link": "https://leetcode.com/problems/count-beautiful-substrings-ii/",
26243-
"tags": ["hash-table", "math", "string", "number-theory", "prefix-sum"]
26259+
"tags": [
26260+
"hash-table",
26261+
"math",
26262+
"string",
26263+
"number-theory",
26264+
"prefix-sum"
26265+
]
2624426266
},
2624526267
"3749": {
2624626268
"id": 3749,
@@ -26276,7 +26298,11 @@
2627626298
"title": "Paths in Matrix Whose Sum Is Divisible by K",
2627726299
"difficulty": "Hard",
2627826300
"link": "https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/",
26279-
"tags": ["array", "dynamic-programming", "matrix"]
26301+
"tags": [
26302+
"array",
26303+
"dynamic-programming",
26304+
"matrix"
26305+
]
2628026306
},
2628126307
"3754": {
2628226308
"id": 3754,
@@ -26319,31 +26345,52 @@
2631926345
"title": "Minimum Cost to Convert String I",
2632026346
"difficulty": "Medium",
2632126347
"link": "https://leetcode.com/problems/minimum-cost-to-convert-string-i/",
26322-
"tags": ["array", "string", "graph", "shortest-path"]
26348+
"tags": [
26349+
"array",
26350+
"string",
26351+
"graph",
26352+
"shortest-path"
26353+
]
2632326354
},
2632426355
"3760": {
2632526356
"id": 3760,
2632626357
"category": "Graph",
2632726358
"title": "Minimum Cost to Convert String II",
2632826359
"difficulty": "Hard",
2632926360
"link": "https://leetcode.com/problems/minimum-cost-to-convert-string-ii/",
26330-
"tags": ["array", "string", "dynamic-programming", "graph", "trie", "shortest-path"]
26361+
"tags": [
26362+
"array",
26363+
"string",
26364+
"dynamic-programming",
26365+
"graph",
26366+
"trie",
26367+
"shortest-path"
26368+
]
2633126369
},
2633226370
"3761": {
2633326371
"id": 3761,
2633426372
"category": "Tree",
2633526373
"title": "Count Valid Paths in a Tree",
2633626374
"difficulty": "Hard",
2633726375
"link": "https://leetcode.com/problems/count-valid-paths-in-a-tree/",
26338-
"tags": ["math", "dynamic-programming", "tree", "depth-first-search", "number-theory"]
26376+
"tags": [
26377+
"math",
26378+
"dynamic-programming",
26379+
"tree",
26380+
"depth-first-search",
26381+
"number-theory"
26382+
]
2633926383
},
2634026384
"3762": {
2634126385
"id": 3762,
2634226386
"category": "Array & Hashing",
2634326387
"title": "Minimum Operations to Make Array Values Equal to K",
2634426388
"difficulty": "Easy",
2634526389
"link": "https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/",
26346-
"tags": ["array", "hash-table"]
26390+
"tags": [
26391+
"array",
26392+
"hash-table"
26393+
]
2634726394
},
2634826395
"3763": {
2634926396
"id": 3763,
@@ -26359,4 +26406,4 @@
2635926406
"difficulty": "Hard",
2636026407
"link": "https://leetcode.com/problems/most-common-course-pairs/"
2636126408
}
26362-
}
26409+
}

0 commit comments

Comments
 (0)