-
Notifications
You must be signed in to change notification settings - Fork 46
Expand file tree
/
Copy pathleetcode-slug-map.json
More file actions
74 lines (74 loc) · 6.96 KB
/
Copy pathleetcode-slug-map.json
File metadata and controls
74 lines (74 loc) · 6.96 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
{
"byName": {
"1234. 替换子串得到平衡字符串_translated": "/en/docs/career/interview-prep/leetcode/1234-replace-substring-for-balanced-string",
"142.环形链表II_translated": "/en/docs/career/interview-prep/leetcode/142-linked-list-cycle-ii",
"1653. 使字符串平衡的最少删除次数_translated": "/en/docs/career/interview-prep/leetcode/1653-minimum-deletions-to-make-string-balanced",
"1664生成平衡数组的方案数_translated": "/en/docs/career/interview-prep/leetcode/1664-ways-to-make-a-fair-array",
"1825求出 MK 平均值_translated": "/en/docs/career/interview-prep/leetcode/1825-mk-average",
"1828统计一个圆中点的数目_translated": "/en/docs/career/interview-prep/leetcode/1828-queries-on-number-of-points-inside-a-circle",
"2299强密码检验器II_translated": "/en/docs/career/interview-prep/leetcode/2299-strong-password-checker-ii",
"2309兼具大小写的最好英文字母_translated": "/en/docs/career/interview-prep/leetcode/2309-greatest-english-letter-in-upper-and-lower-case",
"2335. 装满杯子需要的最短总时长_translated": "/en/docs/career/interview-prep/leetcode/2335-minimum-amount-of-time-to-fill-cups",
"2341. 数组能形成多少数对_translated": "/en/docs/career/interview-prep/leetcode/2341-maximum-number-of-pairs-in-array",
"2639. 查询网格图中每一列的宽度_translated": "/en/docs/career/interview-prep/leetcode/2639-find-column-width-of-grid",
"2679.矩阵中的和_translated": "/en/docs/career/interview-prep/leetcode/2679-sum-in-a-matrix",
"2894. 分类求和并作差": "/en/docs/career/interview-prep/leetcode/2894-divisible-and-non-divisible-sums-difference",
"3072. 将元素分配到两个数组中 II_translated": "/en/docs/career/interview-prep/leetcode/3072-distribute-elements-into-two-arrays-ii",
"345. 反转字符串中的元音字母_translated": "/en/docs/career/interview-prep/leetcode/345-reverse-vowels-of-a-string",
"538.把二叉搜索树转换为累加树_translated": "/en/docs/career/interview-prep/leetcode/538-convert-bst-to-greater-sum-tree",
"6323. 将钱分给最多的儿童_translated": "/en/docs/career/interview-prep/leetcode/6323-distribute-money-to-maximum-children",
"76最小覆盖子串_translated": "/en/docs/career/interview-prep/leetcode/76-minimum-window-substring",
"994.腐烂的橘子_translated": "/en/docs/career/interview-prep/leetcode/994-rotting-oranges",
"[121]买卖股票的最佳时期_translated": "/en/docs/career/interview-prep/leetcode/121-best-time-to-buy-and-sell-stock",
"[1333]餐厅过滤器_translated": "/en/docs/career/interview-prep/leetcode/1333-filter-restaurants-by-vegan-friendly-price-and-distance",
"[146]LRU 缓存_translated": "/en/docs/career/interview-prep/leetcode/146-lru-cache",
"[213]打家劫舍 II_translated": "/en/docs/career/interview-prep/leetcode/213-house-robber-ii",
"[2490]回环句_translated": "/en/docs/career/interview-prep/leetcode/2490-circular-sentence",
"[2562]找出数组的串联值_translated": "/en/docs/career/interview-prep/leetcode/2562-find-the-array-concatenation-value",
"[2582]递枕头_translated": "/en/docs/career/interview-prep/leetcode/2582-pass-the-pillow",
"brief_alternate 作业帮忙_translated": "/zh/docs/career/interview-prep/leetcode/briefalternate-zuo-ye-bang-mang-translated",
"剑指 Offer II 021. 删除链表的倒数第 n 个结点_translated": "/en/docs/career/interview-prep/leetcode/sword-offer-ii-021-remove-nth-node-from-end-of-list"
},
"byNumber": {
"42": "/en/docs/career/interview-prep/leetcode/42-trapping-rain-water",
"46": "/en/docs/career/interview-prep/leetcode/46-permutations",
"76": "/en/docs/career/interview-prep/leetcode/76-minimum-window-substring",
"80": "/en/docs/career/interview-prep/leetcode/80-remove-duplicates-from-sorted-array-ii",
"93": "/en/docs/career/interview-prep/leetcode/93-restore-ip-addresses",
"121": "/en/docs/career/interview-prep/leetcode/121-best-time-to-buy-and-sell-stock",
"142": "/en/docs/career/interview-prep/leetcode/142-linked-list-cycle-ii",
"146": "/en/docs/career/interview-prep/leetcode/146-lru-cache",
"213": "/en/docs/career/interview-prep/leetcode/213-house-robber-ii",
"219": "/en/docs/career/interview-prep/leetcode/219-contains-duplicate-ii",
"345": "/en/docs/career/interview-prep/leetcode/345-reverse-vowels-of-a-string",
"538": "/en/docs/career/interview-prep/leetcode/538-convert-bst-to-greater-sum-tree",
"994": "/en/docs/career/interview-prep/leetcode/994-rotting-oranges",
"1004": "/en/docs/career/interview-prep/leetcode/1004-max-consecutive-ones-iii",
"1234": "/en/docs/career/interview-prep/leetcode/1234-replace-substring-for-balanced-string",
"1333": "/en/docs/career/interview-prep/leetcode/1333-filter-restaurants-by-vegan-friendly-price-and-distance",
"1545": "/en/docs/career/interview-prep/leetcode/1545-find-kth-bit-in-nth-binary-string",
"1653": "/en/docs/career/interview-prep/leetcode/1653-minimum-deletions-to-make-string-balanced",
"1664": "/en/docs/career/interview-prep/leetcode/1664-ways-to-make-a-fair-array",
"1825": "/en/docs/career/interview-prep/leetcode/1825-mk-average",
"1828": "/en/docs/career/interview-prep/leetcode/1828-queries-on-number-of-points-inside-a-circle",
"2131": "/en/docs/career/interview-prep/leetcode/2131-longest-palindrome-by-concatenating-two-letter-words",
"2241": "/en/docs/career/interview-prep/leetcode/2241-design-an-atm-machine",
"2270": "/en/docs/career/interview-prep/leetcode/2270-number-of-ways-to-split-array",
"2293": "/en/docs/career/interview-prep/leetcode/2293-min-max-game",
"2299": "/en/docs/career/interview-prep/leetcode/2299-strong-password-checker-ii",
"2309": "/en/docs/career/interview-prep/leetcode/2309-greatest-english-letter-in-upper-and-lower-case",
"2335": "/en/docs/career/interview-prep/leetcode/2335-minimum-amount-of-time-to-fill-cups",
"2341": "/en/docs/career/interview-prep/leetcode/2341-maximum-number-of-pairs-in-array",
"2490": "/en/docs/career/interview-prep/leetcode/2490-circular-sentence",
"2562": "/en/docs/career/interview-prep/leetcode/2562-find-the-array-concatenation-value",
"2582": "/en/docs/career/interview-prep/leetcode/2582-pass-the-pillow",
"2639": "/en/docs/career/interview-prep/leetcode/2639-find-column-width-of-grid",
"2679": "/en/docs/career/interview-prep/leetcode/2679-sum-in-a-matrix",
"2894": "/en/docs/career/interview-prep/leetcode/2894-divisible-and-non-divisible-sums-difference",
"3072": "/en/docs/career/interview-prep/leetcode/3072-distribute-elements-into-two-arrays-ii",
"3138": "/en/docs/career/interview-prep/leetcode/3138-minimum-length-of-anagram-concatenation",
"6323": "/en/docs/career/interview-prep/leetcode/6323-distribute-money-to-maximum-children",
"9021": "/en/docs/career/interview-prep/leetcode/9021-tut-3-25t1",
"021": "/en/docs/career/interview-prep/leetcode/sword-offer-ii-021-remove-nth-node-from-end-of-list"
}
}