https://github.com/jiangshanmeta/meta

leetcode JS/TS/Java实现
https://github.com/jiangshanmeta/meta
algorithm leetcode
Last synced: about 1 year ago
JSON representation
leetcode JS/TS/Java实现
Host: GitHub
URL: https://github.com/jiangshanmeta/meta
Owner: jiangshanmeta
License: mit
Created: 2017-12-28T00:47:17.000Z (over 8 years ago)
Default Branch: master
Last Pushed: 2025-03-26T15:12:13.000Z (about 1 year ago)
Last Synced: 2025-04-03T20:12:35.869Z (about 1 year ago)
Topics: algorithm, leetcode
Language: JavaScript
Homepage:
Size: 4.42 MB
Stars: 267
Watchers: 9
Forks: 42
Open Issues: 23
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

README

          # leetcode 题解

## 相关链接

[LeetCode个人主页](https://leetcode.cn/u/jiangshanmeta/)

[leetcode题解](https://github.com/jiangshanmeta/meta)

[lintcode题解](https://github.com/jiangshanmeta/lintcode)

[scriptoj题解](https://github.com/jiangshanmeta/scriptoj)

[剑指offer题解](https://github.com/jiangshanmeta/coding-interviews)

[LeetCode笔记本](https://github.com/jiangshanmeta/leetcode-notebook)

## 目录

* TS/JS Answer 2252

* Java Answer 606

| index |       title            | code           |  Difficulty   |

| :--:  | :-------------------:  | :---:          |  :--:         |

| 0001 | Two Sum | [Go](./src/0001.two-sum.1/solution.go) [Java](./src/0001.two-sum.1/solution.java) [JavaScript](./src/0001.two-sum.1/solution.js) [TypeScript](./src/0001.two-sum.1/solution.ts) | Easy  |

| 0002 | Add Two Numbers | [JavaScript](./src/0002.add-two-numbers.2/solution.js) [TypeScript](./src/0002.add-two-numbers.2/solution.ts) | Medium  |

| 0003 | Longest Substring Without Repeating Characters | [JavaScript](./src/0003.longest-substring-without-repeating-characters.3/solution.js) [TypeScript](./src/0003.longest-substring-without-repeating-characters.3/solution.ts) | Medium  |

| 0004 | Median of Two Sorted Arrays | [JavaScript](./src/0004.median-of-two-sorted-arrays.4/solution.js) | Hard  |

| 0005 | Longest Palindromic Substring | [JavaScript](./src/0005.longest-palindromic-substring.5/solution.js) [TypeScript](./src/0005.longest-palindromic-substring.5/solution.ts) | Medium  |

| 0006 | Zigzag Conversion | [JavaScript](./src/0006.zigzag-conversion.6/solution.js) | Medium  |

| 0007 | Reverse Integer | [JavaScript](./src/0007.reverse-integer.7/solution.js) | Medium  |

| 0008 | String to Integer (atoi) | [JavaScript](./src/0008.string-to-integer-atoi.8/solution.js) | Medium  |

| 0009 | Palindrome Number | [Java](./src/0009.palindrome-number.9/solution.java) [JavaScript](./src/0009.palindrome-number.9/solution.js) [TypeScript](./src/0009.palindrome-number.9/solution.ts) | Easy  |

| 0010 | Regular Expression Matching | [JavaScript](./src/0010.regular-expression-matching.10/solution.js) [TypeScript](./src/0010.regular-expression-matching.10/solution.ts) | Hard  |

| 0011 | Container With Most Water | [JavaScript](./src/0011.container-with-most-water.11/solution.js) | Medium  |

| 0012 | Integer to Roman | [JavaScript](./src/0012.integer-to-roman.12/solution.js) [TypeScript](./src/0012.integer-to-roman.12/solution.ts) | Medium  |

| 0013 | Roman to Integer | [JavaScript](./src/0013.roman-to-integer.13/solution.js) [TypeScript](./src/0013.roman-to-integer.13/solution.ts) | Easy  |

| 0014 | Longest Common Prefix | [Java](./src/0014.longest-common-prefix.14/solution.java) [JavaScript](./src/0014.longest-common-prefix.14/solution.js) [TypeScript](./src/0014.longest-common-prefix.14/solution.ts) | Easy  |

| 0015 | 3Sum | [JavaScript](./src/0015.3sum.15/solution.js) | Medium  |

| 0016 | 3Sum Closest | [JavaScript](./src/0016.3sum-closest.16/solution.js) | Medium  |

| 0017 | Letter Combinations of a Phone Number | [Java](./src/0017.letter-combinations-of-a-phone-number.17/solution.java) [JavaScript](./src/0017.letter-combinations-of-a-phone-number.17/solution.js) [TypeScript](./src/0017.letter-combinations-of-a-phone-number.17/solution.ts) | Medium  |

| 0018 | 4Sum | [JavaScript](./src/0018.4sum.18/solution.js) | Medium  |

| 0019 | Remove Nth Node From End of List | [Java](./src/0019.remove-nth-node-from-end-of-list.19/solution.java) [JavaScript](./src/0019.remove-nth-node-from-end-of-list.19/solution.js) [TypeScript](./src/0019.remove-nth-node-from-end-of-list.19/solution.ts) | Medium  |

| 0020 | Valid Parentheses | [Java](./src/0020.valid-parentheses.20/solution.java) [JavaScript](./src/0020.valid-parentheses.20/solution.js) [TypeScript](./src/0020.valid-parentheses.20/solution.ts) | Easy  |

| 0021 | Merge Two Sorted Lists | [Go](./src/0021.merge-two-sorted-lists.21/solution.go) [Java](./src/0021.merge-two-sorted-lists.21/solution.java) [JavaScript](./src/0021.merge-two-sorted-lists.21/solution.js) [TypeScript](./src/0021.merge-two-sorted-lists.21/solution.ts) | Easy  |

| 0022 | Generate Parentheses | [Java](./src/0022.generate-parentheses.22/solution.java) [JavaScript](./src/0022.generate-parentheses.22/solution.js) [TypeScript](./src/0022.generate-parentheses.22/solution.ts) | Medium  |

| 0023 | Merge k Sorted Lists | [JavaScript](./src/0023.merge-k-sorted-lists.23/solution.js) [TypeScript](./src/0023.merge-k-sorted-lists.23/solution.ts) | Hard  |

| 0024 | Swap Nodes in Pairs | [Java](./src/0024.swap-nodes-in-pairs.24/solution.java) [JavaScript](./src/0024.swap-nodes-in-pairs.24/solution.js) [TypeScript](./src/0024.swap-nodes-in-pairs.24/solution.ts) | Medium  |

| 0025 | Reverse Nodes in k-Group | [JavaScript](./src/0025.reverse-nodes-in-k-group.25/solution.js) [TypeScript](./src/0025.reverse-nodes-in-k-group.25/solution.ts) | Hard  |

| 0026 | Remove Duplicates from Sorted Array | [Java](./src/0026.remove-duplicates-from-sorted-array.26/solution.java) [JavaScript](./src/0026.remove-duplicates-from-sorted-array.26/solution.js) [TypeScript](./src/0026.remove-duplicates-from-sorted-array.26/solution.ts) | Easy  |

| 0027 | Remove Element | [Java](./src/0027.remove-element.27/solution.java) [JavaScript](./src/0027.remove-element.27/solution.js) [TypeScript](./src/0027.remove-element.27/solution.ts) | Easy  |

| 0028 | Find the Index of the First Occurrence in a String | [Java](./src/0028.find-the-index-of-the-first-occurrence-in-a-string.28/solution.java) [JavaScript](./src/0028.find-the-index-of-the-first-occurrence-in-a-string.28/solution.js) | Easy  |

| 0029 | Divide Two Integers | [JavaScript](./src/0029.divide-two-integers.29/solution.js) | Medium  |

| 0030 | Substring with Concatenation of All Words |  | Hard  |

| 0031 | Next Permutation | [JavaScript](./src/0031.next-permutation.31/solution.js) | Medium  |

| 0032 | Longest Valid Parentheses | [JavaScript](./src/0032.longest-valid-parentheses.32/solution.js) [TypeScript](./src/0032.longest-valid-parentheses.32/solution.ts) | Hard  |

| 0033 | Search in Rotated Sorted Array | [JavaScript](./src/0033.search-in-rotated-sorted-array.33/solution.js) | Medium  |

| 0034 | Find First and Last Position of Element in Sorted Array | [JavaScript](./src/0034.find-first-and-last-position-of-element-in-sorted-array.34/solution.js) [TypeScript](./src/0034.find-first-and-last-position-of-element-in-sorted-array.34/solution.ts) | Medium  |

| 0035 | Search Insert Position | [Java](./src/0035.search-insert-position.35/solution.java) [JavaScript](./src/0035.search-insert-position.35/solution.js) [TypeScript](./src/0035.search-insert-position.35/solution.ts) | Easy  |

| 0036 | Valid Sudoku | [JavaScript](./src/0036.valid-sudoku.36/solution.js) | Medium  |

| 0037 | Sudoku Solver |  | Hard  |

| 0038 | Count and Say | [JavaScript](./src/0038.count-and-say.38/solution.js) [TypeScript](./src/0038.count-and-say.38/solution.ts) | Medium  |

| 0039 | Combination Sum | [JavaScript](./src/0039.combination-sum.39/solution.js) [TypeScript](./src/0039.combination-sum.39/solution.ts) | Medium  |

| 0040 | Combination Sum II | [JavaScript](./src/0040.combination-sum-ii.40/solution.js) [TypeScript](./src/0040.combination-sum-ii.40/solution.ts) | Medium  |

| 0041 | First Missing Positive | [JavaScript](./src/0041.first-missing-positive.41/solution.js) [TypeScript](./src/0041.first-missing-positive.41/solution.ts) | Hard  |

| 0042 | Trapping Rain Water | [JavaScript](./src/0042.trapping-rain-water.42/solution.js) | Hard  |

| 0043 | Multiply Strings | [JavaScript](./src/0043.multiply-strings.43/solution.js) | Medium  |

| 0044 | Wildcard Matching | [JavaScript](./src/0044.wildcard-matching.44/solution.js) | Hard  |

| 0045 | Jump Game II | [JavaScript](./src/0045.jump-game-ii.45/solution.js) [TypeScript](./src/0045.jump-game-ii.45/solution.ts) | Medium  |

| 0046 | Permutations | [Java](./src/0046.permutations.46/solution.java) [JavaScript](./src/0046.permutations.46/solution.js) [TypeScript](./src/0046.permutations.46/solution.ts) | Medium  |

| 0047 | Permutations II | [Java](./src/0047.permutations-ii.47/solution.java) [JavaScript](./src/0047.permutations-ii.47/solution.js) [TypeScript](./src/0047.permutations-ii.47/solution.ts) | Medium  |

| 0048 | Rotate Image | [JavaScript](./src/0048.rotate-image.48/solution.js) [TypeScript](./src/0048.rotate-image.48/solution.ts) | Medium  |

| 0049 | Group Anagrams | [JavaScript](./src/0049.group-anagrams.49/solution.js) [TypeScript](./src/0049.group-anagrams.49/solution.ts) | Medium  |

| 0050 | Pow(x, n) | [Java](./src/0050.powx-n.50/solution.java) [JavaScript](./src/0050.powx-n.50/solution.js) [TypeScript](./src/0050.powx-n.50/solution.ts) | Medium  |

| 0051 | N-Queens |  | Hard  |

| 0052 | N-Queens II |  | Hard  |

| 0053 | Maximum Subarray | [Java](./src/0053.maximum-subarray.53/solution.java) [JavaScript](./src/0053.maximum-subarray.53/solution.js) [TypeScript](./src/0053.maximum-subarray.53/solution.ts) | Medium  |

| 0054 | Spiral Matrix | [JavaScript](./src/0054.spiral-matrix.54/solution.js) [TypeScript](./src/0054.spiral-matrix.54/solution.ts) | Medium  |

| 0055 | Jump Game | [Java](./src/0055.jump-game.55/solution.java) [JavaScript](./src/0055.jump-game.55/solution.js) [TypeScript](./src/0055.jump-game.55/solution.ts) | Medium  |

| 0056 | Merge Intervals | [JavaScript](./src/0056.merge-intervals.56/solution.js) | Medium  |

| 0057 | Insert Interval | [JavaScript](./src/0057.insert-interval.57/solution.js) | Medium  |

| 0058 | Length of Last Word | [Java](./src/0058.length-of-last-word.58/solution.java) [JavaScript](./src/0058.length-of-last-word.58/solution.js) [TypeScript](./src/0058.length-of-last-word.58/solution.ts) | Easy  |

| 0059 | Spiral Matrix II | [JavaScript](./src/0059.spiral-matrix-ii.59/solution.js) [TypeScript](./src/0059.spiral-matrix-ii.59/solution.ts) | Medium  |

| 0060 | Permutation Sequence | [JavaScript](./src/0060.permutation-sequence.60/solution.js) | Hard  |

| 0061 | Rotate List | [Java](./src/0061.rotate-list.61/solution.java) [JavaScript](./src/0061.rotate-list.61/solution.js) [TypeScript](./src/0061.rotate-list.61/solution.ts) | Medium  |

| 0062 | Unique Paths | [Java](./src/0062.unique-paths.62/solution.java) [JavaScript](./src/0062.unique-paths.62/solution.js) [TypeScript](./src/0062.unique-paths.62/solution.ts) | Medium  |

| 0063 | Unique Paths II | [Java](./src/0063.unique-paths-ii.63/solution.java) [JavaScript](./src/0063.unique-paths-ii.63/solution.js) [TypeScript](./src/0063.unique-paths-ii.63/solution.ts) | Medium  |

| 0064 | Minimum Path Sum | [Java](./src/0064.minimum-path-sum.64/solution.java) [JavaScript](./src/0064.minimum-path-sum.64/solution.js) [TypeScript](./src/0064.minimum-path-sum.64/solution.ts) | Medium  |

| 0065 | Valid Number | [JavaScript](./src/0065.valid-number.65/solution.js) | Hard  |

| 0066 | Plus One | [Java](./src/0066.plus-one.66/solution.java) [JavaScript](./src/0066.plus-one.66/solution.js) [TypeScript](./src/0066.plus-one.66/solution.ts) | Easy  |

| 0067 | Add Binary | [Java](./src/0067.add-binary.67/solution.java) [JavaScript](./src/0067.add-binary.67/solution.js) [TypeScript](./src/0067.add-binary.67/solution.ts) | Easy  |

| 0068 | Text Justification |  | Hard  |

| 0069 | Sqrt(x) | [Java](./src/0069.sqrtx.69/solution.java) [JavaScript](./src/0069.sqrtx.69/solution.js) [TypeScript](./src/0069.sqrtx.69/solution.ts) | Easy  |

| 0070 | Climbing Stairs | [Java](./src/0070.climbing-stairs.70/solution.java) [JavaScript](./src/0070.climbing-stairs.70/solution.js) [TypeScript](./src/0070.climbing-stairs.70/solution.ts) | Easy  |

| 0071 | Simplify Path | [JavaScript](./src/0071.simplify-path.71/solution.js) | Medium  |

| 0072 | Edit Distance | [JavaScript](./src/0072.edit-distance.72/solution.js) [TypeScript](./src/0072.edit-distance.72/solution.ts) | Medium  |

| 0073 | Set Matrix Zeroes | [JavaScript](./src/0073.set-matrix-zeroes.73/solution.js) [TypeScript](./src/0073.set-matrix-zeroes.73/solution.ts) | Medium  |

| 0074 | Search a 2D Matrix | [JavaScript](./src/0074.search-a-2d-matrix.74/solution.js) [TypeScript](./src/0074.search-a-2d-matrix.74/solution.ts) | Medium  |

| 0075 | Sort Colors | [JavaScript](./src/0075.sort-colors.75/solution.js) [TypeScript](./src/0075.sort-colors.75/solution.ts) | Medium  |

| 0076 | Minimum Window Substring | [JavaScript](./src/0076.minimum-window-substring.76/solution.js) | Hard  |

| 0077 | Combinations | [Java](./src/0077.combinations.77/solution.java) [JavaScript](./src/0077.combinations.77/solution.js) [TypeScript](./src/0077.combinations.77/solution.ts) | Medium  |

| 0078 | Subsets | [Java](./src/0078.subsets.78/solution.java) [JavaScript](./src/0078.subsets.78/solution.js) [TypeScript](./src/0078.subsets.78/solution.ts) | Medium  |

| 0079 | Word Search | [JavaScript](./src/0079.word-search.79/solution.js) [TypeScript](./src/0079.word-search.79/solution.ts) | Medium  |

| 0080 | Remove Duplicates from Sorted Array II | [Java](./src/0080.remove-duplicates-from-sorted-array-ii.80/solution.java) [JavaScript](./src/0080.remove-duplicates-from-sorted-array-ii.80/solution.js) [TypeScript](./src/0080.remove-duplicates-from-sorted-array-ii.80/solution.ts) | Medium  |

| 0081 | Search in Rotated Sorted Array II | [JavaScript](./src/0081.search-in-rotated-sorted-array-ii.81/solution.js) | Medium  |

| 0082 | Remove Duplicates from Sorted List II | [JavaScript](./src/0082.remove-duplicates-from-sorted-list-ii.82/solution.js) [TypeScript](./src/0082.remove-duplicates-from-sorted-list-ii.82/solution.ts) | Medium  |

| 0083 | Remove Duplicates from Sorted List | [Go](./src/0083.remove-duplicates-from-sorted-list.83/solution.go) [Java](./src/0083.remove-duplicates-from-sorted-list.83/solution.java) [JavaScript](./src/0083.remove-duplicates-from-sorted-list.83/solution.js) [TypeScript](./src/0083.remove-duplicates-from-sorted-list.83/solution.ts) | Easy  |

| 0084 | Largest Rectangle in Histogram | [TypeScript](./src/0084.largest-rectangle-in-histogram.84/solution.ts) | Hard  |

| 0085 | Maximal Rectangle | [TypeScript](./src/0085.maximal-rectangle.85/solution.ts) | Hard  |

| 0086 | Partition List | [Java](./src/0086.partition-list.86/solution.java) [JavaScript](./src/0086.partition-list.86/solution.js) [TypeScript](./src/0086.partition-list.86/solution.ts) | Medium  |

| 0087 | Scramble String |  | Hard  |

| 0088 | Merge Sorted Array | [Go](./src/0088.merge-sorted-array.88/solution.go) [Java](./src/0088.merge-sorted-array.88/solution.java) [JavaScript](./src/0088.merge-sorted-array.88/solution.js) [TypeScript](./src/0088.merge-sorted-array.88/solution.ts) | Easy  |

| 0089 | Gray Code | [JavaScript](./src/0089.gray-code.89/solution.js) | Medium  |

| 0090 | Subsets II | [Java](./src/0090.subsets-ii.90/solution.java) [JavaScript](./src/0090.subsets-ii.90/solution.js) [TypeScript](./src/0090.subsets-ii.90/solution.ts) | Medium  |

| 0091 | Decode Ways | [JavaScript](./src/0091.decode-ways.91/solution.js) [TypeScript](./src/0091.decode-ways.91/solution.ts) | Medium  |

| 0092 | Reverse Linked List II | [JavaScript](./src/0092.reverse-linked-list-ii.92/solution.js) [TypeScript](./src/0092.reverse-linked-list-ii.92/solution.ts) | Medium  |

| 0093 | Restore IP Addresses | [JavaScript](./src/0093.restore-ip-addresses.93/solution.js) | Medium  |

| 0094 | Binary Tree Inorder Traversal | [Go](./src/0094.binary-tree-inorder-traversal.94/solution.go) [Java](./src/0094.binary-tree-inorder-traversal.94/solution.java) [JavaScript](./src/0094.binary-tree-inorder-traversal.94/solution.js) [TypeScript](./src/0094.binary-tree-inorder-traversal.94/solution.ts) | Easy  |

| 0095 | Unique Binary Search Trees II | [JavaScript](./src/0095.unique-binary-search-trees-ii.95/solution.js) [TypeScript](./src/0095.unique-binary-search-trees-ii.95/solution.ts) | Medium  |

| 0096 | Unique Binary Search Trees | [JavaScript](./src/0096.unique-binary-search-trees.96/solution.js) [TypeScript](./src/0096.unique-binary-search-trees.96/solution.ts) | Medium  |

| 0097 | Interleaving String | [JavaScript](./src/0097.interleaving-string.97/solution.js) | Medium  |

| 0098 | Validate Binary Search Tree | [JavaScript](./src/0098.validate-binary-search-tree.98/solution.js) [TypeScript](./src/0098.validate-binary-search-tree.98/solution.ts) | Medium  |

| 0099 | Recover Binary Search Tree | [JavaScript](./src/0099.recover-binary-search-tree.99/solution.js) [TypeScript](./src/0099.recover-binary-search-tree.99/solution.ts) | Medium  |

| 0100 | Same Tree | [Go](./src/0100.same-tree.100/solution.go) [Java](./src/0100.same-tree.100/solution.java) [JavaScript](./src/0100.same-tree.100/solution.js) [TypeScript](./src/0100.same-tree.100/solution.ts) | Easy  |

| 0101 | Symmetric Tree | [Go](./src/0101.symmetric-tree.101/solution.go) [Java](./src/0101.symmetric-tree.101/solution.java) [JavaScript](./src/0101.symmetric-tree.101/solution.js) [TypeScript](./src/0101.symmetric-tree.101/solution.ts) | Easy  |

| 0102 | Binary Tree Level Order Traversal | [Go](./src/0102.binary-tree-level-order-traversal.102/solution.go) [Java](./src/0102.binary-tree-level-order-traversal.102/solution.java) [JavaScript](./src/0102.binary-tree-level-order-traversal.102/solution.js) [TypeScript](./src/0102.binary-tree-level-order-traversal.102/solution.ts) | Medium  |

| 0103 | Binary Tree Zigzag Level Order Traversal | [Java](./src/0103.binary-tree-zigzag-level-order-traversal.103/solution.java) [JavaScript](./src/0103.binary-tree-zigzag-level-order-traversal.103/solution.js) [TypeScript](./src/0103.binary-tree-zigzag-level-order-traversal.103/solution.ts) | Medium  |

| 0104 | Maximum Depth of Binary Tree | [Go](./src/0104.maximum-depth-of-binary-tree.104/solution.go) [Java](./src/0104.maximum-depth-of-binary-tree.104/solution.java) [JavaScript](./src/0104.maximum-depth-of-binary-tree.104/solution.js) [TypeScript](./src/0104.maximum-depth-of-binary-tree.104/solution.ts) | Easy  |

| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | [JavaScript](./src/0105.construct-binary-tree-from-preorder-and-inorder-traversal.105/solution.js) [TypeScript](./src/0105.construct-binary-tree-from-preorder-and-inorder-traversal.105/solution.ts) | Medium  |

| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | [JavaScript](./src/0106.construct-binary-tree-from-inorder-and-postorder-traversal.106/solution.js) [TypeScript](./src/0106.construct-binary-tree-from-inorder-and-postorder-traversal.106/solution.ts) | Medium  |

| 0107 | Binary Tree Level Order Traversal II | [Go](./src/0107.binary-tree-level-order-traversal-ii.107/solution.go) [Java](./src/0107.binary-tree-level-order-traversal-ii.107/solution.java) [JavaScript](./src/0107.binary-tree-level-order-traversal-ii.107/solution.js) [TypeScript](./src/0107.binary-tree-level-order-traversal-ii.107/solution.ts) | Medium  |

| 0108 | Convert Sorted Array to Binary Search Tree | [Go](./src/0108.convert-sorted-array-to-binary-search-tree.108/solution.go) [Java](./src/0108.convert-sorted-array-to-binary-search-tree.108/solution.java) [JavaScript](./src/0108.convert-sorted-array-to-binary-search-tree.108/solution.js) [TypeScript](./src/0108.convert-sorted-array-to-binary-search-tree.108/solution.ts) | Easy  |

| 0109 | Convert Sorted List to Binary Search Tree | [JavaScript](./src/0109.convert-sorted-list-to-binary-search-tree.109/solution.js) [TypeScript](./src/0109.convert-sorted-list-to-binary-search-tree.109/solution.ts) | Medium  |

| 0110 | Balanced Binary Tree | [Java](./src/0110.balanced-binary-tree.110/solution.java) [JavaScript](./src/0110.balanced-binary-tree.110/solution.js) [TypeScript](./src/0110.balanced-binary-tree.110/solution.ts) | Easy  |

| 0111 | Minimum Depth of Binary Tree | [Java](./src/0111.minimum-depth-of-binary-tree.111/solution.java) [JavaScript](./src/0111.minimum-depth-of-binary-tree.111/solution.js) [TypeScript](./src/0111.minimum-depth-of-binary-tree.111/solution.ts) | Easy  |

| 0112 | Path Sum | [Go](./src/0112.path-sum.112/solution.go) [Java](./src/0112.path-sum.112/solution.java) [JavaScript](./src/0112.path-sum.112/solution.js) [TypeScript](./src/0112.path-sum.112/solution.ts) | Easy  |

| 0113 | Path Sum II | [Java](./src/0113.path-sum-ii.113/solution.java) [JavaScript](./src/0113.path-sum-ii.113/solution.js) [TypeScript](./src/0113.path-sum-ii.113/solution.ts) | Medium  |

| 0114 | Flatten Binary Tree to Linked List | [JavaScript](./src/0114.flatten-binary-tree-to-linked-list.114/solution.js) [TypeScript](./src/0114.flatten-binary-tree-to-linked-list.114/solution.ts) | Medium  |

| 0115 | Distinct Subsequences | [JavaScript](./src/0115.distinct-subsequences.115/solution.js) | Hard  |

| 0116 | Populating Next Right Pointers in Each Node | [JavaScript](./src/0116.populating-next-right-pointers-in-each-node.116/solution.js) [TypeScript](./src/0116.populating-next-right-pointers-in-each-node.116/solution.ts) | Medium  |

| 0117 | Populating Next Right Pointers in Each Node II | [JavaScript](./src/0117.populating-next-right-pointers-in-each-node-ii.117/solution.js) [TypeScript](./src/0117.populating-next-right-pointers-in-each-node-ii.117/solution.ts) | Medium  |

| 0118 | Pascal's Triangle | [Java](./src/0118.pascals-triangle.118/solution.java) [JavaScript](./src/0118.pascals-triangle.118/solution.js) [TypeScript](./src/0118.pascals-triangle.118/solution.ts) | Easy  |

| 0119 | Pascal's Triangle II | [Java](./src/0119.pascals-triangle-ii.119/solution.java) [JavaScript](./src/0119.pascals-triangle-ii.119/solution.js) [TypeScript](./src/0119.pascals-triangle-ii.119/solution.ts) | Easy  |

| 0120 | Triangle | [Java](./src/0120.triangle.120/solution.java) [JavaScript](./src/0120.triangle.120/solution.js) [TypeScript](./src/0120.triangle.120/solution.ts) | Medium  |

| 0121 | Best Time to Buy and Sell Stock | [Java](./src/0121.best-time-to-buy-and-sell-stock.121/solution.java) [JavaScript](./src/0121.best-time-to-buy-and-sell-stock.121/solution.js) [TypeScript](./src/0121.best-time-to-buy-and-sell-stock.121/solution.ts) | Easy  |

| 0122 | Best Time to Buy and Sell Stock II | [JavaScript](./src/0122.best-time-to-buy-and-sell-stock-ii.122/solution.js) [TypeScript](./src/0122.best-time-to-buy-and-sell-stock-ii.122/solution.ts) | Medium  |

| 0123 | Best Time to Buy and Sell Stock III | [JavaScript](./src/0123.best-time-to-buy-and-sell-stock-iii.123/solution.js) | Hard  |

| 0124 | Binary Tree Maximum Path Sum | [Java](./src/0124.binary-tree-maximum-path-sum.124/solution.java) [JavaScript](./src/0124.binary-tree-maximum-path-sum.124/solution.js) [TypeScript](./src/0124.binary-tree-maximum-path-sum.124/solution.ts) | Hard  |

| 0125 | Valid Palindrome | [Java](./src/0125.valid-palindrome.125/solution.java) [JavaScript](./src/0125.valid-palindrome.125/solution.js) [TypeScript](./src/0125.valid-palindrome.125/solution.ts) | Easy  |

| 0126 | Word Ladder II |  | Hard  |

| 0127 | Word Ladder | [JavaScript](./src/0127.word-ladder.127/solution.js) | Hard  |

| 0128 | Longest Consecutive Sequence | [JavaScript](./src/0128.longest-consecutive-sequence.128/solution.js) | Medium  |

| 0129 | Sum Root to Leaf Numbers | [Java](./src/0129.sum-root-to-leaf-numbers.129/solution.java) [JavaScript](./src/0129.sum-root-to-leaf-numbers.129/solution.js) [TypeScript](./src/0129.sum-root-to-leaf-numbers.129/solution.ts) | Medium  |

| 0130 | Surrounded Regions | [JavaScript](./src/0130.surrounded-regions.130/solution.js) | Medium  |

| 0131 | Palindrome Partitioning | [JavaScript](./src/0131.palindrome-partitioning.131/solution.js) | Medium  |

| 0132 | Palindrome Partitioning II | [JavaScript](./src/0132.palindrome-partitioning-ii.132/solution.js) [TypeScript](./src/0132.palindrome-partitioning-ii.132/solution.ts) | Hard  |

| 0133 | Clone Graph | [JavaScript](./src/0133.clone-graph.133/solution.js) | Medium  |

| 0134 | Gas Station | [JavaScript](./src/0134.gas-station.134/solution.js) | Medium  |

| 0135 | Candy | [JavaScript](./src/0135.candy.135/solution.js) [TypeScript](./src/0135.candy.135/solution.ts) | Hard  |

| 0136 | Single Number | [Java](./src/0136.single-number.136/solution.java) [JavaScript](./src/0136.single-number.136/solution.js) [TypeScript](./src/0136.single-number.136/solution.ts) | Easy  |

| 0137 | Single Number II | [JavaScript](./src/0137.single-number-ii.137/solution.js) | Medium  |

| 0138 | Copy List with Random Pointer | [JavaScript](./src/0138.copy-list-with-random-pointer.138/solution.js) | Medium  |

| 0139 | Word Break | [JavaScript](./src/0139.word-break.139/solution.js) | Medium  |

| 0140 | Word Break II | [JavaScript](./src/0140.word-break-ii.140/solution.js) | Hard  |

| 0141 | Linked List Cycle | [Java](./src/0141.linked-list-cycle.141/solution.java) [JavaScript](./src/0141.linked-list-cycle.141/solution.js) [TypeScript](./src/0141.linked-list-cycle.141/solution.ts) | Easy  |

| 0142 | Linked List Cycle II | [Java](./src/0142.linked-list-cycle-ii.142/solution.java) [JavaScript](./src/0142.linked-list-cycle-ii.142/solution.js) [TypeScript](./src/0142.linked-list-cycle-ii.142/solution.ts) | Medium  |

| 0143 | Reorder List | [JavaScript](./src/0143.reorder-list.143/solution.js) [TypeScript](./src/0143.reorder-list.143/solution.ts) | Medium  |

| 0144 | Binary Tree Preorder Traversal | [Go](./src/0144.binary-tree-preorder-traversal.144/solution.go) [Java](./src/0144.binary-tree-preorder-traversal.144/solution.java) [JavaScript](./src/0144.binary-tree-preorder-traversal.144/solution.js) [TypeScript](./src/0144.binary-tree-preorder-traversal.144/solution.ts) | Easy  |

| 0145 | Binary Tree Postorder Traversal | [Go](./src/0145.binary-tree-postorder-traversal.145/solution.go) [Java](./src/0145.binary-tree-postorder-traversal.145/solution.java) [JavaScript](./src/0145.binary-tree-postorder-traversal.145/solution.js) [TypeScript](./src/0145.binary-tree-postorder-traversal.145/solution.ts) | Easy  |

| 0146 | LRU Cache | [JavaScript](./src/0146.lru-cache.146/solution.js) | Medium  |

| 0147 | Insertion Sort List | [JavaScript](./src/0147.insertion-sort-list.147/solution.js) | Medium  |

| 0148 | Sort List | [JavaScript](./src/0148.sort-list.148/solution.js) | Medium  |

| 0149 | Max Points on a Line |  | Hard  |

| 0150 | Evaluate Reverse Polish Notation | [JavaScript](./src/0150.evaluate-reverse-polish-notation.150/solution.js) [TypeScript](./src/0150.evaluate-reverse-polish-notation.150/solution.ts) | Medium  |

| 0151 | Reverse Words in a String | [Java](./src/0151.reverse-words-in-a-string.151/solution.java) [JavaScript](./src/0151.reverse-words-in-a-string.151/solution.js) [TypeScript](./src/0151.reverse-words-in-a-string.151/solution.ts) | Medium  |

| 0152 | Maximum Product Subarray | [JavaScript](./src/0152.maximum-product-subarray.152/solution.js) [TypeScript](./src/0152.maximum-product-subarray.152/solution.ts) | Medium  |

| 0153 | Find Minimum in Rotated Sorted Array | [JavaScript](./src/0153.find-minimum-in-rotated-sorted-array.153/solution.js) | Medium  |

| 0154 | Find Minimum in Rotated Sorted Array II | [JavaScript](./src/0154.find-minimum-in-rotated-sorted-array-ii.154/solution.js) | Hard  |

| 0155 | Min Stack | [Java](./src/0155.min-stack.155/solution.java) [JavaScript](./src/0155.min-stack.155/solution.js) [TypeScript](./src/0155.min-stack.155/solution.ts) | Medium  |

| 0156 | Binary Tree Upside Down | [JavaScript](./src/0156.binary-tree-upside-down.156/solution.js) [TypeScript](./src/0156.binary-tree-upside-down.156/solution.ts) | Medium  |

| 0157 | Read N Characters Given Read4 | [JavaScript](./src/0157.read-n-characters-given-read4.157/solution.js) | Easy  |

| 0158 | Read N Characters Given read4 II - Call Multiple Times |  | Hard  |

| 0159 | Longest Substring with At Most Two Distinct Characters | [JavaScript](./src/0159.longest-substring-with-at-most-two-distinct-characters.159/solution.js) | Medium  |

| 0160 | Intersection of Two Linked Lists | [Java](./src/0160.intersection-of-two-linked-lists.160/solution.java) [JavaScript](./src/0160.intersection-of-two-linked-lists.160/solution.js) [TypeScript](./src/0160.intersection-of-two-linked-lists.160/solution.ts) | Easy  |

| 0161 | One Edit Distance | [JavaScript](./src/0161.one-edit-distance.161/solution.js) [TypeScript](./src/0161.one-edit-distance.161/solution.ts) | Medium  |

| 0162 | Find Peak Element | [JavaScript](./src/0162.find-peak-element.162/solution.js) [TypeScript](./src/0162.find-peak-element.162/solution.ts) | Medium  |

| 0163 | Missing Ranges | [JavaScript](./src/0163.missing-ranges.163/solution.js) [TypeScript](./src/0163.missing-ranges.163/solution.ts) | Easy  |

| 0164 | Maximum Gap | [TypeScript](./src/0164.maximum-gap.164/solution.ts) | Medium  |

| 0165 | Compare Version Numbers | [JavaScript](./src/0165.compare-version-numbers.165/solution.js) [TypeScript](./src/0165.compare-version-numbers.165/solution.ts) | Medium  |

| 0166 | Fraction to Recurring Decimal | [JavaScript](./src/0166.fraction-to-recurring-decimal.166/solution.js) | Medium  |

| 0167 | Two Sum II - Input Array Is Sorted | [JavaScript](./src/0167.two-sum-ii-input-array-is-sorted.167/solution.js) [TypeScript](./src/0167.two-sum-ii-input-array-is-sorted.167/solution.ts) | Medium  |

| 0168 | Excel Sheet Column Title | [JavaScript](./src/0168.excel-sheet-column-title.168/solution.js) [TypeScript](./src/0168.excel-sheet-column-title.168/solution.ts) | Easy  |

| 0169 | Majority Element | [Java](./src/0169.majority-element.169/solution.java) [JavaScript](./src/0169.majority-element.169/solution.js) [TypeScript](./src/0169.majority-element.169/solution.ts) | Easy  |

| 0170 | Two Sum III - Data structure design | [JavaScript](./src/0170.two-sum-iii-data-structure-design.170/solution.js) [TypeScript](./src/0170.two-sum-iii-data-structure-design.170/solution.ts) | Easy  |

| 0171 | Excel Sheet Column Number | [JavaScript](./src/0171.excel-sheet-column-number.171/solution.js) [TypeScript](./src/0171.excel-sheet-column-number.171/solution.ts) | Easy  |

| 0172 | Factorial Trailing Zeroes | [JavaScript](./src/0172.factorial-trailing-zeroes.172/solution.js) [TypeScript](./src/0172.factorial-trailing-zeroes.172/solution.ts) | Medium  |

| 0173 | Binary Search Tree Iterator | [Java](./src/0173.binary-search-tree-iterator.173/solution.java) [JavaScript](./src/0173.binary-search-tree-iterator.173/solution.js) [TypeScript](./src/0173.binary-search-tree-iterator.173/solution.ts) | Medium  |

| 0174 | Dungeon Game |  | Hard  |

| 0175 | Combine Two Tables | [Mysql](./src/0175.combine-two-tables.175/solution.sql) | Easy  |

| 0176 | Second Highest Salary | [Mysql](./src/0176.second-highest-salary.176/solution.sql) | Medium  |

| 0177 | Nth Highest Salary | [Mysql](./src/0177.nth-highest-salary.177/solution.sql) | Medium  |

| 0178 | Rank Scores | [Mysql](./src/0178.rank-scores.178/solution.sql) | Medium  |

| 0179 | Largest Number | [JavaScript](./src/0179.largest-number.179/solution.js) | Medium  |

| 0180 | Consecutive Numbers | [Mysql](./src/0180.consecutive-numbers.180/solution.sql) | Medium  |

| 0181 | Employees Earning More Than Their Managers | [Mysql](./src/0181.employees-earning-more-than-their-managers.181/solution.sql) | Easy  |

| 0182 | Duplicate Emails | [Mysql](./src/0182.duplicate-emails.182/solution.sql) | Easy  |

| 0183 | Customers Who Never Order | [Mysql](./src/0183.customers-who-never-order.183/solution.sql) | Easy  |

| 0184 | Department Highest Salary | [Mysql](./src/0184.department-highest-salary.184/solution.sql) | Medium  |

| 0185 | Department Top Three Salaries |  | Hard  |

| 0186 | Reverse Words in a String II | [JavaScript](./src/0186.reverse-words-in-a-string-ii.186/solution.js) [TypeScript](./src/0186.reverse-words-in-a-string-ii.186/solution.ts) | Medium  |

| 0187 | Repeated DNA Sequences | [JavaScript](./src/0187.repeated-dna-sequences.187/solution.js) | Medium  |

| 0188 | Best Time to Buy and Sell Stock IV | [JavaScript](./src/0188.best-time-to-buy-and-sell-stock-iv.188/solution.js) | Hard  |

| 0189 | Rotate Array | [JavaScript](./src/0189.rotate-array.189/solution.js) [TypeScript](./src/0189.rotate-array.189/solution.ts) | Medium  |

| 0190 | Reverse Bits | [JavaScript](./src/0190.reverse-bits.190/solution.js) [TypeScript](./src/0190.reverse-bits.190/solution.ts) | Easy  |

| 0191 | Number of 1 Bits | [Java](./src/0191.number-of-1-bits.191/solution.java) [JavaScript](./src/0191.number-of-1-bits.191/solution.js) [TypeScript](./src/0191.number-of-1-bits.191/solution.ts) | Easy  |

| 0192 | Word Frequency |  | Medium  |

| 0193 | Valid Phone Numbers |  | Easy  |

| 0194 | Transpose File |  | Medium  |

| 0195 | Tenth Line |  | Easy  |

| 0196 | Delete Duplicate Emails | [Mysql](./src/0196.delete-duplicate-emails.196/solution.sql) | Easy  |

| 0197 | Rising Temperature | [Mysql](./src/0197.rising-temperature.197/solution.sql) | Easy  |

| 0198 | House Robber | [JavaScript](./src/0198.house-robber.198/solution.js) [TypeScript](./src/0198.house-robber.198/solution.ts) | Medium  |

| 0199 | Binary Tree Right Side View | [Java](./src/0199.binary-tree-right-side-view.199/solution.java) [JavaScript](./src/0199.binary-tree-right-side-view.199/solution.js) [TypeScript](./src/0199.binary-tree-right-side-view.199/solution.ts) | Medium  |

| 0200 | Number of Islands | [JavaScript](./src/0200.number-of-islands.200/solution.js) [TypeScript](./src/0200.number-of-islands.200/solution.ts) | Medium  |

| 0201 | Bitwise AND of Numbers Range | [JavaScript](./src/0201.bitwise-and-of-numbers-range.201/solution.js) | Medium  |

| 0202 | Happy Number | [Java](./src/0202.happy-number.202/solution.java) [JavaScript](./src/0202.happy-number.202/solution.js) [TypeScript](./src/0202.happy-number.202/solution.ts) | Easy  |

| 0203 | Remove Linked List Elements | [Go](./src/0203.remove-linked-list-elements.203/solution.go) [Java](./src/0203.remove-linked-list-elements.203/solution.java) [JavaScript](./src/0203.remove-linked-list-elements.203/solution.js) [TypeScript](./src/0203.remove-linked-list-elements.203/solution.ts) | Easy  |

| 0204 | Count Primes | [JavaScript](./src/0204.count-primes.204/solution.js) [TypeScript](./src/0204.count-primes.204/solution.ts) | Medium  |

| 0205 | Isomorphic Strings | [JavaScript](./src/0205.isomorphic-strings.205/solution.js) [TypeScript](./src/0205.isomorphic-strings.205/solution.ts) | Easy  |

| 0206 | Reverse Linked List | [Go](./src/0206.reverse-linked-list.206/solution.go) [Java](./src/0206.reverse-linked-list.206/solution.java) [JavaScript](./src/0206.reverse-linked-list.206/solution.js) [TypeScript](./src/0206.reverse-linked-list.206/solution.ts) | Easy  |

| 0207 | Course Schedule | [JavaScript](./src/0207.course-schedule.207/solution.js) [TypeScript](./src/0207.course-schedule.207/solution.ts) | Medium  |

| 0208 | Implement Trie (Prefix Tree) | [JavaScript](./src/0208.implement-trie-prefix-tree.208/solution.js) | Medium  |

| 0209 | Minimum Size Subarray Sum | [JavaScript](./src/0209.minimum-size-subarray-sum.209/solution.js) [TypeScript](./src/0209.minimum-size-subarray-sum.209/solution.ts) | Medium  |

| 0210 | Course Schedule II | [JavaScript](./src/0210.course-schedule-ii.210/solution.js) [TypeScript](./src/0210.course-schedule-ii.210/solution.ts) | Medium  |

| 0211 | Design Add and Search Words Data Structure | [JavaScript](./src/0211.design-add-and-search-words-data-structure.211/solution.js) | Medium  |

| 0212 | Word Search II |  | Hard  |

| 0213 | House Robber II | [JavaScript](./src/0213.house-robber-ii.213/solution.js) [TypeScript](./src/0213.house-robber-ii.213/solution.ts) | Medium  |

| 0214 | Shortest Palindrome | [TypeScript](./src/0214.shortest-palindrome.214/solution.ts) | Hard  |

| 0215 | Kth Largest Element in an Array | [JavaScript](./src/0215.kth-largest-element-in-an-array.215/solution.js) | Medium  |

| 0216 | Combination Sum III | [JavaScript](./src/0216.combination-sum-iii.216/solution.js) [TypeScript](./src/0216.combination-sum-iii.216/solution.ts) | Medium  |

| 0217 | Contains Duplicate | [Java](./src/0217.contains-duplicate.217/solution.java) [JavaScript](./src/0217.contains-duplicate.217/solution.js) [TypeScript](./src/0217.contains-duplicate.217/solution.ts) | Easy  |

| 0218 | The Skyline Problem |  | Hard  |

| 0219 | Contains Duplicate II | [JavaScript](./src/0219.contains-duplicate-ii.219/solution.js) [TypeScript](./src/0219.contains-duplicate-ii.219/solution.ts) | Easy  |

| 0220 | Contains Duplicate III | [JavaScript](./src/0220.contains-duplicate-iii.220/solution.js) | Hard  |

| 0221 | Maximal Square | [JavaScript](./src/0221.maximal-square.221/solution.js) [TypeScript](./src/0221.maximal-square.221/solution.ts) | Medium  |

| 0222 | Count Complete Tree Nodes | [JavaScript](./src/0222.count-complete-tree-nodes.222/solution.js) [TypeScript](./src/0222.count-complete-tree-nodes.222/solution.ts) | Easy  |

| 0223 | Rectangle Area | [JavaScript](./src/0223.rectangle-area.223/solution.js) | Medium  |

| 0224 | Basic Calculator |  | Hard  |

| 0225 | Implement Stack using Queues | [JavaScript](./src/0225.implement-stack-using-queues.225/solution.js) [TypeScript](./src/0225.implement-stack-using-queues.225/solution.ts) | Easy  |

| 0226 | Invert Binary Tree | [Go](./src/0226.invert-binary-tree.226/solution.go) [Java](./src/0226.invert-binary-tree.226/solution.java) [JavaScript](./src/0226.invert-binary-tree.226/solution.js) [TypeScript](./src/0226.invert-binary-tree.226/solution.ts) | Easy  |

| 0227 | Basic Calculator II |  | Medium  |

| 0228 | Summary Ranges | [Java](./src/0228.summary-ranges.228/solution.java) [JavaScript](./src/0228.summary-ranges.228/solution.js) [TypeScript](./src/0228.summary-ranges.228/solution.ts) | Easy  |

| 0229 | Majority Element II | [JavaScript](./src/0229.majority-element-ii.229/solution.js) | Medium  |

| 0230 | Kth Smallest Element in a BST | [JavaScript](./src/0230.kth-smallest-element-in-a-bst.230/solution.js) [TypeScript](./src/0230.kth-smallest-element-in-a-bst.230/solution.ts) | Medium  |

| 0231 | Power of Two | [Java](./src/0231.power-of-two.231/solution.java) [JavaScript](./src/0231.power-of-two.231/solution.js) [TypeScript](./src/0231.power-of-two.231/solution.ts) | Easy  |

| 0232 | Implement Queue using Stacks | [JavaScript](./src/0232.implement-queue-using-stacks.232/solution.js) [TypeScript](./src/0232.implement-queue-using-stacks.232/solution.ts) | Easy  |

| 0233 | Number of Digit One | [JavaScript](./src/0233.number-of-digit-one.233/solution.js) | Hard  |

| 0234 | Palindrome Linked List | [Java](./src/0234.palindrome-linked-list.234/solution.java) [JavaScript](./src/0234.palindrome-linked-list.234/solution.js) [TypeScript](./src/0234.palindrome-linked-list.234/solution.ts) | Easy  |

| 0235 | Lowest Common Ancestor of a Binary Search Tree | [Go](./src/0235.lowest-common-ancestor-of-a-binary-search-tree.235/solution.go) [Java](./src/0235.lowest-common-ancestor-of-a-binary-search-tree.235/solution.java) [JavaScript](./src/0235.lowest-common-ancestor-of-a-binary-search-tree.235/solution.js) [TypeScript](./src/0235.lowest-common-ancestor-of-a-binary-search-tree.235/solution.ts) | Medium  |

| 0236 | Lowest Common Ancestor of a Binary Tree | [Java](./src/0236.lowest-common-ancestor-of-a-binary-tree.236/solution.java) [JavaScript](./src/0236.lowest-common-ancestor-of-a-binary-tree.236/solution.js) [TypeScript](./src/0236.lowest-common-ancestor-of-a-binary-tree.236/solution.ts) | Medium  |

| 0237 | Delete Node in a Linked List | [Java](./src/0237.delete-node-in-a-linked-list.237/solution.java) [JavaScript](./src/0237.delete-node-in-a-linked-list.237/solution.js) [TypeScript](./src/0237.delete-node-in-a-linked-list.237/solution.ts) | Medium  |

| 0238 | Product of Array Except Self | [JavaScript](./src/0238.product-of-array-except-self.238/solution.js) [TypeScript](./src/0238.product-of-array-except-self.238/solution.ts) | Medium  |

| 0239 | Sliding Window Maximum | [JavaScript](./src/0239.sliding-window-maximum.239/solution.js) [TypeScript](./src/0239.sliding-window-maximum.239/solution.ts) | Hard  |

| 0240 | Search a 2D Matrix II | [JavaScript](./src/0240.search-a-2d-matrix-ii.240/solution.js) [TypeScript](./src/0240.search-a-2d-matrix-ii.240/solution.ts) | Medium  |

| 0241 | Different Ways to Add Parentheses |  | Medium  |

| 0242 | Valid Anagram | [Java](./src/0242.valid-anagram.242/solution.java) [JavaScript](./src/0242.valid-anagram.242/solution.js) [TypeScript](./src/0242.valid-anagram.242/solution.ts) | Easy  |

| 0243 | Shortest Word Distance | [JavaScript](./src/0243.shortest-word-distance.243/solution.js) [TypeScript](./src/0243.shortest-word-distance.243/solution.ts) | Easy  |

| 0244 | Shortest Word Distance II | [JavaScript](./src/0244.shortest-word-distance-ii.244/solution.js) [TypeScript](./src/0244.shortest-word-distance-ii.244/solution.ts) | Medium  |

| 0245 | Shortest Word Distance III | [JavaScript](./src/0245.shortest-word-distance-iii.245/solution.js) [TypeScript](./src/0245.shortest-word-distance-iii.245/solution.ts) | Medium  |

| 0246 | Strobogrammatic Number | [JavaScript](./src/0246.strobogrammatic-number.246/solution.js) [TypeScript](./src/0246.strobogrammatic-number.246/solution.ts) | Easy  |

| 0247 | Strobogrammatic Number II | [JavaScript](./src/0247.strobogrammatic-number-ii.247/solution.js) [TypeScript](./src/0247.strobogrammatic-number-ii.247/solution.ts) | Medium  |

| 0248 | Strobogrammatic Number III |  | Hard  |

| 0249 | Group Shifted Strings |  | Medium  |

| 0250 | Count Univalue Subtrees | [JavaScript](./src/0250.count-univalue-subtrees.250/solution.js) [TypeScript](./src/0250.count-univalue-subtrees.250/solution.ts) | Medium  |

| 0251 | Flatten 2D Vector | [JavaScript](./src/0251.flatten-2d-vector.251/solution.js) [TypeScript](./src/0251.flatten-2d-vector.251/solution.ts) | Medium  |

| 0252 | Meeting Rooms | [JavaScript](./src/0252.meeting-rooms.252/solution.js) [TypeScript](./src/0252.meeting-rooms.252/solution.ts) | Easy  |

| 0253 | Meeting Rooms II |  | Medium  |

| 0254 | Factor Combinations |  | Medium  |

| 0255 | Verify Preorder Sequence in Binary Search Tree | [JavaScript](./src/0255.verify-preorder-sequence-in-binary-search-tree.255/solution.js) | Medium  |

| 0256 | Paint House |  | Medium  |

| 0257 | Binary Tree Paths | [Java](./src/0257.binary-tree-paths.257/solution.java) [JavaScript](./src/0257.binary-tree-paths.257/solution.js) [TypeScript](./src/0257.binary-tree-paths.257/solution.ts) | Easy  |

| 0258 | Add Digits | [Java](./src/0258.add-digits.258/solution.java) [JavaScript](./src/0258.add-digits.258/solution.js) [TypeScript](./src/0258.add-digits.258/solution.ts) | Easy  |

| 0259 | 3Sum Smaller | [JavaScript](./src/0259.3sum-smaller.259/solution.js) [TypeScript](./src/0259.3sum-smaller.259/solution.ts) | Medium  |

| 0260 | Single Number III | [JavaScript](./src/0260.single-number-iii.260/solution.js) [TypeScript](./src/0260.single-number-iii.260/solution.ts) | Medium  |

| 0261 | Graph Valid Tree |  | Medium  |

| 0262 | Trips and Users |  | Hard  |

| 0263 | Ugly Number | [Java](./src/0263.ugly-number.263/solution.java) [JavaScript](./src/0263.ugly-number.263/solution.js) [TypeScript](./src/0263.ugly-number.263/solution.ts) | Easy  |

| 0264 | Ugly Number II | [JavaScript](./src/0264.ugly-number-ii.264/solution.js) | Medium  |

| 0265 | Paint House II |  | Hard  |

| 0266 | Palindrome Permutation | [JavaScript](./src/0266.palindrome-permutation.266/solution.js) [TypeScript](./src/0266.palindrome-permutation.266/solution.ts) | Easy  |

| 0267 | Palindrome Permutation II | [JavaScript](./src/0267.palindrome-permutation-ii.267/solution.js) [TypeScript](./src/0267.palindrome-permutation-ii.267/solution.ts) | Medium  |

| 0268 | Missing Number | [Java](./src/0268.missing-number.268/solution.java) [JavaScript](./src/0268.missing-number.268/solution.js) [TypeScript](./src/0268.missing-number.268/solution.ts) | Easy  |

| 0269 | Alien Dictionary |  | Hard  |

| 0270 | Closest Binary Search Tree Value | [JavaScript](./src/0270.closest-binary-search-tree-value.270/solution.js) [TypeScript](./src/0270.closest-binary-search-tree-value.270/solution.ts) | Easy  |

| 0271 | Encode and Decode Strings | [JavaScript](./src/0271.encode-and-decode-strings.271/solution.js) | Medium  |

| 0272 | Closest Binary Search Tree Value II | [JavaScript](./src/0272.closest-binary-search-tree-value-ii.272/solution.js) [TypeScript](./src/0272.closest-binary-search-tree-value-ii.272/solution.ts) | Hard  |

| 0273 | Integer to English Words | [JavaScript](./src/0273.integer-to-english-words.273/solution.js) | Hard  |

| 0274 | H-Index | [JavaScript](./src/0274.h-index.274/solution.js) [TypeScript](./src/0274.h-index.274/solution.ts) | Medium  |

| 0275 | H-Index II | [JavaScript](./src/0275.h-index-ii.275/solution.js) [TypeScript](./src/0275.h-index-ii.275/solution.ts) | Medium  |

| 0276 | Paint Fence |  | Medium  |

| 0277 | Find the Celebrity |  | Medium  |

| 0278 | First Bad Version | [JavaScript](./src/0278.first-bad-version.278/solution.js) [TypeScript](./src/0278.first-bad-version.278/solution.ts) | Easy  |

| 0279 | Perfect Squares | [JavaScript](./src/0279.perfect-squares.279/solution.js) [TypeScript](./src/0279.perfect-squares.279/solution.ts) | Medium  |

| 0280 | Wiggle Sort | [JavaScript](./src/0280.wiggle-sort.280/solution.js) [TypeScript](./src/0280.wiggle-sort.280/solution.ts) | Medium  |

| 0281 | Zigzag Iterator | [JavaScript](./src/0281.zigzag-iterator.281/solution.js) [TypeScript](./src/0281.zigzag-iterator.281/solution.ts) | Medium  |

| 0282 | Expression Add Operators |  | Hard  |

| 0283 | Move Zeroes | [Java](./src/0283.move-zeroes.283/solution.java) [JavaScript](./src/0283.move-zeroes.283/solution.js) [TypeScript](./src/0283.move-zeroes.283/solution.ts) | Easy  |

| 0284 | Peeking Iterator | [Java](./src/0284.peeking-iterator.284/solution.java) [JavaScript](./src/0284.peeking-iterator.284/solution.js) [Python3](./src/0284.peeking-iterator.284/solution.py) [TypeScript](./src/0284.peeking-iterator.284/solution.ts) | Medium  |

| 0285 | Inorder Successor in BST | [JavaScript](./src/0285.inorder-successor-in-bst.285/solution.js) [TypeScript](./src/0285.inorder-successor-in-bst.285/solution.ts) | Medium  |

| 0286 | Walls and Gates |  | Medium  |

| 0287 | Find the Duplicate Number | [JavaScript](./src/0287.find-the-duplicate-number.287/solution.js) [TypeScript](./src/0287.find-the-duplicate-number.287/solution.ts) | Medium  |

| 0288 | Unique Word Abbreviation | [JavaScript](./src/0288.unique-word-abbreviation.288/solution.js) [TypeScript](./src/0288.unique-word-abbreviation.288/solution.ts) | Medium  |

| 0289 | Game of Life | [JavaScript](./src/0289.game-of-life.289/solution.js) | Medium  |

| 0290 | Word Pattern | [JavaScript](./src/0290.word-pattern.290/solution.js) [TypeScript](./src/0290.word-pattern.290/solution.ts) | Easy  |

| 0291 | Word Pattern II |  | Medium  |

| 0292 | Nim Game | [Java](./src/0292.nim-game.292/solution.java) [JavaScript](./src/0292.nim-game.292/solution.js) [TypeScript](./src/0292.nim-game.292/solution.ts) | Easy  |

| 0293 | Flip Game | [JavaScript](./src/0293.flip-game.293/solution.js) [TypeScript](./src/0293.flip-game.293/solution.ts) | Easy  |

| 0294 | Flip Game II |  | Medium  |

| 0295 | Find Median from Data Stream | [JavaScript](./src/0295.find-median-from-data-stream.295/solution.js) | Hard  |

| 0296 | Best Meeting Point |  | Hard  |

| 0297 | Serialize and Deserialize Binary Tree | [JavaScript](./src/0297.serialize-and-deserialize-binary-tree.297/solution.js) [TypeScript](./src/0297.serialize-and-deserialize-binary-tree.297/solution.ts) | Hard  |

| 0298 | Binary Tree Longest Consecutive Sequence | [JavaScript](./src/0298.binary-tree-longest-consecutive-sequence.298/solution.js) [TypeScript](./src/0298.binary-tree-longest-consecutive-sequence.298/solution.ts) | Medium  |

| 0299 | Bulls and Cows | [JavaScript](./src/0299.bulls-and-cows.299/solution.js) | Medium  |

| 0300 | Longest Increasing Subsequence | [JavaScript](./src/0300.longest-increasing-subsequence.300/solution.js) [TypeScript](./src/0300.longest-increasing-subsequence.300/solution.ts) | Medium  |

| 0301 | Remove Invalid Parentheses |  | Hard  |

| 0302 | Smallest Rectangle Enclosing Black Pixels |  | Hard  |

| 0303 | Range Sum Query - Immutable | [Java](./src/0303.range-sum-query-immutable.303/solution.java) [JavaScript](./src/0303.range-sum-query-immutable.303/solution.js) [TypeScript](./src/0303.range-sum-query-immutable.303/solution.ts) | Easy  |

| 0304 | Range Sum Query 2D - Immutable | [JavaScript](./src/0304.range-sum-query-2d-immutable.304/solution.js) [TypeScript](./src/0304.range-sum-query-2d-immutable.304/solution.ts) | Medium  |

| 0305 | Number of Islands II |  | Hard  |

| 0306 | Additive Number | [JavaScript](./src/0306.additive-number.306/solution.js) | Medium  |

| 0307 | Range Sum Query - Mutable | [JavaScript](./src/0307.range-sum-query-mutable.307/solution.js) [TypeScript](./src/0307.range-sum-query-mutable.307/solution.ts) | Medium  |

| 0308 | Range Sum Query 2D - Mutable |  | Medium  |

| 0309 | Best Time to Buy and Sell Stock with Cooldown | [JavaScript](./src/0309.best-time-to-buy-and-sell-stock-with-cooldown.309/solution.js) | Medium  |

| 0310 | Minimum Height Trees | [JavaScript](./src/0310.minimum-height-trees.310/solution.js) | Medium  |

| 0311 | Sparse Matrix Multiplication | [JavaScript](./src/0311.sparse-matrix-multiplication.311/solution.js) [TypeScript](./src/0311.sparse-matrix-multiplication.311/solution.ts) | Medium  |

| 0312 | Burst Balloons |  | Hard  |

| 0313 | Super Ugly Number | [JavaScript](./src/0313.super-ugly-number.313/solution.js) | Medium  |

| 0314 | Binary Tree Vertical Order Traversal | [JavaScript](./src/0314.binary-tree-vertical-order-traversal.314/solution.js) [TypeScript](./src/0314.binary-tree-vertical-order-traversal.314/solution.ts) | Medium  |

| 0315 | Count of Smaller Numbers After Self | [JavaScript](./src/0315.count-of-smaller-numbers-after-self.315/solution.js) | Hard  |

| 0316 | Remove Duplicate Letters | [JavaScript](./src/0316.remove-duplicate-letters.316/solution.js) [TypeScript](./src/0316.remove-duplicate-letters.316/solution.ts) | Medium  |

| 0317 | Shortest Distance from All Buildings |  | Hard  |

| 0318 | Maximum Product of Word Lengths | [Java](./src/0318.maximum-product-of-word-lengths.318/solution.java) [JavaScript](./src/0318.maximum-product-of-word-lengths.318/solution.js) [TypeScript](./src/0318.maximum-product-of-word-lengths.318/solution.ts) | Medium  |

| 0319 | Bulb Switcher | [JavaScript](./src/0319.bulb-switcher.319/solution.js) [TypeScript](./src/0319.bulb-switcher.319/solution.ts) | Medium  |

| 0320 | Generalized Abbreviation | [JavaScript](./src/0320.generalized-abbreviation.320/solution.js) [TypeScript](./src/0320.generalized-abbreviation.320/solution.ts) | Medium  |

| 0321 | Create Maximum Number |  | Hard  |

| 0322 | Coin Change | [JavaScript](./src/0322.coin-change.322/solution.js) [TypeScript](./src/0322.coin-change.322/solution.ts) | Medium  |

| 0323 | Number of Connected Components in an Undirected Graph | [JavaScript](./src/0323.number-of-connected-components-in-an-undirected-graph.323/solution.js) [TypeScript](./src/0323.number-of-connected-components-in-an-undirected-graph.323/solution.ts) | Medium  |

| 0324 | Wiggle Sort II |  | Medium  |

| 0325 | Maximum Size Subarray Sum Equals k | [JavaScript](./src/0325.maximum-size-subarray-sum-equals-k.325/solution.js) [TypeScript](./src/0325.maximum-size-subarray-sum-equals-k.325/solution.ts) | Medium  |

| 0326 | Power of Three | [Java](./src/0326.power-of-three.326/solution.java) [JavaScript](./src/0326.power-of-three.326/solution.js) [TypeScript](./src/0326.power-of-three.326/solution.ts) | Easy  |

| 0327 | Count of Range Sum | [TypeScript](./src/0327.count-of-range-sum.327/solution.ts) | Hard  |

| 0328 | Odd Even Linked List | [Java](./src/0328.odd-even-linked-list.328/solution.java) [JavaScript](./src/0328.odd-even-linked-list.328/solution.js) [TypeScript](./src/0328.odd-even-linked-list.328/solution.ts) | Medium  |

| 0329 | Longest Increasing Path in a Matrix | [JavaScript](./src/0329.longest-increasing-path-in-a-matrix.329/solution.js) | Hard  |

| 0330 | Patching Array |  | Hard  |

| 0331 | Verify Preorder Serialization of a Binary Tree | [JavaScript](./src/0331.verify-preorder-serialization-of-a-binary-tree.331/solution.js) | Medium  |

| 0332 | Reconstruct Itinerary |  | Hard  |

| 0333 | Largest BST Subtree | [JavaScript](./src/0333.largest-bst-subtree.333/solution.js) [TypeScript](./src/0333.largest-bst-subtree.333/solution.ts) | Medium  |

| 0334 | Increasing Triplet Subsequence | [JavaScript](./src/0334.increasing-triplet-subsequence.334/solution.js) | Medium  |

| 0335 | Self Crossing |  | Hard  |

| 0336 | Palindrome Pairs |  | Hard  |

| 0337 | House Robber III | [JavaScript](./src/0337.house-robber-iii.337/solution.js) | Medium  |

| 0338 | Counting Bits | [Java](./src/0338.counting-bits.338/solution.java) [JavaScript](./src/0338.counting-bits.338/solution.js) [TypeScript](./src/0338.counting-bits.338/solution.ts) | Easy  |

| 0339 | Nested List Weight Sum | [JavaScript](./src/0339.nested-list-weight-sum.339/solution.js) [TypeScript](./src/0339.nested-list-weight-sum.339/solution.ts) | Medium  |

| 0340 | Longest Substring with At Most K Distinct Characters |  | Medium  |

| 0341 | Flatten Nested List Iterator | [JavaScript](./src/0341.flatten-nested-list-iterator.341/solution.js) | Medium  |

| 0342 | Power of Four | [Java](./src/0342.power-of-four.342/solution.java) [JavaScript](./src/0342.power-of-four.342/solution.js) [TypeScript](./src/0342.power-of-four.342/solution.ts) | Easy  |

| 0343 | Integer Break | [JavaScript](./src/0343.integer-break.343/solution.js) [TypeScript](./src/0343.integer-break.343/solution.ts) | Medium  |

| 0344 | Reverse String | [Java](./src/0344.reverse-string.344/solution.java) [JavaScript](./src/0344.reverse-string.344/solution.js) [TypeScript](./src/0344.reverse-string.344/solution.ts) | Easy  |

| 0345 | Reverse Vowels of a String | [Java](./src/0345.reverse-vowels-of-a-string.345/solution.java) [JavaScript](./src/0345.reverse-vowels-of-a-string.345/solution.js) [TypeScript](./src/0345.reverse-vowels-of-a-string.345/solution.ts) | Easy  |

| 0346 | Moving Average from Data Stream | [JavaScript](./src/0346.moving-average-from-data-stream.346/solution.js) [TypeScript](./src/0346.moving-average-from-data-stream.346/solution.ts) | Easy  |

| 0347 | Top K Frequent Elements | [JavaScript](./src/0347.top-k-frequent-elements.347/solution.js) | Medium  |

| 0348 | Design Tic-Tac-Toe |  | Medium  |

| 0349 | Intersection of Two Arrays | [Java](./src/0349.intersection-of-two-arrays.349/solution.java) [JavaScript](./src/0349.intersection-of-two-arrays.349/solution.js) [TypeScript](./src/0349.intersection-of-two-arrays.349/solution.ts) | Easy  |

| 0350 | Intersection of Two Arrays II | [Java](./src/0350.intersection-of-two-arrays-ii.350/solution.java) [JavaScript](./src/0350.intersection-of-two-arrays-ii.350/solution.js) [TypeScript](./src/0350.intersection-of-two-arrays-ii.350/solution.ts) | Easy  |

| 0351 | Android Unlock Patterns |  | Medium  |

| 0352 | Data Stream as Disjoint Intervals | [JavaScript](./src/0352.data-stream-as-disjoint-intervals.352/solution.js) | Hard  |

| 0353 | Design Snake Game |  | Medium  |

| 0354 | Russian Doll Envelopes | [JavaScript](./src/0354.russian-doll-envelopes.354/solution.js) | Hard  |

| 0355 | Design Twitter |  | Medium  |

| 0356 | Line Reflection |  | Medium  |

| 0357 | Count Numbers with Unique Digits | [JavaScript](./src/0357.count-numbers-with-unique-digits.357/solution.js) | Medium  |

| 0358 | Rearrange String k Distance Apart |  | Hard  |

| 0359 | Logger Rate Limiter | [JavaScript](./src/0359.logger-rate-limiter.359/solution.js) [TypeScript](./src/0359.logger-rate-limiter.359/solution.ts) | Easy  |

| 0360 | Sort Transformed Array | [JavaScript](./src/0360.sort-transformed-array.360/solution.js) | Medium  |

| 0361 | Bomb Enemy |  | Medium  |

| 0362 | Design Hit Counter | [JavaScript](./src/0362.design-hit-counter.362/solution.js) [TypeScript](./src/0362.design-hit-counter.362/solution.ts) | Medium  |

| 0363 | Max Sum of Rectangle No Larger Than K |  | Hard  |

| 0364 | Nested List Weight Sum II | [JavaScript](./src/0364.nested-list-weight-sum-ii.364/solution.js) [TypeScript](./src/0364.nested-list-weight-sum-ii.364/solution.ts) | Medium  |

| 0365 | Water and Jug Problem |  | Medium  |

| 0366 | Find Leaves of Binary Tree | [JavaScript](./src/0366.find-leaves-of-binary-tree.366/solution.js) [TypeScript](./src/0366.find-leaves-of-binary-tree.366/solution.ts) | Medium  |

| 0367 | Valid Perfect Square | [Java](./src/0367.valid-perfect-square.367/solution.java) [JavaScript](./src/0367.valid-perfect-square.367/solution.js) [TypeScript](./src/0367.valid-perfect-square.367/solution.ts) | Easy  |

| 0368 | Largest Divisible Subset |  | Medium  |

| 0369 | Plus One Linked List | [JavaScript](./src/0369.plus-one-linked-list.369/solution.js) [TypeScript](./src/0369.plus-one-linked-list.369/solution.ts) | Medium  |

| 0370 | Range Addition | [JavaScript](./src/0370.range-addition.370/solution.js) [TypeScript](./src/0370.range-addition.370/solution.ts) | Medium  |

| 0371 | Sum of Two Integers | [JavaScript](./src/0371.sum-of-two-integers.371/solution.js) [TypeScript](./src/0371.sum-of-two-integers.371/solution.ts) | Medium  |

| 0372 | Super Pow | [JavaScript](./src/0372.super-pow.372/solution.js) | Medium  |

| 0373 | Find K Pairs with Smallest Sums | [JavaScript](./src/0373.find-k-pairs-with-smallest-sums.373/solution.js) | Medium  |

| 0374 | Guess Number Higher or Lower | [Java](./src/0374.guess-number-higher-or-lower.374/solution.java) [JavaScript](./src/0374.guess-number-higher-or-lower.374/solution.js) [Python3](./src/0374.guess-number-higher-or-lower.374/solution.py) [TypeScript](./src/0374.guess-number-higher-or-lower.374/solution.ts) | Easy  |

| 0375 | Guess Number Higher or Lower II | [JavaScript](./src/0375.guess-number-higher-or-lower-ii.375/solution.js) | Medium  |

| 0376 | Wiggle Subsequence | [JavaScript](./src/0376.wiggle-subsequence.376/solution.js) | Medium  |

| 0377 | Combination Sum IV | [JavaScript](./src/0377.combination-sum-iv.377/solution.js) [TypeScript](./src/0377.combination-sum-iv.377/solution.ts) | Medium  |

| 0378 | Kth Smallest Element in a Sorted Matrix | [JavaScript](./src/0378.kth-smallest-element-in-a-sorted-matrix.378/solution.js) | Medium  |

| 0379 | Design Phone Directory | [JavaScript](./src/0379.design-phone-directory.379/solution.js) [TypeScript](./src/0379.design-phone-directory.379/solution.ts) | Medium  |

| 0380 | Insert Delete GetRandom O(1) | [JavaScript](./src/0380.insert-delete-getrandom-o1.380/solution.js) | Medium  |

| 0381 | Insert Delete GetRandom O(1) - Duplicates allowed | [JavaScript](./src/0381.insert-delete-getrandom-o1-duplicates-allowed.381/solution.js) | Hard  |

| 0382 | Linked List Random Node | [JavaScript](./src/0382.linked-list-random-node.382/solution.js) | Medium  |

| 0383 | Ransom Note | [Java](./src/0383.ransom-note.383/solution.java) [JavaScript](./src/0383.ransom-note.383/solution.js) [TypeScript](./src/0383.ransom-note.383/solution.ts) | Easy  |

| 0384 | Shuffle an Array | [Java](./src/0384.shuffle-an-array.384/solution.java) [JavaScript](./src/0384.shuffle-an-array.384/solution.js) [TypeScript](./src/0384.shuffle-an-array.384/solution.ts) | Medium  |

| 0385 | Mini Parser | [JavaScript](./src/0385.mini-parser.385/solution.js) | Medium  |

| 0386 | Lexicographical Numbers | [JavaScript](./src/0386.lexicographical-numbers.386/solution.js) [TypeScript](./src/0386.lexicographical-numbers.386/solution.ts) | Medium  |

| 0387 | First Unique Character in a String | [Java](./src/0387.first-unique-character-in-a-string.387/solution.java) [JavaScript](./src/0387.first-unique-character-in-a-string.387/solution.js) [TypeScript](./src/0387.first-unique-character-in-a-string.387/solution.ts) | Easy  |

| 0388 | Longest Absolute File Path | [JavaScript](./src/0388.longest-absolute-file-path.388/solution.js) | Medium  |

| 0389 | Find the Difference | [Java](./src/0389.find-the-difference.389/solution.java) [JavaScript](./src/0389.find-the-difference.389/solution.js) [TypeScript](./src/0389.find-the-difference.389/solution.ts) | Easy  |

| 0390 | Elimination Game |  | Medium  |

| 0391 | Perfect Rectangle |  | Hard  |

| 0392 | Is Subsequence | [Java](./src/0392.is-subsequence.392/solution.java) [JavaScript](./src/0392.is-subsequence.392/solution.js) [TypeScript](./src/0392.is-subsequence.392/solution.ts) | Easy  |

| 0393 | UTF-8 Validation | [JavaScript](./src/0393.utf-8-validation.393/solution.js) | Medium  |

| 0394 | Decode String | [JavaScript](./src/0394.decode-string.394/solution.js) | Medium  |

| 0395 | Longest Substring with At Least K Repeating Characters | [JavaScript](./src/0395.longest-substring-with-at-least-k-repeating-characters.395/solution.js) | Medium  |

| 0396 | Rotate Function | [JavaScript](./src/0396.rotate-function.396/solution.js) | Medium  |

| 0397 | Integer Replacement | [JavaScript](./src/0397.integer-replacement.397/solution.js) | Medium  |

| 0398 | Random Pick Index | [JavaScript](./src/0398.random-pick-index.398/solution.js) | Medium  |

| 0399 | Evaluate Division | [JavaScript](./src/0399.evaluate-division.399/solution.js) [TypeScript](./src/0399.evaluate-division.399/solution.ts) | Medium  |

| 0400 | Nth Digit | [JavaScript](./src/0400.nth-digit.400/solution.js) | Medium  |

| 0401 | Binary Watch | [JavaScript](./src/0401.binary-watch.401/solution.js) [TypeScript](./src/0401.binary-watch.401/solution.ts) | Easy  |

| 0402 | Remove K Digits | [TypeScript](./src/0402.remove-k-digits.402/solution.ts) | Medium  |

| 0403 | Frog Jump | [JavaScript](./src/0403.frog-jump.403/solution.js) | Hard  |

| 0404 | Sum of Left Leaves | [Java](./src/0404.sum-of-left-leaves.404/solution.java) [JavaScript](./src/0404.sum-of-left-leaves.404/solution.js) [TypeScript](./src/0404.sum-of-left-leaves.404/solution.ts) | Easy  |

| 0405 | Convert a Number to Hexadecimal | [Java](./src/0405.convert-a-number-to-hexadecimal.405/solution.java) [JavaScript](./src/0405.convert-a-number-to-hexadecimal.405/solution.js) [TypeScript](./src/0405.convert-a-number-to-hexadecimal.405/solution.ts) | Easy  |

| 0406 | Queue Reconstruction by Height |  | Medium  |

| 0407 | Trapping Rain Water II |  | Hard  |

| 0408 | Valid Word Abbreviation | [JavaScript](./src/0408.valid-word-abbreviation.408/solution.js) [TypeScript](./src/0408.valid-word-abbreviation.408/solution.ts) | Easy  |

| 0409 | Longest Palindrome | [Java](./src/0409.longest-palindrome.409/solution.java) [JavaScript](./src/0409.longest-palindrome.409/solution.js) [TypeScript](./src/0409.longest-palindrome.409/solution.ts) | Easy  |

| 0410 | Split Array Largest Sum | [JavaScript](./src/0410.split-array-largest-sum.410/solution.js) [TypeScript](./src/0410.split-array-largest-sum.410/solution.ts) | Hard  |

| 0411 | Minimum Unique Word Abbreviation |  | Hard  |

| 0412 | Fizz Buzz | [Java](./src/0412.fizz-buzz.412/solution.java) [JavaScript](./src/0412.fizz-buzz.412/solution.js) [TypeScript](./src/0412.fizz-buzz.412/solution.ts) | Easy  |

| 0413 | Arithmetic Slices | [JavaScript](./src/0413.arithmetic-slices.413/solution.js) | Medium  |

| 0414 | Third Maximum Number | [Java](./src/0414.third-maximum-number.414/solution.java) [JavaScript](./src/0414.third-maximum-number.414/solution.js) [TypeScript](./src/0414.third-maximum-number.414/solution.ts) | Easy  |

| 0415 | Add Strings | [Java](./src/0415.add-strings.415/solution.java) [JavaScript](./src/0415.add-strings.415/solution.js) [TypeScript](./src/0415.add-strings.415/solution.ts) | Easy  |

| 0416 | Partition Equal Subset Sum | [Java](./src/0416.partition-equal-subset-sum.416/solution.java) [JavaScript](./src/0416.partition-equal-subset-sum.416/solution.js) [TypeScript](./src/0416.partition-equal-subset-sum.416/solution.ts) | Medium  |

| 0417 | Pacific Atlantic Water Flow | [JavaScript](./src/0417.pacific-atlantic-water-flow.417/solution.js) | Medium  |

| 0418 | Sentence Screen Fitting |  | Medium  |

| 0419 | Battleships in a Board | [JavaScript](./src/0419.battleships-in-a-board.419/solution.js) | Medium  |

| 0420 | Strong Password Checker |  | Hard  |

| 0421 | Maximum XOR of Two Numbers in an Array | [JavaScript](./src/0421.maximum-xor-of-two-numbers-in-an-array.421/solution.js) | Medium  |

| 0422 | Valid Word Square | [JavaScript](./src/0422.valid-word-square.422/solution.js) | Easy  |

| 0423 | Reconstruct Original Digits from English | [JavaScript](./src/0423.reconstruct-original-digits-from-english.423/solution.js) | Medium  |

| 0424 | Longest Repeating Character Replacement |  | Medium  |

| 0425 | Word Squares |  | Hard  |

| 0426 | Convert Binary Search Tree to Sorted Doubly Linked List | [JavaScript](./src/0426.convert-binary-search-tree-to-sorted-doubly-linked-list.758/solution.js) | Medium  |

| 0427 | Construct Quad Tree | [JavaScript](./src/0427.construct-quad-tree.772/solution.js) | Medium  |

| 0428 | Serialize and Deserialize N-ary Tree | [JavaScript](./src/0428.serialize-and-deserialize-n-ary-tree.765/solution.js) | Hard  |

| 0429 | N-ary Tree Level Order Traversal | [Java](./src/0429.n-ary-tree-level-order-traversal.764/solution.java) [JavaScript](./src/0429.n-ary-tree-level-order-traversal.764/solution.js) [TypeScript](./src/0429.n-ary-tree-level-order-traversal.764/solution.ts) | Medium  |

| 0430 | Flatten a Multilevel Doubly Linked List | [JavaScript](./src/0430.flatten-a-multilevel-doubly-linked-list.766/solution.js) | Medium  |

| 0431 | Encode N-ary Tree to Binary Tree | [JavaScript](./src/0431.encode-n-ary-tree-to-binary-tree.771/solution.js) [TypeScript](./src/0431.encode-n-ary-tree-to-binary-tree.771/solution.ts) | Hard  |

| 0432 | All O`one Data Structure | [JavaScript](./src/0432.all-oone-data-structure.432/solution.js) | Hard  |

| 0433 | Minimum Genetic Mutation | [JavaScript](./src/0433.minimum-genetic-mutation.433/solution.js) | Medium  |

| 0434 | Number of Segments in a String | [Java](./src/0434.number-of-segments-in-a-string.434/solution.java) [JavaScript](./src/0434.number-of-segments-in-a-string.434/solution.js) [TypeScript](./src/0434.number-of-segments-in-a-string.434/solution.ts) | Easy  |

| 0435 | Non-overlapping Intervals | [JavaScript](./src/0435.non-overlapping-intervals.435/solution.js) | Medium  |

| 0436 | Find Right Interval | [JavaScript](./src/0436.find-right-interval.436/solution.js) | Medium  |

| 0437 | Path Sum III | [JavaScript](./src/0437.path-sum-iii.437/solution.js) [TypeScript](./src/0437.path-sum-iii.437/solution.ts) | Medium  |

| 0438 | Find All Anagrams in a String | [JavaScript](./src/0438.find-all-anagrams-in-a-string.438/solution.js) [TypeScript](./src/0438.find-all-anagrams-in-a-string.438/solution.ts) | Medium  |

| 0439 | Ternary Expression Parser |  | Medium  |

| 0440 | K-th Smallest in Lexicographical Order |  | Hard  |

| 0441 | Arranging Coins | [Java](./src/0441.arranging-coins.441/solution.java) [JavaScript](./src/0441.arranging-coins.441/solution.js) [TypeScript](./src/0441.arranging-coins.441/solution.ts) | Easy  |

| 0442 | Find All Duplicates in an Array | [JavaScript](./src/0442.find-all-duplicates-in-an-array.442/solution.js) [TypeScript](./src/0442.find-all-duplicates-in-an-array.442/solution.ts) | Medium  |

| 0443 | String Compression | [Java](./src/0443.string-compression.443/solution.java) [JavaScript](./src/0443.string-compression.443/solution.js) | Medium  |

| 0444 | Sequence Reconstruction |  | Medium  |

| 0445 | Add Two Numbers II | [JavaScript](./src/0445.add-two-numbers-ii.445/solution.js) [TypeScript](./src/0445.add-two-numbers-ii.445/solution.ts) | Medium  |

| 0446 | Arithmetic Slices II - Subsequence | [JavaScript](./src/0446.arithmetic-slices-ii-subsequence.446/solution.js) | Hard  |

| 0447 | Number of Boomerangs | [JavaScript](./src/0447.number-of-boomerangs.447/solution.js) | Medium  |

| 0448 | Find All Numbers Disappeared in an Array | [JavaScript](./src/0448.find-all-numbers-disappeared-in-an-array.448/solution.js) [TypeScript](./src/0448.find-all-numbers-disappeared-in-an-array.448/solution.ts) | Easy  |

| 0449 | Serialize and Deserialize BST | [JavaScript](./src/0449.serialize-and-deserialize-bst.449/solution.js) [TypeScript](./src/0449.serialize-and-deserialize-bst.449/solution.ts) | Medium  |

| 0450 | Delete Node in a BST | [JavaScript](./src/0450.delete-node-in-a-bst.450/solution.js) [TypeScript](./src/0450.delete-node-in-a-bst.450/solution.ts) | Medium  |

| 0451 | Sort Characters By Frequency | [JavaScript](./src/0451.sort-characters-by-frequency.451/solution.js) [TypeScript](./src/0451.sort-characters-by-frequency.451/solution.ts) | Medium  |

| 0452 | Minimum Number of Arrows to Burst Balloons |  | Medium  |

| 0453 | Minimum Moves to Equal Array Elements |  | Medium  |

| 0454 | 4Sum II | [JavaScript](./src/0454.4sum-ii.454/solution.js) | Medium  |

| 0455 | Assign Cookies | [JavaScript](./src/0455.assign-cookies.455/solution.js) [TypeScript](./src/0455.assign-cookies.455/solution.ts) | Easy  |

| 0456 | 132 Pattern | [JavaScript](./src/0456.132-pattern.456/solution.js) | Medium  |

| 0457 | Circular Array Loop |  | Medium  |

| 0458 | Poor Pigs |  | Hard  |

| 0459 | Repeated Substring Pattern | [JavaScript](./src/0459.repeated-substring-pattern.459/solution.js) [TypeScript](./src/0459.repeated-substring-pattern.459/solution.ts) | Easy  |

| 0460 | LFU Cache | [JavaScript](./src/0460.lfu-cache.460/solution.js) | Hard  |

| 0461 | Hamming Distance | [Java](./src/0461.hamming-distance.461/solution.java) [JavaScript](./src/0461.hamming-distance.461/solution.js) [TypeScript](./src/0461.hamming-distance.461/solution.ts) | Easy  |

| 0462 | Minimum Moves to Equal Array Elements II | [TypeScript](./src/0462.minimum-moves-to-equal-array-elements-ii.462/solution.ts) | Medium  |

| 0463 | Island Perimeter | [JavaScript](./src/0463.island-perimeter.463/solution.js) [TypeScript](./src/0463.island-perimeter.463/solution.ts) | Easy  |

| 0464 | Can I Win |  | Medium  |

| 0465 | Optimal Account Balancing |  | Hard  |

| 0466 | Count The Repetitions |  | Hard  |

| 0467 | Unique Substrings in Wraparound String | [TypeScript](./src/0467.unique-substrings-in-wraparound-string.467/solution.ts) | Medium  |

| 0468 | Validate IP Address | [JavaScript](./src/0468.validate-ip-address.468/solution.js) | Medium  |

| 0469 | Convex Polygon |  | Medium  |

| 0470 | Implement Rand10() Using Rand7() | [Java](./src/0470.implement-rand10-using-rand7.903/solution.java) [JavaScript](./src/0470.implement-rand10-using-rand7.903/solution.js) [TypeScript](./src/0470.implement-rand10-using-rand7.903/solution.ts) | Medium  |

| 0471 | Encode String with Shortest Length |  | Hard  |

| 0472 | Concatenated Words |  | Hard  |

| 0473 | Matchsticks to Square | [JavaScript](./src/0473.matchsticks-to-square.473/solution.js) | Medium  |

| 0474 | Ones and Zeroes | [JavaScript](./src/0474.ones-and-zeroes.474/solution.js) | Medium  |

| 0475 | Heaters | [JavaScript](./src/0475.heaters.475/solution.js) | Medium  |

| 0476 | Number Complement | [Java](./src/0476.number-complement.476/solution.java) [JavaScript](./src/0476.number-complement.476/solution.js) [TypeScript](./src/0476.number-complement.476/solution.ts) | Easy  |

| 0477 | Total Hamming Distance | [JavaScript](./src/0477.total-hamming-distance.477/solution.js) | Medium  |

| 0478 | Generate Random Point in a Circle | [JavaScript](./src/0478.generate-random-point-in-a-circle.915/solution.js) [TypeScript](./src/0478.generate-random-point-in-a-circle.915/solution.ts) | Medium  |

| 0479 | Largest Palindrome Product | [JavaScript](./src/0479.largest-palindrome-product.479/solution.js) [TypeScript](./src/0479.largest-palindrome-product.479/solution.ts) | Hard  |

| 0480 | Sliding Window Median | [JavaScript](./src/0480.sliding-window-median.480/solution.js) | Hard  |

| 0481 | Magical String | [TypeScript](./src/0481.magical-string.481/solution.ts) | Medium  |

| 0482 | License Key Formatting | [JavaScript](./src/0482.license-key-formatting.482/solution.js) [TypeScript](./src/0482.license-key-formatting.482/solution.ts) | Easy  |

| 0483 | Smallest Good Base |  | Hard  |

| 0484 | Find Permutation |  | Medium  |

| 0485 | Max Consecutive Ones | [Java](./src/0485.max-consecutive-ones.485/solution.java) [JavaScript](./src/0485.max-consecutive-ones.485/solution.js) [TypeScript](./src/0485.max-consecutive-ones.485/solution.ts) | Easy  |

| 0486 | Predict the Winner | [JavaScript](./src/0486.predict-the-winner.486/solution.js) | Medium  |

| 0487 | Max Consecutive Ones II | [JavaScript](./src/0487.max-consecutive-ones-ii.487/solution.js) | Medium  |

| 0488 | Zuma Game |  | Hard  |

| 0489 | Robot Room Cleaner |  | Hard  |

| 0490 | The Maze |  | Medium  |

| 0491 | Non-decreasing Subsequences | [JavaScript](./src/0491.non-decreasing-subsequences.491/solution.js) | Medium  |

| 0492 | Construct the Rectangle | [JavaScript](./src/0492.construct-the-rectangle.492/solution.js) [TypeScript](./src/0492.construct-the-rectangle.492/solution.ts) | Easy  |

| 0493 | Reverse Pairs | [JavaScript](./src/0493.reverse-pairs.493/solution.js) | Hard  |

| 0494 | Target Sum | [JavaScript](./src/0494.target-sum.494/solution.js) | Medium  |

| 0495 | Teemo Attacking | [JavaScript](./src/0495.teemo-attacking.495/solution.js) [TypeScript](./src/0495.teemo-attacking.495/solution.ts) | Easy  |

| 0496 | Next Greater Element I | [JavaScript](./src/0496.next-greater-element-i.496/solution.js) [TypeScript](./src/0496.next-greater-element-i.496/solution.ts) | Easy  |

| 0497 | Random Point in Non-overlapping Rectangles | [JavaScript](./src/0497.random-point-in-non-overlapping-rectangles.914/solution.js) | Medium  |

| 0498 | Diagonal Traverse | [JavaScript](./src/0498.diagonal-traverse.498/solution.js) | Medium  |

| 0499 | The Maze III |  | Hard  |

| 0500 | Keyboard Row | [Java](./src/0500.keyboard-row.500/solution.java) [JavaScript](./src/0500.keyboard-row.500/solution.js) [TypeScript](./src/0500.keyboard-row.500/solution.ts) | Easy  |

| 0501 | Find Mode in Binary Search Tree | [JavaScript](./src/0501.find-mode-in-binary-search-tree.501/solution.js) [TypeScript](./src/0501.find-mode-in-binary-search-tree.501/solution.ts) | Easy  |

| 0502 | IPO | [TypeScript](./src/0502.ipo.502/solution.ts) | Hard  |

| 0503 | Next Greater Element II | [JavaScript](./src/0503.next-greater-element-ii.503/solution.js) [TypeScript](./src/0503.next-greater-element-ii.503/solution.ts) | Medium  |

| 0504 | Base 7 | [Java](./src/0504.base-7.504/solution.java) [JavaScript](./src/0504.base-7.504/solution.js) [TypeScript](./src/0504.base-7.504/solution.ts) | Easy  |

| 0505 | The Maze II |  | Medium  |

| 0506 | Relative Ranks | [JavaScript](./src/0506.relative-ranks.506/solution.js) [TypeScript](./src/0506.relative-ranks.506/solution.ts) | Easy  |

| 0507 | Perfect Number | [Java](./src/0507.perfect-number.507/solution.java) [JavaScript](./src/0507.perfect-number.507/solution.js) [TypeScript](./src/0507.perfect-number.507/solution.ts) | Easy  |

| 0508 | Most Frequent Subtree Sum | [JavaScript](./src/0508.most-frequent-subtree-sum.508/solution.js) [TypeScript](./src/0508.most-frequent-subtree-sum.508/solution.ts) | Medium  |

| 0509 | Fibonacci Number | [Java](./src/0509.fibonacci-number.1013/solution.java) [JavaScript](./src/0509.fibonacci-number.1013/solution.js) [TypeScript](./src/0509.fibonacci-number.1013/solution.ts) | Easy  |

| 0510 | Inorder Successor in BST II | [JavaScript](./src/0510.inorder-successor-in-bst-ii.509/solution.js) [TypeScript](./src/0510.inorder-successor-in-bst-ii.509/solution.ts) | Medium  |

| 0511 | Game Play Analysis I |  | Easy  |

| 0512 | Game Play Analysis II |  | Easy  |

| 0513 | Find Bottom Left Tree Value | [JavaScript](./src/0513.find-bottom-left-tree-value.513/solution.js) [TypeScript](./src/0513.find-bottom-left-tree-value.513/solution.ts) | Medium  |

| 0514 | Freedom Trail |  | Hard  |

| 0515 | Find Largest Value in Each Tree Row | [Java](./src/0515.find-largest-value-in-each-tree-row.515/solution.java) [JavaScript](./src/0515.find-largest-value-in-each-tree-row.515/solution.js) [TypeScript](./src/0515.find-largest-value-in-each-tree-row.515/solution.ts) | Medium  |

| 0516 | Longest Palindromic Subsequence | [TypeScript](./src/0516.longest-palindromic-subsequence.516/solution.ts) | Medium  |

| 0517 | Super Washing Machines |  | Hard  |

| 0518 | Coin Change II | [JavaScript](./src/0518.coin-change-ii.518/solution.js) [TypeScript](./src/0518.coin-change-ii.518/solution.ts) | Medium  |

| 0519 | Random Flip Matrix | [JavaScript](./src/0519.random-flip-matrix.913/solution.js) | Medium  |

| 0520 | Detect Capital | [Java](./src/0520.detect-capital.520/solution.java) [JavaScript](./src/0520.detect-capital.520/solution.js) [TypeScript](./src/0520.detect-capital.520/solution.ts) | Easy  |

| 0521 | Longest Uncommon Subsequence I | [Java](./src/0521.longest-uncommon-subsequence-i.521/solution.java) [JavaScript](./src/0521.longest-uncommon-subsequence-i.521/solution.js) [TypeScript](./src/0521.longest-uncommon-subsequence-i.521/solution.ts) | Easy  |

| 0522 | Longest Uncommon Subsequence II | [JavaScript](./src/0522.longest-uncommon-subsequence-ii.522/solution.js) | Medium  |

| 0523 | Continuous Subarray Sum | [JavaScript](./src/0523.continuous-subarray-sum.523/solution.js) | Medium  |

| 0524 | Longest Word in Dictionary through Deleting | [JavaScript](./src/0524.longest-word-in-dictionary-through-deleting.524/solution.js) | Medium  |

| 0525 | Contiguous Array | [JavaScript](./src/0525.contiguous-array.525/solution.js) | Medium  |

| 0526 | Beautiful Arrangement | [JavaScript](./src/0526.beautiful-arrangement.526/solution.js) | Medium  |

| 0527 | Word Abbreviation |  | Hard  |

| 0528 | Random Pick with Weight | [JavaScript](./src/0528.random-pick-with-weight.912/solution.js) | Medium  |

| 0529 | Minesweeper | [JavaScript](./src/0529.minesweeper.529/solution.js) | Medium  |

| 0530 | Minimum Absolute Difference in BST | [Java](./src/0530.minimum-absolute-difference-in-bst.530/solution.java) [JavaScript](./src/0530.minimum-absolute-difference-in-bst.530/solution.js) [TypeScript](./src/0530.minimum-absolute-difference-in-bst.530/solution.ts) | Easy  |

| 0531 | Lonely Pixel I | [JavaScript](./src/0531.lonely-pixel-i.531/solution.js) | Medium  |

| 0532 | K-diff Pairs in an Array | [JavaScript](./src/0532.k-diff-pairs-in-an-array.532/solution.js) | Medium  |

| 0533 | Lonely Pixel II |  | Medium  |

| 0534 | Game Play Analysis III |  | Medium  |

| 0535 | Encode and Decode TinyURL | [JavaScript](./src/0535.encode-and-decode-tinyurl.535/solution.js) [TypeScript](./src/0535.encode-and-decode-tinyurl.535/solution.ts) | Medium  |

| 0536 | Construct Binary Tree from String | [JavaScript](./src/0536.construct-binary-tree-from-string.536/solution.js) | Medium  |

| 0537 | Complex Number Multiplication | [Java](./src/0537.complex-number-multiplication.537/solution.java) [JavaScript](./src/0537.complex-number-multiplication.537/solution.js) [TypeScript](./src/0537.complex-number-multiplication.537/solution.ts) | Medium  |

| 0538 | Convert BST to Greater Tree | [Java](./src/0538.convert-bst-to-greater-tree.538/solution.java) [JavaScript](./src/0538.convert-bst-to-greater-tree.538/solution.js) [TypeScript](./src/0538.convert-bst-to-greater-tree.538/solution.ts) | Medium  |

| 0539 | Minimum Time Difference | [Java](./src/0539.minimum-time-difference.539/solution.java) [JavaScript](./src/0539.minimum-time-difference.539/solution.js) [TypeScript](./src/0539.minimum-time-difference.539/solution.ts) | Medium  |

| 0540 | Single Element in a Sorted Array | [JavaScript](./src/0540.single-element-in-a-sorted-array.540/solution.js) [TypeScript](./src/0540.single-element-in-a-sorted-array.540/solution.ts) | Medium  |

| 0541 | Reverse String II | [Java](./src/0541.reverse-string-ii.541/solution.java) [JavaScript](./src/0541.reverse-string-ii.541/solution.js) [TypeScript](./src/0541.reverse-string-ii.541/solution.ts) | Easy  |

| 0542 | 01 Matrix | [JavaScript](./src/0542.01-matrix.542/solution.js) | Medium  |

| 0543 | Diameter of Binary Tree | [JavaScript](./src/0543.diameter-of-binary-tree.543/solution.js) [TypeScript](./src/0543.diameter-of-binary-tree.543/solution.ts) | Easy  |

| 0544 | Output Contest Matches |  | Medium  |

| 0545 | Boundary of Binary Tree |  | Medium  |

| 0546 | Remove Boxes |  | Hard  |

| 0547 | Number of Provinces | [JavaScript](./src/0547.number-of-provinces.547/solution.js) [TypeScript](./src/0547.number-of-provinces.547/solution.ts) | Medium  |

| 0548 | Split Array with Equal Sum |  | Hard  |

| 0549 | Binary Tree Longest Consecutive Sequence II | [JavaScript](./src/0549.binary-tree-longest-consecutive-sequence-ii.549/solution.js) | Medium  |

| 0550 | Game Play Analysis IV |  | Medium  |

| 0551 | Student Attendance Record I | [JavaScript](./src/0551.student-attendance-record-i.551/solution.js) [TypeScript](./src/0551.student-attendance-record-i.551/solution.ts) | Easy  |

| 0552 | Student Attendance Record II | [JavaScript](./src/0552.student-attendance-record-ii.552/solution.js) | Hard  |

| 0553 | Optimal Division |  | Medium  |

| 0554 | Brick Wall | [JavaScript](./src/0554.brick-wall.554/solution.js) | Medium  |

| 0555 | Split Concatenated Strings |  | Medium  |

| 0556 | Next Greater Element III | [JavaScript](./src/0556.next-greater-element-iii.556/solution.js) | Medium  |

| 0557 | Reverse Words in a String III | [Java](./src/0557.reverse-words-in-a-string-iii.557/solution.java) [JavaScript](./src/0557.reverse-words-in-a-string-iii.557/solution.js) [TypeScript](./src/0557.reverse-words-in-a-string-iii.557/solution.ts) | Easy  |

| 0558 | Logical OR of Two Binary Grids Represented as Quad-Trees | [JavaScript](./src/0558.logical-or-of-two-binary-grids-represented-as-quad-trees.773/solution.js) | Medium  |

| 0559 | Maximum Depth of N-ary Tree | [Java](./src/0559.maximum-depth-of-n-ary-tree.774/solution.java) [JavaScript](./src/0559.maximum-depth-of-n-ary-tree.774/solution.js) [TypeScript](./src/0559.maximum-depth-of-n-ary-tree.774/solution.ts) | Easy  |

| 0560 | Subarray Sum Equals K | [JavaScript](./src/0560.subarray-sum-equals-k.560/solution.js) [TypeScript](./src/0560.subarray-sum-equals-k.560/solution.ts) | Medium  |

| 0561 | Array Partition | [Java](./src/0561.array-partition.561/solution.java) [JavaScript](./src/0561.array-partition.561/solution.js) [TypeScript](./src/0561.array-partition.561/solution.ts) | Easy  |

| 0562 | Longest Line of Consecutive One in Matrix |  | Medium  |

| 0563 | Binary Tree Tilt | [JavaScript](./src/0563.binary-tree-tilt.563/solution.js) [TypeScript](./src/0563.binary-tree-tilt.563/solution.ts) | Easy  |

| 0564 | Find the Closest Palindrome |  | Hard  |

| 0565 | Array Nesting | [JavaScript](./src/0565.array-nesting.565/solution.js) | Medium  |

| 0566 | Reshape the Matrix | [Java](./src/0566.reshape-the-matrix.566/solution.java) [JavaScript](./src/0566.reshape-the-matrix.566/solution.js) [TypeScript](./src/0566.reshape-the-matrix.566/solution.ts) | Easy  |

| 0567 | Permutation in String | [JavaScript](./src/0567.permutation-in-string.567/solution.js) [TypeScript](./src/0567.permutation-in-string.567/solution.ts) | Medium  |

| 0568 | Maximum Vacation Days |  | Hard  |

| 0569 | Median Employee Salary |  | Hard  |

| 0570 | Managers with at Least 5 Direct Reports |  | Medium  |

| 0571 | Find Median Given Frequency of Numbers |  | Hard  |

| 0572 | Subtree of Another Tree | [JavaScript](./src/0572.subtree-of-another-tree.572/solution.js) [TypeScript](./src/0572.subtree-of-another-tree.572/solution.ts) | Easy  |

| 0573 | Squirrel Simulation |  | Medium  |

| 0574 | Winning Candidate |  | Medium  |

| 0575 | Distribute Candies | [JavaScript](./src/0575.distribute-candies.575/solution.js) [TypeScript](./src/0575.distribute-candies.575/solution.ts) | Easy  |

| 0576 | Out of Boundary Paths | [JavaScript](./src/0576.out-of-boundary-paths.576/solution.js) | Medium  |

| 0577 | Employee Bonus |  | Easy  |

| 0578 | Get Highest Answer Rate Question |  | Medium  |

| 0579 | Find Cumulative Salary of an Employee |  | Hard  |

| 0580 | Count Student Number in Departments |  | Medium  |

| 0581 | Shortest Unsorted Continuous Subarray | [JavaScript](./src/0581.shortest-unsorted-continuous-subarray.581/solution.js) | Medium  |

| 0582 | Kill Process | [JavaScript](./src/0582.kill-process.582/solution.js) | Medium  |

| 0583 | Delete Operation for Two Strings | [JavaScript](./src/0583.delete-operation-for-two-strings.583/solution.js) | Medium  |

| 0584 | Find Customer Referee |  | Easy  |

| 0585 | Investments in 2016 |  | Medium  |

| 0586 | Customer Placing the Largest Number of Orders |  | Easy  |

| 0587 | Erect the Fence |  | Hard  |

| 0588 | Design In-Memory File System |  | Hard  |

| 0589 | N-ary Tree Preorder Traversal | [Java](./src/0589.n-ary-tree-preorder-traversal.775/solution.java) [JavaScript](./src/0589.n-ary-tree-preorder-traversal.775/solution.js) [TypeScript](./src/0589.n-ary-tree-preorder-traversal.775/solution.ts) | Easy  |

| 0590 | N-ary Tree Postorder Traversal | [Java](./src/0590.n-ary-tree-postorder-traversal.776/solution.java) [JavaScript](./src/0590.n-ary-tree-postorder-traversal.776/solution.js) [TypeScript](./src/0590.n-ary-tree-postorder-traversal.776/solution.ts) | Easy  |

| 0591 | Tag Validator |  | Hard  |

| 0592 | Fraction Addition and Subtraction | [JavaScript](./src/0592.fraction-addition-and-subtraction.592/solution.js) | Medium  |

| 0593 | Valid Square | [JavaScript](./src/0593.valid-square.593/solution.js) [TypeScript](./src/0593.valid-square.593/solution.ts) | Medium  |

| 0594 | Longest Harmonious Subsequence | [JavaScript](./src/0594.longest-harmonious-subsequence.594/solution.js) [TypeScript](./src/0594.longest-harmonious-subsequence.594/solution.ts) | Easy  |

| 0595 | Big Countries | [Mysql](./src/0595.big-countries.595/solution.sql) | Easy  |

| 0596 | Classes More Than 5 Students | [Mysql](./src/0596.classes-more-than-5-students.596/solution.sql) | Easy  |

| 0597 | Friend Requests I: Overall Acceptance Rate |  | Easy  |

| 0598 | Range Addition II | [JavaScript](./src/0598.range-addition-ii.598/solution.js) [TypeScript](./src/0598.range-addition-ii.598/solution.ts) | Easy  |

| 0599 | Minimum Index Sum of Two Lists | [JavaScript](./src/0599.minimum-index-sum-of-two-lists.599/solution.js) [TypeScript](./src/0599.minimum-index-sum-of-two-lists.599/solution.ts) | Easy  |

| 0600 | Non-negative Integers without Consecutive Ones |  | Hard  |

| 0601 | Human Traffic of Stadium |  | Hard  |

| 0602 | Friend Requests II: Who Has the Most Friends |  | Medium  |

| 0603 | Consecutive Available Seats |  | Easy  |

| 0604 | Design Compressed String Iterator | [JavaScript](./src/0604.design-compressed-string-iterator.604/solution.js) [TypeScript](./src/0604.design-compressed-string-iterator.604/solution.ts) | Easy  |

| 0605 | Can Place Flowers | [JavaScript](./src/0605.can-place-flowers.605/solution.js) [TypeScript](./src/0605.can-place-flowers.605/solution.ts) | Easy  |

| 0606 | Construct String from Binary Tree | [JavaScript](./src/0606.construct-string-from-binary-tree.606/solution.js) [TypeScript](./src/0606.construct-string-from-binary-tree.606/solution.ts) | Medium  |

| 0607 | Sales Person |  | Easy  |

| 0608 | Tree Node |  | Medium  |

| 0609 | Find Duplicate File in System | [JavaScript](./src/0609.find-duplicate-file-in-system.609/solution.js) | Medium  |

| 0610 | Triangle Judgement |  | Easy  |

| 0611 | Valid Triangle Number | [JavaScript](./src/0611.valid-triangle-number.611/solution.js) | Medium  |

| 0612 | Shortest Distance in a Plane |  | Medium  |

| 0613 | Shortest Distance in a Line |  | Easy  |

| 0614 | Second Degree Follower |  | Medium  |

| 0615 | Average Salary: Departments VS Company |  | Hard  |

| 0616 | Add Bold Tag in String | [JavaScript](./src/0616.add-bold-tag-in-string.616/solution.js) | Medium  |

| 0617 | Merge Two Binary Trees | [Java](./src/0617.merge-two-binary-trees.617/solution.java) [JavaScript](./src/0617.merge-two-binary-trees.617/solution.js) [TypeScript](./src/0617.merge-two-binary-trees.617/solution.ts) | Easy  |

| 0618 | Students Report By Geography |  | Hard  |

| 0619 | Biggest Single Number |  | Easy  |

| 0620 | Not Boring Movies | [Mysql](./src/0620.not-boring-movies.620/solution.sql) | Easy  |

| 0621 | Task Scheduler |  | Medium  |

| 0622 | Design Circular Queue | [JavaScript](./src/0622.design-circular-queue.860/solution.js) | Medium  |

| 0623 | Add One Row to Tree | [JavaScript](./src/0623.add-one-row-to-tree.623/solution.js) [TypeScript](./src/0623.add-one-row-to-tree.623/solution.ts) | Medium  |

| 0624 | Maximum Distance in Arrays | [JavaScript](./src/0624.maximum-distance-in-arrays.624/solution.js) | Medium  |

| 0625 | Minimum Factorization |  | Medium  |

| 0626 | Exchange Seats | [Mysql](./src/0626.exchange-seats.626/solution.sql) | Medium  |

| 0627 | Swap Salary | [Mysql](./src/0627.swap-salary.627/solution.sql) | Easy  |

| 0628 | Maximum Product of Three Numbers | [Java](./src/0628.maximum-product-of-three-numbers.628/solution.java) [JavaScript](./src/0628.maximum-product-of-three-numbers.628/solution.js) [TypeScript](./src/0628.maximum-product-of-three-numbers.628/solution.ts) | Easy  |

| 0629 | K Inverse Pairs Array |  | Hard  |

| 0630 | Course Schedule III |  | Hard  |

| 0631 | Design Excel Sum Formula |  | Hard  |

| 0632 | Smallest Range Covering Elements from K Lists |  | Hard  |

| 0633 | Sum of Square Numbers | [JavaScript](./src/0633.sum-of-square-numbers.633/solution.js) [TypeScript](./src/0633.sum-of-square-numbers.633/solution.ts) | Medium  |

| 0634 | Find the Derangement of An Array |  | Medium  |

| 0635 | Design Log Storage System |  | Medium  |

| 0636 | Exclusive Time of Functions | [JavaScript](./src/0636.exclusive-time-of-functions.636/solution.js) | Medium  |

| 0637 | Average of Levels in Binary Tree | [Java](./src/0637.average-of-levels-in-binary-tree.637/solution.java) [JavaScript](./src/0637.average-of-levels-in-binary-tree.637/solution.js) [TypeScript](./src/0637.average-of-levels-in-binary-tree.637/solution.ts) | Easy  |

| 0638 | Shopping Offers |  | Medium  |

| 0639 | Decode Ways II | [TypeScript](./src/0639.decode-ways-ii.639/solution.ts) | Hard  |

| 0640 | Solve the Equation | [JavaScript](./src/0640.solve-the-equation.640/solution.js) | Medium  |

| 0641 | Design Circular Deque | [JavaScript](./src/0641.design-circular-deque.859/solution.js) | Medium  |

| 0642 | Design Search Autocomplete System |  | Hard  |

| 0643 | Maximum Average Subarray I | [JavaScript](./src/0643.maximum-average-subarray-i.643/solution.js) [TypeScript](./src/0643.maximum-average-subarray-i.643/solution.ts) | Easy  |

| 0644 | Maximum Average Subarray II |  | Hard  |

| 0645 | Set Mismatch | [JavaScript](./src/0645.set-mismatch.645/solution.js) [TypeScript](./src/0645.set-mismatch.645/solution.ts) | Easy  |

| 0646 | Maximum Length of Pair Chain | [JavaScript](./src/0646.maximum-length-of-pair-chain.646/solution.js) [TypeScript](./src/0646.maximum-length-of-pair-chain.646/solution.ts) | Medium  |

| 0647 | Palindromic Substrings | [JavaScript](./src/0647.palindromic-substrings.647/solution.js) | Medium  |

| 0648 | Replace Words | [JavaScript](./src/0648.replace-words.648/solution.js) | Medium  |

| 0649 | Dota2 Senate |  | Medium  |

| 0650 | 2 Keys Keyboard | [JavaScript](./src/0650.2-keys-keyboard.650/solution.js) | Medium  |

| 0651 | 4 Keys Keyboard |  | Medium  |

| 0652 | Find Duplicate Subtrees | [JavaScript](./src/0652.find-duplicate-subtrees.652/solution.js) | Medium  |

| 0653 | Two Sum IV - Input is a BST | [JavaScript](./src/0653.two-sum-iv-input-is-a-bst.653/solution.js) [TypeScript](./src/0653.two-sum-iv-input-is-a-bst.653/solution.ts) | Easy  |

| 0654 | Maximum Binary Tree | [JavaScript](./src/0654.maximum-binary-tree.654/solution.js) [TypeScript](./src/0654.maximum-binary-tree.654/solution.ts) | Medium  |

| 0655 | Print Binary Tree | [JavaScript](./src/0655.print-binary-tree.655/solution.js) [TypeScript](./src/0655.print-binary-tree.655/solution.ts) | Medium  |

| 0656 | Coin Path |  | Hard  |

| 0657 | Robot Return to Origin | [Java](./src/0657.robot-return-to-origin.657/solution.java) [JavaScript](./src/0657.robot-return-to-origin.657/solution.js) [TypeScript](./src/0657.robot-return-to-origin.657/solution.ts) | Easy  |

| 0658 | Find K Closest Elements | [JavaScript](./src/0658.find-k-closest-elements.658/solution.js) [TypeScript](./src/0658.find-k-closest-elements.658/solution.ts) | Medium  |

| 0659 | Split Array into Consecutive Subsequences |  | Medium  |

| 0660 | Remove 9 |  | Hard  |

| 0661 | Image Smoother | [Java](./src/0661.image-smoother.661/solution.java) [JavaScript](./src/0661.image-smoother.661/solution.js) [TypeScript](./src/0661.image-smoother.661/solution.ts) | Easy  |

| 0662 | Maximum Width of Binary Tree | [JavaScript](./src/0662.maximum-width-of-binary-tree.662/solution.js) [TypeScript](./src/0662.maximum-width-of-binary-tree.662/solution.ts) | Medium  |

| 0663 | Equal Tree Partition |  | Medium  |

| 0664 | Strange Printer |  | Hard  |

| 0665 | Non-decreasing Array | [JavaScript](./src/0665.non-decreasing-array.665/solution.js) [TypeScript](./src/0665.non-decreasing-array.665/solution.ts) | Medium  |

| 0666 | Path Sum IV | [JavaScript](./src/0666.path-sum-iv.666/solution.js) | Medium  |

| 0667 | Beautiful Arrangement II |  | Medium  |

| 0668 | Kth Smallest Number in Multiplication Table |  | Hard  |

| 0669 | Trim a Binary Search Tree | [Java](./src/0669.trim-a-binary-search-tree.669/solution.java) [JavaScript](./src/0669.trim-a-binary-search-tree.669/solution.js) [TypeScript](./src/0669.trim-a-binary-search-tree.669/solution.ts) | Medium  |

| 0670 | Maximum Swap | [JavaScript](./src/0670.maximum-swap.670/solution.js) | Medium  |

| 0671 | Second Minimum Node In a Binary Tree | [Java](./src/0671.second-minimum-node-in-a-binary-tree.671/solution.java) [JavaScript](./src/0671.second-minimum-node-in-a-binary-tree.671/solution.js) [TypeScript](./src/0671.second-minimum-node-in-a-binary-tree.671/solution.ts) | Easy  |

| 0672 | Bulb Switcher II |  | Medium  |

| 0673 | Number of Longest Increasing Subsequence | [JavaScript](./src/0673.number-of-longest-increasing-subsequence.673/solution.js) | Medium  |

| 0674 | Longest Continuous Increasing Subsequence | [Java](./src/0674.longest-continuous-increasing-subsequence.674/solution.java) [JavaScript](./src/0674.longest-continuous-increasing-subsequence.674/solution.js) [TypeScript](./src/0674.longest-continuous-increasing-subsequence.674/solution.ts) | Easy  |

| 0675 | Cut Off Trees for Golf Event |  | Hard  |

| 0676 | Implement Magic Dictionary | [JavaScript](./src/0676.implement-magic-dictionary.676/solution.js) | Medium  |

| 0677 | Map Sum Pairs | [JavaScript](./src/0677.map-sum-pairs.677/solution.js) | Medium  |

| 0678 | Valid Parenthesis String | [JavaScript](./src/0678.valid-parenthesis-string.678/solution.js) | Medium  |

| 0679 | 24 Game |  | Hard  |

| 0680 | Valid Palindrome II | [Java](./src/0680.valid-palindrome-ii.680/solution.java) [JavaScript](./src/0680.valid-palindrome-ii.680/solution.js) [TypeScript](./src/0680.valid-palindrome-ii.680/solution.ts) | Easy  |

| 0681 | Next Closest Time | [JavaScript](./src/0681.next-closest-time.681/solution.js) | Medium  |

| 0682 | Baseball Game | [Java](./src/0682.baseball-game.682/solution.java) [JavaScript](./src/0682.baseball-game.682/solution.js) [TypeScript](./src/0682.baseball-game.682/solution.ts) | Easy  |

| 0683 | K Empty Slots |  | Hard  |

| 0684 | Redundant Connection | [JavaScript](./src/0684.redundant-connection.684/solution.js) | Medium  |

| 0685 | Redundant Connection II |  | Hard  |

| 0686 | Repeated String Match | [JavaScript](./src/0686.repeated-string-match.686/solution.js) | Medium  |

| 0687 | Longest Univalue Path | [JavaScript](./src/0687.longest-univalue-path.687/solution.js) [TypeScript](./src/0687.longest-univalue-path.687/solution.ts) | Medium  |

| 0688 | Knight Probability in Chessboard |  | Medium  |

| 0689 | Maximum Sum of 3 Non-Overlapping Subarrays |  | Hard  |

| 0690 | Employee Importance | [JavaScript](./src/0690.employee-importance.690/solution.js) [Python3](./src/0690.employee-importance.690/solution.py) [TypeScript](./src/0690.employee-importance.690/solution.ts) | Medium  |

| 0691 | Stickers to Spell Word |  | Hard  |

| 0692 | Top K Frequent Words | [JavaScript](./src/0692.top-k-frequent-words.692/solution.js) | Medium  |

| 0693 | Binary Number with Alternating Bits | [Java](./src/0693.binary-number-with-alternating-bits.693/solution.java) [JavaScript](./src/0693.binary-number-with-alternating-bits.693/solution.js) [TypeScript](./src/0693.binary-number-with-alternating-bits.693/solution.ts) | Easy  |

| 0694 | Number of Distinct Islands |  | Medium  |

| 0695 | Max Area of Island | [Java](./src/0695.max-area-of-island.695/solution.java) [JavaScript](./src/0695.max-area-of-island.695/solution.js) [TypeScript](./src/0695.max-area-of-island.695/solution.ts) | Medium  |

| 0696 | Count Binary Substrings | [JavaScript](./src/0696.count-binary-substrings.696/solution.js) [TypeScript](./src/0696.count-binary-substrings.696/solution.ts) | Easy  |

| 0697 | Degree of an Array | [JavaScript](./src/0697.degree-of-an-array.697/solution.js) [TypeScript](./src/0697.degree-of-an-array.697/solution.ts) | Easy  |

| 0698 | Partition to K Equal Sum Subsets |  | Medium  |

| 0699 | Falling Squares | [TypeScript](./src/0699.falling-squares.699/solution.ts) | Hard  |

| 0700 | Search in a Binary Search Tree | [Go](./src/0700.search-in-a-binary-search-tree.783/solution.go) [Java](./src/0700.search-in-a-binary-search-tree.783/solution.java) [JavaScript](./src/0700.search-in-a-binary-search-tree.783/solution.js) [TypeScript](./src/0700.search-in-a-binary-search-tree.783/solution.ts) | Easy  |

| 0701 | Insert into a Binary Search Tree | [Java](./src/0701.insert-into-a-binary-search-tree.784/solution.java) [JavaScript](./src/0701.insert-into-a-binary-search-tree.784/solution.js) [TypeScript](./src/0701.insert-into-a-binary-search-tree.784/solution.ts) | Medium  |

| 0702 | Search in a Sorted Array of Unknown Size | [JavaScript](./src/0702.search-in-a-sorted-array-of-unknown-size.786/solution.js) [TypeScript](./src/0702.search-in-a-sorted-array-of-unknown-size.786/solution.ts) | Medium  |

| 0703 | Kth Largest Element in a Stream | [JavaScript](./src/0703.kth-largest-element-in-a-stream.789/solution.js) [TypeScript](./src/0703.kth-largest-element-in-a-stream.789/solution.ts) | Easy  |

| 0704 | Binary Search | [Java](./src/0704.binary-search.792/solution.java) [JavaScript](./src/0704.binary-search.792/solution.js) [TypeScript](./src/0704.binary-search.792/solution.ts) | Easy  |

| 0705 | Design HashSet | [JavaScript](./src/0705.design-hashset.816/solution.js) | Easy  |

| 0706 | Design HashMap | [JavaScript](./src/0706.design-hashmap.817/solution.js) | Easy  |

| 0707 | Design Linked List | [JavaScript](./src/0707.design-linked-list.838/solution.js) [TypeScript](./src/0707.design-linked-list.838/solution.ts) | Medium  |

| 0708 | Insert into a Sorted Circular Linked List | [JavaScript](./src/0708.insert-into-a-sorted-circular-linked-list.850/solution.js) | Medium  |

| 0709 | To Lower Case | [Java](./src/0709.to-lower-case.742/solution.java) [JavaScript](./src/0709.to-lower-case.742/solution.js) [TypeScript](./src/0709.to-lower-case.742/solution.ts) | Easy  |

| 0710 | Random Pick with Blacklist | [JavaScript](./src/0710.random-pick-with-blacklist.894/solution.js) | Hard  |

| 0711 | Number of Distinct Islands II |  | Hard  |

| 0712 | Minimum ASCII Delete Sum for Two Strings | [JavaScript](./src/0712.minimum-ascii-delete-sum-for-two-strings.712/solution.js) | Medium  |

| 0713 | Subarray Product Less Than K | [JavaScript](./src/0713.subarray-product-less-than-k.713/solution.js) | Medium  |

| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [JavaScript](./src/0714.best-time-to-buy-and-sell-stock-with-transaction-fee.714/solution.js) | Medium  |

| 0715 | Range Module | [Ja
ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Awesome

https://github.com/jiangshanmeta/meta

Awesome Lists containing this project

README
