-
Notifications
You must be signed in to change notification settings - Fork 160
/
README.md
454 lines (428 loc) · 97.9 KB
/
README.md
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
# Just-Code
   
- 逐步收录常见面试算法题，包括 **剑指offer** 和 **LeetCode** 。
- 持续更新，如果对您有帮助，小手一点， Star 走一走，靴靴！
- **题解简介**
- [剑指 Offer 题解简介](#剑指-Offer-题解)
- [Leetcode 题解简介](#leetcode-题解)
- [字节跳动面经题解简介](#字节跳动面经总结算法题)
- **题目分类收集**
- [字节跳动各岗位算法题频次收集](./BAT/bytedance.md)
- [LeetCode字节跳动分类](https://leetcode.com/list/x7kpxvli)
- [LeetCode腾讯分类](https://leetcode.com/list/xl3e1xkj)
---
### 题解快速入口
- [剑指 Offer 题解入口](./%E5%89%91%E6%8C%87offer%EF%BC%88%E7%AC%AC%E4%BA%8C%E7%89%88%EF%BC%89/%E5%89%91%E6%8C%87offer%EF%BC%88%E7%AC%AC%E4%BA%8C%E7%89%88%EF%BC%89.md)
- [LeetCode 题解入口](./LeetCode/README.md)
- [字节跳动趴的题解入口](./BAT/Algorithm.md)
---
### 剑指 Offer 题解
- [剑指 Offer 题解入口](./%E5%89%91%E6%8C%87offer%EF%BC%88%E7%AC%AC%E4%BA%8C%E7%89%88%EF%BC%89/%E5%89%91%E6%8C%87offer%EF%BC%88%E7%AC%AC%E4%BA%8C%E7%89%88%EF%BC%89.md)
如果您有更好或者不同的解法，请提 issue 一起进步，靴靴！
- 《剑指offer》剖析了80个典型的编程面试题，系统整理基础知识、代码质量、解题思路、优化效率和综合能力这5个面试要点。但是我刷题只有牛客网上的66题。
- 如果是单纯的面试需求，剑指offer的优先级肯定是在Leetcode之前，总的说它有三个优点：
1.很可能在面试中出现原题
2.约66题，题量少，但是涵盖的内容较全
3.能培养一个良好的刷题习惯
- 它的缺点是：
1.只有66题，刷着容易过拟合
2.动态规划的题比较少，因此需要在Leetcode上专项训练。
**推荐的刷题网站：**
1. [牛客网](https://www.nowcoder.com/ta/coding-interviews)
- 优点：有氛围非常好的算法讨论区，对于一道题可以有很多人一起讨论。
- 缺点：题目数量有限，第二版的部分题目未收录，而且测试用例较少不完备。无法自测，每次必须提交。
2. [Acwing](https://www.acwing.com/problem/search/1/?csrfmiddlewaretoken=BXz7gi5dT1RtqvDtBXXgqr21qIW0SaIpv02bwj2WIHvIMzO3Mced0hY1qXUhQXbA&search_content=%E5%89%91%E6%8C%87offer)
- 优点：题目收录完备，并且测试用例较多，有体验比较好的测试台自测。
- 缺点：平台较为小众，可能解法没有牛客网的多，但是希望大家看看 **Yaxe** 的题解哈哈。
### Leetcode 题解
- 如果要仔细准备面对大厂可能出现的更难的题， Leetcode 上前 400 道也够用了。
- 我根据题目类型对 LeetCode 前 400 题进行初步分类，再根据题目的相关关系递进地排序，如果你选择仔细刷题，那么随便选择一个题目类型跟着我排的顺序刷题就可以了。推荐优先完成数组、链表和二叉树等基础数据结构的题目。
- 如果希望根据题号而不是类型查询我的题解，请继续往下划划划（爬虫挂了 部分未更新，建议按照tag找）。
- [LeetCode 分类总目录](./LeetCode/README.md)
- [1. 链表 Linked_List](./LeetCode/Linked_List.md)
- [2. 树 Tree](./LeetCode/Tree.md)
- [3. 动态规划 Dynamic_Programming](./LeetCode/Dynamic_Programming.md)
- [4. 数组 Array](./LeetCode/Array.md)
- [5. 广度优先搜索 BFS & 深度优先搜索 DFS](./LeetCode/DFS%26BFS.md)
- [6. 二分搜索 Binary_Search](./LeetCode/Binary_Search.md)
- [7. 数理 Math](./LeetCode/Math.md)
- [9. 字符串 String](./LeetCode/String.md)
- [10.位运算 Bit_Manipulation](./LeetCode/Bit_Manipulation.md)
### 字节跳动面经总结算法题
- 从看准网和牛客笔经面经区扒取了最近两年内的字节跳动后端部分的所有面试算法题，分类整理，并附我的解法，希望对你有所帮助。
- 因为字节跳动的题目分类必须买 LeetCode 会员才可以看，所以我把题目都添加了一个 list ，然后点击 [字节跳动分类](https://leetcode.com/list/x7kpxvli) 就可以查看我分享的题目 list 了。因为是英文版LeetCode所以第一次打开可能重定向跳转到中国力扣官网，关闭重新打开即可。
**分类如下：**
- [总目录](./BAT/Algorithm.md)
- [链表](./BAT/Algorithm.md/#链表)
- [二叉树](./BAT/Algorithm.md/#二叉树)
- [动态规划](./BAT/Algorithm.md/#动态规划)
- [二分查找](./BAT/Algorithm.md/#二分查找)
- [排序算法](./BAT/Algorithm.md/#排序算法)
- [双指针](./BAT/Algorithm.md/#双指针)
- [设计类](./BAT/Algorithm.md/#设计类)
### 代码仓库
<p align="center"><img width="300" src="https://raw.githubusercontent.com/ZhaoxiZhang/LeetCodeCrawler/master/pictures/site-logo.png"></p>
<p align="center">
<img src="https://img.shields.io/badge/540/1522-Solved/Total-blue.svg" alt="">
<img src="https://img.shields.io/badge/Easy-234-green.svg" alt="">
<img src="https://img.shields.io/badge/Medium-223-orange.svg" alt="">
<img src="https://img.shields.io/badge/Hard-83-red.svg" alt="">
</p>
| # | Title | Solution | Acceptance | Difficulty | Topics
|:--:|:-----:|:---------:|:----:|:----:|:----:|
| 0001 | [Two Sum](./src/0001.two-sum/two-sum.md) | [Python3](./src/0001.two-sum/two-sum.py) | 44.77% | Easy | [Array](./src/Topics.md#array) | [Hash Table](./src/Topics.md#hash-table) |
| 0002 | [Add Two Numbers](./src/0002.add-two-numbers/add-two-numbers.md) | [Python3](./src/0002.add-two-numbers/add-two-numbers.py) | 32.23% | Medium | [Linked List](./src/Topics.md#linked-list) | [Math](./src/Topics.md#math) |
| 0003 | [Longest Substring Without Repeating Characters](./src/0003.longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.md) | [Python3](./src/0003.longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.py) | 29.15% | Medium | [Hash Table](./src/Topics.md#hash-table) | [Two Pointers](./src/Topics.md#two-pointers) | [String](./src/Topics.md#string) | [Sliding Window](./src/Topics.md#sliding-window) |
| 0005 | [Longest Palindromic Substring](./src/0005.longest-palindromic-substring/longest-palindromic-substring.md) | [Python3](./src/0005.longest-palindromic-substring/longest-palindromic-substring.py) | 28.32% | Medium | [String](./src/Topics.md#string) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0006 | [ZigZag Conversion](./src/0006.zigzag-conversion/zigzag-conversion.md) | [Python3](./src/0006.zigzag-conversion/zigzag-conversion.py) | 33.91% | Medium | [String](./src/Topics.md#string) |
| 0007 | [Reverse Integer](./src/0007.reverse-integer/reverse-integer.md) | [Python3](./src/0007.reverse-integer/reverse-integer.py) | 25.55% | Easy | [Math](./src/Topics.md#math) |
| 0008 | [String to Integer (atoi)](./src/0008.string-to-integer-atoi/string-to-integer-atoi.md) | [Python3](./src/0008.string-to-integer-atoi/string-to-integer-atoi.py) | 14.85% | Medium | [Math](./src/Topics.md#math) | [String](./src/Topics.md#string) |
| 0009 | [Palindrome Number](./src/0009.palindrome-number/palindrome-number.md) | [Python3](./src/0009.palindrome-number/palindrome-number.py) | 45.67% | Easy | [Math](./src/Topics.md#math) |
| 0010 | [Regular Expression Matching](./src/0010.regular-expression-matching/regular-expression-matching.md) | [Python3](./src/0010.regular-expression-matching/regular-expression-matching.py) | 25.93% | Hard | [String](./src/Topics.md#string) | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Backtracking](./src/Topics.md#backtracking) |
| 0011 | [Container With Most Water](./src/0011.container-with-most-water/container-with-most-water.md) | [Python3](./src/0011.container-with-most-water/container-with-most-water.py) | 47.70% | Medium | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0012 | [Integer to Roman](./src/0012.integer-to-roman/integer-to-roman.md) | [Python3](./src/0012.integer-to-roman/integer-to-roman.py) | 52.71% | Medium | [Math](./src/Topics.md#math) | [String](./src/Topics.md#string) |
| 0013 | [Roman to Integer](./src/0013.roman-to-integer/roman-to-integer.md) | [Python3](./src/0013.roman-to-integer/roman-to-integer.py) | 53.77% | Easy | [Math](./src/Topics.md#math) | [String](./src/Topics.md#string) |
| 0014 | [Longest Common Prefix](./src/0014.longest-common-prefix/longest-common-prefix.md) | [Python3](./src/0014.longest-common-prefix/longest-common-prefix.py) | 34.38% | Easy | [String](./src/Topics.md#string) |
| 0015 | [3Sum](./src/0015.3sum/3sum.md) | [Python3](./src/0015.3sum/3sum.py) | 25.23% | Medium | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0016 | [3Sum Closest](./src/0016.3sum-closest/3sum-closest.md) | [Python3](./src/0016.3sum-closest/3sum-closest.py) | 45.70% | Medium | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0017 | [Letter Combinations of a Phone Number](./src/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number.md) | [Python3](./src/0017.letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number.py) | 43.79% | Medium | [String](./src/Topics.md#string) | [Backtracking](./src/Topics.md#backtracking) |
| 0019 | [Remove Nth Node From End of List](./src/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.md) | [Python3](./src/0019.remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.py) | 34.62% | Medium | [Linked List](./src/Topics.md#linked-list) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0020 | [Valid Parentheses](./src/0020.valid-parentheses/valid-parentheses.md) | [Python3](./src/0020.valid-parentheses/valid-parentheses.py) | 37.58% | Easy | [String](./src/Topics.md#string) | [Stack](./src/Topics.md#stack) |
| 0021 | [Merge Two Sorted Lists](./src/0021.merge-two-sorted-lists/merge-two-sorted-lists.md) | [Python3](./src/0021.merge-two-sorted-lists/merge-two-sorted-lists.py) | 50.01% | Easy | [Linked List](./src/Topics.md#linked-list) |
| 0022 | [Generate Parentheses](./src/0022.generate-parentheses/generate-parentheses.md) | [Python3](./src/0022.generate-parentheses/generate-parentheses.py) | 58.19% | Medium | [String](./src/Topics.md#string) | [Backtracking](./src/Topics.md#backtracking) |
| 0023 | [Merge k Sorted Lists](./src/0023.merge-k-sorted-lists/merge-k-sorted-lists.md) | [Python3](./src/0023.merge-k-sorted-lists/merge-k-sorted-lists.py) | 37.02% | Hard | [Linked List](./src/Topics.md#linked-list) | [Divide and Conquer](./src/Topics.md#divide-and-conquer) | [Heap](./src/Topics.md#heap) |
| 0024 | [Swap Nodes in Pairs](./src/0024.swap-nodes-in-pairs/swap-nodes-in-pairs.md) | [Python3](./src/0024.swap-nodes-in-pairs/swap-nodes-in-pairs.py) | 47.17% | Medium | [Linked List](./src/Topics.md#linked-list) |
| 0025 | [Reverse Nodes in k-Group](./src/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group.md) | [Python3](./src/0025.reverse-nodes-in-k-group/reverse-nodes-in-k-group.py) | 38.62% | Hard | [Linked List](./src/Topics.md#linked-list) |
| 0026 | [Remove Duplicates from Sorted Array](./src/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.md) | [Python3](./src/0026.remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.py) | 42.51% | Easy | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0027 | [Remove Element](./src/0027.remove-element/remove-element.md) | [Python3](./src/0027.remove-element/remove-element.py) | 46.12% | Easy | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0031 | [Next Permutation](./src/0031.next-permutation/next-permutation.md) | [Python3](./src/0031.next-permutation/next-permutation.py) | 31.37% | Medium | [Array](./src/Topics.md#array) |
| 0033 | [Search in Rotated Sorted Array](./src/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array.md) | [Python3](./src/0033.search-in-rotated-sorted-array/search-in-rotated-sorted-array.py) | 33.38% | Medium | [Array](./src/Topics.md#array) | [Binary Search](./src/Topics.md#binary-search) |
| 0034 | [Find First and Last Position of Element in Sorted Array](./src/0034.find-first-and-last-position-of-element-in-sorted-array/find-first-and-last-position-of-element-in-sorted-array.md) | [Python3](./src/0034.find-first-and-last-position-of-element-in-sorted-array/find-first-and-last-position-of-element-in-sorted-array.py) | 34.60% | Medium | [Array](./src/Topics.md#array) | [Binary Search](./src/Topics.md#binary-search) |
| 0035 | [Search Insert Position](./src/0035.search-insert-position/search-insert-position.md) | [Python3](./src/0035.search-insert-position/search-insert-position.py) | 41.29% | Easy | [Array](./src/Topics.md#array) | [Binary Search](./src/Topics.md#binary-search) |
| 0041 | [First Missing Positive](./src/0041.first-missing-positive/first-missing-positive.md) | [Python3](./src/0041.first-missing-positive/first-missing-positive.py) | 30.20% | Hard | [Array](./src/Topics.md#array) |
| 0042 | [Trapping Rain Water](./src/0042.trapping-rain-water/trapping-rain-water.md) | [Python3](./src/0042.trapping-rain-water/trapping-rain-water.py) | 45.70% | Hard | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) | [Stack](./src/Topics.md#stack) |
| 0047 | [Permutations II](./src/0047.permutations-ii/permutations-ii.md) | [Python3](./src/0047.permutations-ii/permutations-ii.py) | 43.08% | Medium | [Backtracking](./src/Topics.md#backtracking) |
| 0048 | [Rotate Image](./src/0048.rotate-image/rotate-image.md) | [Python3](./src/0048.rotate-image/rotate-image.py) | 51.77% | Medium | [Array](./src/Topics.md#array) |
| 0049 | [Group Anagrams](./src/0049.group-anagrams/group-anagrams.md) | [Python3](./src/0049.group-anagrams/group-anagrams.py) | 50.81% | Medium | [Hash Table](./src/Topics.md#hash-table) | [String](./src/Topics.md#string) |
| 0050 | [Pow(x, n)](./src/0050.powx-n/powx-n.md) | [Python3](./src/0050.powx-n/powx-n.py) | 28.81% | Medium | [Math](./src/Topics.md#math) | [Binary Search](./src/Topics.md#binary-search) |
| 0053 | [Maximum Subarray](./src/0053.maximum-subarray/maximum-subarray.md) | [Python3](./src/0053.maximum-subarray/maximum-subarray.py) | 45.07% | Easy | [Array](./src/Topics.md#array) | [Divide and Conquer](./src/Topics.md#divide-and-conquer) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0054 | [Spiral Matrix](./src/0054.spiral-matrix/spiral-matrix.md) | [Python3](./src/0054.spiral-matrix/spiral-matrix.py) | 32.03% | Medium | [Array](./src/Topics.md#array) |
| 0056 | [Merge Intervals](./src/0056.merge-intervals/merge-intervals.md) | [Python3](./src/0056.merge-intervals/merge-intervals.py) | 37.24% | Medium | [Array](./src/Topics.md#array) | [Sort](./src/Topics.md#sort) |
| 0057 | [Insert Interval](./src/0057.insert-interval/insert-interval.md) | [Python3](./src/0057.insert-interval/insert-interval.py) | 32.12% | Hard | [Array](./src/Topics.md#array) | [Sort](./src/Topics.md#sort) |
| 0058 | [Length of Last Word](./src/0058.length-of-last-word/length-of-last-word.md) | [Python3](./src/0058.length-of-last-word/length-of-last-word.py) | 32.34% | Easy | [String](./src/Topics.md#string) |
| 0059 | [Spiral Matrix II](./src/0059.spiral-matrix-ii/spiral-matrix-ii.md) | [Python3](./src/0059.spiral-matrix-ii/spiral-matrix-ii.py) | 49.90% | Medium | [Array](./src/Topics.md#array) |
| 0061 | [Rotate List](./src/0061.rotate-list/rotate-list.md) | [Python3](./src/0061.rotate-list/rotate-list.py) | 28.35% | Medium | [Linked List](./src/Topics.md#linked-list) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0062 | [Unique Paths](./src/0062.unique-paths/unique-paths.md) | [Python3](./src/0062.unique-paths/unique-paths.py) | 50.11% | Medium | [Array](./src/Topics.md#array) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0063 | [Unique Paths II](./src/0063.unique-paths-ii/unique-paths-ii.md) | [Python3](./src/0063.unique-paths-ii/unique-paths-ii.py) | 33.76% | Medium | [Array](./src/Topics.md#array) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0064 | [Minimum Path Sum](./src/0064.minimum-path-sum/minimum-path-sum.md) | [Python3](./src/0064.minimum-path-sum/minimum-path-sum.py) | 49.54% | Medium | [Array](./src/Topics.md#array) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0065 | [Valid Number](./src/0065.valid-number/valid-number.md) | [Python3](./src/0065.valid-number/valid-number.py) | 14.52% | Hard | [Math](./src/Topics.md#math) | [String](./src/Topics.md#string) |
| 0066 | [Plus One](./src/0066.plus-one/plus-one.md) | [Python3](./src/0066.plus-one/plus-one.py) | 41.77% | Easy | [Array](./src/Topics.md#array) |
| 0067 | [Add Binary](./src/0067.add-binary/add-binary.md) | [Python3](./src/0067.add-binary/add-binary.py) | 41.33% | Easy | [Math](./src/Topics.md#math) | [String](./src/Topics.md#string) |
| 0069 | [Sqrt(x)](./src/0069.sqrtx/sqrtx.md) | [Python3](./src/0069.sqrtx/sqrtx.py) | 32.44% | Easy | [Math](./src/Topics.md#math) | [Binary Search](./src/Topics.md#binary-search) |
| 0070 | [Climbing Stairs](./src/0070.climbing-stairs/climbing-stairs.md) | [Python3](./src/0070.climbing-stairs/climbing-stairs.py) | 45.51% | Easy | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0071 | [Simplify Path](./src/0071.simplify-path/simplify-path.md) | [Python3](./src/0071.simplify-path/simplify-path.py) | 30.26% | Medium | [String](./src/Topics.md#string) | [Stack](./src/Topics.md#stack) |
| 0072 | [Edit Distance](./src/0072.edit-distance/edit-distance.md) | [Python3](./src/0072.edit-distance/edit-distance.py) | 40.24% | Hard | [String](./src/Topics.md#string) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0073 | [Set Matrix Zeroes](./src/0073.set-matrix-zeroes/set-matrix-zeroes.md) | [Python3](./src/0073.set-matrix-zeroes/set-matrix-zeroes.py) | 41.35% | Medium | [Array](./src/Topics.md#array) |
| 0074 | [Search a 2D Matrix](./src/0074.search-a-2d-matrix/search-a-2d-matrix.md) | [Python3](./src/0074.search-a-2d-matrix/search-a-2d-matrix.py) | 35.52% | Medium | [Array](./src/Topics.md#array) | [Binary Search](./src/Topics.md#binary-search) |
| 0075 | [Sort Colors](./src/0075.sort-colors/sort-colors.md) | [Python3](./src/0075.sort-colors/sort-colors.py) | 43.83% | Medium | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) | [Sort](./src/Topics.md#sort) |
| 0076 | [Minimum Window Substring](./src/0076.minimum-window-substring/minimum-window-substring.md) | [Python3](./src/0076.minimum-window-substring/minimum-window-substring.py) | 32.56% | Hard | [Hash Table](./src/Topics.md#hash-table) | [Two Pointers](./src/Topics.md#two-pointers) | [String](./src/Topics.md#string) | [Sliding Window](./src/Topics.md#sliding-window) |
| 0078 | [Subsets](./src/0078.subsets/subsets.md) | [Python3](./src/0078.subsets/subsets.py) | 56.34% | Medium | [Array](./src/Topics.md#array) | [Backtracking](./src/Topics.md#backtracking) | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0079 | [Word Search](./src/0079.word-search/word-search.md) | [Python3](./src/0079.word-search/word-search.py) | 32.93% | Medium | [Array](./src/Topics.md#array) | [Backtracking](./src/Topics.md#backtracking) |
| 0080 | [Remove Duplicates from Sorted Array II](./src/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii.md) | [Python3](./src/0080.remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii.py) | 41.87% | Medium | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0082 | [Remove Duplicates from Sorted List II](./src/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii.md) | [Python3](./src/0082.remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii.py) | 34.63% | Medium | [Linked List](./src/Topics.md#linked-list) |
| 0083 | [Remove Duplicates from Sorted List](./src/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.md) | [Python3](./src/0083.remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.py) | 43.74% | Easy | [Linked List](./src/Topics.md#linked-list) |
| 0085 | [Maximal Rectangle](./src/0085.maximal-rectangle/maximal-rectangle.md) | [Python3](./src/0085.maximal-rectangle/maximal-rectangle.py) | 35.17% | Hard | [Array](./src/Topics.md#array) | [Hash Table](./src/Topics.md#hash-table) | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Stack](./src/Topics.md#stack) |
| 0086 | [Partition List](./src/0086.partition-list/partition-list.md) | [Python3](./src/0086.partition-list/partition-list.py) | 39.00% | Medium | [Linked List](./src/Topics.md#linked-list) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0088 | [Merge Sorted Array](./src/0088.merge-sorted-array/merge-sorted-array.md) | [Python3](./src/0088.merge-sorted-array/merge-sorted-array.py) | 37.41% | Easy | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0091 | [Decode Ways](./src/0091.decode-ways/decode-ways.md) | [Python3](./src/0091.decode-ways/decode-ways.py) | 23.22% | Medium | [String](./src/Topics.md#string) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0092 | [Reverse Linked List II](./src/0092.reverse-linked-list-ii/reverse-linked-list-ii.md) | [Python3](./src/0092.reverse-linked-list-ii/reverse-linked-list-ii.py) | 36.57% | Medium | [Linked List](./src/Topics.md#linked-list) |
| 0094 | [Binary Tree Inorder Traversal](./src/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal.md) | [Python3](./src/0094.binary-tree-inorder-traversal/binary-tree-inorder-traversal.py) | 59.50% | Medium | [Hash Table](./src/Topics.md#hash-table) | [Stack](./src/Topics.md#stack) | [Tree](./src/Topics.md#tree) |
| 0095 | [Unique Binary Search Trees II](./src/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii.md) | [Python3](./src/0095.unique-binary-search-trees-ii/unique-binary-search-trees-ii.py) | 37.58% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Tree](./src/Topics.md#tree) |
| 0096 | [Unique Binary Search Trees](./src/0096.unique-binary-search-trees/unique-binary-search-trees.md) | [Python3](./src/0096.unique-binary-search-trees/unique-binary-search-trees.py) | 48.60% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Tree](./src/Topics.md#tree) |
| 0098 | [Validate Binary Search Tree](./src/0098.validate-binary-search-tree/validate-binary-search-tree.md) | [Python3](./src/0098.validate-binary-search-tree/validate-binary-search-tree.py) | 26.67% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0099 | [Recover Binary Search Tree](./src/0099.recover-binary-search-tree/recover-binary-search-tree.md) | [Python3](./src/0099.recover-binary-search-tree/recover-binary-search-tree.py) | 36.38% | Hard | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0100 | [Same Tree](./src/0100.same-tree/same-tree.md) | [Python3](./src/0100.same-tree/same-tree.py) | 51.23% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0101 | [Symmetric Tree](./src/0101.symmetric-tree/symmetric-tree.md) | [Python3](./src/0101.symmetric-tree/symmetric-tree.py) | 44.96% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0102 | [Binary Tree Level Order Traversal](./src/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal.md) | [Python3](./src/0102.binary-tree-level-order-traversal/binary-tree-level-order-traversal.py) | 50.98% | Medium | [Tree](./src/Topics.md#tree) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0103 | [Binary Tree Zigzag Level Order Traversal](./src/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal.md) | [Python3](./src/0103.binary-tree-zigzag-level-order-traversal/binary-tree-zigzag-level-order-traversal.py) | 44.09% | Medium | [Stack](./src/Topics.md#stack) | [Tree](./src/Topics.md#tree) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0104 | [Maximum Depth of Binary Tree](./src/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.md) | [Python3](./src/0104.maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.py) | 62.93% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0105 | [Construct Binary Tree from Preorder and Inorder Traversal](./src/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal.md) | [Python3](./src/0105.construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal.py) | 44.24% | Medium | [Array](./src/Topics.md#array) | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0106 | [Construct Binary Tree from Inorder and Postorder Traversal](./src/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal.md) | [Python3](./src/0106.construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal.py) | 41.91% | Medium | [Array](./src/Topics.md#array) | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0107 | [Binary Tree Level Order Traversal II](./src/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii.md) | [Python3](./src/0107.binary-tree-level-order-traversal-ii/binary-tree-level-order-traversal-ii.py) | 48.95% | Easy | [Tree](./src/Topics.md#tree) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0108 | [Convert Sorted Array to Binary Search Tree](./src/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree.md) | [Python3](./src/0108.convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree.py) | 53.67% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0109 | [Convert Sorted List to Binary Search Tree](./src/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree.md) | [Python3](./src/0109.convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree.py) | 43.51% | Medium | [Linked List](./src/Topics.md#linked-list) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0110 | [Balanced Binary Tree](./src/0110.balanced-binary-tree/balanced-binary-tree.md) | [Python3](./src/0110.balanced-binary-tree/balanced-binary-tree.py) | 42.09% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0111 | [Minimum Depth of Binary Tree](./src/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.md) | [Python3](./src/0111.minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.py) | 36.18% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0112 | [Path Sum](./src/0112.path-sum/path-sum.md) | [Python3](./src/0112.path-sum/path-sum.py) | 39.18% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0113 | [Path Sum II](./src/0113.path-sum-ii/path-sum-ii.md) | [Python3](./src/0113.path-sum-ii/path-sum-ii.py) | 43.10% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0114 | [Flatten Binary Tree to Linked List](./src/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list.md) | [Python3](./src/0114.flatten-binary-tree-to-linked-list/flatten-binary-tree-to-linked-list.py) | 45.15% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0116 | [Populating Next Right Pointers in Each Node](./src/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node.md) | [Python3](./src/0116.populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node.py) | 40.34% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0117 | [Populating Next Right Pointers in Each Node II](./src/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii.md) | [Python3](./src/0117.populating-next-right-pointers-in-each-node-ii/populating-next-right-pointers-in-each-node-ii.py) | 36.24% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0118 | [Pascal's Triangle](./src/0118.pascals-triangle/pascals-triangle.md) | [Python3](./src/0118.pascals-triangle/pascals-triangle.py) | 48.82% | Easy | [Array](./src/Topics.md#array) |
| 0119 | [Pascal's Triangle II](./src/0119.pascals-triangle-ii/pascals-triangle-ii.md) | [Python3](./src/0119.pascals-triangle-ii/pascals-triangle-ii.py) | 45.95% | Easy | [Array](./src/Topics.md#array) |
| 0120 | [Triangle](./src/0120.triangle/triangle.md) | [Python3](./src/0120.triangle/triangle.py) | 41.41% | Medium | [Array](./src/Topics.md#array) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0121 | [Best Time to Buy and Sell Stock](./src/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.md) | [Python3](./src/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.py) | 48.72% | Easy | [Array](./src/Topics.md#array) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0122 | [Best Time to Buy and Sell Stock II](./src/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii.md) | [Python3](./src/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii.py) | 53.65% | Easy | [Array](./src/Topics.md#array) | [Greedy](./src/Topics.md#greedy) |
| 0123 | [Best Time to Buy and Sell Stock III](./src/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii.md) | [Python3](./src/0123.best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii.py) | 35.37% | Hard | [Array](./src/Topics.md#array) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0124 | [Binary Tree Maximum Path Sum](./src/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum.md) | [Python3](./src/0124.binary-tree-maximum-path-sum/binary-tree-maximum-path-sum.py) | 31.60% | Hard | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0125 | [Valid Palindrome](./src/0125.valid-palindrome/valid-palindrome.md) | [Python3](./src/0125.valid-palindrome/valid-palindrome.py) | 33.10% | Easy | [Two Pointers](./src/Topics.md#two-pointers) | [String](./src/Topics.md#string) |
| 0129 | [Sum Root to Leaf Numbers](./src/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers.md) | [Python3](./src/0129.sum-root-to-leaf-numbers/sum-root-to-leaf-numbers.py) | 44.49% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0130 | [Surrounded Regions](./src/0130.surrounded-regions/surrounded-regions.md) | [Python3](./src/0130.surrounded-regions/surrounded-regions.py) | 24.60% | Medium | [Depth-first Search](./src/Topics.md#depth-first-search) | [Breadth-first Search](./src/Topics.md#breadth-first-search) | [Union Find](./src/Topics.md#union-find) |
| 0136 | [Single Number](./src/0136.single-number/single-number.md) | [Python3](./src/0136.single-number/single-number.py) | 62.06% | Easy | [Hash Table](./src/Topics.md#hash-table) | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0137 | [Single Number II](./src/0137.single-number-ii/single-number-ii.md) | [Python3](./src/0137.single-number-ii/single-number-ii.py) | 47.73% | Medium | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0138 | [Copy List with Random Pointer](./src/0138.copy-list-with-random-pointer/copy-list-with-random-pointer.md) | [Python3](./src/0138.copy-list-with-random-pointer/copy-list-with-random-pointer.py) | 30.50% | Medium | [Hash Table](./src/Topics.md#hash-table) | [Linked List](./src/Topics.md#linked-list) |
| 0139 | [Word Break](./src/0139.word-break/word-break.md) | [Python3](./src/0139.word-break/word-break.py) | 37.33% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0142 | [Linked List Cycle II](./src/0142.linked-list-cycle-ii/linked-list-cycle-ii.md) | [Python3](./src/0142.linked-list-cycle-ii/linked-list-cycle-ii.py) | 34.21% | Medium | [Linked List](./src/Topics.md#linked-list) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0143 | [Reorder List](./src/0143.reorder-list/reorder-list.md) | [Python3](./src/0143.reorder-list/reorder-list.py) | 33.18% | Medium | [Linked List](./src/Topics.md#linked-list) |
| 0144 | [Binary Tree Preorder Traversal](./src/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal.md) | [Python3](./src/0144.binary-tree-preorder-traversal/binary-tree-preorder-traversal.py) | 53.19% | Medium | [Stack](./src/Topics.md#stack) | [Tree](./src/Topics.md#tree) |
| 0145 | [Binary Tree Postorder Traversal](./src/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal.md) | [Python3](./src/0145.binary-tree-postorder-traversal/binary-tree-postorder-traversal.py) | 51.15% | Hard | [Stack](./src/Topics.md#stack) | [Tree](./src/Topics.md#tree) |
| 0150 | [Evaluate Reverse Polish Notation](./src/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation.md) | [Python3](./src/0150.evaluate-reverse-polish-notation/evaluate-reverse-polish-notation.py) | 33.97% | Medium | [Stack](./src/Topics.md#stack) |
| 0151 | [Reverse Words in a String](./src/0151.reverse-words-in-a-string/reverse-words-in-a-string.md) | [Python3](./src/0151.reverse-words-in-a-string/reverse-words-in-a-string.py) | 18.51% | Medium | [String](./src/Topics.md#string) |
| 0152 | [Maximum Product Subarray](./src/0152.maximum-product-subarray/maximum-product-subarray.md) | [Python3](./src/0152.maximum-product-subarray/maximum-product-subarray.py) | 30.38% | Medium | [Array](./src/Topics.md#array) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0153 | [Find Minimum in Rotated Sorted Array](./src/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array.md) | [Python3](./src/0153.find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array.py) | 43.87% | Medium | [Array](./src/Topics.md#array) | [Binary Search](./src/Topics.md#binary-search) |
| 0154 | [Find Minimum in Rotated Sorted Array II](./src/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii.md) | [Python3](./src/0154.find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii.py) | 39.98% | Hard | [Array](./src/Topics.md#array) | [Binary Search](./src/Topics.md#binary-search) |
| 0155 | [Min Stack](./src/0155.min-stack/min-stack.md) | [Python3](./src/0155.min-stack/min-stack.py) | 39.70% | Easy | [Stack](./src/Topics.md#stack) | [Design](./src/Topics.md#design) |
| 0162 | [Find Peak Element](./src/0162.find-peak-element/find-peak-element.md) | [Python3](./src/0162.find-peak-element/find-peak-element.py) | 42.18% | Medium | [Array](./src/Topics.md#array) | [Binary Search](./src/Topics.md#binary-search) |
| 0167 | [Two Sum II - Input array is sorted](./src/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.md) | [Python3](./src/0167.two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.py) | 51.86% | Easy | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) | [Binary Search](./src/Topics.md#binary-search) |
| 0168 | [Excel Sheet Column Title](./src/0168.excel-sheet-column-title/excel-sheet-column-title.md) | [Python3](./src/0168.excel-sheet-column-title/excel-sheet-column-title.py) | 29.86% | Easy | [Math](./src/Topics.md#math) |
| 0169 | [Majority Element](./src/0169.majority-element/majority-element.md) | [Python3](./src/0169.majority-element/majority-element.py) | 54.86% | Easy | [Array](./src/Topics.md#array) | [Divide and Conquer](./src/Topics.md#divide-and-conquer) | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0171 | [Excel Sheet Column Number](./src/0171.excel-sheet-column-number/excel-sheet-column-number.md) | [Python3](./src/0171.excel-sheet-column-number/excel-sheet-column-number.py) | 52.72% | Easy | [Math](./src/Topics.md#math) |
| 0179 | [Largest Number](./src/0179.largest-number/largest-number.md) | [Python3](./src/0179.largest-number/largest-number.py) | 26.92% | Medium | [Sort](./src/Topics.md#sort) |
| 0189 | [Rotate Array](./src/0189.rotate-array/rotate-array.md) | [Python3](./src/0189.rotate-array/rotate-array.py) | 32.10% | Easy | [Array](./src/Topics.md#array) |
| 0198 | [House Robber](./src/0198.house-robber/house-robber.md) | [Python3](./src/0198.house-robber/house-robber.py) | 41.45% | Easy | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0199 | [Binary Tree Right Side View](./src/0199.binary-tree-right-side-view/binary-tree-right-side-view.md) | [Python3](./src/0199.binary-tree-right-side-view/binary-tree-right-side-view.py) | 50.45% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0200 | [Number of Islands](./src/0200.number-of-islands/number-of-islands.md) | [Python3](./src/0200.number-of-islands/number-of-islands.py) | 43.72% | Medium | [Depth-first Search](./src/Topics.md#depth-first-search) | [Breadth-first Search](./src/Topics.md#breadth-first-search) | [Union Find](./src/Topics.md#union-find) |
| 0201 | [Bitwise AND of Numbers Range](./src/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range.md) | [Python3](./src/0201.bitwise-and-of-numbers-range/bitwise-and-of-numbers-range.py) | 36.80% | Medium | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0202 | [Happy Number](./src/0202.happy-number/happy-number.md) | [Python3](./src/0202.happy-number/happy-number.py) | 47.41% | Easy | [Hash Table](./src/Topics.md#hash-table) | [Math](./src/Topics.md#math) |
| 0203 | [Remove Linked List Elements](./src/0203.remove-linked-list-elements/remove-linked-list-elements.md) | [Python3](./src/0203.remove-linked-list-elements/remove-linked-list-elements.py) | 36.70% | Easy | [Linked List](./src/Topics.md#linked-list) |
| 0204 | [Count Primes](./src/0204.count-primes/count-primes.md) | [Python3](./src/0204.count-primes/count-primes.py) | 30.16% | Easy | [Hash Table](./src/Topics.md#hash-table) | [Math](./src/Topics.md#math) |
| 0206 | [Reverse Linked List](./src/0206.reverse-linked-list/reverse-linked-list.md) | [Python3](./src/0206.reverse-linked-list/reverse-linked-list.py) | 58.03% | Easy | [Linked List](./src/Topics.md#linked-list) |
| 0209 | [Minimum Size Subarray Sum](./src/0209.minimum-size-subarray-sum/minimum-size-subarray-sum.md) | [Python3](./src/0209.minimum-size-subarray-sum/minimum-size-subarray-sum.py) | 36.01% | Medium | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) | [Binary Search](./src/Topics.md#binary-search) |
| 0213 | [House Robber II](./src/0213.house-robber-ii/house-robber-ii.md) | [Python3](./src/0213.house-robber-ii/house-robber-ii.py) | 35.73% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0215 | [Kth Largest Element in an Array](./src/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array.md) | [Python3](./src/0215.kth-largest-element-in-an-array/kth-largest-element-in-an-array.py) | 50.95% | Medium | [Divide and Conquer](./src/Topics.md#divide-and-conquer) | [Heap](./src/Topics.md#heap) |
| 0217 | [Contains Duplicate](./src/0217.contains-duplicate/contains-duplicate.md) | [Python3](./src/0217.contains-duplicate/contains-duplicate.py) | 53.98% | Easy | [Array](./src/Topics.md#array) | [Hash Table](./src/Topics.md#hash-table) |
| 0219 | [Contains Duplicate II](./src/0219.contains-duplicate-ii/contains-duplicate-ii.md) | [Python3](./src/0219.contains-duplicate-ii/contains-duplicate-ii.py) | 36.32% | Easy | [Array](./src/Topics.md#array) | [Hash Table](./src/Topics.md#hash-table) |
| 0220 | [Contains Duplicate III](./src/0220.contains-duplicate-iii/contains-duplicate-iii.md) | [Python3](./src/0220.contains-duplicate-iii/contains-duplicate-iii.py) | 20.28% | Medium | [Sort](./src/Topics.md#sort) | [Ordered Map](./src/Topics.md#ordered-map) |
| 0221 | [Maximal Square](./src/0221.maximal-square/maximal-square.md) | [Python3](./src/0221.maximal-square/maximal-square.py) | 34.62% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0222 | [Count Complete Tree Nodes](./src/0222.count-complete-tree-nodes/count-complete-tree-nodes.md) | [Python3](./src/0222.count-complete-tree-nodes/count-complete-tree-nodes.py) | 38.82% | Medium | [Binary Search](./src/Topics.md#binary-search) | [Tree](./src/Topics.md#tree) |
| 0226 | [Invert Binary Tree](./src/0226.invert-binary-tree/invert-binary-tree.md) | [Python3](./src/0226.invert-binary-tree/invert-binary-tree.py) | 60.46% | Easy | [Tree](./src/Topics.md#tree) |
| 0230 | [Kth Smallest Element in a BST](./src/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst.md) | [Python3](./src/0230.kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst.py) | 54.43% | Medium | [Binary Search](./src/Topics.md#binary-search) | [Tree](./src/Topics.md#tree) |
| 0231 | [Power of Two](./src/0231.power-of-two/power-of-two.md) | [Python3](./src/0231.power-of-two/power-of-two.py) | 42.54% | Easy | [Math](./src/Topics.md#math) | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0232 | [Implement Queue using Stacks](./src/0232.implement-queue-using-stacks/implement-queue-using-stacks.md) | [Python3](./src/0232.implement-queue-using-stacks/implement-queue-using-stacks.py) | 45.84% | Easy | [Stack](./src/Topics.md#stack) | [Design](./src/Topics.md#design) |
| 0233 | [Number of Digit One](./src/0233.number-of-digit-one/number-of-digit-one.md) | [Python3](./src/0233.number-of-digit-one/number-of-digit-one.py) | 30.78% | Hard | [Math](./src/Topics.md#math) |
| 0234 | [Palindrome Linked List](./src/0234.palindrome-linked-list/palindrome-linked-list.md) | [Python3](./src/0234.palindrome-linked-list/palindrome-linked-list.py) | 37.38% | Easy | [Linked List](./src/Topics.md#linked-list) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0235 | [Lowest Common Ancestor of a Binary Search Tree](./src/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.md) | [Python3](./src/0235.lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.py) | 47.05% | Easy | [Tree](./src/Topics.md#tree) |
| 0236 | [Lowest Common Ancestor of a Binary Tree](./src/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree.md) | [Python3](./src/0236.lowest-common-ancestor-of-a-binary-tree/lowest-common-ancestor-of-a-binary-tree.py) | 40.98% | Medium | [Tree](./src/Topics.md#tree) |
| 0237 | [Delete Node in a Linked List](./src/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list.md) | [Python3](./src/0237.delete-node-in-a-linked-list/delete-node-in-a-linked-list.py) | 56.65% | Easy | [Linked List](./src/Topics.md#linked-list) |
| 0239 | [Sliding Window Maximum](./src/0239.sliding-window-maximum/sliding-window-maximum.md) | [Python3](./src/0239.sliding-window-maximum/sliding-window-maximum.py) | 40.03% | Hard | [Heap](./src/Topics.md#heap) | [Sliding Window](./src/Topics.md#sliding-window) |
| 0240 | [Search a 2D Matrix II](./src/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii.md) | [Python3](./src/0240.search-a-2d-matrix-ii/search-a-2d-matrix-ii.py) | 41.90% | Medium | [Binary Search](./src/Topics.md#binary-search) | [Divide and Conquer](./src/Topics.md#divide-and-conquer) |
| 0242 | [Valid Anagram](./src/0242.valid-anagram/valid-anagram.md) | [Python3](./src/0242.valid-anagram/valid-anagram.py) | 54.22% | Easy | [Hash Table](./src/Topics.md#hash-table) | [Sort](./src/Topics.md#sort) |
| 0257 | [Binary Tree Paths](./src/0257.binary-tree-paths/binary-tree-paths.md) | [Python3](./src/0257.binary-tree-paths/binary-tree-paths.py) | 48.02% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0260 | [Single Number III](./src/0260.single-number-iii/single-number-iii.md) | [Python3](./src/0260.single-number-iii/single-number-iii.py) | 58.74% | Medium | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0263 | [Ugly Number](./src/0263.ugly-number/ugly-number.md) | [Python3](./src/0263.ugly-number/ugly-number.py) | 41.07% | Easy | [Math](./src/Topics.md#math) |
| 0264 | [Ugly Number II](./src/0264.ugly-number-ii/ugly-number-ii.md) | [Python3](./src/0264.ugly-number-ii/ugly-number-ii.py) | 37.98% | Medium | [Math](./src/Topics.md#math) | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Heap](./src/Topics.md#heap) |
| 0268 | [Missing Number](./src/0268.missing-number/missing-number.md) | [Python3](./src/0268.missing-number/missing-number.py) | 49.60% | Easy | [Array](./src/Topics.md#array) | [Math](./src/Topics.md#math) | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0278 | [First Bad Version](./src/0278.first-bad-version/first-bad-version.md) | [Python3](./src/0278.first-bad-version/first-bad-version.py) | 32.03% | Easy | [Binary Search](./src/Topics.md#binary-search) |
| 0279 | [Perfect Squares](./src/0279.perfect-squares/perfect-squares.md) | [Python3](./src/0279.perfect-squares/perfect-squares.py) | 43.46% | Medium | [Math](./src/Topics.md#math) | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0283 | [Move Zeroes](./src/0283.move-zeroes/move-zeroes.md) | [Python3](./src/0283.move-zeroes/move-zeroes.py) | 55.63% | Easy | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0287 | [Find the Duplicate Number](./src/0287.find-the-duplicate-number/find-the-duplicate-number.md) | [Python3](./src/0287.find-the-duplicate-number/find-the-duplicate-number.py) | 51.65% | Medium | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) | [Binary Search](./src/Topics.md#binary-search) |
| 0290 | [Word Pattern](./src/0290.word-pattern/word-pattern.md) | [Python3](./src/0290.word-pattern/word-pattern.py) | 35.88% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 0292 | [Nim Game](./src/0292.nim-game/nim-game.md) | [Python3](./src/0292.nim-game/nim-game.py) | 55.92% | Easy | [Brainteaser](./src/Topics.md#brainteaser) | [Minimax](./src/Topics.md#minimax) |
| 0297 | [Serialize and Deserialize Binary Tree](./src/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree.md) | [Python3](./src/0297.serialize-and-deserialize-binary-tree/serialize-and-deserialize-binary-tree.py) | 43.77% | Hard | [Tree](./src/Topics.md#tree) | [Design](./src/Topics.md#design) |
| 0300 | [Longest Increasing Subsequence](./src/0300.longest-increasing-subsequence/longest-increasing-subsequence.md) | [Python3](./src/0300.longest-increasing-subsequence/longest-increasing-subsequence.py) | 41.69% | Medium | [Binary Search](./src/Topics.md#binary-search) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0303 | [Range Sum Query - Immutable](./src/0303.range-sum-query-immutable/range-sum-query-immutable.md) | [Python3](./src/0303.range-sum-query-immutable/range-sum-query-immutable.py) | 40.70% | Easy | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0312 | [Burst Balloons](./src/0312.burst-balloons/burst-balloons.md) | [Python3](./src/0312.burst-balloons/burst-balloons.py) | 49.17% | Hard | [Divide and Conquer](./src/Topics.md#divide-and-conquer) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0315 | [Count of Smaller Numbers After Self](./src/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self.md) | [Python3](./src/0315.count-of-smaller-numbers-after-self/count-of-smaller-numbers-after-self.py) | 39.99% | Hard | [Binary Search](./src/Topics.md#binary-search) | [Divide and Conquer](./src/Topics.md#divide-and-conquer) | [Sort](./src/Topics.md#sort) | [Binary Indexed Tree](./src/Topics.md#binary-indexed-tree) | [Segment Tree](./src/Topics.md#segment-tree) |
| 0319 | [Bulb Switcher](./src/0319.bulb-switcher/bulb-switcher.md) | [Python3](./src/0319.bulb-switcher/bulb-switcher.py) | 44.67% | Medium | [Math](./src/Topics.md#math) | [Brainteaser](./src/Topics.md#brainteaser) |
| 0322 | [Coin Change](./src/0322.coin-change/coin-change.md) | [Python3](./src/0322.coin-change/coin-change.py) | 32.55% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0326 | [Power of Three](./src/0326.power-of-three/power-of-three.md) | [Python3](./src/0326.power-of-three/power-of-three.py) | 41.88% | Easy | [Math](./src/Topics.md#math) |
| 0328 | [Odd Even Linked List](./src/0328.odd-even-linked-list/odd-even-linked-list.md) | [Python3](./src/0328.odd-even-linked-list/odd-even-linked-list.py) | 51.09% | Medium | [Linked List](./src/Topics.md#linked-list) |
| 0329 | [Longest Increasing Path in a Matrix](./src/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix.md) | [Python3](./src/0329.longest-increasing-path-in-a-matrix/longest-increasing-path-in-a-matrix.py) | 41.49% | Hard | [Depth-first Search](./src/Topics.md#depth-first-search) | [Topological Sort](./src/Topics.md#topological-sort) | [Memoization](./src/Topics.md#memoization) |
| 0337 | [House Robber III](./src/0337.house-robber-iii/house-robber-iii.md) | [Python3](./src/0337.house-robber-iii/house-robber-iii.py) | 49.24% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0338 | [Counting Bits](./src/0338.counting-bits/counting-bits.md) | [Python3](./src/0338.counting-bits/counting-bits.py) | 66.06% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0342 | [Power of Four](./src/0342.power-of-four/power-of-four.md) | [Python3](./src/0342.power-of-four/power-of-four.py) | 40.89% | Easy | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0343 | [Integer Break](./src/0343.integer-break/integer-break.md) | [Python3](./src/0343.integer-break/integer-break.py) | 48.89% | Medium | [Math](./src/Topics.md#math) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0344 | [Reverse String](./src/0344.reverse-string/reverse-string.md) | [Python3](./src/0344.reverse-string/reverse-string.py) | 64.70% | Easy | [Two Pointers](./src/Topics.md#two-pointers) | [String](./src/Topics.md#string) |
| 0345 | [Reverse Vowels of a String](./src/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string.md) | [Python3](./src/0345.reverse-vowels-of-a-string/reverse-vowels-of-a-string.py) | 42.49% | Easy | [Two Pointers](./src/Topics.md#two-pointers) | [String](./src/Topics.md#string) |
| 0349 | [Intersection of Two Arrays](./src/0349.intersection-of-two-arrays/intersection-of-two-arrays.md) | [Python3](./src/0349.intersection-of-two-arrays/intersection-of-two-arrays.py) | 57.93% | Easy | [Hash Table](./src/Topics.md#hash-table) | [Two Pointers](./src/Topics.md#two-pointers) | [Binary Search](./src/Topics.md#binary-search) | [Sort](./src/Topics.md#sort) |
| 0350 | [Intersection of Two Arrays II](./src/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.md) | [Python3](./src/0350.intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.py) | 49.65% | Easy | [Hash Table](./src/Topics.md#hash-table) | [Two Pointers](./src/Topics.md#two-pointers) | [Binary Search](./src/Topics.md#binary-search) | [Sort](./src/Topics.md#sort) |
| 0357 | [Count Numbers with Unique Digits](./src/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits.md) | [Python3](./src/0357.count-numbers-with-unique-digits/count-numbers-with-unique-digits.py) | 47.63% | Medium | [Math](./src/Topics.md#math) | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Backtracking](./src/Topics.md#backtracking) |
| 0371 | [Sum of Two Integers](./src/0371.sum-of-two-integers/sum-of-two-integers.md) | [Python3](./src/0371.sum-of-two-integers/sum-of-two-integers.py) | 50.77% | Easy | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0372 | [Super Pow](./src/0372.super-pow/super-pow.md) | [Python3](./src/0372.super-pow/super-pow.py) | 36.04% | Medium | [Math](./src/Topics.md#math) |
| 0378 | [Kth Smallest Element in a Sorted Matrix](./src/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix.md) | [Python3](./src/0378.kth-smallest-element-in-a-sorted-matrix/kth-smallest-element-in-a-sorted-matrix.py) | 51.36% | Medium | [Binary Search](./src/Topics.md#binary-search) | [Heap](./src/Topics.md#heap) |
| 0383 | [Ransom Note](./src/0383.ransom-note/ransom-note.md) | [Python3](./src/0383.ransom-note/ransom-note.py) | 51.04% | Easy | [String](./src/Topics.md#string) |
| 0384 | [Shuffle an Array](./src/0384.shuffle-an-array/shuffle-an-array.md) | [Python3](./src/0384.shuffle-an-array/shuffle-an-array.py) | 51.26% | Medium | |
| 0387 | [First Unique Character in a String](./src/0387.first-unique-character-in-a-string/first-unique-character-in-a-string.md) | [Python3](./src/0387.first-unique-character-in-a-string/first-unique-character-in-a-string.py) | 50.99% | Easy | [Hash Table](./src/Topics.md#hash-table) | [String](./src/Topics.md#string) |
| 0389 | [Find the Difference](./src/0389.find-the-difference/find-the-difference.md) | [Python3](./src/0389.find-the-difference/find-the-difference.py) | 53.93% | Easy | [Hash Table](./src/Topics.md#hash-table) | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0400 | [Nth Digit](./src/0400.nth-digit/nth-digit.md) | [Python3](./src/0400.nth-digit/nth-digit.py) | 30.81% | Medium | [Math](./src/Topics.md#math) |
| 0404 | [Sum of Left Leaves](./src/0404.sum-of-left-leaves/sum-of-left-leaves.md) | [Python3](./src/0404.sum-of-left-leaves/sum-of-left-leaves.py) | 49.89% | Easy | [Tree](./src/Topics.md#tree) |
| 0409 | [Longest Palindrome](./src/0409.longest-palindrome/longest-palindrome.md) | [Python3](./src/0409.longest-palindrome/longest-palindrome.py) | 49.03% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 0412 | [Fizz Buzz](./src/0412.fizz-buzz/fizz-buzz.md) | [Python3](./src/0412.fizz-buzz/fizz-buzz.py) | 60.45% | Easy | |
| 0415 | [Add Strings](./src/0415.add-strings/add-strings.md) | [Python3](./src/0415.add-strings/add-strings.py) | 45.26% | Easy | [String](./src/Topics.md#string) |
| 0429 | [N-ary Tree Level Order Traversal](./src/0429.n-ary-tree-level-order-traversal/n-ary-tree-level-order-traversal.md) | [Python3](./src/0429.n-ary-tree-level-order-traversal/n-ary-tree-level-order-traversal.py) | 61.29% | Medium | [Tree](./src/Topics.md#tree) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0430 | [Flatten a Multilevel Doubly Linked List](./src/0430.flatten-a-multilevel-doubly-linked-list/flatten-a-multilevel-doubly-linked-list.md) | [Python3](./src/0430.flatten-a-multilevel-doubly-linked-list/flatten-a-multilevel-doubly-linked-list.py) | 45.96% | Medium | [Linked List](./src/Topics.md#linked-list) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0434 | [Number of Segments in a String](./src/0434.number-of-segments-in-a-string/number-of-segments-in-a-string.md) | [Python3](./src/0434.number-of-segments-in-a-string/number-of-segments-in-a-string.py) | 37.32% | Easy | [String](./src/Topics.md#string) |
| 0437 | [Path Sum III](./src/0437.path-sum-iii/path-sum-iii.md) | [Python3](./src/0437.path-sum-iii/path-sum-iii.py) | 44.21% | Easy | [Tree](./src/Topics.md#tree) |
| 0442 | [Find All Duplicates in an Array](./src/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array.md) | [Python3](./src/0442.find-all-duplicates-in-an-array/find-all-duplicates-in-an-array.py) | 62.97% | Medium | [Array](./src/Topics.md#array) |
| 0445 | [Add Two Numbers II](./src/0445.add-two-numbers-ii/add-two-numbers-ii.md) | [Python3](./src/0445.add-two-numbers-ii/add-two-numbers-ii.py) | 51.93% | Medium | [Linked List](./src/Topics.md#linked-list) |
| 0459 | [Repeated Substring Pattern](./src/0459.repeated-substring-pattern/repeated-substring-pattern.md) | [Python3](./src/0459.repeated-substring-pattern/repeated-substring-pattern.py) | 40.73% | Easy | [String](./src/Topics.md#string) |
| 0461 | [Hamming Distance](./src/0461.hamming-distance/hamming-distance.md) | [Python3](./src/0461.hamming-distance/hamming-distance.py) | 70.80% | Easy | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0463 | [Island Perimeter](./src/0463.island-perimeter/island-perimeter.md) | [Python3](./src/0463.island-perimeter/island-perimeter.py) | 62.17% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 0470 | [Implement Rand10() Using Rand7()](./src/0470.implement-rand10-using-rand7/implement-rand10-using-rand7.md) | [Python3](./src/0470.implement-rand10-using-rand7/implement-rand10-using-rand7.py) | 45.54% | Medium | [Random](./src/Topics.md#random) | [Rejection Sampling](./src/Topics.md#rejection-sampling) |
| 0476 | [Number Complement](./src/0476.number-complement/number-complement.md) | [Python3](./src/0476.number-complement/number-complement.py) | 62.89% | Easy | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 0485 | [Max Consecutive Ones](./src/0485.max-consecutive-ones/max-consecutive-ones.md) | [Python3](./src/0485.max-consecutive-ones/max-consecutive-ones.py) | 55.80% | Easy | [Array](./src/Topics.md#array) |
| 0496 | [Next Greater Element I](./src/0496.next-greater-element-i/next-greater-element-i.md) | [Python3](./src/0496.next-greater-element-i/next-greater-element-i.py) | 61.21% | Easy | [Stack](./src/Topics.md#stack) |
| 0500 | [Keyboard Row](./src/0500.keyboard-row/keyboard-row.md) | [Python3](./src/0500.keyboard-row/keyboard-row.py) | 63.19% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 0503 | [Next Greater Element II](./src/0503.next-greater-element-ii/next-greater-element-ii.md) | [Python3](./src/0503.next-greater-element-ii/next-greater-element-ii.py) | 52.85% | Medium | [Stack](./src/Topics.md#stack) |
| 0508 | [Most Frequent Subtree Sum](./src/0508.most-frequent-subtree-sum/most-frequent-subtree-sum.md) | [Python3](./src/0508.most-frequent-subtree-sum/most-frequent-subtree-sum.py) | 55.93% | Medium | [Hash Table](./src/Topics.md#hash-table) | [Tree](./src/Topics.md#tree) |
| 0509 | [Fibonacci Number](./src/0509.fibonacci-number/fibonacci-number.md) | [Python3](./src/0509.fibonacci-number/fibonacci-number.py) | 66.62% | Easy | [Array](./src/Topics.md#array) |
| 0513 | [Find Bottom Left Tree Value](./src/0513.find-bottom-left-tree-value/find-bottom-left-tree-value.md) | [Python3](./src/0513.find-bottom-left-tree-value/find-bottom-left-tree-value.py) | 59.74% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0515 | [Find Largest Value in Each Tree Row](./src/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row.md) | [Python3](./src/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row.py) | 58.85% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0520 | [Detect Capital](./src/0520.detect-capital/detect-capital.md) | [Python3](./src/0520.detect-capital/detect-capital.py) | 52.81% | Easy | [String](./src/Topics.md#string) |
| 0521 | [Longest Uncommon Subsequence I ](./src/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i.md) | [Python3](./src/0521.longest-uncommon-subsequence-i/longest-uncommon-subsequence-i.py) | 56.95% | Easy | [String](./src/Topics.md#string) |
| 0523 | [Continuous Subarray Sum](./src/0523.continuous-subarray-sum/continuous-subarray-sum.md) | [Python3](./src/0523.continuous-subarray-sum/continuous-subarray-sum.py) | 24.38% | Medium | [Math](./src/Topics.md#math) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0530 | [Minimum Absolute Difference in BST](./src/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst.md) | [Python3](./src/0530.minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst.py) | 51.80% | Easy | [Tree](./src/Topics.md#tree) |
| 0538 | [Convert BST to Greater Tree](./src/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree.md) | [Python3](./src/0538.convert-bst-to-greater-tree/convert-bst-to-greater-tree.py) | 52.80% | Easy | [Tree](./src/Topics.md#tree) |
| 0540 | [Single Element in a Sorted Array](./src/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array.md) | [Python3](./src/0540.single-element-in-a-sorted-array/single-element-in-a-sorted-array.py) | 57.54% | Medium | |
| 0541 | [Reverse String II](./src/0541.reverse-string-ii/reverse-string-ii.md) | [Python3](./src/0541.reverse-string-ii/reverse-string-ii.py) | 46.63% | Easy | [String](./src/Topics.md#string) |
| 0543 | [Diameter of Binary Tree](./src/0543.diameter-of-binary-tree/diameter-of-binary-tree.md) | [Python3](./src/0543.diameter-of-binary-tree/diameter-of-binary-tree.py) | 47.80% | Easy | [Tree](./src/Topics.md#tree) |
| 0551 | [Student Attendance Record I](./src/0551.student-attendance-record-i/student-attendance-record-i.md) | [Python3](./src/0551.student-attendance-record-i/student-attendance-record-i.py) | 46.12% | Easy | [String](./src/Topics.md#string) |
| 0556 | [Next Greater Element III](./src/0556.next-greater-element-iii/next-greater-element-iii.md) | [Python3](./src/0556.next-greater-element-iii/next-greater-element-iii.py) | 30.68% | Medium | [String](./src/Topics.md#string) |
| 0557 | [Reverse Words in a String III](./src/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii.md) | [Python3](./src/0557.reverse-words-in-a-string-iii/reverse-words-in-a-string-iii.py) | 66.34% | Easy | [String](./src/Topics.md#string) |
| 0559 | [Maximum Depth of N-ary Tree](./src/0559.maximum-depth-of-n-ary-tree/maximum-depth-of-n-ary-tree.md) | [Python3](./src/0559.maximum-depth-of-n-ary-tree/maximum-depth-of-n-ary-tree.py) | 66.51% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0561 | [Array Partition I](./src/0561.array-partition-i/array-partition-i.md) | [Python3](./src/0561.array-partition-i/array-partition-i.py) | 70.39% | Easy | [Array](./src/Topics.md#array) |
| 0575 | [Distribute Candies](./src/0575.distribute-candies/distribute-candies.md) | [Python3](./src/0575.distribute-candies/distribute-candies.py) | 60.30% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 0583 | [Delete Operation for Two Strings](./src/0583.delete-operation-for-two-strings/delete-operation-for-two-strings.md) | [Python3](./src/0583.delete-operation-for-two-strings/delete-operation-for-two-strings.py) | 46.15% | Medium | [String](./src/Topics.md#string) |
| 0589 | [N-ary Tree Preorder Traversal](./src/0589.n-ary-tree-preorder-traversal/n-ary-tree-preorder-traversal.md) | [Python3](./src/0589.n-ary-tree-preorder-traversal/n-ary-tree-preorder-traversal.py) | 69.40% | Easy | [Tree](./src/Topics.md#tree) |
| 0590 | [N-ary Tree Postorder Traversal](./src/0590.n-ary-tree-postorder-traversal/n-ary-tree-postorder-traversal.md) | [Python3](./src/0590.n-ary-tree-postorder-traversal/n-ary-tree-postorder-traversal.py) | 69.38% | Easy | [Tree](./src/Topics.md#tree) |
| 0606 | [Construct String from Binary Tree](./src/0606.construct-string-from-binary-tree/construct-string-from-binary-tree.md) | [Python3](./src/0606.construct-string-from-binary-tree/construct-string-from-binary-tree.py) | 52.53% | Easy | [String](./src/Topics.md#string) | [Tree](./src/Topics.md#tree) |
| 0611 | [Valid Triangle Number](./src/0611.valid-triangle-number/valid-triangle-number.md) | [Python3](./src/0611.valid-triangle-number/valid-triangle-number.py) | 46.76% | Medium | [Array](./src/Topics.md#array) |
| 0617 | [Merge Two Binary Trees](./src/0617.merge-two-binary-trees/merge-two-binary-trees.md) | [Python3](./src/0617.merge-two-binary-trees/merge-two-binary-trees.py) | 71.76% | Easy | [Tree](./src/Topics.md#tree) |
| 0637 | [Average of Levels in Binary Tree](./src/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree.md) | [Python3](./src/0637.average-of-levels-in-binary-tree/average-of-levels-in-binary-tree.py) | 60.31% | Easy | [Tree](./src/Topics.md#tree) |
| 0643 | [Maximum Average Subarray I](./src/0643.maximum-average-subarray-i/maximum-average-subarray-i.md) | [Python3](./src/0643.maximum-average-subarray-i/maximum-average-subarray-i.py) | 40.47% | Easy | [Array](./src/Topics.md#array) |
| 0653 | [Two Sum IV - Input is a BST](./src/0653.two-sum-iv-input-is-a-bst/two-sum-iv-input-is-a-bst.md) | [Python3](./src/0653.two-sum-iv-input-is-a-bst/two-sum-iv-input-is-a-bst.py) | 53.74% | Easy | [Tree](./src/Topics.md#tree) |
| 0654 | [Maximum Binary Tree](./src/0654.maximum-binary-tree/maximum-binary-tree.md) | [Python3](./src/0654.maximum-binary-tree/maximum-binary-tree.py) | 77.59% | Medium | [Tree](./src/Topics.md#tree) |
| 0655 | [Print Binary Tree](./src/0655.print-binary-tree/print-binary-tree.md) | [Python3](./src/0655.print-binary-tree/print-binary-tree.py) | 52.91% | Medium | [Tree](./src/Topics.md#tree) |
| 0657 | [Robot Return to Origin](./src/0657.robot-return-to-origin/robot-return-to-origin.md) | [Python3](./src/0657.robot-return-to-origin/robot-return-to-origin.py) | 72.49% | Easy | [String](./src/Topics.md#string) |
| 0662 | [Maximum Width of Binary Tree](./src/0662.maximum-width-of-binary-tree/maximum-width-of-binary-tree.md) | [Python3](./src/0662.maximum-width-of-binary-tree/maximum-width-of-binary-tree.py) | 39.56% | Medium | [Tree](./src/Topics.md#tree) |
| 0669 | [Trim a Binary Search Tree](./src/0669.trim-a-binary-search-tree/trim-a-binary-search-tree.md) | [Python3](./src/0669.trim-a-binary-search-tree/trim-a-binary-search-tree.py) | 61.29% | Easy | [Tree](./src/Topics.md#tree) |
| 0670 | [Maximum Swap](./src/0670.maximum-swap/maximum-swap.md) | [Python3](./src/0670.maximum-swap/maximum-swap.py) | 41.22% | Medium | [Array](./src/Topics.md#array) | [Math](./src/Topics.md#math) |
| 0671 | [Second Minimum Node In a Binary Tree](./src/0671.second-minimum-node-in-a-binary-tree/second-minimum-node-in-a-binary-tree.md) | [Python3](./src/0671.second-minimum-node-in-a-binary-tree/second-minimum-node-in-a-binary-tree.py) | 43.05% | Easy | [Tree](./src/Topics.md#tree) |
| 0701 | [Insert into a Binary Search Tree](./src/0701.insert-into-a-binary-search-tree/insert-into-a-binary-search-tree.md) | [Python3](./src/0701.insert-into-a-binary-search-tree/insert-into-a-binary-search-tree.py) | 77.75% | Medium | [Tree](./src/Topics.md#tree) |
| 0704 | [Binary Search](./src/0704.binary-search/binary-search.md) | [Python3](./src/0704.binary-search/binary-search.py) | 49.83% | Easy | [Binary Search](./src/Topics.md#binary-search) |
| 0707 | [Design Linked List](./src/0707.design-linked-list/design-linked-list.md) | [Python3](./src/0707.design-linked-list/design-linked-list.py) | 21.13% | Medium | [Linked List](./src/Topics.md#linked-list) | [Design](./src/Topics.md#design) |
| 0709 | [To Lower Case](./src/0709.to-lower-case/to-lower-case.md) | [Python3](./src/0709.to-lower-case/to-lower-case.py) | 78.02% | Easy | [String](./src/Topics.md#string) |
| 0725 | [Split Linked List in Parts](./src/0725.split-linked-list-in-parts/split-linked-list-in-parts.md) | [Python3](./src/0725.split-linked-list-in-parts/split-linked-list-in-parts.py) | 50.14% | Medium | [Linked List](./src/Topics.md#linked-list) |
| 0728 | [Self Dividing Numbers](./src/0728.self-dividing-numbers/self-dividing-numbers.md) | [Python3](./src/0728.self-dividing-numbers/self-dividing-numbers.py) | 72.09% | Easy | [Math](./src/Topics.md#math) |
| 0739 | [Daily Temperatures](./src/0739.daily-temperatures/daily-temperatures.md) | [Python3](./src/0739.daily-temperatures/daily-temperatures.py) | 61.20% | Medium | [Hash Table](./src/Topics.md#hash-table) | [Stack](./src/Topics.md#stack) |
| 0744 | [Find Smallest Letter Greater Than Target](./src/0744.find-smallest-letter-greater-than-target/find-smallest-letter-greater-than-target.md) | [Python3](./src/0744.find-smallest-letter-greater-than-target/find-smallest-letter-greater-than-target.py) | 44.59% | Easy | [Binary Search](./src/Topics.md#binary-search) |
| 0763 | [Partition Labels](./src/0763.partition-labels/partition-labels.md) | [Python3](./src/0763.partition-labels/partition-labels.py) | 72.91% | Medium | [Two Pointers](./src/Topics.md#two-pointers) | [Greedy](./src/Topics.md#greedy) |
| 0771 | [Jewels and Stones](./src/0771.jewels-and-stones/jewels-and-stones.md) | [Python3](./src/0771.jewels-and-stones/jewels-and-stones.py) | 84.06% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 0781 | [Rabbits in Forest](./src/0781.rabbits-in-forest/rabbits-in-forest.md) | [Python3](./src/0781.rabbits-in-forest/rabbits-in-forest.py) | 52.73% | Medium | [Hash Table](./src/Topics.md#hash-table) | [Math](./src/Topics.md#math) |
| 0783 | [Minimum Distance Between BST Nodes](./src/0783.minimum-distance-between-bst-nodes/minimum-distance-between-bst-nodes.md) | [Python3](./src/0783.minimum-distance-between-bst-nodes/minimum-distance-between-bst-nodes.py) | 51.05% | Easy | [Tree](./src/Topics.md#tree) | [Recursion](./src/Topics.md#recursion) |
| 0788 | [Rotated Digits](./src/0788.rotated-digits/rotated-digits.md) | [Python3](./src/0788.rotated-digits/rotated-digits.py) | 55.77% | Easy | [String](./src/Topics.md#string) |
| 0791 | [Custom Sort String](./src/0791.custom-sort-string/custom-sort-string.md) | [Python3](./src/0791.custom-sort-string/custom-sort-string.py) | 63.79% | Medium | [String](./src/Topics.md#string) |
| 0804 | [Unique Morse Code Words](./src/0804.unique-morse-code-words/unique-morse-code-words.md) | [Python3](./src/0804.unique-morse-code-words/unique-morse-code-words.py) | 75.51% | Easy | [String](./src/Topics.md#string) |
| 0807 | [Max Increase to Keep City Skyline](./src/0807.max-increase-to-keep-city-skyline/max-increase-to-keep-city-skyline.md) | [Python3](./src/0807.max-increase-to-keep-city-skyline/max-increase-to-keep-city-skyline.py) | 82.40% | Medium | |
| 0811 | [Subdomain Visit Count](./src/0811.subdomain-visit-count/subdomain-visit-count.md) | [Python3](./src/0811.subdomain-visit-count/subdomain-visit-count.py) | 67.01% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 0814 | [Binary Tree Pruning](./src/0814.binary-tree-pruning/binary-tree-pruning.md) | [Python3](./src/0814.binary-tree-pruning/binary-tree-pruning.py) | 72.37% | Medium | [Tree](./src/Topics.md#tree) |
| 0817 | [Linked List Components](./src/0817.linked-list-components/linked-list-components.md) | [Python3](./src/0817.linked-list-components/linked-list-components.py) | 55.88% | Medium | [Linked List](./src/Topics.md#linked-list) |
| 0819 | [Most Common Word](./src/0819.most-common-word/most-common-word.md) | [Python3](./src/0819.most-common-word/most-common-word.py) | 43.16% | Easy | [String](./src/Topics.md#string) |
| 0824 | [Goat Latin](./src/0824.goat-latin/goat-latin.md) | [Python3](./src/0824.goat-latin/goat-latin.py) | 59.66% | Easy | [String](./src/Topics.md#string) |
| 0832 | [Flipping an Image](./src/0832.flipping-an-image/flipping-an-image.md) | [Python3](./src/0832.flipping-an-image/flipping-an-image.py) | 73.97% | Easy | [Array](./src/Topics.md#array) |
| 0841 | [Keys and Rooms](./src/0841.keys-and-rooms/keys-and-rooms.md) | [Python3](./src/0841.keys-and-rooms/keys-and-rooms.py) | 61.85% | Medium | [Depth-first Search](./src/Topics.md#depth-first-search) | [Graph](./src/Topics.md#graph) |
| 0852 | [Peak Index in a Mountain Array](./src/0852.peak-index-in-a-mountain-array/peak-index-in-a-mountain-array.md) | [Python3](./src/0852.peak-index-in-a-mountain-array/peak-index-in-a-mountain-array.py) | 70.43% | Easy | [Binary Search](./src/Topics.md#binary-search) |
| 0859 | [Buddy Strings](./src/0859.buddy-strings/buddy-strings.md) | [Python3](./src/0859.buddy-strings/buddy-strings.py) | 27.79% | Easy | [String](./src/Topics.md#string) |
| 0867 | [Transpose Matrix](./src/0867.transpose-matrix/transpose-matrix.md) | [Python3](./src/0867.transpose-matrix/transpose-matrix.py) | 63.85% | Easy | [Array](./src/Topics.md#array) |
| 0872 | [Leaf-Similar Trees](./src/0872.leaf-similar-trees/leaf-similar-trees.md) | [Python3](./src/0872.leaf-similar-trees/leaf-similar-trees.py) | 64.26% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0874 | [Walking Robot Simulation](./src/0874.walking-robot-simulation/walking-robot-simulation.md) | [Python3](./src/0874.walking-robot-simulation/walking-robot-simulation.py) | 33.47% | Easy | [Greedy](./src/Topics.md#greedy) |
| 0876 | [Middle of the Linked List](./src/0876.middle-of-the-linked-list/middle-of-the-linked-list.md) | [Python3](./src/0876.middle-of-the-linked-list/middle-of-the-linked-list.py) | 65.45% | Easy | [Linked List](./src/Topics.md#linked-list) |
| 0877 | [Stone Game](./src/0877.stone-game/stone-game.md) | [Python3](./src/0877.stone-game/stone-game.py) | 62.76% | Medium | [Math](./src/Topics.md#math) | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Minimax](./src/Topics.md#minimax) |
| 0884 | [Uncommon Words from Two Sentences](./src/0884.uncommon-words-from-two-sentences/uncommon-words-from-two-sentences.md) | [Python3](./src/0884.uncommon-words-from-two-sentences/uncommon-words-from-two-sentences.py) | 61.43% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 0894 | [All Possible Full Binary Trees](./src/0894.all-possible-full-binary-trees/all-possible-full-binary-trees.md) | [Python3](./src/0894.all-possible-full-binary-trees/all-possible-full-binary-trees.py) | 72.31% | Medium | [Tree](./src/Topics.md#tree) | [Recursion](./src/Topics.md#recursion) |
| 0897 | [Increasing Order Search Tree](./src/0897.increasing-order-search-tree/increasing-order-search-tree.md) | [Python3](./src/0897.increasing-order-search-tree/increasing-order-search-tree.py) | 66.40% | Easy | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0905 | [Sort Array By Parity](./src/0905.sort-array-by-parity/sort-array-by-parity.md) | [Python3](./src/0905.sort-array-by-parity/sort-array-by-parity.py) | 73.11% | Easy | [Array](./src/Topics.md#array) |
| 0908 | [Smallest Range I](./src/0908.smallest-range-i/smallest-range-i.md) | [Python3](./src/0908.smallest-range-i/smallest-range-i.py) | 65.04% | Easy | [Math](./src/Topics.md#math) |
| 0912 | [Sort an Array](./src/0912.sort-an-array/sort-an-array.md) | [Python3](./src/0912.sort-an-array/sort-an-array.py) | 62.77% | Medium | |
| 0917 | [Reverse Only Letters](./src/0917.reverse-only-letters/reverse-only-letters.md) | [Python3](./src/0917.reverse-only-letters/reverse-only-letters.py) | 56.54% | Easy | [String](./src/Topics.md#string) |
| 0921 | [Minimum Add to Make Parentheses Valid](./src/0921.minimum-add-to-make-parentheses-valid/minimum-add-to-make-parentheses-valid.md) | [Python3](./src/0921.minimum-add-to-make-parentheses-valid/minimum-add-to-make-parentheses-valid.py) | 70.99% | Medium | [Stack](./src/Topics.md#stack) | [Greedy](./src/Topics.md#greedy) |
| 0922 | [Sort Array By Parity II](./src/0922.sort-array-by-parity-ii/sort-array-by-parity-ii.md) | [Python3](./src/0922.sort-array-by-parity-ii/sort-array-by-parity-ii.py) | 67.42% | Easy | [Array](./src/Topics.md#array) | [Sort](./src/Topics.md#sort) |
| 0929 | [Unique Email Addresses](./src/0929.unique-email-addresses/unique-email-addresses.md) | [Python3](./src/0929.unique-email-addresses/unique-email-addresses.py) | 68.20% | Easy | [String](./src/Topics.md#string) |
| 0931 | [Minimum Falling Path Sum](./src/0931.minimum-falling-path-sum/minimum-falling-path-sum.md) | [Python3](./src/0931.minimum-falling-path-sum/minimum-falling-path-sum.py) | 59.83% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 0933 | [Number of Recent Calls](./src/0933.number-of-recent-calls/number-of-recent-calls.md) | [Python3](./src/0933.number-of-recent-calls/number-of-recent-calls.py) | 69.73% | Easy | [Queue](./src/Topics.md#queue) |
| 0938 | [Range Sum of BST](./src/0938.range-sum-of-bst/range-sum-of-bst.md) | [Python3](./src/0938.range-sum-of-bst/range-sum-of-bst.py) | 78.53% | Easy | [Tree](./src/Topics.md#tree) | [Recursion](./src/Topics.md#recursion) |
| 0942 | [DI String Match](./src/0942.di-string-match/di-string-match.md) | [Python3](./src/0942.di-string-match/di-string-match.py) | 70.19% | Easy | [Math](./src/Topics.md#math) |
| 0944 | [Delete Columns to Make Sorted](./src/0944.delete-columns-to-make-sorted/delete-columns-to-make-sorted.md) | [Python3](./src/0944.delete-columns-to-make-sorted/delete-columns-to-make-sorted.py) | 69.67% | Easy | [Greedy](./src/Topics.md#greedy) |
| 0946 | [Validate Stack Sequences](./src/0946.validate-stack-sequences/validate-stack-sequences.md) | [Python3](./src/0946.validate-stack-sequences/validate-stack-sequences.py) | 58.45% | Medium | [Stack](./src/Topics.md#stack) |
| 0950 | [Reveal Cards In Increasing Order](./src/0950.reveal-cards-in-increasing-order/reveal-cards-in-increasing-order.md) | [Python3](./src/0950.reveal-cards-in-increasing-order/reveal-cards-in-increasing-order.py) | 72.64% | Medium | [Array](./src/Topics.md#array) |
| 0951 | [Flip Equivalent Binary Trees](./src/0951.flip-equivalent-binary-trees/flip-equivalent-binary-trees.md) | [Python3](./src/0951.flip-equivalent-binary-trees/flip-equivalent-binary-trees.py) | 65.23% | Medium | [Tree](./src/Topics.md#tree) |
| 0958 | [Check Completeness of a Binary Tree](./src/0958.check-completeness-of-a-binary-tree/check-completeness-of-a-binary-tree.md) | [Python3](./src/0958.check-completeness-of-a-binary-tree/check-completeness-of-a-binary-tree.py) | 50.40% | Medium | [Tree](./src/Topics.md#tree) |
| 0961 | [N-Repeated Element in Size 2N Array](./src/0961.n-repeated-element-in-size-2n-array/n-repeated-element-in-size-2n-array.md) | [Python3](./src/0961.n-repeated-element-in-size-2n-array/n-repeated-element-in-size-2n-array.py) | 72.73% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 0965 | [Univalued Binary Tree](./src/0965.univalued-binary-tree/univalued-binary-tree.md) | [Python3](./src/0965.univalued-binary-tree/univalued-binary-tree.py) | 66.89% | Easy | [Tree](./src/Topics.md#tree) |
| 0968 | [Binary Tree Cameras](./src/0968.binary-tree-cameras/binary-tree-cameras.md) | [Python3](./src/0968.binary-tree-cameras/binary-tree-cameras.py) | 36.40% | Hard | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0969 | [Pancake Sorting](./src/0969.pancake-sorting/pancake-sorting.md) | [Python3](./src/0969.pancake-sorting/pancake-sorting.py) | 63.15% | Medium | [Array](./src/Topics.md#array) | [Sort](./src/Topics.md#sort) |
| 0977 | [Squares of a Sorted Array](./src/0977.squares-of-a-sorted-array/squares-of-a-sorted-array.md) | [Python3](./src/0977.squares-of-a-sorted-array/squares-of-a-sorted-array.py) | 71.87% | Easy | [Array](./src/Topics.md#array) | [Two Pointers](./src/Topics.md#two-pointers) |
| 0979 | [Distribute Coins in Binary Tree](./src/0979.distribute-coins-in-binary-tree/distribute-coins-in-binary-tree.md) | [Python3](./src/0979.distribute-coins-in-binary-tree/distribute-coins-in-binary-tree.py) | 68.05% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0986 | [Interval List Intersections](./src/0986.interval-list-intersections/interval-list-intersections.md) | [Python3](./src/0986.interval-list-intersections/interval-list-intersections.py) | 64.58% | Medium | [Two Pointers](./src/Topics.md#two-pointers) |
| 0987 | [Vertical Order Traversal of a Binary Tree](./src/0987.vertical-order-traversal-of-a-binary-tree/vertical-order-traversal-of-a-binary-tree.md) | [Python3](./src/0987.vertical-order-traversal-of-a-binary-tree/vertical-order-traversal-of-a-binary-tree.py) | 33.50% | Medium | [Hash Table](./src/Topics.md#hash-table) | [Tree](./src/Topics.md#tree) |
| 0988 | [Smallest String Starting From Leaf](./src/0988.smallest-string-starting-from-leaf/smallest-string-starting-from-leaf.md) | [Python3](./src/0988.smallest-string-starting-from-leaf/smallest-string-starting-from-leaf.py) | 44.84% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 0989 | [Add to Array-Form of Integer](./src/0989.add-to-array-form-of-integer/add-to-array-form-of-integer.md) | [Python3](./src/0989.add-to-array-form-of-integer/add-to-array-form-of-integer.py) | 43.99% | Easy | [Array](./src/Topics.md#array) |
| 0993 | [Cousins in Binary Tree](./src/0993.cousins-in-binary-tree/cousins-in-binary-tree.md) | [Python3](./src/0993.cousins-in-binary-tree/cousins-in-binary-tree.py) | 51.88% | Easy | [Tree](./src/Topics.md#tree) | [Breadth-first Search](./src/Topics.md#breadth-first-search) |
| 0998 | [Maximum Binary Tree II](./src/0998.maximum-binary-tree-ii/maximum-binary-tree-ii.md) | [Python3](./src/0998.maximum-binary-tree-ii/maximum-binary-tree-ii.py) | 61.65% | Medium | [Tree](./src/Topics.md#tree) |
| 1002 | [Find Common Characters](./src/1002.find-common-characters/find-common-characters.md) | [Python3](./src/1002.find-common-characters/find-common-characters.py) | 66.03% | Easy | [Array](./src/Topics.md#array) | [Hash Table](./src/Topics.md#hash-table) |
| 1004 | [Max Consecutive Ones III](./src/1004.max-consecutive-ones-iii/max-consecutive-ones-iii.md) | [Python3](./src/1004.max-consecutive-ones-iii/max-consecutive-ones-iii.py) | 55.33% | Medium | [Two Pointers](./src/Topics.md#two-pointers) | [Sliding Window](./src/Topics.md#sliding-window) |
| 1008 | [Construct Binary Search Tree from Preorder Traversal](./src/1008.construct-binary-search-tree-from-preorder-traversal/construct-binary-search-tree-from-preorder-traversal.md) | [Python3](./src/1008.construct-binary-search-tree-from-preorder-traversal/construct-binary-search-tree-from-preorder-traversal.py) | 74.15% | Medium | [Tree](./src/Topics.md#tree) |
| 1009 | [Complement of Base 10 Integer](./src/1009.complement-of-base-10-integer/complement-of-base-10-integer.md) | [Python3](./src/1009.complement-of-base-10-integer/complement-of-base-10-integer.py) | 59.22% | Easy | [Math](./src/Topics.md#math) |
| 1019 | [Next Greater Node In Linked List](./src/1019.next-greater-node-in-linked-list/next-greater-node-in-linked-list.md) | [Python3](./src/1019.next-greater-node-in-linked-list/next-greater-node-in-linked-list.py) | 56.59% | Medium | [Linked List](./src/Topics.md#linked-list) | [Stack](./src/Topics.md#stack) |
| 1021 | [Remove Outermost Parentheses](./src/1021.remove-outermost-parentheses/remove-outermost-parentheses.md) | [Python3](./src/1021.remove-outermost-parentheses/remove-outermost-parentheses.py) | 75.74% | Easy | [Stack](./src/Topics.md#stack) |
| 1022 | [Sum of Root To Leaf Binary Numbers](./src/1022.sum-of-root-to-leaf-binary-numbers/sum-of-root-to-leaf-binary-numbers.md) | [Python3](./src/1022.sum-of-root-to-leaf-binary-numbers/sum-of-root-to-leaf-binary-numbers.py) | 62.36% | Easy | [Tree](./src/Topics.md#tree) |
| 1025 | [Divisor Game](./src/1025.divisor-game/divisor-game.md) | [Python3](./src/1025.divisor-game/divisor-game.py) | 65.18% | Easy | [Math](./src/Topics.md#math) | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 1026 | [Maximum Difference Between Node and Ancestor](./src/1026.maximum-difference-between-node-and-ancestor/maximum-difference-between-node-and-ancestor.md) | [Python3](./src/1026.maximum-difference-between-node-and-ancestor/maximum-difference-between-node-and-ancestor.py) | 61.75% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 1028 | [Recover a Tree From Preorder Traversal](./src/1028.recover-a-tree-from-preorder-traversal/recover-a-tree-from-preorder-traversal.md) | [Python3](./src/1028.recover-a-tree-from-preorder-traversal/recover-a-tree-from-preorder-traversal.py) | 69.38% | Hard | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 1038 | [Binary Search Tree to Greater Sum Tree](./src/1038.binary-search-tree-to-greater-sum-tree/binary-search-tree-to-greater-sum-tree.md) | [Python3](./src/1038.binary-search-tree-to-greater-sum-tree/binary-search-tree-to-greater-sum-tree.py) | 78.17% | Medium | [Binary Search Tree](./src/Topics.md#binary-search-tree) |
| 1041 | [Robot Bounded In Circle](./src/1041.robot-bounded-in-circle/robot-bounded-in-circle.md) | [Python3](./src/1041.robot-bounded-in-circle/robot-bounded-in-circle.py) | 46.63% | Medium | [Math](./src/Topics.md#math) |
| 1043 | [Partition Array for Maximum Sum](./src/1043.partition-array-for-maximum-sum/partition-array-for-maximum-sum.md) | [Python3](./src/1043.partition-array-for-maximum-sum/partition-array-for-maximum-sum.py) | 62.94% | Medium | [Graph](./src/Topics.md#graph) |
| 1046 | [Last Stone Weight](./src/1046.last-stone-weight/last-stone-weight.md) | [Python3](./src/1046.last-stone-weight/last-stone-weight.py) | 62.43% | Easy | [Heap](./src/Topics.md#heap) | [Greedy](./src/Topics.md#greedy) |
| 1049 | [Last Stone Weight II](./src/1049.last-stone-weight-ii/last-stone-weight-ii.md) | [Python3](./src/1049.last-stone-weight-ii/last-stone-weight-ii.py) | 41.74% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 1051 | [Height Checker](./src/1051.height-checker/height-checker.md) | [Python3](./src/1051.height-checker/height-checker.py) | 68.23% | Easy | [Array](./src/Topics.md#array) |
| 1071 | [Greatest Common Divisor of Strings](./src/1071.greatest-common-divisor-of-strings/greatest-common-divisor-of-strings.md) | [Python3](./src/1071.greatest-common-divisor-of-strings/greatest-common-divisor-of-strings.py) | 53.79% | Easy | [String](./src/Topics.md#string) |
| 1072 | [Flip Columns For Maximum Number of Equal Rows](./src/1072.flip-columns-for-maximum-number-of-equal-rows/flip-columns-for-maximum-number-of-equal-rows.md) | [Python3](./src/1072.flip-columns-for-maximum-number-of-equal-rows/flip-columns-for-maximum-number-of-equal-rows.py) | 59.37% | Medium | [Hash Table](./src/Topics.md#hash-table) |
| 1078 | [Occurrences After Bigram](./src/1078.occurrences-after-bigram/occurrences-after-bigram.md) | [Python3](./src/1078.occurrences-after-bigram/occurrences-after-bigram.py) | 64.40% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 1089 | [Duplicate Zeros](./src/1089.duplicate-zeros/duplicate-zeros.md) | [Python3](./src/1089.duplicate-zeros/duplicate-zeros.py) | 58.36% | Easy | [Array](./src/Topics.md#array) |
| 1104 | [Path In Zigzag Labelled Binary Tree](./src/1104.path-in-zigzag-labelled-binary-tree/path-in-zigzag-labelled-binary-tree.md) | [Python3](./src/1104.path-in-zigzag-labelled-binary-tree/path-in-zigzag-labelled-binary-tree.py) | 70.47% | Medium | [Math](./src/Topics.md#math) | [Tree](./src/Topics.md#tree) |
| 1106 | [Parsing A Boolean Expression](./src/1106.parsing-a-boolean-expression/parsing-a-boolean-expression.md) | [Python3](./src/1106.parsing-a-boolean-expression/parsing-a-boolean-expression.py) | 57.51% | Hard | [String](./src/Topics.md#string) |
| 1108 | [Defanging an IP Address](./src/1108.defanging-an-ip-address/defanging-an-ip-address.md) | [Python3](./src/1108.defanging-an-ip-address/defanging-an-ip-address.py) | 84.84% | Easy | [String](./src/Topics.md#string) |
| 1110 | [Delete Nodes And Return Forest](./src/1110.delete-nodes-and-return-forest/delete-nodes-and-return-forest.md) | [Python3](./src/1110.delete-nodes-and-return-forest/delete-nodes-and-return-forest.py) | 64.60% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 1114 | [Print in Order](./src/1114.print-in-order/print-in-order.md) | [Python3](./src/1114.print-in-order/print-in-order.py) | 60.62% | Easy | |
| 1123 | [Lowest Common Ancestor of Deepest Leaves](./src/1123.lowest-common-ancestor-of-deepest-leaves/lowest-common-ancestor-of-deepest-leaves.md) | [Python3](./src/1123.lowest-common-ancestor-of-deepest-leaves/lowest-common-ancestor-of-deepest-leaves.py) | 65.13% | Medium | [Tree](./src/Topics.md#tree) | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 1130 | [Minimum Cost Tree From Leaf Values](./src/1130.minimum-cost-tree-from-leaf-values/minimum-cost-tree-from-leaf-values.md) | [Python3](./src/1130.minimum-cost-tree-from-leaf-values/minimum-cost-tree-from-leaf-values.py) | 62.92% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Stack](./src/Topics.md#stack) | [Tree](./src/Topics.md#tree) |
| 1143 | [Longest Common Subsequence](./src/1143.longest-common-subsequence/longest-common-subsequence.md) | [Python3](./src/1143.longest-common-subsequence/longest-common-subsequence.py) | 57.30% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) |
| 1154 | [Day of the Year](./src/1154.day-of-the-year/day-of-the-year.md) | [Python3](./src/1154.day-of-the-year/day-of-the-year.py) | 48.93% | Easy | [Math](./src/Topics.md#math) |
| 1161 | [Maximum Level Sum of a Binary Tree](./src/1161.maximum-level-sum-of-a-binary-tree/maximum-level-sum-of-a-binary-tree.md) | [Python3](./src/1161.maximum-level-sum-of-a-binary-tree/maximum-level-sum-of-a-binary-tree.py) | 70.80% | Medium | [Graph](./src/Topics.md#graph) |
| 1170 | [Compare Strings by Frequency of the Smallest Character](./src/1170.compare-strings-by-frequency-of-the-smallest-character/compare-strings-by-frequency-of-the-smallest-character.md) | [Python3](./src/1170.compare-strings-by-frequency-of-the-smallest-character/compare-strings-by-frequency-of-the-smallest-character.py) | 58.33% | Easy | [Array](./src/Topics.md#array) | [String](./src/Topics.md#string) |
| 1171 | [Remove Zero Sum Consecutive Nodes from Linked List](./src/1171.remove-zero-sum-consecutive-nodes-from-linked-list/remove-zero-sum-consecutive-nodes-from-linked-list.md) | [Python3](./src/1171.remove-zero-sum-consecutive-nodes-from-linked-list/remove-zero-sum-consecutive-nodes-from-linked-list.py) | 41.55% | Medium | [Linked List](./src/Topics.md#linked-list) |
| 1184 | [Distance Between Bus Stops](./src/1184.distance-between-bus-stops/distance-between-bus-stops.md) | [Python3](./src/1184.distance-between-bus-stops/distance-between-bus-stops.py) | 55.79% | Easy | [Array](./src/Topics.md#array) |
| 1185 | [Day of the Week](./src/1185.day-of-the-week/day-of-the-week.md) | [Python3](./src/1185.day-of-the-week/day-of-the-week.py) | 64.29% | Easy | [Array](./src/Topics.md#array) |
| 1189 | [Maximum Number of Balloons](./src/1189.maximum-number-of-balloons/maximum-number-of-balloons.md) | [Python3](./src/1189.maximum-number-of-balloons/maximum-number-of-balloons.py) | 61.41% | Easy | [Hash Table](./src/Topics.md#hash-table) | [String](./src/Topics.md#string) |
| 1190 | [Reverse Substrings Between Each Pair of Parentheses](./src/1190.reverse-substrings-between-each-pair-of-parentheses/reverse-substrings-between-each-pair-of-parentheses.md) | [Python3](./src/1190.reverse-substrings-between-each-pair-of-parentheses/reverse-substrings-between-each-pair-of-parentheses.py) | 57.84% | Medium | [Stack](./src/Topics.md#stack) |
| 1200 | [Minimum Absolute Difference](./src/1200.minimum-absolute-difference/minimum-absolute-difference.md) | [Python3](./src/1200.minimum-absolute-difference/minimum-absolute-difference.py) | 66.14% | Easy | [Array](./src/Topics.md#array) |
| 1202 | [Smallest String With Swaps](./src/1202.smallest-string-with-swaps/smallest-string-with-swaps.md) | [Python3](./src/1202.smallest-string-with-swaps/smallest-string-with-swaps.py) | 41.60% | Medium | [Array](./src/Topics.md#array) | [Union Find](./src/Topics.md#union-find) |
| 1207 | [Unique Number of Occurrences](./src/1207.unique-number-of-occurrences/unique-number-of-occurrences.md) | [Python3](./src/1207.unique-number-of-occurrences/unique-number-of-occurrences.py) | 72.44% | Easy | [Hash Table](./src/Topics.md#hash-table) |
| 1209 | [Remove All Adjacent Duplicates in String II](./src/1209.remove-all-adjacent-duplicates-in-string-ii/remove-all-adjacent-duplicates-in-string-ii.md) | [Python3](./src/1209.remove-all-adjacent-duplicates-in-string-ii/remove-all-adjacent-duplicates-in-string-ii.py) | 56.53% | Medium | [Stack](./src/Topics.md#stack) |
| 1217 | [Play with Chips](./src/1217.play-with-chips/play-with-chips.md) | [Python3](./src/1217.play-with-chips/play-with-chips.py) | 63.66% | Easy | [Array](./src/Topics.md#array) | [Math](./src/Topics.md#math) | [Greedy](./src/Topics.md#greedy) |
| 1219 | [Path with Maximum Gold](./src/1219.path-with-maximum-gold/path-with-maximum-gold.md) | [Python3](./src/1219.path-with-maximum-gold/path-with-maximum-gold.py) | 61.59% | Medium | [Backtracking](./src/Topics.md#backtracking) |
| 1221 | [Split a String in Balanced Strings](./src/1221.split-a-string-in-balanced-strings/split-a-string-in-balanced-strings.md) | [Python3](./src/1221.split-a-string-in-balanced-strings/split-a-string-in-balanced-strings.py) | 78.74% | Easy | [String](./src/Topics.md#string) | [Greedy](./src/Topics.md#greedy) |
| 1227 | [Airplane Seat Assignment Probability](./src/1227.airplane-seat-assignment-probability/airplane-seat-assignment-probability.md) | [Python3](./src/1227.airplane-seat-assignment-probability/airplane-seat-assignment-probability.py) | 59.91% | Medium | [Math](./src/Topics.md#math) | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Brainteaser](./src/Topics.md#brainteaser) |
| 1233 | [Remove Sub-Folders from the Filesystem](./src/1233.remove-sub-folders-from-the-filesystem/remove-sub-folders-from-the-filesystem.md) | [Python3](./src/1233.remove-sub-folders-from-the-filesystem/remove-sub-folders-from-the-filesystem.py) | 54.45% | Medium | [Array](./src/Topics.md#array) | [String](./src/Topics.md#string) |
| 1237 | [Find Positive Integer Solution for a Given Equation](./src/1237.find-positive-integer-solution-for-a-given-equation/find-positive-integer-solution-for-a-given-equation.md) | [Python3](./src/1237.find-positive-integer-solution-for-a-given-equation/find-positive-integer-solution-for-a-given-equation.py) | 66.88% | Easy | [Math](./src/Topics.md#math) | [Binary Search](./src/Topics.md#binary-search) |
| 1240 | [Tiling a Rectangle with the Fewest Squares](./src/1240.tiling-a-rectangle-with-the-fewest-squares/tiling-a-rectangle-with-the-fewest-squares.md) | [Python3](./src/1240.tiling-a-rectangle-with-the-fewest-squares/tiling-a-rectangle-with-the-fewest-squares.py) | 48.98% | Hard | [Dynamic Programming](./src/Topics.md#dynamic-programming) | [Backtracking](./src/Topics.md#backtracking) |
| 1247 | [Minimum Swaps to Make Strings Equal](./src/1247.minimum-swaps-to-make-strings-equal/minimum-swaps-to-make-strings-equal.md) | [Python3](./src/1247.minimum-swaps-to-make-strings-equal/minimum-swaps-to-make-strings-equal.py) | 57.26% | Medium | [String](./src/Topics.md#string) | [Greedy](./src/Topics.md#greedy) |
| 1248 | [Count Number of Nice Subarrays](./src/1248.count-number-of-nice-subarrays/count-number-of-nice-subarrays.md) | [Python3](./src/1248.count-number-of-nice-subarrays/count-number-of-nice-subarrays.py) | 52.86% | Medium | [Two Pointers](./src/Topics.md#two-pointers) |
| 1249 | [Minimum Remove to Make Valid Parentheses](./src/1249.minimum-remove-to-make-valid-parentheses/minimum-remove-to-make-valid-parentheses.md) | [Python3](./src/1249.minimum-remove-to-make-valid-parentheses/minimum-remove-to-make-valid-parentheses.py) | 59.35% | Medium | [String](./src/Topics.md#string) | [Stack](./src/Topics.md#stack) |
| 1250 | [Check If It Is a Good Array](./src/1250.check-if-it-is-a-good-array/check-if-it-is-a-good-array.md) | [Python3](./src/1250.check-if-it-is-a-good-array/check-if-it-is-a-good-array.py) | 50.25% | Hard | [Math](./src/Topics.md#math) |
| 1252 | [Cells with Odd Values in a Matrix](./src/1252.cells-with-odd-values-in-a-matrix/cells-with-odd-values-in-a-matrix.md) | [Python3](./src/1252.cells-with-odd-values-in-a-matrix/cells-with-odd-values-in-a-matrix.py) | 78.68% | Easy | [Array](./src/Topics.md#array) |
| 1254 | [Number of Closed Islands](./src/1254.number-of-closed-islands/number-of-closed-islands.md) | [Python3](./src/1254.number-of-closed-islands/number-of-closed-islands.py) | 59.79% | Medium | [Depth-first Search](./src/Topics.md#depth-first-search) |
| 1255 | [Maximum Score Words Formed by Letters](./src/1255.maximum-score-words-formed-by-letters/maximum-score-words-formed-by-letters.md) | [Python3](./src/1255.maximum-score-words-formed-by-letters/maximum-score-words-formed-by-letters.py) | 71.02% | Hard | [Bit Manipulation](./src/Topics.md#bit-manipulation) |
| 1260 | [Shift 2D Grid](./src/1260.shift-2d-grid/shift-2d-grid.md) | [Python3](./src/1260.shift-2d-grid/shift-2d-grid.py) | 58.67% | Easy | [Array](./src/Topics.md#array) |
| 1261 | [Find Elements in a Contaminated Binary Tree](./src/1261.find-elements-in-a-contaminated-binary-tree/find-elements-in-a-contaminated-binary-tree.md) | [Python3](./src/1261.find-elements-in-a-contaminated-binary-tree/find-elements-in-a-contaminated-binary-tree.py) | 72.40% | Medium | [Hash Table](./src/Topics.md#hash-table) | [Tree](./src/Topics.md#tree) |
| 1262 | [Greatest Sum Divisible by Three](./src/1262.greatest-sum-divisible-by-three/greatest-sum-divisible-by-three.md) | [Python3](./src/1262.greatest-sum-divisible-by-three/greatest-sum-divisible-by-three.py) | 39.16% | Medium | [Dynamic Programming](./src/Topics.md#dynamic-programming) |