https://github.com/jacoblincool/leetcode-solutions
My LeetCode Solutions. Use leetcode-dump to automatically sync and build.
https://github.com/jacoblincool/leetcode-solutions
leetcode
Last synced: 7 months ago
JSON representation
My LeetCode Solutions. Use leetcode-dump to automatically sync and build.
- Host: GitHub
- URL: https://github.com/jacoblincool/leetcode-solutions
- Owner: JacobLinCool
- Created: 2022-03-13T09:39:01.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2024-04-10T00:44:22.000Z (over 1 year ago)
- Last Synced: 2025-01-24T23:41:25.822Z (9 months ago)
- Topics: leetcode
- Language: JavaScript
- Homepage: https://leetcode.jacoblin.cool
- Size: 133 MB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 3
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# JacobLinCool's Solutions
[](https://github.com/JacobLinCool/LeetCode-Stats-Card)
[GitHub Repository](https://github.com/JacobLinCool/LeetCode-Solutions)
Built by [LeetCode Dump](https://github.com/JacobLinCool/LeetCode-Dump)
## My Solutions
| Problem | Difficulty | Tags | Solution |
| ------- | ---------- | ---- | -------- |
| [1. Two Sum](./1.%20Two%20Sum) [🔗](https://leetcode.com/problems/two-sum/) | Easy | `Array`, `Hash Table` | [c](./1.%20Two%20Sum/two-sum.c) \| [golang](./1.%20Two%20Sum/two-sum.go) \| [javascript](./1.%20Two%20Sum/two-sum.js) |
| [2. Add Two Numbers](./2.%20Add%20Two%20Numbers) [🔗](https://leetcode.com/problems/add-two-numbers/) | Medium | `Linked List`, `Math`, `Recursion` | [golang](./2.%20Add%20Two%20Numbers/add-two-numbers.go) \| [javascript](./2.%20Add%20Two%20Numbers/add-two-numbers.js) \| [typescript](./2.%20Add%20Two%20Numbers/add-two-numbers.ts) |
| [3. Longest Substring Without Repeating Characters](./3.%20Longest%20Substring%20Without%20Repeating%20Characters) [🔗](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | `Hash Table`, `String`, `Sliding Window` | [golang](./3.%20Longest%20Substring%20Without%20Repeating%20Characters/longest-substring-without-repeating-characters.go) \| [javascript](./3.%20Longest%20Substring%20Without%20Repeating%20Characters/longest-substring-without-repeating-characters.js) |
| [4. Median of Two Sorted Arrays](./4.%20Median%20of%20Two%20Sorted%20Arrays) [🔗](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | `Array`, `Binary Search`, `Divide and Conquer` | [golang](./4.%20Median%20of%20Two%20Sorted%20Arrays/median-of-two-sorted-arrays.go) \| [javascript](./4.%20Median%20of%20Two%20Sorted%20Arrays/median-of-two-sorted-arrays.js) |
| [8. String to Integer (atoi)](./8.%20String%20to%20Integer%20(atoi)) [🔗](https://leetcode.com/problems/string-to-integer-atoi/) | Medium | `String` | [c](./8.%20String%20to%20Integer%20(atoi)/string-to-integer-atoi.c) |
| [9. Palindrome Number](./9.%20Palindrome%20Number) [🔗](https://leetcode.com/problems/palindrome-number/) | Easy | `Math` | [c](./9.%20Palindrome%20Number/palindrome-number.c) |
| [13. Roman to Integer](./13.%20Roman%20to%20Integer) [🔗](https://leetcode.com/problems/roman-to-integer/) | Easy | `Hash Table`, `Math`, `String` | [c](./13.%20Roman%20to%20Integer/roman-to-integer.c) \| [typescript](./13.%20Roman%20to%20Integer/roman-to-integer.ts) |
| [14. Longest Common Prefix](./14.%20Longest%20Common%20Prefix) [🔗](https://leetcode.com/problems/longest-common-prefix/) | Easy | `String` | [c](./14.%20Longest%20Common%20Prefix/longest-common-prefix.c) |
| [15. 3Sum](./15.%203Sum) [🔗](https://leetcode.com/problems/3sum/) | Medium | `Array`, `Two Pointers`, `Sorting` | [javascript](./15.%203Sum/3sum.js) |
| [16. 3Sum Closest](./16.%203Sum%20Closest) [🔗](https://leetcode.com/problems/3sum-closest/) | Medium | `Array`, `Two Pointers`, `Sorting` | [javascript](./16.%203Sum%20Closest/3sum-closest.js) |
| [19. Remove Nth Node From End of List](./19.%20Remove%20Nth%20Node%20From%20End%20of%20List) [🔗](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium | `Linked List`, `Two Pointers` | [javascript](./19.%20Remove%20Nth%20Node%20From%20End%20of%20List/remove-nth-node-from-end-of-list.js) |
| [20. Valid Parentheses](./20.%20Valid%20Parentheses) [🔗](https://leetcode.com/problems/valid-parentheses/) | Easy | `String`, `Stack` | [c](./20.%20Valid%20Parentheses/valid-parentheses.c) \| [javascript](./20.%20Valid%20Parentheses/valid-parentheses.js) |
| [21. Merge Two Sorted Lists](./21.%20Merge%20Two%20Sorted%20Lists) [🔗](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | `Linked List`, `Recursion` | [c](./21.%20Merge%20Two%20Sorted%20Lists/merge-two-sorted-lists.c) \| [javascript](./21.%20Merge%20Two%20Sorted%20Lists/merge-two-sorted-lists.js) |
| [22. Generate Parentheses](./22.%20Generate%20Parentheses) [🔗](https://leetcode.com/problems/generate-parentheses/) | Medium | `String`, `Dynamic Programming`, `Backtracking` | [javascript](./22.%20Generate%20Parentheses/generate-parentheses.js) |
| [24. Swap Nodes in Pairs](./24.%20Swap%20Nodes%20in%20Pairs) [🔗](https://leetcode.com/problems/swap-nodes-in-pairs/) | Medium | `Linked List`, `Recursion` | [c](./24.%20Swap%20Nodes%20in%20Pairs/swap-nodes-in-pairs.c) |
| [26. Remove Duplicates from Sorted Array](./26.%20Remove%20Duplicates%20from%20Sorted%20Array) [🔗](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | Easy | `Array`, `Two Pointers` | [c](./26.%20Remove%20Duplicates%20from%20Sorted%20Array/remove-duplicates-from-sorted-array.c) |
| [27. Remove Element](./27.%20Remove%20Element) [🔗](https://leetcode.com/problems/remove-element/) | Easy | `Array`, `Two Pointers` | [c](./27.%20Remove%20Element/remove-element.c) |
| [28. Implement strStr()](./28.%20Implement%20strStr()) [🔗](https://leetcode.com/problems/implement-strstr/) | Easy | `Two Pointers`, `String`, `String Matching` | [c](./28.%20Implement%20strStr()/implement-strstr.c) |
| [35. Search Insert Position](./35.%20Search%20Insert%20Position) [🔗](https://leetcode.com/problems/search-insert-position/) | Easy | `Array`, `Binary Search` | [javascript](./35.%20Search%20Insert%20Position/search-insert-position.js) |
| [36. Valid Sudoku](./36.%20Valid%20Sudoku) [🔗](https://leetcode.com/problems/valid-sudoku/) | Medium | `Array`, `Hash Table`, `Matrix` | [javascript](./36.%20Valid%20Sudoku/valid-sudoku.js) |
| [44. Wildcard Matching](./44.%20Wildcard%20Matching) [🔗](https://leetcode.com/problems/wildcard-matching/) | Hard | `String`, `Dynamic Programming`, `Greedy`, `Recursion` | [c](./44.%20Wildcard%20Matching/wildcard-matching.c) \| [golang](./44.%20Wildcard%20Matching/wildcard-matching.go) |
| [46. Permutations](./46.%20Permutations) [🔗](https://leetcode.com/problems/permutations/) | Medium | `Array`, `Backtracking` | [javascript](./46.%20Permutations/permutations.js) |
| [48. Rotate Image](./48.%20Rotate%20Image) [🔗](https://leetcode.com/problems/rotate-image/) | Medium | `Array`, `Math`, `Matrix` | [javascript](./48.%20Rotate%20Image/rotate-image.js) |
| [52. N-Queens II](./52.%20N-Queens%20II) [🔗](https://leetcode.com/problems/n-queens-ii/) | Hard | `Backtracking` | [golang](./52.%20N-Queens%20II/n-queens-ii.go) \| [javascript](./52.%20N-Queens%20II/n-queens-ii.js) |
| [53. Maximum Subarray](./53.%20Maximum%20Subarray) [🔗](https://leetcode.com/problems/maximum-subarray/) | Easy | `Array`, `Divide and Conquer`, `Dynamic Programming` | [javascript](./53.%20Maximum%20Subarray/maximum-subarray.js) |
| [56. Merge Intervals](./56.%20Merge%20Intervals) [🔗](https://leetcode.com/problems/merge-intervals/) | Medium | `Array`, `Sorting` | [javascript](./56.%20Merge%20Intervals/merge-intervals.js) |
| [58. Length of Last Word](./58.%20Length%20of%20Last%20Word) [🔗](https://leetcode.com/problems/length-of-last-word/) | Easy | `String` | [c](./58.%20Length%20of%20Last%20Word/length-of-last-word.c) |
| [59. Spiral Matrix II](./59.%20Spiral%20Matrix%20II) [🔗](https://leetcode.com/problems/spiral-matrix-ii/) | Medium | `Array`, `Matrix`, `Simulation` | [javascript](./59.%20Spiral%20Matrix%20II/spiral-matrix-ii.js) |
| [61. Rotate List](./61.%20Rotate%20List) [🔗](https://leetcode.com/problems/rotate-list/) | Medium | `Linked List`, `Two Pointers` | [c](./61.%20Rotate%20List/rotate-list.c) |
| [62. Unique Paths](./62.%20Unique%20Paths) [🔗](https://leetcode.com/problems/unique-paths/) | Medium | `Math`, `Dynamic Programming`, `Combinatorics` | [c](./62.%20Unique%20Paths/unique-paths.c) |
| [63. Unique Paths II](./63.%20Unique%20Paths%20II) [🔗](https://leetcode.com/problems/unique-paths-ii/) | Medium | `Array`, `Dynamic Programming`, `Matrix` | [c](./63.%20Unique%20Paths%20II/unique-paths-ii.c) \| [typescript](./63.%20Unique%20Paths%20II/unique-paths-ii.ts) |
| [66. Plus One](./66.%20Plus%20One) [🔗](https://leetcode.com/problems/plus-one/) | Easy | `Array`, `Math` | [c](./66.%20Plus%20One/plus-one.c) |
| [67. Add Binary](./67.%20Add%20Binary) [🔗](https://leetcode.com/problems/add-binary/) | Easy | `Math`, `String`, `Bit Manipulation`, `Simulation` | [c](./67.%20Add%20Binary/add-binary.c) \| [typescript](./67.%20Add%20Binary/add-binary.ts) |
| [69. Sqrt(x)](./69.%20Sqrt(x)) [🔗](https://leetcode.com/problems/sqrtx/) | Easy | `Math`, `Binary Search` | [c](./69.%20Sqrt(x)/sqrtx.c) |
| [70. Climbing Stairs](./70.%20Climbing%20Stairs) [🔗](https://leetcode.com/problems/climbing-stairs/) | Easy | `Math`, `Dynamic Programming`, `Memoization` | [c](./70.%20Climbing%20Stairs/climbing-stairs.c) \| [javascript](./70.%20Climbing%20Stairs/climbing-stairs.js) |
| [71. Simplify Path](./71.%20Simplify%20Path) [🔗](https://leetcode.com/problems/simplify-path/) | Medium | `String`, `Stack` | [c](./71.%20Simplify%20Path/simplify-path.c) |
| [74. Search a 2D Matrix](./74.%20Search%20a%202D%20Matrix) [🔗](https://leetcode.com/problems/search-a-2d-matrix/) | Medium | `Array`, `Binary Search`, `Matrix` | [c](./74.%20Search%20a%202D%20Matrix/search-a-2d-matrix.c) \| [javascript](./74.%20Search%20a%202D%20Matrix/search-a-2d-matrix.js) |
| [75. Sort Colors](./75.%20Sort%20Colors) [🔗](https://leetcode.com/problems/sort-colors/) | Medium | `Array`, `Two Pointers`, `Sorting` | [javascript](./75.%20Sort%20Colors/sort-colors.js) |
| [77. Combinations](./77.%20Combinations) [🔗](https://leetcode.com/problems/combinations/) | Medium | `Backtracking` | [javascript](./77.%20Combinations/combinations.js) |
| [81. Search in Rotated Sorted Array II](./81.%20Search%20in%20Rotated%20Sorted%20Array%20II) [🔗](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) | Medium | `Array`, `Binary Search` | [c](./81.%20Search%20in%20Rotated%20Sorted%20Array%20II/search-in-rotated-sorted-array-ii.c) |
| [82. Remove Duplicates from Sorted List II](./82.%20Remove%20Duplicates%20from%20Sorted%20List%20II) [🔗](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | Medium | `Linked List`, `Two Pointers` | [c](./82.%20Remove%20Duplicates%20from%20Sorted%20List%20II/remove-duplicates-from-sorted-list-ii.c) \| [golang](./82.%20Remove%20Duplicates%20from%20Sorted%20List%20II/remove-duplicates-from-sorted-list-ii.go) \| [javascript](./82.%20Remove%20Duplicates%20from%20Sorted%20List%20II/remove-duplicates-from-sorted-list-ii.js) \| [typescript](./82.%20Remove%20Duplicates%20from%20Sorted%20List%20II/remove-duplicates-from-sorted-list-ii.ts) |
| [83. Remove Duplicates from Sorted List](./83.%20Remove%20Duplicates%20from%20Sorted%20List) [🔗](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | Easy | `Linked List` | [javascript](./83.%20Remove%20Duplicates%20from%20Sorted%20List/remove-duplicates-from-sorted-list.js) |
| [88. Merge Sorted Array](./88.%20Merge%20Sorted%20Array) [🔗](https://leetcode.com/problems/merge-sorted-array/) | Easy | `Array`, `Two Pointers`, `Sorting` | [javascript](./88.%20Merge%20Sorted%20Array/merge-sorted-array.js) |
| [89. Gray Code](./89.%20Gray%20Code) [🔗](https://leetcode.com/problems/gray-code/) | Medium | `Math`, `Backtracking`, `Bit Manipulation` | [javascript](./89.%20Gray%20Code/gray-code.js) |
| [92. Reverse Linked List II](./92.%20Reverse%20Linked%20List%20II) [🔗](https://leetcode.com/problems/reverse-linked-list-ii/) | Medium | `Linked List` | [cpp](./92.%20Reverse%20Linked%20List%20II/reverse-linked-list-ii.cpp) |
| [94. Binary Tree Inorder Traversal](./94.%20Binary%20Tree%20Inorder%20Traversal) [🔗](https://leetcode.com/problems/binary-tree-inorder-traversal/) | Easy | `Stack`, `Tree`, `Depth-First Search`, `Binary Tree` | [javascript](./94.%20Binary%20Tree%20Inorder%20Traversal/binary-tree-inorder-traversal.js) |
| [97. Interleaving String](./97.%20Interleaving%20String) [🔗](https://leetcode.com/problems/interleaving-string/) | Medium | `String`, `Dynamic Programming` | [javascript](./97.%20Interleaving%20String/interleaving-string.js) |
| [98. Validate Binary Search Tree](./98.%20Validate%20Binary%20Search%20Tree) [🔗](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | `Tree`, `Depth-First Search`, `Binary Search Tree`, `Binary Tree` | [javascript](./98.%20Validate%20Binary%20Search%20Tree/validate-binary-search-tree.js) |
| [101. Symmetric Tree](./101.%20Symmetric%20Tree) [🔗](https://leetcode.com/problems/symmetric-tree/) | Easy | `Tree`, `Depth-First Search`, `Breadth-First Search`, `Binary Tree` | [javascript](./101.%20Symmetric%20Tree/symmetric-tree.js) |
| [102. Binary Tree Level Order Traversal](./102.%20Binary%20Tree%20Level%20Order%20Traversal) [🔗](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium | `Tree`, `Breadth-First Search`, `Binary Tree` | [javascript](./102.%20Binary%20Tree%20Level%20Order%20Traversal/binary-tree-level-order-traversal.js) |
| [104. Maximum Depth of Binary Tree](./104.%20Maximum%20Depth%20of%20Binary%20Tree) [🔗](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | Easy | `Tree`, `Depth-First Search`, `Breadth-First Search`, `Binary Tree` | [javascript](./104.%20Maximum%20Depth%20of%20Binary%20Tree/maximum-depth-of-binary-tree.js) |
| [105. Construct Binary Tree from Preorder and Inorder Traversal](./105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal) [🔗](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium | `Array`, `Hash Table`, `Divide and Conquer`, `Tree`, `Binary Tree` | [javascript](./105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/construct-binary-tree-from-preorder-and-inorder-traversal.js) |
| [112. Path Sum](./112.%20Path%20Sum) [🔗](https://leetcode.com/problems/path-sum/) | Easy | `Tree`, `Depth-First Search`, `Breadth-First Search`, `Binary Tree` | [javascript](./112.%20Path%20Sum/path-sum.js) |
| [116. Populating Next Right Pointers in Each Node](./116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node) [🔗](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | Medium | `Linked List`, `Tree`, `Depth-First Search`, `Breadth-First Search`, `Binary Tree` | [javascript](./116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node/populating-next-right-pointers-in-each-node.js) |
| [118. Pascal's Triangle](./118.%20Pascal's%20Triangle) [🔗](https://leetcode.com/problems/pascals-triangle/) | Easy | `Array`, `Dynamic Programming` | [javascript](./118.%20Pascal's%20Triangle/pascals-triangle.js) |
| [119. Pascal's Triangle II](./119.%20Pascal's%20Triangle%20II) [🔗](https://leetcode.com/problems/pascals-triangle-ii/) | Easy | `Array`, `Dynamic Programming` | [javascript](./119.%20Pascal's%20Triangle%20II/pascals-triangle-ii.js) |
| [120. Triangle](./120.%20Triangle) [🔗](https://leetcode.com/problems/triangle/) | Medium | `Array`, `Dynamic Programming` | [javascript](./120.%20Triangle/triangle.js) |
| [121. Best Time to Buy and Sell Stock](./121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock) [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | `Array`, `Dynamic Programming` | [javascript](./121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock/best-time-to-buy-and-sell-stock.js) |
| [128. Longest Consecutive Sequence](./128.%20Longest%20Consecutive%20Sequence) [🔗](https://leetcode.com/problems/longest-consecutive-sequence/) | Medium | `Array`, `Hash Table`, `Union Find` | [javascript](./128.%20Longest%20Consecutive%20Sequence/longest-consecutive-sequence.js) |
| [133. Clone Graph](./133.%20Clone%20Graph) [🔗](https://leetcode.com/problems/clone-graph/) | Medium | `Hash Table`, `Depth-First Search`, `Breadth-First Search`, `Graph` | [c](./133.%20Clone%20Graph/clone-graph.c) |
| [135. Candy](./135.%20Candy) [🔗](https://leetcode.com/problems/candy/) | Hard | `Array`, `Greedy` | [javascript](./135.%20Candy/candy.js) |
| [136. Single Number](./136.%20Single%20Number) [🔗](https://leetcode.com/problems/single-number/) | Easy | `Array`, `Bit Manipulation` | [javascript](./136.%20Single%20Number/single-number.js) |
| [138. Copy List with Random Pointer](./138.%20Copy%20List%20with%20Random%20Pointer) [🔗](https://leetcode.com/problems/copy-list-with-random-pointer/) | Medium | `Hash Table`, `Linked List` | [c](./138.%20Copy%20List%20with%20Random%20Pointer/copy-list-with-random-pointer.c) |
| [141. Linked List Cycle](./141.%20Linked%20List%20Cycle) [🔗](https://leetcode.com/problems/linked-list-cycle/) | Easy | `Hash Table`, `Linked List`, `Two Pointers` | [c](./141.%20Linked%20List%20Cycle/linked-list-cycle.c) \| [javascript](./141.%20Linked%20List%20Cycle/linked-list-cycle.js) |
| [144. Binary Tree Preorder Traversal](./144.%20Binary%20Tree%20Preorder%20Traversal) [🔗](https://leetcode.com/problems/binary-tree-preorder-traversal/) | Easy | `Stack`, `Tree`, `Depth-First Search`, `Binary Tree` | [javascript](./144.%20Binary%20Tree%20Preorder%20Traversal/binary-tree-preorder-traversal.js) |
| [145. Binary Tree Postorder Traversal](./145.%20Binary%20Tree%20Postorder%20Traversal) [🔗](https://leetcode.com/problems/binary-tree-postorder-traversal/) | Easy | `Stack`, `Tree`, `Depth-First Search`, `Binary Tree` | [javascript](./145.%20Binary%20Tree%20Postorder%20Traversal/binary-tree-postorder-traversal.js) |
| [167. Two Sum II - Input Array Is Sorted](./167.%20Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted) [🔗](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | Medium | `Array`, `Two Pointers`, `Binary Search` | [javascript](./167.%20Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/two-sum-ii-input-array-is-sorted.js) |
| [169. Majority Element](./169.%20Majority%20Element) [🔗](https://leetcode.com/problems/majority-element/) | Easy | `Array`, `Hash Table`, `Divide and Conquer`, `Sorting`, `Counting` | [javascript](./169.%20Majority%20Element/majority-element.js) |
| [189. Rotate Array](./189.%20Rotate%20Array) [🔗](https://leetcode.com/problems/rotate-array/) | Medium | `Array`, `Math`, `Two Pointers` | [javascript](./189.%20Rotate%20Array/rotate-array.js) |
| [190. Reverse Bits](./190.%20Reverse%20Bits) [🔗](https://leetcode.com/problems/reverse-bits/) | Easy | `Divide and Conquer`, `Bit Manipulation` | [javascript](./190.%20Reverse%20Bits/reverse-bits.js) |
| [191. Number of 1 Bits](./191.%20Number%20of%201%20Bits) [🔗](https://leetcode.com/problems/number-of-1-bits/) | Easy | `Bit Manipulation` | [c](./191.%20Number%20of%201%20Bits/number-of-1-bits.c) \| [golang](./191.%20Number%20of%201%20Bits/number-of-1-bits.go) \| [javascript](./191.%20Number%20of%201%20Bits/number-of-1-bits.js) \| [typescript](./191.%20Number%20of%201%20Bits/number-of-1-bits.ts) |
| [198. House Robber](./198.%20House%20Robber) [🔗](https://leetcode.com/problems/house-robber/) | Medium | `Array`, `Dynamic Programming` | [javascript](./198.%20House%20Robber/house-robber.js) |
| [203. Remove Linked List Elements](./203.%20Remove%20Linked%20List%20Elements) [🔗](https://leetcode.com/problems/remove-linked-list-elements/) | Easy | `Linked List`, `Recursion` | [javascript](./203.%20Remove%20Linked%20List%20Elements/remove-linked-list-elements.js) |
| [206. Reverse Linked List](./206.%20Reverse%20Linked%20List) [🔗](https://leetcode.com/problems/reverse-linked-list/) | Easy | `Linked List`, `Recursion` | [javascript](./206.%20Reverse%20Linked%20List/reverse-linked-list.js) |
| [217. Contains Duplicate](./217.%20Contains%20Duplicate) [🔗](https://leetcode.com/problems/contains-duplicate/) | Easy | `Array`, `Hash Table`, `Sorting` | [javascript](./217.%20Contains%20Duplicate/contains-duplicate.js) |
| [226. Invert Binary Tree](./226.%20Invert%20Binary%20Tree) [🔗](https://leetcode.com/problems/invert-binary-tree/) | Easy | `Tree`, `Depth-First Search`, `Breadth-First Search`, `Binary Tree` | [javascript](./226.%20Invert%20Binary%20Tree/invert-binary-tree.js) |
| [231. Power of Two](./231.%20Power%20of%20Two) [🔗](https://leetcode.com/problems/power-of-two/) | Easy | `Math`, `Bit Manipulation`, `Recursion` | [javascript](./231.%20Power%20of%20Two/power-of-two.js) |
| [232. Implement Queue using Stacks](./232.%20Implement%20Queue%20using%20Stacks) [🔗](https://leetcode.com/problems/implement-queue-using-stacks/) | Easy | `Stack`, `Design`, `Queue` | [javascript](./232.%20Implement%20Queue%20using%20Stacks/implement-queue-using-stacks.js) |
| [235. Lowest Common Ancestor of a Binary Search Tree](./235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree) [🔗](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy | `Tree`, `Depth-First Search`, `Binary Search Tree`, `Binary Tree` | [javascript](./235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/lowest-common-ancestor-of-a-binary-search-tree.js) |
| [236. Lowest Common Ancestor of a Binary Tree](./236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree) [🔗](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | Medium | `Tree`, `Depth-First Search`, `Binary Tree` | [javascript](./236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/lowest-common-ancestor-of-a-binary-tree.js) |
| [240. Search a 2D Matrix II](./240.%20Search%20a%202D%20Matrix%20II) [🔗](https://leetcode.com/problems/search-a-2d-matrix-ii/) | Medium | `Array`, `Binary Search`, `Divide and Conquer`, `Matrix` | [javascript](./240.%20Search%20a%202D%20Matrix%20II/search-a-2d-matrix-ii.js) |
| [242. Valid Anagram](./242.%20Valid%20Anagram) [🔗](https://leetcode.com/problems/valid-anagram/) | Easy | `Hash Table`, `String`, `Sorting` | [javascript](./242.%20Valid%20Anagram/valid-anagram.js) |
| [278. First Bad Version](./278.%20First%20Bad%20Version) [🔗](https://leetcode.com/problems/first-bad-version/) | Easy | `Binary Search`, `Interactive` | [javascript](./278.%20First%20Bad%20Version/first-bad-version.js) |
| [283. Move Zeroes](./283.%20Move%20Zeroes) [🔗](https://leetcode.com/problems/move-zeroes/) | Easy | `Array`, `Two Pointers` | [c](./283.%20Move%20Zeroes/move-zeroes.c) \| [javascript](./283.%20Move%20Zeroes/move-zeroes.js) |
| [287. Find the Duplicate Number](./287.%20Find%20the%20Duplicate%20Number) [🔗](https://leetcode.com/problems/find-the-duplicate-number/) | Medium | `Array`, `Two Pointers`, `Binary Search`, `Bit Manipulation` | [c](./287.%20Find%20the%20Duplicate%20Number/find-the-duplicate-number.c) |
| [307. Range Sum Query - Mutable](./307.%20Range%20Sum%20Query%20-%20Mutable) [🔗](https://leetcode.com/problems/range-sum-query-mutable/) | Medium | `Array`, `Design`, `Binary Indexed Tree`, `Segment Tree` | [javascript](./307.%20Range%20Sum%20Query%20-%20Mutable/range-sum-query-mutable.js) |
| [315. Count of Smaller Numbers After Self](./315.%20Count%20of%20Smaller%20Numbers%20After%20Self) [🔗](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | Hard | `Array`, `Binary Search`, `Divide and Conquer`, `Binary Indexed Tree`, `Segment Tree`, `Merge Sort`, `Ordered Set` | [cpp](./315.%20Count%20of%20Smaller%20Numbers%20After%20Self/count-of-smaller-numbers-after-self.cpp) |
| [316. Remove Duplicate Letters](./316.%20Remove%20Duplicate%20Letters) [🔗](https://leetcode.com/problems/remove-duplicate-letters/) | Medium | `String`, `Stack`, `Greedy`, `Monotonic Stack` | [c](./316.%20Remove%20Duplicate%20Letters/remove-duplicate-letters.c) |
| [318. Maximum Product of Word Lengths](./318.%20Maximum%20Product%20of%20Word%20Lengths) [🔗](https://leetcode.com/problems/maximum-product-of-word-lengths/) | Medium | `Array`, `String`, `Bit Manipulation` | [golang](./318.%20Maximum%20Product%20of%20Word%20Lengths/maximum-product-of-word-lengths.go) \| [javascript](./318.%20Maximum%20Product%20of%20Word%20Lengths/maximum-product-of-word-lengths.js) |
| [322. Coin Change](./322.%20Coin%20Change) [🔗](https://leetcode.com/problems/coin-change/) | Medium | `Array`, `Dynamic Programming`, `Breadth-First Search` | [c](./322.%20Coin%20Change/coin-change.c) |
| [326. Power of Three](./326.%20Power%20of%20Three) [🔗](https://leetcode.com/problems/power-of-three/) | Easy | `Math`, `Recursion` | [c](./326.%20Power%20of%20Three/power-of-three.c) |
| [336. Palindrome Pairs](./336.%20Palindrome%20Pairs) [🔗](https://leetcode.com/problems/palindrome-pairs/) | Hard | `Array`, `Hash Table`, `String`, `Trie` | [javascript](./336.%20Palindrome%20Pairs/palindrome-pairs.js) |
| [338. Counting Bits](./338.%20Counting%20Bits) [🔗](https://leetcode.com/problems/counting-bits/) | Easy | `Dynamic Programming`, `Bit Manipulation` | [c](./338.%20Counting%20Bits/counting-bits.c) |
| [344. Reverse String](./344.%20Reverse%20String) [🔗](https://leetcode.com/problems/reverse-string/) | Easy | `Two Pointers`, `String`, `Recursion` | [c](./344.%20Reverse%20String/reverse-string.c) \| [javascript](./344.%20Reverse%20String/reverse-string.js) \| [rust](./344.%20Reverse%20String/reverse-string.rs) |
| [350. Intersection of Two Arrays II](./350.%20Intersection%20of%20Two%20Arrays%20II) [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | Easy | `Array`, `Hash Table`, `Two Pointers`, `Binary Search`, `Sorting` | [javascript](./350.%20Intersection%20of%20Two%20Arrays%20II/intersection-of-two-arrays-ii.js) |
| [363. Max Sum of Rectangle No Larger Than K](./363.%20Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K) [🔗](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/) | Hard | `Array`, `Binary Search`, `Dynamic Programming`, `Matrix`, `Ordered Set` | [cpp](./363.%20Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/max-sum-of-rectangle-no-larger-than-k.cpp) |
| [378. Kth Smallest Element in a Sorted Matrix](./378.%20Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix) [🔗](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | Medium | `Array`, `Binary Search`, `Sorting`, `Heap (Priority Queue)`, `Matrix` | [javascript](./378.%20Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/kth-smallest-element-in-a-sorted-matrix.js) |
| [383. Ransom Note](./383.%20Ransom%20Note) [🔗](https://leetcode.com/problems/ransom-note/) | Easy | `Hash Table`, `String`, `Counting` | [javascript](./383.%20Ransom%20Note/ransom-note.js) |
| [387. First Unique Character in a String](./387.%20First%20Unique%20Character%20in%20a%20String) [🔗](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | `Hash Table`, `String`, `Queue`, `Counting` | [javascript](./387.%20First%20Unique%20Character%20in%20a%20String/first-unique-character-in-a-string.js) |
| [392. Is Subsequence](./392.%20Is%20Subsequence) [🔗](https://leetcode.com/problems/is-subsequence/) | Easy | `Two Pointers`, `String`, `Dynamic Programming` | [c](./392.%20Is%20Subsequence/is-subsequence.c) |
| [410. Split Array Largest Sum](./410.%20Split%20Array%20Largest%20Sum) [🔗](https://leetcode.com/problems/split-array-largest-sum/) | Hard | `Array`, `Binary Search`, `Dynamic Programming`, `Greedy` | [c](./410.%20Split%20Array%20Largest%20Sum/split-array-largest-sum.c) |
| [413. Arithmetic Slices](./413.%20Arithmetic%20Slices) [🔗](https://leetcode.com/problems/arithmetic-slices/) | Medium | `Array`, `Dynamic Programming` | [c](./413.%20Arithmetic%20Slices/arithmetic-slices.c) |
| [473. Matchsticks to Square](./473.%20Matchsticks%20to%20Square) [🔗](https://leetcode.com/problems/matchsticks-to-square/) | Medium | `Array`, `Dynamic Programming`, `Backtracking`, `Bit Manipulation`, `Bitmask` | [javascript](./473.%20Matchsticks%20to%20Square/matchsticks-to-square.js) |
| [476. Number Complement](./476.%20Number%20Complement) [🔗](https://leetcode.com/problems/number-complement/) | Easy | `Bit Manipulation` | [c](./476.%20Number%20Complement/number-complement.c) |
| [485. Max Consecutive Ones](./485.%20Max%20Consecutive%20Ones) [🔗](https://leetcode.com/problems/max-consecutive-ones/) | Easy | `Array` | [javascript](./485.%20Max%20Consecutive%20Ones/max-consecutive-ones.js) |
| [506. Relative Ranks](./506.%20Relative%20Ranks) [🔗](https://leetcode.com/problems/relative-ranks/) | Easy | `Array`, `Sorting`, `Heap (Priority Queue)` | [javascript](./506.%20Relative%20Ranks/relative-ranks.js) |
| [542. 01 Matrix](./542.%2001%20Matrix) [🔗](https://leetcode.com/problems/01-matrix/) | Medium | `Array`, `Dynamic Programming`, `Breadth-First Search`, `Matrix` | [javascript](./542.%2001%20Matrix/01-matrix.js) |
| [557. Reverse Words in a String III](./557.%20Reverse%20Words%20in%20a%20String%20III) [🔗](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | Easy | `Two Pointers`, `String` | [javascript](./557.%20Reverse%20Words%20in%20a%20String%20III/reverse-words-in-a-string-iii.js) |
| [566. Reshape the Matrix](./566.%20Reshape%20the%20Matrix) [🔗](https://leetcode.com/problems/reshape-the-matrix/) | Easy | `Array`, `Matrix`, `Simulation` | [javascript](./566.%20Reshape%20the%20Matrix/reshape-the-matrix.js) |
| [567. Permutation in String](./567.%20Permutation%20in%20String) [🔗](https://leetcode.com/problems/permutation-in-string/) | Medium | `Hash Table`, `Two Pointers`, `String`, `Sliding Window` | [javascript](./567.%20Permutation%20in%20String/permutation-in-string.js) |
| [576. Out of Boundary Paths](./576.%20Out%20of%20Boundary%20Paths) [🔗](https://leetcode.com/problems/out-of-boundary-paths/) | Medium | `Dynamic Programming` | [javascript](./576.%20Out%20of%20Boundary%20Paths/out-of-boundary-paths.js) |
| [617. Merge Two Binary Trees](./617.%20Merge%20Two%20Binary%20Trees) [🔗](https://leetcode.com/problems/merge-two-binary-trees/) | Easy | `Tree`, `Depth-First Search`, `Breadth-First Search`, `Binary Tree` | [javascript](./617.%20Merge%20Two%20Binary%20Trees/merge-two-binary-trees.js) |
| [629. K Inverse Pairs Array](./629.%20K%20Inverse%20Pairs%20Array) [🔗](https://leetcode.com/problems/k-inverse-pairs-array/) | Hard | `Dynamic Programming` | [javascript](./629.%20K%20Inverse%20Pairs%20Array/k-inverse-pairs-array.js) |
| [653. Two Sum IV - Input is a BST](./653.%20Two%20Sum%20IV%20-%20Input%20is%20a%20BST) [🔗](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) | Easy | `Hash Table`, `Two Pointers`, `Tree`, `Depth-First Search`, `Breadth-First Search`, `Binary Search Tree`, `Binary Tree` | [javascript](./653.%20Two%20Sum%20IV%20-%20Input%20is%20a%20BST/two-sum-iv-input-is-a-bst.js) |
| [658. Find K Closest Elements](./658.%20Find%20K%20Closest%20Elements) [🔗](https://leetcode.com/problems/find-k-closest-elements/) | Medium | `Array`, `Two Pointers`, `Binary Search`, `Sorting`, `Heap (Priority Queue)` | [javascript](./658.%20Find%20K%20Closest%20Elements/find-k-closest-elements.js) |
| [680. Valid Palindrome II](./680.%20Valid%20Palindrome%20II) [🔗](https://leetcode.com/problems/valid-palindrome-ii/) | Easy | `Two Pointers`, `String`, `Greedy` | [c](./680.%20Valid%20Palindrome%20II/valid-palindrome-ii.c) |
| [682. Baseball Game](./682.%20Baseball%20Game) [🔗](https://leetcode.com/problems/baseball-game/) | Easy | `Array`, `Stack`, `Simulation` | [golang](./682.%20Baseball%20Game/baseball-game.go) |
| [684. Redundant Connection](./684.%20Redundant%20Connection) [🔗](https://leetcode.com/problems/redundant-connection/) | Medium | `Depth-First Search`, `Breadth-First Search`, `Union Find`, `Graph` | [javascript](./684.%20Redundant%20Connection/redundant-connection.js) |
| [695. Max Area of Island](./695.%20Max%20Area%20of%20Island) [🔗](https://leetcode.com/problems/max-area-of-island/) | Medium | `Array`, `Depth-First Search`, `Breadth-First Search`, `Union Find`, `Matrix` | [c](./695.%20Max%20Area%20of%20Island/max-area-of-island.c) \| [javascript](./695.%20Max%20Area%20of%20Island/max-area-of-island.js) |
| [700. Search in a Binary Search Tree](./700.%20Search%20in%20a%20Binary%20Search%20Tree) [🔗](https://leetcode.com/problems/search-in-a-binary-search-tree/) | Easy | `Tree`, `Binary Search Tree`, `Binary Tree` | [javascript](./700.%20Search%20in%20a%20Binary%20Search%20Tree/search-in-a-binary-search-tree.js) |
| [701. Insert into a Binary Search Tree](./701.%20Insert%20into%20a%20Binary%20Search%20Tree) [🔗](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | Medium | `Tree`, `Binary Search Tree`, `Binary Tree` | [javascript](./701.%20Insert%20into%20a%20Binary%20Search%20Tree/insert-into-a-binary-search-tree.js) |
| [704. Binary Search](./704.%20Binary%20Search) [🔗](https://leetcode.com/problems/binary-search/) | Easy | `Array`, `Binary Search` | [c](./704.%20Binary%20Search/binary-search.c) \| [javascript](./704.%20Binary%20Search/binary-search.js) |
| [705. Design HashSet](./705.%20Design%20HashSet) [🔗](https://leetcode.com/problems/design-hashset/) | Easy | `Array`, `Hash Table`, `Linked List`, `Design`, `Hash Function` | [c](./705.%20Design%20HashSet/design-hashset.c) |
| [706. Design HashMap](./706.%20Design%20HashMap) [🔗](https://leetcode.com/problems/design-hashmap/) | Easy | `Array`, `Hash Table`, `Linked List`, `Design`, `Hash Function` | [javascript](./706.%20Design%20HashMap/design-hashmap.js) |
| [729. My Calendar I](./729.%20My%20Calendar%20I) [🔗](https://leetcode.com/problems/my-calendar-i/) | Medium | `Binary Search`, `Design`, `Segment Tree`, `Ordered Set` | [c](./729.%20My%20Calendar%20I/my-calendar-i.c) \| [javascript](./729.%20My%20Calendar%20I/my-calendar-i.js) |
| [733. Flood Fill](./733.%20Flood%20Fill) [🔗](https://leetcode.com/problems/flood-fill/) | Easy | `Array`, `Depth-First Search`, `Breadth-First Search`, `Matrix` | [javascript](./733.%20Flood%20Fill/flood-fill.js) |
| [740. Delete and Earn](./740.%20Delete%20and%20Earn) [🔗](https://leetcode.com/problems/delete-and-earn/) | Medium | `Array`, `Hash Table`, `Dynamic Programming` | [c](./740.%20Delete%20and%20Earn/delete-and-earn.c) |
| [746. Min Cost Climbing Stairs](./746.%20Min%20Cost%20Climbing%20Stairs) [🔗](https://leetcode.com/problems/min-cost-climbing-stairs/) | Easy | `Array`, `Dynamic Programming` | [c](./746.%20Min%20Cost%20Climbing%20Stairs/min-cost-climbing-stairs.c) \| [javascript](./746.%20Min%20Cost%20Climbing%20Stairs/min-cost-climbing-stairs.js) |
| [752. Open the Lock](./752.%20Open%20the%20Lock) [🔗](https://leetcode.com/problems/open-the-lock/) | Medium | `Array`, `Hash Table`, `String`, `Breadth-First Search` | [javascript](./752.%20Open%20the%20Lock/open-the-lock.js) |
| [763. Partition Labels](./763.%20Partition%20Labels) [🔗](https://leetcode.com/problems/partition-labels/) | Medium | `Hash Table`, `Two Pointers`, `String`, `Greedy` | [c](./763.%20Partition%20Labels/partition-labels.c) \| [typescript](./763.%20Partition%20Labels/partition-labels.ts) |
| [778. Swim in Rising Water](./778.%20Swim%20in%20Rising%20Water) [🔗](https://leetcode.com/problems/swim-in-rising-water/) | Hard | `Array`, `Binary Search`, `Depth-First Search`, `Breadth-First Search`, `Union Find`, `Heap (Priority Queue)`, `Matrix` | [cpp](./778.%20Swim%20in%20Rising%20Water/swim-in-rising-water.cpp) |
| [784. Letter Case Permutation](./784.%20Letter%20Case%20Permutation) [🔗](https://leetcode.com/problems/letter-case-permutation/) | Medium | `String`, `Backtracking`, `Bit Manipulation` | [javascript](./784.%20Letter%20Case%20Permutation/letter-case-permutation.js) |
| [792. Number of Matching Subsequences](./792.%20Number%20of%20Matching%20Subsequences) [🔗](https://leetcode.com/problems/number-of-matching-subsequences/) | Medium | `Hash Table`, `String`, `Trie`, `Sorting` | [cpp](./792.%20Number%20of%20Matching%20Subsequences/number-of-matching-subsequences.cpp) |
| [795. Number of Subarrays with Bounded Maximum](./795.%20Number%20of%20Subarrays%20with%20Bounded%20Maximum) [🔗](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/) | Medium | `Array`, `Two Pointers` | [javascript](./795.%20Number%20of%20Subarrays%20with%20Bounded%20Maximum/number-of-subarrays-with-bounded-maximum.js) |
| [799. Champagne Tower](./799.%20Champagne%20Tower) [🔗](https://leetcode.com/problems/champagne-tower/) | Medium | `Dynamic Programming` | [c](./799.%20Champagne%20Tower/champagne-tower.c) |
| [856. Score of Parentheses](./856.%20Score%20of%20Parentheses) [🔗](https://leetcode.com/problems/score-of-parentheses/) | Medium | `String`, `Stack` | [c](./856.%20Score%20of%20Parentheses/score-of-parentheses.c) \| [golang](./856.%20Score%20of%20Parentheses/score-of-parentheses.go) \| [typescript](./856.%20Score%20of%20Parentheses/score-of-parentheses.ts) |
| [871. Minimum Number of Refueling Stops](./871.%20Minimum%20Number%20of%20Refueling%20Stops) [🔗](https://leetcode.com/problems/minimum-number-of-refueling-stops/) | Hard | `Array`, `Dynamic Programming`, `Greedy`, `Heap (Priority Queue)` | [javascript](./871.%20Minimum%20Number%20of%20Refueling%20Stops/minimum-number-of-refueling-stops.js) |
| [876. Middle of the Linked List](./876.%20Middle%20of%20the%20Linked%20List) [🔗](https://leetcode.com/problems/middle-of-the-linked-list/) | Easy | `Linked List`, `Two Pointers` | [c](./876.%20Middle%20of%20the%20Linked%20List/middle-of-the-linked-list.c) \| [javascript](./876.%20Middle%20of%20the%20Linked%20List/middle-of-the-linked-list.js) |
| [881. Boats to Save People](./881.%20Boats%20to%20Save%20People) [🔗](https://leetcode.com/problems/boats-to-save-people/) | Medium | `Array`, `Two Pointers`, `Greedy`, `Sorting` | [c](./881.%20Boats%20to%20Save%20People/boats-to-save-people.c) |
| [895. Maximum Frequency Stack](./895.%20Maximum%20Frequency%20Stack) [🔗](https://leetcode.com/problems/maximum-frequency-stack/) | Hard | `Hash Table`, `Stack`, `Design`, `Ordered Set` | [c](./895.%20Maximum%20Frequency%20Stack/maximum-frequency-stack.c) \| [javascript](./895.%20Maximum%20Frequency%20Stack/maximum-frequency-stack.js) \| [typescript](./895.%20Maximum%20Frequency%20Stack/maximum-frequency-stack.ts) |
| [905. Sort Array By Parity](./905.%20Sort%20Array%20By%20Parity) [🔗](https://leetcode.com/problems/sort-array-by-parity/) | Easy | `Array`, `Two Pointers`, `Sorting` | [c](./905.%20Sort%20Array%20By%20Parity/sort-array-by-parity.c) |
| [941. Valid Mountain Array](./941.%20Valid%20Mountain%20Array) [🔗](https://leetcode.com/problems/valid-mountain-array/) | Easy | `Array` | [c](./941.%20Valid%20Mountain%20Array/valid-mountain-array.c) |
| [946. Validate Stack Sequences](./946.%20Validate%20Stack%20Sequences) [🔗](https://leetcode.com/problems/validate-stack-sequences/) | Medium | `Array`, `Stack`, `Simulation` | [c](./946.%20Validate%20Stack%20Sequences/validate-stack-sequences.c) \| [typescript](./946.%20Validate%20Stack%20Sequences/validate-stack-sequences.ts) |
| [977. Squares of a Sorted Array](./977.%20Squares%20of%20a%20Sorted%20Array) [🔗](https://leetcode.com/problems/squares-of-a-sorted-array/) | Easy | `Array`, `Two Pointers`, `Sorting` | [javascript](./977.%20Squares%20of%20a%20Sorted%20Array/squares-of-a-sorted-array.js) |
| [991. Broken Calculator](./991.%20Broken%20Calculator) [🔗](https://leetcode.com/problems/broken-calculator/) | Medium | `Math`, `Greedy` | [c](./991.%20Broken%20Calculator/broken-calculator.c) |
| [994. Rotting Oranges](./994.%20Rotting%20Oranges) [🔗](https://leetcode.com/problems/rotting-oranges/) | Medium | `Array`, `Breadth-First Search`, `Matrix` | [javascript](./994.%20Rotting%20Oranges/rotting-oranges.js) |
| [1004. Max Consecutive Ones III](./1004.%20Max%20Consecutive%20Ones%20III) [🔗](https://leetcode.com/problems/max-consecutive-ones-iii/) | Medium | `Array`, `Binary Search`, `Sliding Window`, `Prefix Sum` | [javascript](./1004.%20Max%20Consecutive%20Ones%20III/max-consecutive-ones-iii.js) |
| [1007. Minimum Domino Rotations For Equal Row](./1007.%20Minimum%20Domino%20Rotations%20For%20Equal%20Row) [🔗](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/) | Medium | `Array`, `Greedy` | [c](./1007.%20Minimum%20Domino%20Rotations%20For%20Equal%20Row/minimum-domino-rotations-for-equal-row.c) |
| [1009. Complement of Base 10 Integer](./1009.%20Complement%20of%20Base%2010%20Integer) [🔗](https://leetcode.com/problems/complement-of-base-10-integer/) | Easy | `Bit Manipulation` | [c](./1009.%20Complement%20of%20Base%2010%20Integer/complement-of-base-10-integer.c) |
| [1029. Two City Scheduling](./1029.%20Two%20City%20Scheduling) [🔗](https://leetcode.com/problems/two-city-scheduling/) | Medium | `Array`, `Greedy`, `Sorting` | [c](./1029.%20Two%20City%20Scheduling/two-city-scheduling.c) \| [javascript](./1029.%20Two%20City%20Scheduling/two-city-scheduling.js) \| [typescript](./1029.%20Two%20City%20Scheduling/two-city-scheduling.ts) |
| [1047. Remove All Adjacent Duplicates In String](./1047.%20Remove%20All%20Adjacent%20Duplicates%20In%20String) [🔗](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | Easy | `String`, `Stack` | [javascript](./1047.%20Remove%20All%20Adjacent%20Duplicates%20In%20String/remove-all-adjacent-duplicates-in-string.js) |
| [1081. Smallest Subsequence of Distinct Characters](./1081.%20Smallest%20Subsequence%20of%20Distinct%20Characters) [🔗](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/) | Medium | `String`, `Stack`, `Greedy`, `Monotonic Stack` | [c](./1081.%20Smallest%20Subsequence%20of%20Distinct%20Characters/smallest-subsequence-of-distinct-characters.c) |
| [1089. Duplicate Zeros](./1089.%20Duplicate%20Zeros) [🔗](https://leetcode.com/problems/duplicate-zeros/) | Easy | `Array`, `Two Pointers` | [javascript](./1089.%20Duplicate%20Zeros/duplicate-zeros.js) |
| [1220. Count Vowels Permutation](./1220.%20Count%20Vowels%20Permutation) [🔗](https://leetcode.com/problems/count-vowels-permutation/) | Hard | `Dynamic Programming` | [cpp](./1220.%20Count%20Vowels%20Permutation/count-vowels-permutation.cpp) |
| [1249. Minimum Remove to Make Valid Parentheses](./1249.%20Minimum%20Remove%20to%20Make%20Valid%20Parentheses) [🔗](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) | Medium | `String`, `Stack` | [c](./1249.%20Minimum%20Remove%20to%20Make%20Valid%20Parentheses/minimum-remove-to-make-valid-parentheses.c) |
| [1290. Convert Binary Number in a Linked List to Integer](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer) [🔗](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/) | Easy | `Linked List`, `Math` | [c](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/convert-binary-number-in-a-linked-list-to-integer.c) \| [cpp](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/convert-binary-number-in-a-linked-list-to-integer.cpp) \| [golang](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/convert-binary-number-in-a-linked-list-to-integer.go) \| [java](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/convert-binary-number-in-a-linked-list-to-integer.java) \| [javascript](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/convert-binary-number-in-a-linked-list-to-integer.js) \| [php](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/convert-binary-number-in-a-linked-list-to-integer.php) \| [python3](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/convert-binary-number-in-a-linked-list-to-integer.py3) \| [python](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/convert-binary-number-in-a-linked-list-to-integer.py) \| [typescript](./1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/convert-binary-number-in-a-linked-list-to-integer.ts) |
| [1295. Find Numbers with Even Number of Digits](./1295.%20Find%20Numbers%20with%20Even%20Number%20of%20Digits) [🔗](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/) | Easy | `Array` | [javascript](./1295.%20Find%20Numbers%20with%20Even%20Number%20of%20Digits/find-numbers-with-even-number-of-digits.js) |
| [1299. Replace Elements with Greatest Element on Right Side](./1299.%20Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side) [🔗](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/) | Easy | `Array` | [c](./1299.%20Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/replace-elements-with-greatest-element-on-right-side.c) |
| [1337. The K Weakest Rows in a Matrix](./1337.%20The%20K%20Weakest%20Rows%20in%20a%20Matrix) [🔗](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/) | Easy | `Array`, `Binary Search`, `Sorting`, `Heap (Priority Queue)`, `Matrix` | [javascript](./1337.%20The%20K%20Weakest%20Rows%20in%20a%20Matrix/the-k-weakest-rows-in-a-matrix.js) \| [typescript](./1337.%20The%20K%20Weakest%20Rows%20in%20a%20Matrix/the-k-weakest-rows-in-a-matrix.ts) |
| [1338. Reduce Array Size to The Half](./1338.%20Reduce%20Array%20Size%20to%20The%20Half) [🔗](https://leetcode.com/problems/reduce-array-size-to-the-half/) | Medium | `Array`, `Hash Table`, `Greedy`, `Sorting`, `Heap (Priority Queue)` | [javascript](./1338.%20Reduce%20Array%20Size%20to%20The%20Half/reduce-array-size-to-the-half.js) |
| [1346. Check If N and Its Double Exist](./1346.%20Check%20If%20N%20and%20Its%20Double%20Exist) [🔗](https://leetcode.com/problems/check-if-n-and-its-double-exist/) | Easy | `Array`, `Hash Table`, `Two Pointers`, `Binary Search`, `Sorting` | [c](./1346.%20Check%20If%20N%20and%20Its%20Double%20Exist/check-if-n-and-its-double-exist.c) |
| [1359. Count All Valid Pickup and Delivery Options](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options) [🔗](https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options/) | Hard | `Math`, `Dynamic Programming`, `Combinatorics` | [c](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.c) \| [cpp](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.cpp) \| [csharp](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.cs) \| [java](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.java) \| [javascript](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.js) \| [python3](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.py3) \| [python](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.py) \| [ruby](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.rb) \| [rust](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.rs) \| [typescript](./1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/count-all-valid-pickup-and-delivery-options.ts) |
| [1383. Maximum Performance of a Team](./1383.%20Maximum%20Performance%20of%20a%20Team) [🔗](https://leetcode.com/problems/maximum-performance-of-a-team/) | Hard | `Array`, `Greedy`, `Sorting`, `Heap (Priority Queue)` | [cpp](./1383.%20Maximum%20Performance%20of%20a%20Team/maximum-performance-of-a-team.cpp) \| [javascript](./1383.%20Maximum%20Performance%20of%20a%20Team/maximum-performance-of-a-team.js) |
| [1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](./1465.%20Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts) [🔗](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/) | Medium | `Array`, `Greedy`, `Sorting` | [c](./1465.%20Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.c) \| [javascript](./1465.%20Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.js) |
| [1663. Smallest String With A Given Numeric Value](./1663.%20Smallest%20String%20With%20A%20Given%20Numeric%20Value) [🔗](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/) | Medium | `String`, `Greedy` | [c](./1663.%20Smallest%20String%20With%20A%20Given%20Numeric%20Value/smallest-string-with-a-given-numeric-value.c) \| [typescript](./1663.%20Smallest%20String%20With%20A%20Given%20Numeric%20Value/smallest-string-with-a-given-numeric-value.ts) |
| [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](./1689.%20Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers) [🔗](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/) | Medium | `String`, `Greedy` | [golang](./1689.%20Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/partitioning-into-minimum-number-of-deci-binary-numbers.go) \| [javascript](./1689.%20Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/partitioning-into-minimum-number-of-deci-binary-numbers.js) |
| [1690. Stone Game VII](./1690.%20Stone%20Game%20VII) [🔗](https://leetcode.com/problems/stone-game-vii/) | Medium | `Array`, `Math`, `Dynamic Programming`, `Game Theory` | [c](./1690.%20Stone%20Game%20VII/stone-game-vii.c) \| [javascript](./1690.%20Stone%20Game%20VII/stone-game-vii.js) |
| [1695. Maximum Erasure Value](./1695.%20Maximum%20Erasure%20Value) [🔗](https://leetcode.com/problems/maximum-erasure-value/) | Medium | `Array`, `Hash Table`, `Sliding Window` | [golang](./1695.%20Maximum%20Erasure%20Value/maximum-erasure-value.go) \| [javascript](./1695.%20Maximum%20Erasure%20Value/maximum-erasure-value.js) |
| [1696. Jump Game VI](./1696.%20Jump%20Game%20VI) [🔗](https://leetcode.com/problems/jump-game-vi/) | Medium | `Array`, `Dynamic Programming`, `Queue`, `Sliding Window`, `Heap (Priority Queue)`, `Monotonic Queue` | [javascript](./1696.%20Jump%20Game%20VI/jump-game-vi.js) |
| [1710. Maximum Units on a Truck](./1710.%20Maximum%20Units%20on%20a%20Truck) [🔗](https://leetcode.com/problems/maximum-units-on-a-truck/) | Easy | `Array`, `Greedy`, `Sorting` | [javascript](./1710.%20Maximum%20Units%20on%20a%20Truck/maximum-units-on-a-truck.js) |
| [1876. Substrings of Size Three with Distinct Characters](./1876.%20Substrings%20of%20Size%20Three%20with%20Distinct%20Characters) [🔗](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/) | Easy | `Hash Table`, `String`, `Sliding Window`, `Counting` | [javascript](./1876.%20Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/substrings-of-size-three-with-distinct-characters.js) |
| [1877. Minimize Maximum Pair Sum in Array](./1877.%20Minimize%20Maximum%20Pair%20Sum%20in%20Array) [🔗](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/) | Medium | `Array`, `Two Pointers`, `Greedy`, `Sorting` | [javascript](./1877.%20Minimize%20Maximum%20Pair%20Sum%20in%20Array/minimize-maximum-pair-sum-in-array.js) |
| [1878. Get Biggest Three Rhombus Sums in a Grid](./1878.%20Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid) [🔗](https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid/) | Medium | `Array`, `Math`, `Sorting`, `Heap (Priority Queue)`, `Matrix`, `Prefix Sum` | [cpp](./1878.%20Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/get-biggest-three-rhombus-sums-in-a-grid.cpp) |
| [1879. Minimum XOR Sum of Two Arrays](./1879.%20Minimum%20XOR%20Sum%20of%20Two%20Arrays) [🔗](https://leetcode.com/problems/minimum-xor-sum-of-two-arrays/) | Hard | `Array`, `Dynamic Programming`, `Bit Manipulation`, `Bitmask` | [cpp](./1879.%20Minimum%20XOR%20Sum%20of%20Two%20Arrays/minimum-xor-sum-of-two-arrays.cpp) |
| [1880. Check if Word Equals Summation of Two Words](./1880.%20Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words) [🔗](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/) | Easy | `String` | [javascript](./1880.%20Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/check-if-word-equals-summation-of-two-words.js) |
| [1881. Maximum Value after Insertion](./1881.%20Maximum%20Value%20after%20Insertion) [🔗](https://leetcode.com/problems/maximum-value-after-insertion/) | Medium | `String`, `Greedy` | [javascript](./1881.%20Maximum%20Value%20after%20Insertion/maximum-value-after-insertion.js) |
| [1882. Process Tasks Using Servers](./1882.%20Process%20Tasks%20Using%20Servers) [🔗](https://leetcode.com/problems/process-tasks-using-servers/) | Medium | `Array`, `Heap (Priority Queue)` | [cpp](./1882.%20Process%20Tasks%20Using%20Servers/process-tasks-using-servers.cpp) |
| [1893. Check if All the Integers in a Range Are Covered](./1893.%20Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered) [🔗](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/) | Easy | `Array`, `Hash Table`, `Prefix Sum` | [javascript](./1893.%20Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/check-if-all-the-integers-in-a-range-are-covered.js) |
| [1894. Find the Student that Will Replace the Chalk](./1894.%20Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk) [🔗](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/) | Medium | `Array`, `Binary Search`, `Simulation`, `Prefix Sum` | [javascript](./1894.%20Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/find-the-student-that-will-replace-the-chalk.js) |
| [1895. Largest Magic Square](./1895.%20Largest%20Magic%20Square) [🔗](https://leetcode.com/problems/largest-magic-square/) | Medium | `Array`, `Matrix`, `Prefix Sum` | [golang](./1895.%20Largest%20Magic%20Square/largest-magic-square.go) |
| [1897. Redistribute Characters to Make All Strings Equal](./1897.%20Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal) [🔗](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/) | Easy | `Hash Table`, `String`, `Counting` | [javascript](./1897.%20Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/redistribute-characters-to-make-all-strings-equal.js) |
| [1899. Merge Triplets to Form Target Triplet](./1899.%20Merge%20Triplets%20to%20Form%20Target%20Triplet) [🔗](https://leetcode.com/problems/merge-triplets-to-form-target-triplet/) | Medium | `Array`, `Greedy` | [javascript](./1899.%20Merge%20Triplets%20to%20Form%20Target%20Triplet/merge-triplets-to-form-target-triplet.js) |
| [1909. Remove One Element to Make the Array Strictly Increasing](./1909.%20Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing) [🔗](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/) | Easy | `Array` | [javascript](./1909.%20Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/remove-one-element-to-make-the-array-strictly-increasing.js) |
| [1910. Remove All Occurrences of a Substring](./1910.%20Remove%20All%20Occurrences%20of%20a%20Substring) [🔗](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/) | Medium | `String` | [javascript](./1910.%20Remove%20All%20Occurrences%20of%20a%20Substring/remove-all-occurrences-of-a-substring.js) |