README_EN.md

# LeetCode

[中文文档](/solution/README.md)

## Solutions

Press <kbd>Control</kbd>+<kbd>F</kbd>(or <kbd>Command</kbd>+<kbd>F</kbd> on the Mac) to search anything you want.


|  #  |  Solution  |  Tags  |  Difficulty  |  Remark |
| --- | --- | --- | --- | --- |
|  [0001](https://leetcode.com/problems/two-sum)  |  [Two Sum](/solution/0000-0099/0001.Two%20Sum/README_EN.md)  |  `Array`,`Hash Table`  |  Easy  |    |
|  [0002](https://leetcode.com/problems/add-two-numbers)  |  [Add Two Numbers](/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md)  |  `Recursion`,`Linked List`,`Math`  |  Medium  |    |
|  [0003](https://leetcode.com/problems/longest-substring-without-repeating-characters)  |  [Longest Substring Without Repeating Characters](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |    |
|  [0004](https://leetcode.com/problems/median-of-two-sorted-arrays)  |  [Median of Two Sorted Arrays](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README_EN.md)  |  `Array`,`Binary Search`,`Divide and Conquer`  |  Hard  |    |
|  [0005](https://leetcode.com/problems/longest-palindromic-substring)  |  [Longest Palindromic Substring](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [0006](https://leetcode.com/problems/zigzag-conversion)  |  [ZigZag Conversion](/solution/0000-0099/0006.ZigZag%20Conversion/README_EN.md)  |  `String`  |  Medium  |    |
|  [0007](https://leetcode.com/problems/reverse-integer)  |  [Reverse Integer](/solution/0000-0099/0007.Reverse%20Integer/README_EN.md)  |  `Math`  |  Easy  |    |
|  [0008](https://leetcode.com/problems/string-to-integer-atoi)  |  [String to Integer (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README_EN.md)  |  `String`  |  Medium  |    |
|  [0009](https://leetcode.com/problems/palindrome-number)  |  [Palindrome Number](/solution/0000-0099/0009.Palindrome%20Number/README_EN.md)  |  `Math`  |  Easy  |    |
|  [0010](https://leetcode.com/problems/regular-expression-matching)  |  [Regular Expression Matching](/solution/0000-0099/0010.Regular%20Expression%20Matching/README_EN.md)  |  `Recursion`,`String`,`Dynamic Programming`  |  Hard  |    |
|  [0011](https://leetcode.com/problems/container-with-most-water)  |  [Container With Most Water](/solution/0000-0099/0011.Container%20With%20Most%20Water/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`  |  Medium  |    |
|  [0012](https://leetcode.com/problems/integer-to-roman)  |  [Integer to Roman](/solution/0000-0099/0012.Integer%20to%20Roman/README_EN.md)  |  `Hash Table`,`Math`,`String`  |  Medium  |    |
|  [0013](https://leetcode.com/problems/roman-to-integer)  |  [Roman to Integer](/solution/0000-0099/0013.Roman%20to%20Integer/README_EN.md)  |  `Hash Table`,`Math`,`String`  |  Easy  |    |
|  [0014](https://leetcode.com/problems/longest-common-prefix)  |  [Longest Common Prefix](/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md)  |  `String`  |  Easy  |    |
|  [0015](https://leetcode.com/problems/3sum)  |  [3Sum](/solution/0000-0099/0015.3Sum/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [0016](https://leetcode.com/problems/3sum-closest)  |  [3Sum Closest](/solution/0000-0099/0016.3Sum%20Closest/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [0017](https://leetcode.com/problems/letter-combinations-of-a-phone-number)  |  [Letter Combinations of a Phone Number](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README_EN.md)  |  `Hash Table`,`String`,`Backtracking`  |  Medium  |    |
|  [0018](https://leetcode.com/problems/4sum)  |  [4Sum](/solution/0000-0099/0018.4Sum/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [0019](https://leetcode.com/problems/remove-nth-node-from-end-of-list)  |  [Remove Nth Node From End of List](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README_EN.md)  |  `Linked List`,`Two Pointers`  |  Medium  |    |
|  [0020](https://leetcode.com/problems/valid-parentheses)  |  [Valid Parentheses](/solution/0000-0099/0020.Valid%20Parentheses/README_EN.md)  |  `Stack`,`String`  |  Easy  |    |
|  [0021](https://leetcode.com/problems/merge-two-sorted-lists)  |  [Merge Two Sorted Lists](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README_EN.md)  |  `Recursion`,`Linked List`  |  Easy  |    |
|  [0022](https://leetcode.com/problems/generate-parentheses)  |  [Generate Parentheses](/solution/0000-0099/0022.Generate%20Parentheses/README_EN.md)  |  `String`,`Dynamic Programming`,`Backtracking`  |  Medium  |    |
|  [0023](https://leetcode.com/problems/merge-k-sorted-lists)  |  [Merge k Sorted Lists](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README_EN.md)  |  `Linked List`,`Divide and Conquer`,`Heap (Priority Queue)`,`Merge Sort`  |  Hard  |    |
|  [0024](https://leetcode.com/problems/swap-nodes-in-pairs)  |  [Swap Nodes in Pairs](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README_EN.md)  |  `Recursion`,`Linked List`  |  Medium  |    |
|  [0025](https://leetcode.com/problems/reverse-nodes-in-k-group)  |  [Reverse Nodes in k-Group](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README_EN.md)  |  `Recursion`,`Linked List`  |  Hard  |    |
|  [0026](https://leetcode.com/problems/remove-duplicates-from-sorted-array)  |  [Remove Duplicates from Sorted Array](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md)  |  `Array`,`Two Pointers`  |  Easy  |    |
|  [0027](https://leetcode.com/problems/remove-element)  |  [Remove Element](/solution/0000-0099/0027.Remove%20Element/README_EN.md)  |  `Array`,`Two Pointers`  |  Easy  |    |
|  [0028](https://leetcode.com/problems/implement-strstr)  |  [Implement strStr()](/solution/0000-0099/0028.Implement%20strStr%28%29/README_EN.md)  |  `Two Pointers`,`String`,`String Matching`  |  Easy  |    |
|  [0029](https://leetcode.com/problems/divide-two-integers)  |  [Divide Two Integers](/solution/0000-0099/0029.Divide%20Two%20Integers/README_EN.md)  |  `Bit Manipulation`,`Math`  |  Medium  |    |
|  [0030](https://leetcode.com/problems/substring-with-concatenation-of-all-words)  |  [Substring with Concatenation of All Words](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Hard  |    |
|  [0031](https://leetcode.com/problems/next-permutation)  |  [Next Permutation](/solution/0000-0099/0031.Next%20Permutation/README_EN.md)  |  `Array`,`Two Pointers`  |  Medium  |    |
|  [0032](https://leetcode.com/problems/longest-valid-parentheses)  |  [Longest Valid Parentheses](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README_EN.md)  |  `Stack`,`String`,`Dynamic Programming`  |  Hard  |    |
|  [0033](https://leetcode.com/problems/search-in-rotated-sorted-array)  |  [Search in Rotated Sorted Array](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [0034](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array)  |  [Find First and Last Position of Element in Sorted Array](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [0035](https://leetcode.com/problems/search-insert-position)  |  [Search Insert Position](/solution/0000-0099/0035.Search%20Insert%20Position/README_EN.md)  |  `Array`,`Binary Search`  |  Easy  |    |
|  [0036](https://leetcode.com/problems/valid-sudoku)  |  [Valid Sudoku](/solution/0000-0099/0036.Valid%20Sudoku/README_EN.md)  |  `Array`,`Hash Table`,`Matrix`  |  Medium  |    |
|  [0037](https://leetcode.com/problems/sudoku-solver)  |  [Sudoku Solver](/solution/0000-0099/0037.Sudoku%20Solver/README_EN.md)  |  `Array`,`Backtracking`,`Matrix`  |  Hard  |    |
|  [0038](https://leetcode.com/problems/count-and-say)  |  [Count and Say](/solution/0000-0099/0038.Count%20and%20Say/README_EN.md)  |  `String`  |  Medium  |    |
|  [0039](https://leetcode.com/problems/combination-sum)  |  [Combination Sum](/solution/0000-0099/0039.Combination%20Sum/README_EN.md)  |  `Array`,`Backtracking`  |  Medium  |    |
|  [0040](https://leetcode.com/problems/combination-sum-ii)  |  [Combination Sum II](/solution/0000-0099/0040.Combination%20Sum%20II/README_EN.md)  |  `Array`,`Backtracking`  |  Medium  |    |
|  [0041](https://leetcode.com/problems/first-missing-positive)  |  [First Missing Positive](/solution/0000-0099/0041.First%20Missing%20Positive/README_EN.md)  |  `Array`,`Hash Table`  |  Hard  |    |
|  [0042](https://leetcode.com/problems/trapping-rain-water)  |  [Trapping Rain Water](/solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md)  |  `Stack`,`Array`,`Two Pointers`,`Dynamic Programming`,`Monotonic Stack`  |  Hard  |    |
|  [0043](https://leetcode.com/problems/multiply-strings)  |  [Multiply Strings](/solution/0000-0099/0043.Multiply%20Strings/README_EN.md)  |  `Math`,`String`,`Simulation`  |  Medium  |    |
|  [0044](https://leetcode.com/problems/wildcard-matching)  |  [Wildcard Matching](/solution/0000-0099/0044.Wildcard%20Matching/README_EN.md)  |  `Greedy`,`Recursion`,`String`,`Dynamic Programming`  |  Hard  |    |
|  [0045](https://leetcode.com/problems/jump-game-ii)  |  [Jump Game II](/solution/0000-0099/0045.Jump%20Game%20II/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [0046](https://leetcode.com/problems/permutations)  |  [Permutations](/solution/0000-0099/0046.Permutations/README_EN.md)  |  `Array`,`Backtracking`  |  Medium  |    |
|  [0047](https://leetcode.com/problems/permutations-ii)  |  [Permutations II](/solution/0000-0099/0047.Permutations%20II/README_EN.md)  |  `Array`,`Backtracking`  |  Medium  |    |
|  [0048](https://leetcode.com/problems/rotate-image)  |  [Rotate Image](/solution/0000-0099/0048.Rotate%20Image/README_EN.md)  |  `Array`,`Math`,`Matrix`  |  Medium  |    |
|  [0049](https://leetcode.com/problems/group-anagrams)  |  [Group Anagrams](/solution/0000-0099/0049.Group%20Anagrams/README_EN.md)  |  `Hash Table`,`String`,`Sorting`  |  Medium  |    |
|  [0050](https://leetcode.com/problems/powx-n)  |  [Pow(x, n)](/solution/0000-0099/0050.Pow%28x%2C%20n%29/README_EN.md)  |  `Recursion`,`Math`  |  Medium  |    |
|  [0051](https://leetcode.com/problems/n-queens)  |  [N-Queens](/solution/0000-0099/0051.N-Queens/README_EN.md)  |  `Array`,`Backtracking`  |  Hard  |    |
|  [0052](https://leetcode.com/problems/n-queens-ii)  |  [N-Queens II](/solution/0000-0099/0052.N-Queens%20II/README_EN.md)  |  `Backtracking`  |  Hard  |    |
|  [0053](https://leetcode.com/problems/maximum-subarray)  |  [Maximum Subarray](/solution/0000-0099/0053.Maximum%20Subarray/README_EN.md)  |  `Array`,`Divide and Conquer`,`Dynamic Programming`  |  Easy  |    |
|  [0054](https://leetcode.com/problems/spiral-matrix)  |  [Spiral Matrix](/solution/0000-0099/0054.Spiral%20Matrix/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Medium  |    |
|  [0055](https://leetcode.com/problems/jump-game)  |  [Jump Game](/solution/0000-0099/0055.Jump%20Game/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [0056](https://leetcode.com/problems/merge-intervals)  |  [Merge Intervals](/solution/0000-0099/0056.Merge%20Intervals/README_EN.md)  |  `Array`,`Sorting`  |  Medium  |    |
|  [0057](https://leetcode.com/problems/insert-interval)  |  [Insert Interval](/solution/0000-0099/0057.Insert%20Interval/README_EN.md)  |  `Array`  |  Medium  |    |
|  [0058](https://leetcode.com/problems/length-of-last-word)  |  [Length of Last Word](/solution/0000-0099/0058.Length%20of%20Last%20Word/README_EN.md)  |  `String`  |  Easy  |    |
|  [0059](https://leetcode.com/problems/spiral-matrix-ii)  |  [Spiral Matrix II](/solution/0000-0099/0059.Spiral%20Matrix%20II/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Medium  |    |
|  [0060](https://leetcode.com/problems/permutation-sequence)  |  [Permutation Sequence](/solution/0000-0099/0060.Permutation%20Sequence/README_EN.md)  |  `Recursion`,`Math`  |  Hard  |    |
|  [0061](https://leetcode.com/problems/rotate-list)  |  [Rotate List](/solution/0000-0099/0061.Rotate%20List/README_EN.md)  |  `Linked List`,`Two Pointers`  |  Medium  |    |
|  [0062](https://leetcode.com/problems/unique-paths)  |  [Unique Paths](/solution/0000-0099/0062.Unique%20Paths/README_EN.md)  |  `Math`,`Dynamic Programming`,`Combinatorics`  |  Medium  |    |
|  [0063](https://leetcode.com/problems/unique-paths-ii)  |  [Unique Paths II](/solution/0000-0099/0063.Unique%20Paths%20II/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |    |
|  [0064](https://leetcode.com/problems/minimum-path-sum)  |  [Minimum Path Sum](/solution/0000-0099/0064.Minimum%20Path%20Sum/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |    |
|  [0065](https://leetcode.com/problems/valid-number)  |  [Valid Number](/solution/0000-0099/0065.Valid%20Number/README_EN.md)  |  `String`  |  Hard  |    |
|  [0066](https://leetcode.com/problems/plus-one)  |  [Plus One](/solution/0000-0099/0066.Plus%20One/README_EN.md)  |  `Array`,`Math`  |  Easy  |    |
|  [0067](https://leetcode.com/problems/add-binary)  |  [Add Binary](/solution/0000-0099/0067.Add%20Binary/README_EN.md)  |  `Bit Manipulation`,`Math`,`String`,`Simulation`  |  Easy  |    |
|  [0068](https://leetcode.com/problems/text-justification)  |  [Text Justification](/solution/0000-0099/0068.Text%20Justification/README_EN.md)  |  `String`,`Simulation`  |  Hard  |    |
|  [0069](https://leetcode.com/problems/sqrtx)  |  [Sqrt(x)](/solution/0000-0099/0069.Sqrt%28x%29/README_EN.md)  |  `Math`,`Binary Search`  |  Easy  |    |
|  [0070](https://leetcode.com/problems/climbing-stairs)  |  [Climbing Stairs](/solution/0000-0099/0070.Climbing%20Stairs/README_EN.md)  |  `Memoization`,`Math`,`Dynamic Programming`  |  Easy  |    |
|  [0071](https://leetcode.com/problems/simplify-path)  |  [Simplify Path](/solution/0000-0099/0071.Simplify%20Path/README_EN.md)  |  `Stack`,`String`  |  Medium  |    |
|  [0072](https://leetcode.com/problems/edit-distance)  |  [Edit Distance](/solution/0000-0099/0072.Edit%20Distance/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0073](https://leetcode.com/problems/set-matrix-zeroes)  |  [Set Matrix Zeroes](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README_EN.md)  |  `Array`,`Hash Table`,`Matrix`  |  Medium  |    |
|  [0074](https://leetcode.com/problems/search-a-2d-matrix)  |  [Search a 2D Matrix](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README_EN.md)  |  `Array`,`Binary Search`,`Matrix`  |  Medium  |    |
|  [0075](https://leetcode.com/problems/sort-colors)  |  [Sort Colors](/solution/0000-0099/0075.Sort%20Colors/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [0076](https://leetcode.com/problems/minimum-window-substring)  |  [Minimum Window Substring](/solution/0000-0099/0076.Minimum%20Window%20Substring/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Hard  |    |
|  [0077](https://leetcode.com/problems/combinations)  |  [Combinations](/solution/0000-0099/0077.Combinations/README_EN.md)  |  `Array`,`Backtracking`  |  Medium  |    |
|  [0078](https://leetcode.com/problems/subsets)  |  [Subsets](/solution/0000-0099/0078.Subsets/README_EN.md)  |  `Bit Manipulation`,`Array`,`Backtracking`  |  Medium  |    |
|  [0079](https://leetcode.com/problems/word-search)  |  [Word Search](/solution/0000-0099/0079.Word%20Search/README_EN.md)  |  `Array`,`Backtracking`,`Matrix`  |  Medium  |    |
|  [0080](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)  |  [Remove Duplicates from Sorted Array II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md)  |  `Array`,`Two Pointers`  |  Medium  |    |
|  [0081](https://leetcode.com/problems/search-in-rotated-sorted-array-ii)  |  [Search in Rotated Sorted Array II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [0082](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii)  |  [Remove Duplicates from Sorted List II](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README_EN.md)  |  `Linked List`,`Two Pointers`  |  Medium  |    |
|  [0083](https://leetcode.com/problems/remove-duplicates-from-sorted-list)  |  [Remove Duplicates from Sorted List](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README_EN.md)  |  `Linked List`  |  Easy  |    |
|  [0084](https://leetcode.com/problems/largest-rectangle-in-histogram)  |  [Largest Rectangle in Histogram](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README_EN.md)  |  `Stack`,`Array`,`Monotonic Stack`  |  Hard  |    |
|  [0085](https://leetcode.com/problems/maximal-rectangle)  |  [Maximal Rectangle](/solution/0000-0099/0085.Maximal%20Rectangle/README_EN.md)  |  `Stack`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack`  |  Hard  |    |
|  [0086](https://leetcode.com/problems/partition-list)  |  [Partition List](/solution/0000-0099/0086.Partition%20List/README_EN.md)  |  `Linked List`,`Two Pointers`  |  Medium  |    |
|  [0087](https://leetcode.com/problems/scramble-string)  |  [Scramble String](/solution/0000-0099/0087.Scramble%20String/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0088](https://leetcode.com/problems/merge-sorted-array)  |  [Merge Sorted Array](/solution/0000-0099/0088.Merge%20Sorted%20Array/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Easy  |    |
|  [0089](https://leetcode.com/problems/gray-code)  |  [Gray Code](/solution/0000-0099/0089.Gray%20Code/README_EN.md)  |  `Bit Manipulation`,`Math`,`Backtracking`  |  Medium  |    |
|  [0090](https://leetcode.com/problems/subsets-ii)  |  [Subsets II](/solution/0000-0099/0090.Subsets%20II/README_EN.md)  |  `Bit Manipulation`,`Array`,`Backtracking`  |  Medium  |    |
|  [0091](https://leetcode.com/problems/decode-ways)  |  [Decode Ways](/solution/0000-0099/0091.Decode%20Ways/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [0092](https://leetcode.com/problems/reverse-linked-list-ii)  |  [Reverse Linked List II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README_EN.md)  |  `Linked List`  |  Medium  |    |
|  [0093](https://leetcode.com/problems/restore-ip-addresses)  |  [Restore IP Addresses](/solution/0000-0099/0093.Restore%20IP%20Addresses/README_EN.md)  |  `String`,`Backtracking`  |  Medium  |    |
|  [0094](https://leetcode.com/problems/binary-tree-inorder-traversal)  |  [Binary Tree Inorder Traversal](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0095](https://leetcode.com/problems/unique-binary-search-trees-ii)  |  [Unique Binary Search Trees II](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Dynamic Programming`,`Backtracking`,`Binary Tree`  |  Medium  |    |
|  [0096](https://leetcode.com/problems/unique-binary-search-trees)  |  [Unique Binary Search Trees](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Math`,`Dynamic Programming`,`Binary Tree`  |  Medium  |    |
|  [0097](https://leetcode.com/problems/interleaving-string)  |  [Interleaving String](/solution/0000-0099/0097.Interleaving%20String/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [0098](https://leetcode.com/problems/validate-binary-search-tree)  |  [Validate Binary Search Tree](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Medium  |    |
|  [0099](https://leetcode.com/problems/recover-binary-search-tree)  |  [Recover Binary Search Tree](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Medium  |    |
|  [0100](https://leetcode.com/problems/same-tree)  |  [Same Tree](/solution/0100-0199/0100.Same%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0101](https://leetcode.com/problems/symmetric-tree)  |  [Symmetric Tree](/solution/0100-0199/0101.Symmetric%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0102](https://leetcode.com/problems/binary-tree-level-order-traversal)  |  [Binary Tree Level Order Traversal](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README_EN.md)  |  `Tree`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0103](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)  |  [Binary Tree Zigzag Level Order Traversal](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README_EN.md)  |  `Tree`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0104](https://leetcode.com/problems/maximum-depth-of-binary-tree)  |  [Maximum Depth of Binary Tree](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0105](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)  |  [Construct Binary Tree from Preorder and Inorder Traversal](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README_EN.md)  |  `Tree`,`Array`,`Hash Table`,`Divide and Conquer`,`Binary Tree`  |  Medium  |    |
|  [0106](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal)  |  [Construct Binary Tree from Inorder and Postorder Traversal](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README_EN.md)  |  `Tree`,`Array`,`Hash Table`,`Divide and Conquer`,`Binary Tree`  |  Medium  |    |
|  [0107](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)  |  [Binary Tree Level Order Traversal II](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README_EN.md)  |  `Tree`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0108](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)  |  [Convert Sorted Array to Binary Search Tree](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Array`,`Divide and Conquer`,`Binary Tree`  |  Easy  |    |
|  [0109](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree)  |  [Convert Sorted List to Binary Search Tree](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Linked List`,`Divide and Conquer`,`Binary Tree`  |  Medium  |    |
|  [0110](https://leetcode.com/problems/balanced-binary-tree)  |  [Balanced Binary Tree](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0111](https://leetcode.com/problems/minimum-depth-of-binary-tree)  |  [Minimum Depth of Binary Tree](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0112](https://leetcode.com/problems/path-sum)  |  [Path Sum](/solution/0100-0199/0112.Path%20Sum/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0113](https://leetcode.com/problems/path-sum-ii)  |  [Path Sum II](/solution/0100-0199/0113.Path%20Sum%20II/README_EN.md)  |  `Tree`,`Depth-First Search`,`Backtracking`,`Binary Tree`  |  Medium  |    |
|  [0114](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)  |  [Flatten Binary Tree to Linked List](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`,`Linked List`,`Binary Tree`  |  Medium  |    |
|  [0115](https://leetcode.com/problems/distinct-subsequences)  |  [Distinct Subsequences](/solution/0100-0199/0115.Distinct%20Subsequences/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0116](https://leetcode.com/problems/populating-next-right-pointers-in-each-node)  |  [Populating Next Right Pointers in Each Node](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0117](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii)  |  [Populating Next Right Pointers in Each Node II](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0118](https://leetcode.com/problems/pascals-triangle)  |  [Pascal's Triangle](/solution/0100-0199/0118.Pascal%27s%20Triangle/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Easy  |    |
|  [0119](https://leetcode.com/problems/pascals-triangle-ii)  |  [Pascal's Triangle II](/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Easy  |    |
|  [0120](https://leetcode.com/problems/triangle)  |  [Triangle](/solution/0100-0199/0120.Triangle/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0121](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)  |  [Best Time to Buy and Sell Stock](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Easy  |    |
|  [0122](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)  |  [Best Time to Buy and Sell Stock II](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Easy  |    |
|  [0123](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii)  |  [Best Time to Buy and Sell Stock III](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [0124](https://leetcode.com/problems/binary-tree-maximum-path-sum)  |  [Binary Tree Maximum Path Sum](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README_EN.md)  |  `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree`  |  Hard  |    |
|  [0125](https://leetcode.com/problems/valid-palindrome)  |  [Valid Palindrome](/solution/0100-0199/0125.Valid%20Palindrome/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |    |
|  [0126](https://leetcode.com/problems/word-ladder-ii)  |  [Word Ladder II](/solution/0100-0199/0126.Word%20Ladder%20II/README_EN.md)  |  `Breadth-First Search`,`Hash Table`,`String`,`Backtracking`  |  Hard  |    |
|  [0127](https://leetcode.com/problems/word-ladder)  |  [Word Ladder](/solution/0100-0199/0127.Word%20Ladder/README_EN.md)  |  `Breadth-First Search`,`Hash Table`,`String`  |  Hard  |    |
|  [0128](https://leetcode.com/problems/longest-consecutive-sequence)  |  [Longest Consecutive Sequence](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README_EN.md)  |  `Union Find`,`Array`,`Hash Table`  |  Medium  |    |
|  [0129](https://leetcode.com/problems/sum-root-to-leaf-numbers)  |  [Sum Root to Leaf Numbers](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0130](https://leetcode.com/problems/surrounded-regions)  |  [Surrounded Regions](/solution/0100-0199/0130.Surrounded%20Regions/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Medium  |    |
|  [0131](https://leetcode.com/problems/palindrome-partitioning)  |  [Palindrome Partitioning](/solution/0100-0199/0131.Palindrome%20Partitioning/README_EN.md)  |  `String`,`Dynamic Programming`,`Backtracking`  |  Medium  |    |
|  [0132](https://leetcode.com/problems/palindrome-partitioning-ii)  |  [Palindrome Partitioning II](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0133](https://leetcode.com/problems/clone-graph)  |  [Clone Graph](/solution/0100-0199/0133.Clone%20Graph/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Hash Table`  |  Medium  |    |
|  [0134](https://leetcode.com/problems/gas-station)  |  [Gas Station](/solution/0100-0199/0134.Gas%20Station/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [0135](https://leetcode.com/problems/candy)  |  [Candy](/solution/0100-0199/0135.Candy/README_EN.md)  |  `Greedy`,`Array`  |  Hard  |    |
|  [0136](https://leetcode.com/problems/single-number)  |  [Single Number](/solution/0100-0199/0136.Single%20Number/README_EN.md)  |  `Bit Manipulation`,`Array`  |  Easy  |    |
|  [0137](https://leetcode.com/problems/single-number-ii)  |  [Single Number II](/solution/0100-0199/0137.Single%20Number%20II/README_EN.md)  |  `Bit Manipulation`,`Array`  |  Medium  |    |
|  [0138](https://leetcode.com/problems/copy-list-with-random-pointer)  |  [Copy List with Random Pointer](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README_EN.md)  |  `Hash Table`,`Linked List`  |  Medium  |    |
|  [0139](https://leetcode.com/problems/word-break)  |  [Word Break](/solution/0100-0199/0139.Word%20Break/README_EN.md)  |  `Trie`,`Memoization`,`Hash Table`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [0140](https://leetcode.com/problems/word-break-ii)  |  [Word Break II](/solution/0100-0199/0140.Word%20Break%20II/README_EN.md)  |  `Trie`,`Memoization`,`Hash Table`,`String`,`Dynamic Programming`,`Backtracking`  |  Hard  |    |
|  [0141](https://leetcode.com/problems/linked-list-cycle)  |  [Linked List Cycle](/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md)  |  `Hash Table`,`Linked List`,`Two Pointers`  |  Easy  |    |
|  [0142](https://leetcode.com/problems/linked-list-cycle-ii)  |  [Linked List Cycle II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md)  |  `Hash Table`,`Linked List`,`Two Pointers`  |  Medium  |    |
|  [0143](https://leetcode.com/problems/reorder-list)  |  [Reorder List](/solution/0100-0199/0143.Reorder%20List/README_EN.md)  |  `Stack`,`Recursion`,`Linked List`,`Two Pointers`  |  Medium  |    |
|  [0144](https://leetcode.com/problems/binary-tree-preorder-traversal)  |  [Binary Tree Preorder Traversal](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0145](https://leetcode.com/problems/binary-tree-postorder-traversal)  |  [Binary Tree Postorder Traversal](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0146](https://leetcode.com/problems/lru-cache)  |  [LRU Cache](/solution/0100-0199/0146.LRU%20Cache/README_EN.md)  |  `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List`  |  Medium  |    |
|  [0147](https://leetcode.com/problems/insertion-sort-list)  |  [Insertion Sort List](/solution/0100-0199/0147.Insertion%20Sort%20List/README_EN.md)  |  `Linked List`,`Sorting`  |  Medium  |    |
|  [0148](https://leetcode.com/problems/sort-list)  |  [Sort List](/solution/0100-0199/0148.Sort%20List/README_EN.md)  |  `Linked List`,`Two Pointers`,`Divide and Conquer`,`Sorting`,`Merge Sort`  |  Medium  |    |
|  [0149](https://leetcode.com/problems/max-points-on-a-line)  |  [Max Points on a Line](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README_EN.md)  |  `Geometry`,`Hash Table`,`Math`  |  Hard  |    |
|  [0150](https://leetcode.com/problems/evaluate-reverse-polish-notation)  |  [Evaluate Reverse Polish Notation](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README_EN.md)  |  `Stack`,`Array`,`Math`  |  Medium  |    |
|  [0151](https://leetcode.com/problems/reverse-words-in-a-string)  |  [Reverse Words in a String](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README_EN.md)  |  `Two Pointers`,`String`  |  Medium  |    |
|  [0152](https://leetcode.com/problems/maximum-product-subarray)  |  [Maximum Product Subarray](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0153](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)  |  [Find Minimum in Rotated Sorted Array](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [0154](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii)  |  [Find Minimum in Rotated Sorted Array II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README_EN.md)  |  `Array`,`Binary Search`  |  Hard  |    |
|  [0155](https://leetcode.com/problems/min-stack)  |  [Min Stack](/solution/0100-0199/0155.Min%20Stack/README_EN.md)  |  `Stack`,`Design`  |  Easy  |    |
|  [0156](https://leetcode.com/problems/binary-tree-upside-down)  |  [Binary Tree Upside Down](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [0157](https://leetcode.com/problems/read-n-characters-given-read4)  |  [Read N Characters Given Read4](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README_EN.md)  |  `String`,`Interactive`,`Simulation`  |  Easy  |  🔒  |
|  [0158](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times)  |  [Read N Characters Given Read4 II - Call multiple times](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times/README_EN.md)  |  `String`,`Interactive`,`Simulation`  |  Hard  |  🔒  |
|  [0159](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters)  |  [Longest Substring with At Most Two Distinct Characters](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |  🔒  |
|  [0160](https://leetcode.com/problems/intersection-of-two-linked-lists)  |  [Intersection of Two Linked Lists](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README_EN.md)  |  `Hash Table`,`Linked List`,`Two Pointers`  |  Easy  |    |
|  [0161](https://leetcode.com/problems/one-edit-distance)  |  [One Edit Distance](/solution/0100-0199/0161.One%20Edit%20Distance/README_EN.md)  |  `Two Pointers`,`String`  |  Medium  |  🔒  |
|  [0162](https://leetcode.com/problems/find-peak-element)  |  [Find Peak Element](/solution/0100-0199/0162.Find%20Peak%20Element/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [0163](https://leetcode.com/problems/missing-ranges)  |  [Missing Ranges](/solution/0100-0199/0163.Missing%20Ranges/README_EN.md)  |  `Array`  |  Easy  |  🔒  |
|  [0164](https://leetcode.com/problems/maximum-gap)  |  [Maximum Gap](/solution/0100-0199/0164.Maximum%20Gap/README_EN.md)  |  `Array`,`Bucket Sort`,`Radix Sort`,`Sorting`  |  Hard  |    |
|  [0165](https://leetcode.com/problems/compare-version-numbers)  |  [Compare Version Numbers](/solution/0100-0199/0165.Compare%20Version%20Numbers/README_EN.md)  |  `Two Pointers`,`String`  |  Medium  |    |
|  [0166](https://leetcode.com/problems/fraction-to-recurring-decimal)  |  [Fraction to Recurring Decimal](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README_EN.md)  |  `Hash Table`,`Math`,`String`  |  Medium  |    |
|  [0167](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)  |  [Two Sum II - Input array is sorted](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20array%20is%20sorted/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`  |  Easy  |    |
|  [0168](https://leetcode.com/problems/excel-sheet-column-title)  |  [Excel Sheet Column Title](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README_EN.md)  |  `Math`,`String`  |  Easy  |    |
|  [0169](https://leetcode.com/problems/majority-element)  |  [Majority Element](/solution/0100-0199/0169.Majority%20Element/README_EN.md)  |  `Array`,`Hash Table`,`Divide and Conquer`,`Counting`,`Sorting`  |  Easy  |    |
|  [0170](https://leetcode.com/problems/two-sum-iii-data-structure-design)  |  [Two Sum III - Data structure design](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Two Pointers`,`Data Stream`  |  Easy  |  🔒  |
|  [0171](https://leetcode.com/problems/excel-sheet-column-number)  |  [Excel Sheet Column Number](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README_EN.md)  |  `Math`,`String`  |  Easy  |    |
|  [0172](https://leetcode.com/problems/factorial-trailing-zeroes)  |  [Factorial Trailing Zeroes](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README_EN.md)  |  `Math`  |  Easy  |    |
|  [0173](https://leetcode.com/problems/binary-search-tree-iterator)  |  [Binary Search Tree Iterator](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README_EN.md)  |  `Stack`,`Tree`,`Design`,`Binary Search Tree`,`Binary Tree`,`Iterator`  |  Medium  |    |
|  [0174](https://leetcode.com/problems/dungeon-game)  |  [Dungeon Game](/solution/0100-0199/0174.Dungeon%20Game/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Hard  |    |
|  [0175](https://leetcode.com/problems/combine-two-tables)  |  [Combine Two Tables](/solution/0100-0199/0175.Combine%20Two%20Tables/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0176](https://leetcode.com/problems/second-highest-salary)  |  [Second Highest Salary](/solution/0100-0199/0176.Second%20Highest%20Salary/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0177](https://leetcode.com/problems/nth-highest-salary)  |  [Nth Highest Salary](/solution/0100-0199/0177.Nth%20Highest%20Salary/README_EN.md)  |  `Database`  |  Medium  |    |
|  [0178](https://leetcode.com/problems/rank-scores)  |  [Rank Scores](/solution/0100-0199/0178.Rank%20Scores/README_EN.md)  |  `Database`  |  Medium  |    |
|  [0179](https://leetcode.com/problems/largest-number)  |  [Largest Number](/solution/0100-0199/0179.Largest%20Number/README_EN.md)  |  `Greedy`,`String`,`Sorting`  |  Medium  |    |
|  [0180](https://leetcode.com/problems/consecutive-numbers)  |  [Consecutive Numbers](/solution/0100-0199/0180.Consecutive%20Numbers/README_EN.md)  |  `Database`  |  Medium  |    |
|  [0181](https://leetcode.com/problems/employees-earning-more-than-their-managers)  |  [Employees Earning More Than Their Managers](/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0182](https://leetcode.com/problems/duplicate-emails)  |  [Duplicate Emails](/solution/0100-0199/0182.Duplicate%20Emails/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0183](https://leetcode.com/problems/customers-who-never-order)  |  [Customers Who Never Order](/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0184](https://leetcode.com/problems/department-highest-salary)  |  [Department Highest Salary](/solution/0100-0199/0184.Department%20Highest%20Salary/README_EN.md)  |  `Database`  |  Medium  |    |
|  [0185](https://leetcode.com/problems/department-top-three-salaries)  |  [Department Top Three Salaries](/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README_EN.md)  |  `Database`  |  Hard  |    |
|  [0186](https://leetcode.com/problems/reverse-words-in-a-string-ii)  |  [Reverse Words in a String II](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README_EN.md)  |  `Two Pointers`,`String`  |  Medium  |  🔒  |
|  [0187](https://leetcode.com/problems/repeated-dna-sequences)  |  [Repeated DNA Sequences](/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README_EN.md)  |  `Bit Manipulation`,`Hash Table`,`String`,`Sliding Window`,`Hash Function`,`Rolling Hash`  |  Medium  |    |
|  [0188](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv)  |  [Best Time to Buy and Sell Stock IV](/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [0189](https://leetcode.com/problems/rotate-array)  |  [Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README_EN.md)  |  `Array`,`Math`,`Two Pointers`  |  Medium  |    |
|  [0190](https://leetcode.com/problems/reverse-bits)  |  [Reverse Bits](/solution/0100-0199/0190.Reverse%20Bits/README_EN.md)  |  `Bit Manipulation`,`Divide and Conquer`  |  Easy  |    |
|  [0191](https://leetcode.com/problems/number-of-1-bits)  |  [Number of 1 Bits](/solution/0100-0199/0191.Number%20of%201%20Bits/README_EN.md)  |  `Bit Manipulation`  |  Easy  |    |
|  [0192](https://leetcode.com/problems/word-frequency)  |  [Word Frequency](/solution/0100-0199/0192.Word%20Frequency/README_EN.md)  |  `Shell`  |  Medium  |    |
|  [0193](https://leetcode.com/problems/valid-phone-numbers)  |  [Valid Phone Numbers](/solution/0100-0199/0193.Valid%20Phone%20Numbers/README_EN.md)  |  `Shell`  |  Easy  |    |
|  [0194](https://leetcode.com/problems/transpose-file)  |  [Transpose File](/solution/0100-0199/0194.Transpose%20File/README_EN.md)  |  `Shell`  |  Medium  |    |
|  [0195](https://leetcode.com/problems/tenth-line)  |  [Tenth Line](/solution/0100-0199/0195.Tenth%20Line/README_EN.md)  |  `Shell`  |  Easy  |    |
|  [0196](https://leetcode.com/problems/delete-duplicate-emails)  |  [Delete Duplicate Emails](/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0197](https://leetcode.com/problems/rising-temperature)  |  [Rising Temperature](/solution/0100-0199/0197.Rising%20Temperature/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0198](https://leetcode.com/problems/house-robber)  |  [House Robber](/solution/0100-0199/0198.House%20Robber/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0199](https://leetcode.com/problems/binary-tree-right-side-view)  |  [Binary Tree Right Side View](/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0200](https://leetcode.com/problems/number-of-islands)  |  [Number of Islands](/solution/0200-0299/0200.Number%20of%20Islands/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Medium  |    |
|  [0201](https://leetcode.com/problems/bitwise-and-of-numbers-range)  |  [Bitwise AND of Numbers Range](/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README_EN.md)  |  `Bit Manipulation`  |  Medium  |    |
|  [0202](https://leetcode.com/problems/happy-number)  |  [Happy Number](/solution/0200-0299/0202.Happy%20Number/README_EN.md)  |  `Hash Table`,`Math`,`Two Pointers`  |  Easy  |    |
|  [0203](https://leetcode.com/problems/remove-linked-list-elements)  |  [Remove Linked List Elements](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README_EN.md)  |  `Recursion`,`Linked List`  |  Easy  |    |
|  [0204](https://leetcode.com/problems/count-primes)  |  [Count Primes](/solution/0200-0299/0204.Count%20Primes/README_EN.md)  |  `Array`,`Math`,`Enumeration`,`Number Theory`  |  Easy  |    |
|  [0205](https://leetcode.com/problems/isomorphic-strings)  |  [Isomorphic Strings](/solution/0200-0299/0205.Isomorphic%20Strings/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [0206](https://leetcode.com/problems/reverse-linked-list)  |  [Reverse Linked List](/solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md)  |  `Recursion`,`Linked List`  |  Easy  |    |
|  [0207](https://leetcode.com/problems/course-schedule)  |  [Course Schedule](/solution/0200-0299/0207.Course%20Schedule/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`  |  Medium  |    |
|  [0208](https://leetcode.com/problems/implement-trie-prefix-tree)  |  [Implement Trie (Prefix Tree)](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README_EN.md)  |  `Design`,`Trie`,`Hash Table`,`String`  |  Medium  |    |
|  [0209](https://leetcode.com/problems/minimum-size-subarray-sum)  |  [Minimum Size Subarray Sum](/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README_EN.md)  |  `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window`  |  Medium  |    |
|  [0210](https://leetcode.com/problems/course-schedule-ii)  |  [Course Schedule II](/solution/0200-0299/0210.Course%20Schedule%20II/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`  |  Medium  |    |
|  [0211](https://leetcode.com/problems/design-add-and-search-words-data-structure)  |  [Design Add and Search Words Data Structure](/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README_EN.md)  |  `Depth-First Search`,`Design`,`Trie`,`String`  |  Medium  |    |
|  [0212](https://leetcode.com/problems/word-search-ii)  |  [Word Search II](/solution/0200-0299/0212.Word%20Search%20II/README_EN.md)  |  `Trie`,`Array`,`String`,`Backtracking`,`Matrix`  |  Hard  |    |
|  [0213](https://leetcode.com/problems/house-robber-ii)  |  [House Robber II](/solution/0200-0299/0213.House%20Robber%20II/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0214](https://leetcode.com/problems/shortest-palindrome)  |  [Shortest Palindrome](/solution/0200-0299/0214.Shortest%20Palindrome/README_EN.md)  |  `String`,`String Matching`,`Hash Function`,`Rolling Hash`  |  Hard  |    |
|  [0215](https://leetcode.com/problems/kth-largest-element-in-an-array)  |  [Kth Largest Element in an Array](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README_EN.md)  |  `Array`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0216](https://leetcode.com/problems/combination-sum-iii)  |  [Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md)  |  `Array`,`Backtracking`  |  Medium  |    |
|  [0217](https://leetcode.com/problems/contains-duplicate)  |  [Contains Duplicate](/solution/0200-0299/0217.Contains%20Duplicate/README_EN.md)  |  `Array`,`Hash Table`,`Sorting`  |  Easy  |    |
|  [0218](https://leetcode.com/problems/the-skyline-problem)  |  [The Skyline Problem](/solution/0200-0299/0218.The%20Skyline%20Problem/README_EN.md)  |  `Binary Indexed Tree`,`Segment Tree`,`Array`,`Divide and Conquer`,`Ordered Set`,`Line Sweep`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0219](https://leetcode.com/problems/contains-duplicate-ii)  |  [Contains Duplicate II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README_EN.md)  |  `Array`,`Hash Table`,`Sliding Window`  |  Easy  |    |
|  [0220](https://leetcode.com/problems/contains-duplicate-iii)  |  [Contains Duplicate III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README_EN.md)  |  `Array`,`Bucket Sort`,`Ordered Set`,`Sorting`,`Sliding Window`  |  Medium  |    |
|  [0221](https://leetcode.com/problems/maximal-square)  |  [Maximal Square](/solution/0200-0299/0221.Maximal%20Square/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |    |
|  [0222](https://leetcode.com/problems/count-complete-tree-nodes)  |  [Count Complete Tree Nodes](/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search`,`Binary Tree`  |  Medium  |    |
|  [0223](https://leetcode.com/problems/rectangle-area)  |  [Rectangle Area](/solution/0200-0299/0223.Rectangle%20Area/README_EN.md)  |  `Geometry`,`Math`  |  Medium  |    |
|  [0224](https://leetcode.com/problems/basic-calculator)  |  [Basic Calculator](/solution/0200-0299/0224.Basic%20Calculator/README_EN.md)  |  `Stack`,`Recursion`,`Math`,`String`  |  Hard  |    |
|  [0225](https://leetcode.com/problems/implement-stack-using-queues)  |  [Implement Stack using Queues](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README_EN.md)  |  `Stack`,`Design`,`Queue`  |  Easy  |    |
|  [0226](https://leetcode.com/problems/invert-binary-tree)  |  [Invert Binary Tree](/solution/0200-0299/0226.Invert%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0227](https://leetcode.com/problems/basic-calculator-ii)  |  [Basic Calculator II](/solution/0200-0299/0227.Basic%20Calculator%20II/README_EN.md)  |  `Stack`,`Math`,`String`  |  Medium  |    |
|  [0228](https://leetcode.com/problems/summary-ranges)  |  [Summary Ranges](/solution/0200-0299/0228.Summary%20Ranges/README_EN.md)  |  `Array`  |  Easy  |    |
|  [0229](https://leetcode.com/problems/majority-element-ii)  |  [Majority Element II](/solution/0200-0299/0229.Majority%20Element%20II/README_EN.md)  |  `Array`,`Hash Table`,`Counting`,`Sorting`  |  Medium  |    |
|  [0230](https://leetcode.com/problems/kth-smallest-element-in-a-bst)  |  [Kth Smallest Element in a BST](/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Medium  |    |
|  [0231](https://leetcode.com/problems/power-of-two)  |  [Power of Two](/solution/0200-0299/0231.Power%20of%20Two/README_EN.md)  |  `Bit Manipulation`,`Recursion`,`Math`  |  Easy  |    |
|  [0232](https://leetcode.com/problems/implement-queue-using-stacks)  |  [Implement Queue using Stacks](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README_EN.md)  |  `Stack`,`Design`,`Queue`  |  Easy  |    |
|  [0233](https://leetcode.com/problems/number-of-digit-one)  |  [Number of Digit One](/solution/0200-0299/0233.Number%20of%20Digit%20One/README_EN.md)  |  `Recursion`,`Math`,`Dynamic Programming`  |  Hard  |    |
|  [0234](https://leetcode.com/problems/palindrome-linked-list)  |  [Palindrome Linked List](/solution/0200-0299/0234.Palindrome%20Linked%20List/README_EN.md)  |  `Stack`,`Recursion`,`Linked List`,`Two Pointers`  |  Easy  |    |
|  [0235](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)  |  [Lowest Common Ancestor of a Binary Search Tree](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Easy  |    |
|  [0236](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)  |  [Lowest Common Ancestor of a Binary Tree](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0237](https://leetcode.com/problems/delete-node-in-a-linked-list)  |  [Delete Node in a Linked List](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README_EN.md)  |  `Linked List`  |  Easy  |    |
|  [0238](https://leetcode.com/problems/product-of-array-except-self)  |  [Product of Array Except Self](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README_EN.md)  |  `Array`,`Prefix Sum`  |  Medium  |    |
|  [0239](https://leetcode.com/problems/sliding-window-maximum)  |  [Sliding Window Maximum](/solution/0200-0299/0239.Sliding%20Window%20Maximum/README_EN.md)  |  `Queue`,`Array`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0240](https://leetcode.com/problems/search-a-2d-matrix-ii)  |  [Search a 2D Matrix II](/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README_EN.md)  |  `Array`,`Binary Search`,`Divide and Conquer`,`Matrix`  |  Medium  |    |
|  [0241](https://leetcode.com/problems/different-ways-to-add-parentheses)  |  [Different Ways to Add Parentheses](/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README_EN.md)  |  `Recursion`,`Memoization`,`Math`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [0242](https://leetcode.com/problems/valid-anagram)  |  [Valid Anagram](/solution/0200-0299/0242.Valid%20Anagram/README_EN.md)  |  `Hash Table`,`String`,`Sorting`  |  Easy  |    |
|  [0243](https://leetcode.com/problems/shortest-word-distance)  |  [Shortest Word Distance](/solution/0200-0299/0243.Shortest%20Word%20Distance/README_EN.md)  |  `Array`,`String`  |  Easy  |  🔒  |
|  [0244](https://leetcode.com/problems/shortest-word-distance-ii)  |  [Shortest Word Distance II](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Two Pointers`,`String`  |  Medium  |  🔒  |
|  [0245](https://leetcode.com/problems/shortest-word-distance-iii)  |  [Shortest Word Distance III](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README_EN.md)  |  `Array`,`String`  |  Medium  |  🔒  |
|  [0246](https://leetcode.com/problems/strobogrammatic-number)  |  [Strobogrammatic Number](/solution/0200-0299/0246.Strobogrammatic%20Number/README_EN.md)  |  `Hash Table`,`Two Pointers`,`String`  |  Easy  |  🔒  |
|  [0247](https://leetcode.com/problems/strobogrammatic-number-ii)  |  [Strobogrammatic Number II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README_EN.md)  |  `Recursion`,`Array`,`String`  |  Medium  |  🔒  |
|  [0248](https://leetcode.com/problems/strobogrammatic-number-iii)  |  [Strobogrammatic Number III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README_EN.md)  |  `Recursion`,`Array`,`String`  |  Hard  |  🔒  |
|  [0249](https://leetcode.com/problems/group-shifted-strings)  |  [Group Shifted Strings](/solution/0200-0299/0249.Group%20Shifted%20Strings/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |  🔒  |
|  [0250](https://leetcode.com/problems/count-univalue-subtrees)  |  [Count Univalue Subtrees](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [0251](https://leetcode.com/problems/flatten-2d-vector)  |  [Flatten 2D Vector](/solution/0200-0299/0251.Flatten%202D%20Vector/README_EN.md)  |  `Design`,`Array`,`Two Pointers`,`Iterator`  |  Medium  |  🔒  |
|  [0252](https://leetcode.com/problems/meeting-rooms)  |  [Meeting Rooms](/solution/0200-0299/0252.Meeting%20Rooms/README_EN.md)  |  `Array`,`Sorting`  |  Easy  |  🔒  |
|  [0253](https://leetcode.com/problems/meeting-rooms-ii)  |  [Meeting Rooms II](/solution/0200-0299/0253.Meeting%20Rooms%20II/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |  🔒  |
|  [0254](https://leetcode.com/problems/factor-combinations)  |  [Factor Combinations](/solution/0200-0299/0254.Factor%20Combinations/README_EN.md)  |  `Array`,`Backtracking`  |  Medium  |  🔒  |
|  [0255](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree)  |  [Verify Preorder Sequence in Binary Search Tree](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README_EN.md)  |  `Stack`,`Tree`,`Binary Search Tree`,`Recursion`,`Binary Tree`,`Monotonic Stack`  |  Medium  |  🔒  |
|  [0256](https://leetcode.com/problems/paint-house)  |  [Paint House](/solution/0200-0299/0256.Paint%20House/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |  🔒  |
|  [0257](https://leetcode.com/problems/binary-tree-paths)  |  [Binary Tree Paths](/solution/0200-0299/0257.Binary%20Tree%20Paths/README_EN.md)  |  `Tree`,`Depth-First Search`,`String`,`Binary Tree`  |  Easy  |    |
|  [0258](https://leetcode.com/problems/add-digits)  |  [Add Digits](/solution/0200-0299/0258.Add%20Digits/README_EN.md)  |  `Math`,`Number Theory`,`Simulation`  |  Easy  |    |
|  [0259](https://leetcode.com/problems/3sum-smaller)  |  [3Sum Smaller](/solution/0200-0299/0259.3Sum%20Smaller/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`,`Sorting`  |  Medium  |  🔒  |
|  [0260](https://leetcode.com/problems/single-number-iii)  |  [Single Number III](/solution/0200-0299/0260.Single%20Number%20III/README_EN.md)  |  `Bit Manipulation`,`Array`  |  Medium  |    |
|  [0261](https://leetcode.com/problems/graph-valid-tree)  |  [Graph Valid Tree](/solution/0200-0299/0261.Graph%20Valid%20Tree/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Medium  |  🔒  |
|  [0262](https://leetcode.com/problems/trips-and-users)  |  [Trips and Users](/solution/0200-0299/0262.Trips%20and%20Users/README_EN.md)  |  `Database`  |  Hard  |    |
|  [0263](https://leetcode.com/problems/ugly-number)  |  [Ugly Number](/solution/0200-0299/0263.Ugly%20Number/README_EN.md)  |  `Math`  |  Easy  |    |
|  [0264](https://leetcode.com/problems/ugly-number-ii)  |  [Ugly Number II](/solution/0200-0299/0264.Ugly%20Number%20II/README_EN.md)  |  `Hash Table`,`Math`,`Dynamic Programming`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0265](https://leetcode.com/problems/paint-house-ii)  |  [Paint House II](/solution/0200-0299/0265.Paint%20House%20II/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |  🔒  |
|  [0266](https://leetcode.com/problems/palindrome-permutation)  |  [Palindrome Permutation](/solution/0200-0299/0266.Palindrome%20Permutation/README_EN.md)  |  `Bit Manipulation`,`Hash Table`,`String`  |  Easy  |  🔒  |
|  [0267](https://leetcode.com/problems/palindrome-permutation-ii)  |  [Palindrome Permutation II](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README_EN.md)  |  `Hash Table`,`String`,`Backtracking`  |  Medium  |  🔒  |
|  [0268](https://leetcode.com/problems/missing-number)  |  [Missing Number](/solution/0200-0299/0268.Missing%20Number/README_EN.md)  |  `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Sorting`  |  Easy  |    |
|  [0269](https://leetcode.com/problems/alien-dictionary)  |  [Alien Dictionary](/solution/0200-0299/0269.Alien%20Dictionary/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Array`,`String`  |  Hard  |  🔒  |
|  [0270](https://leetcode.com/problems/closest-binary-search-tree-value)  |  [Closest Binary Search Tree Value](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Search`,`Binary Tree`  |  Easy  |  🔒  |
|  [0271](https://leetcode.com/problems/encode-and-decode-strings)  |  [Encode and Decode Strings](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README_EN.md)  |  `Design`,`Array`,`String`  |  Medium  |  🔒  |
|  [0272](https://leetcode.com/problems/closest-binary-search-tree-value-ii)  |  [Closest Binary Search Tree Value II](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Two Pointers`,`Binary Tree`,`Heap (Priority Queue)`  |  Hard  |  🔒  |
|  [0273](https://leetcode.com/problems/integer-to-english-words)  |  [Integer to English Words](/solution/0200-0299/0273.Integer%20to%20English%20Words/README_EN.md)  |  `Recursion`,`Math`,`String`  |  Hard  |    |
|  [0274](https://leetcode.com/problems/h-index)  |  [H-Index](/solution/0200-0299/0274.H-Index/README_EN.md)  |  `Array`,`Counting Sort`,`Sorting`  |  Medium  |    |
|  [0275](https://leetcode.com/problems/h-index-ii)  |  [H-Index II](/solution/0200-0299/0275.H-Index%20II/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [0276](https://leetcode.com/problems/paint-fence)  |  [Paint Fence](/solution/0200-0299/0276.Paint%20Fence/README_EN.md)  |  `Dynamic Programming`  |  Medium  |  🔒  |
|  [0277](https://leetcode.com/problems/find-the-celebrity)  |  [Find the Celebrity](/solution/0200-0299/0277.Find%20the%20Celebrity/README_EN.md)  |  `Greedy`,`Graph`,`Two Pointers`,`Interactive`  |  Medium  |  🔒  |
|  [0278](https://leetcode.com/problems/first-bad-version)  |  [First Bad Version](/solution/0200-0299/0278.First%20Bad%20Version/README_EN.md)  |  `Binary Search`,`Interactive`  |  Easy  |    |
|  [0279](https://leetcode.com/problems/perfect-squares)  |  [Perfect Squares](/solution/0200-0299/0279.Perfect%20Squares/README_EN.md)  |  `Breadth-First Search`,`Math`,`Dynamic Programming`  |  Medium  |    |
|  [0280](https://leetcode.com/problems/wiggle-sort)  |  [Wiggle Sort](/solution/0200-0299/0280.Wiggle%20Sort/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |  🔒  |
|  [0281](https://leetcode.com/problems/zigzag-iterator)  |  [Zigzag Iterator](/solution/0200-0299/0281.Zigzag%20Iterator/README_EN.md)  |  `Design`,`Queue`,`Array`,`Iterator`  |  Medium  |  🔒  |
|  [0282](https://leetcode.com/problems/expression-add-operators)  |  [Expression Add Operators](/solution/0200-0299/0282.Expression%20Add%20Operators/README_EN.md)  |  `Math`,`String`,`Backtracking`  |  Hard  |    |
|  [0283](https://leetcode.com/problems/move-zeroes)  |  [Move Zeroes](/solution/0200-0299/0283.Move%20Zeroes/README_EN.md)  |  `Array`,`Two Pointers`  |  Easy  |    |
|  [0284](https://leetcode.com/problems/peeking-iterator)  |  [Peeking Iterator](/solution/0200-0299/0284.Peeking%20Iterator/README_EN.md)  |  `Design`,`Array`,`Iterator`  |  Medium  |    |
|  [0285](https://leetcode.com/problems/inorder-successor-in-bst)  |  [Inorder Successor in BST](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Medium  |  🔒  |
|  [0286](https://leetcode.com/problems/walls-and-gates)  |  [Walls and Gates](/solution/0200-0299/0286.Walls%20and%20Gates/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Medium  |  🔒  |
|  [0287](https://leetcode.com/problems/find-the-duplicate-number)  |  [Find the Duplicate Number](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README_EN.md)  |  `Bit Manipulation`,`Array`,`Two Pointers`,`Binary Search`  |  Medium  |    |
|  [0288](https://leetcode.com/problems/unique-word-abbreviation)  |  [Unique Word Abbreviation](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`String`  |  Medium  |  🔒  |
|  [0289](https://leetcode.com/problems/game-of-life)  |  [Game of Life](/solution/0200-0299/0289.Game%20of%20Life/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Medium  |    |
|  [0290](https://leetcode.com/problems/word-pattern)  |  [Word Pattern](/solution/0200-0299/0290.Word%20Pattern/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [0291](https://leetcode.com/problems/word-pattern-ii)  |  [Word Pattern II](/solution/0200-0299/0291.Word%20Pattern%20II/README_EN.md)  |  `Hash Table`,`String`,`Backtracking`  |  Medium  |  🔒  |
|  [0292](https://leetcode.com/problems/nim-game)  |  [Nim Game](/solution/0200-0299/0292.Nim%20Game/README_EN.md)  |  `Brainteaser`,`Math`,`Game Theory`  |  Easy  |    |
|  [0293](https://leetcode.com/problems/flip-game)  |  [Flip Game](/solution/0200-0299/0293.Flip%20Game/README_EN.md)  |  `String`  |  Easy  |  🔒  |
|  [0294](https://leetcode.com/problems/flip-game-ii)  |  [Flip Game II](/solution/0200-0299/0294.Flip%20Game%20II/README_EN.md)  |  `Memoization`,`Math`,`Dynamic Programming`,`Backtracking`,`Game Theory`  |  Medium  |  🔒  |
|  [0295](https://leetcode.com/problems/find-median-from-data-stream)  |  [Find Median from Data Stream](/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README_EN.md)  |  `Design`,`Two Pointers`,`Data Stream`,`Sorting`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0296](https://leetcode.com/problems/best-meeting-point)  |  [Best Meeting Point](/solution/0200-0299/0296.Best%20Meeting%20Point/README_EN.md)  |  `Array`,`Math`,`Matrix`,`Sorting`  |  Hard  |  🔒  |
|  [0297](https://leetcode.com/problems/serialize-and-deserialize-binary-tree)  |  [Serialize and Deserialize Binary Tree](/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`String`,`Binary Tree`  |  Hard  |    |
|  [0298](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence)  |  [Binary Tree Longest Consecutive Sequence](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [0299](https://leetcode.com/problems/bulls-and-cows)  |  [Bulls and Cows](/solution/0200-0299/0299.Bulls%20and%20Cows/README_EN.md)  |  `Hash Table`,`String`,`Counting`  |  Medium  |    |
|  [0300](https://leetcode.com/problems/longest-increasing-subsequence)  |  [Longest Increasing Subsequence](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README_EN.md)  |  `Array`,`Binary Search`,`Dynamic Programming`  |  Medium  |    |
|  [0301](https://leetcode.com/problems/remove-invalid-parentheses)  |  [Remove Invalid Parentheses](/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README_EN.md)  |  `Breadth-First Search`,`String`,`Backtracking`  |  Hard  |    |
|  [0302](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels)  |  [Smallest Rectangle Enclosing Black Pixels](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Binary Search`,`Matrix`  |  Hard  |  🔒  |
|  [0303](https://leetcode.com/problems/range-sum-query-immutable)  |  [Range Sum Query - Immutable](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README_EN.md)  |  `Design`,`Array`,`Prefix Sum`  |  Easy  |    |
|  [0304](https://leetcode.com/problems/range-sum-query-2d-immutable)  |  [Range Sum Query 2D - Immutable](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README_EN.md)  |  `Design`,`Array`,`Matrix`,`Prefix Sum`  |  Medium  |    |
|  [0305](https://leetcode.com/problems/number-of-islands-ii)  |  [Number of Islands II](/solution/0300-0399/0305.Number%20of%20Islands%20II/README_EN.md)  |  `Union Find`,`Array`  |  Hard  |  🔒  |
|  [0306](https://leetcode.com/problems/additive-number)  |  [Additive Number](/solution/0300-0399/0306.Additive%20Number/README_EN.md)  |  `String`,`Backtracking`  |  Medium  |    |
|  [0307](https://leetcode.com/problems/range-sum-query-mutable)  |  [Range Sum Query - Mutable](/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README_EN.md)  |  `Design`,`Binary Indexed Tree`,`Segment Tree`,`Array`  |  Medium  |    |
|  [0308](https://leetcode.com/problems/range-sum-query-2d-mutable)  |  [Range Sum Query 2D - Mutable](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README_EN.md)  |  `Design`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Matrix`  |  Hard  |  🔒  |
|  [0309](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown)  |  [Best Time to Buy and Sell Stock with Cooldown](/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0310](https://leetcode.com/problems/minimum-height-trees)  |  [Minimum Height Trees](/solution/0300-0399/0310.Minimum%20Height%20Trees/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`  |  Medium  |    |
|  [0311](https://leetcode.com/problems/sparse-matrix-multiplication)  |  [Sparse Matrix Multiplication](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README_EN.md)  |  `Array`,`Hash Table`,`Matrix`  |  Medium  |  🔒  |
|  [0312](https://leetcode.com/problems/burst-balloons)  |  [Burst Balloons](/solution/0300-0399/0312.Burst%20Balloons/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [0313](https://leetcode.com/problems/super-ugly-number)  |  [Super Ugly Number](/solution/0300-0399/0313.Super%20Ugly%20Number/README_EN.md)  |  `Array`,`Hash Table`,`Math`,`Dynamic Programming`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0314](https://leetcode.com/problems/binary-tree-vertical-order-traversal)  |  [Binary Tree Vertical Order Traversal](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`  |  Medium  |  🔒  |
|  [0315](https://leetcode.com/problems/count-of-smaller-numbers-after-self)  |  [Count of Smaller Numbers After Self](/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README_EN.md)  |  `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort`  |  Hard  |    |
|  [0316](https://leetcode.com/problems/remove-duplicate-letters)  |  [Remove Duplicate Letters](/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README_EN.md)  |  `Stack`,`Greedy`,`String`,`Monotonic Stack`  |  Medium  |    |
|  [0317](https://leetcode.com/problems/shortest-distance-from-all-buildings)  |  [Shortest Distance from All Buildings](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Hard  |  🔒  |
|  [0318](https://leetcode.com/problems/maximum-product-of-word-lengths)  |  [Maximum Product of Word Lengths](/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README_EN.md)  |  `Bit Manipulation`,`Array`,`String`  |  Medium  |    |
|  [0319](https://leetcode.com/problems/bulb-switcher)  |  [Bulb Switcher](/solution/0300-0399/0319.Bulb%20Switcher/README_EN.md)  |  `Brainteaser`,`Math`  |  Medium  |    |
|  [0320](https://leetcode.com/problems/generalized-abbreviation)  |  [Generalized Abbreviation](/solution/0300-0399/0320.Generalized%20Abbreviation/README_EN.md)  |  `Bit Manipulation`,`String`,`Backtracking`  |  Medium  |  🔒  |
|  [0321](https://leetcode.com/problems/create-maximum-number)  |  [Create Maximum Number](/solution/0300-0399/0321.Create%20Maximum%20Number/README_EN.md)  |  `Stack`,`Greedy`,`Monotonic Stack`  |  Hard  |    |
|  [0322](https://leetcode.com/problems/coin-change)  |  [Coin Change](/solution/0300-0399/0322.Coin%20Change/README_EN.md)  |  `Breadth-First Search`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [0323](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph)  |  [Number of Connected Components in an Undirected Graph](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Medium  |  🔒  |
|  [0324](https://leetcode.com/problems/wiggle-sort-ii)  |  [Wiggle Sort II](/solution/0300-0399/0324.Wiggle%20Sort%20II/README_EN.md)  |  `Array`,`Divide and Conquer`,`Quickselect`,`Sorting`  |  Medium  |    |
|  [0325](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k)  |  [Maximum Size Subarray Sum Equals k](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |  🔒  |
|  [0326](https://leetcode.com/problems/power-of-three)  |  [Power of Three](/solution/0300-0399/0326.Power%20of%20Three/README_EN.md)  |  `Recursion`,`Math`  |  Easy  |    |
|  [0327](https://leetcode.com/problems/count-of-range-sum)  |  [Count of Range Sum](/solution/0300-0399/0327.Count%20of%20Range%20Sum/README_EN.md)  |  `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort`  |  Hard  |    |
|  [0328](https://leetcode.com/problems/odd-even-linked-list)  |  [Odd Even Linked List](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README_EN.md)  |  `Linked List`  |  Medium  |    |
|  [0329](https://leetcode.com/problems/longest-increasing-path-in-a-matrix)  |  [Longest Increasing Path in a Matrix](/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Memoization`,`Dynamic Programming`  |  Hard  |    |
|  [0330](https://leetcode.com/problems/patching-array)  |  [Patching Array](/solution/0300-0399/0330.Patching%20Array/README_EN.md)  |  `Greedy`,`Array`  |  Hard  |    |
|  [0331](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree)  |  [Verify Preorder Serialization of a Binary Tree](/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README_EN.md)  |  `Stack`,`Tree`,`String`,`Binary Tree`  |  Medium  |    |
|  [0332](https://leetcode.com/problems/reconstruct-itinerary)  |  [Reconstruct Itinerary](/solution/0300-0399/0332.Reconstruct%20Itinerary/README_EN.md)  |  `Depth-First Search`,`Graph`,`Eulerian Circuit`  |  Medium  |    |
|  [0333](https://leetcode.com/problems/largest-bst-subtree)  |  [Largest BST Subtree](/solution/0300-0399/0333.Largest%20BST%20Subtree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Dynamic Programming`,`Binary Tree`  |  Medium  |  🔒  |
|  [0334](https://leetcode.com/problems/increasing-triplet-subsequence)  |  [Increasing Triplet Subsequence](/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [0335](https://leetcode.com/problems/self-crossing)  |  [Self Crossing](/solution/0300-0399/0335.Self%20Crossing/README_EN.md)  |  `Geometry`,`Array`,`Math`  |  Hard  |    |
|  [0336](https://leetcode.com/problems/palindrome-pairs)  |  [Palindrome Pairs](/solution/0300-0399/0336.Palindrome%20Pairs/README_EN.md)  |  `Trie`,`Array`,`Hash Table`,`String`  |  Hard  |    |
|  [0337](https://leetcode.com/problems/house-robber-iii)  |  [House Robber III](/solution/0300-0399/0337.House%20Robber%20III/README_EN.md)  |  `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree`  |  Medium  |    |
|  [0338](https://leetcode.com/problems/counting-bits)  |  [Counting Bits](/solution/0300-0399/0338.Counting%20Bits/README_EN.md)  |  `Bit Manipulation`,`Dynamic Programming`  |  Easy  |    |
|  [0339](https://leetcode.com/problems/nested-list-weight-sum)  |  [Nested List Weight Sum](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`  |  Medium  |  🔒  |
|  [0340](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters)  |  [Longest Substring with At Most K Distinct Characters](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |  🔒  |
|  [0341](https://leetcode.com/problems/flatten-nested-list-iterator)  |  [Flatten Nested List Iterator](/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`,`Design`,`Queue`,`Iterator`  |  Medium  |    |
|  [0342](https://leetcode.com/problems/power-of-four)  |  [Power of Four](/solution/0300-0399/0342.Power%20of%20Four/README_EN.md)  |  `Bit Manipulation`,`Recursion`,`Math`  |  Easy  |    |
|  [0343](https://leetcode.com/problems/integer-break)  |  [Integer Break](/solution/0300-0399/0343.Integer%20Break/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Medium  |    |
|  [0344](https://leetcode.com/problems/reverse-string)  |  [Reverse String](/solution/0300-0399/0344.Reverse%20String/README_EN.md)  |  `Recursion`,`Two Pointers`,`String`  |  Easy  |    |
|  [0345](https://leetcode.com/problems/reverse-vowels-of-a-string)  |  [Reverse Vowels of a String](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |    |
|  [0346](https://leetcode.com/problems/moving-average-from-data-stream)  |  [Moving Average from Data Stream](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README_EN.md)  |  `Design`,`Queue`,`Array`,`Data Stream`  |  Easy  |  🔒  |
|  [0347](https://leetcode.com/problems/top-k-frequent-elements)  |  [Top K Frequent Elements](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README_EN.md)  |  `Array`,`Hash Table`,`Divide and Conquer`,`Bucket Sort`,`Counting`,`Quickselect`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0348](https://leetcode.com/problems/design-tic-tac-toe)  |  [Design Tic-Tac-Toe](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Matrix`  |  Medium  |  🔒  |
|  [0349](https://leetcode.com/problems/intersection-of-two-arrays)  |  [Intersection of Two Arrays](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting`  |  Easy  |    |
|  [0350](https://leetcode.com/problems/intersection-of-two-arrays-ii)  |  [Intersection of Two Arrays II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting`  |  Easy  |    |
|  [0351](https://leetcode.com/problems/android-unlock-patterns)  |  [Android Unlock Patterns](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README_EN.md)  |  `Dynamic Programming`,`Backtracking`  |  Medium  |  🔒  |
|  [0352](https://leetcode.com/problems/data-stream-as-disjoint-intervals)  |  [Data Stream as Disjoint Intervals](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README_EN.md)  |  `Design`,`Binary Search`,`Ordered Set`  |  Hard  |    |
|  [0353](https://leetcode.com/problems/design-snake-game)  |  [Design Snake Game](/solution/0300-0399/0353.Design%20Snake%20Game/README_EN.md)  |  `Design`,`Queue`,`Array`,`Matrix`  |  Medium  |  🔒  |
|  [0354](https://leetcode.com/problems/russian-doll-envelopes)  |  [Russian Doll Envelopes](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README_EN.md)  |  `Array`,`Binary Search`,`Dynamic Programming`,`Sorting`  |  Hard  |    |
|  [0355](https://leetcode.com/problems/design-twitter)  |  [Design Twitter](/solution/0300-0399/0355.Design%20Twitter/README_EN.md)  |  `Design`,`Hash Table`,`Linked List`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0356](https://leetcode.com/problems/line-reflection)  |  [Line Reflection](/solution/0300-0399/0356.Line%20Reflection/README_EN.md)  |  `Array`,`Hash Table`,`Math`  |  Medium  |  🔒  |
|  [0357](https://leetcode.com/problems/count-numbers-with-unique-digits)  |  [Count Numbers with Unique Digits](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README_EN.md)  |  `Math`,`Dynamic Programming`,`Backtracking`  |  Medium  |    |
|  [0358](https://leetcode.com/problems/rearrange-string-k-distance-apart)  |  [Rearrange String k Distance Apart](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README_EN.md)  |  `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)`  |  Hard  |  🔒  |
|  [0359](https://leetcode.com/problems/logger-rate-limiter)  |  [Logger Rate Limiter](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README_EN.md)  |  `Design`,`Hash Table`  |  Easy  |  🔒  |
|  [0360](https://leetcode.com/problems/sort-transformed-array)  |  [Sort Transformed Array](/solution/0300-0399/0360.Sort%20Transformed%20Array/README_EN.md)  |  `Array`,`Math`,`Two Pointers`,`Sorting`  |  Medium  |  🔒  |
|  [0361](https://leetcode.com/problems/bomb-enemy)  |  [Bomb Enemy](/solution/0300-0399/0361.Bomb%20Enemy/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |  🔒  |
|  [0362](https://leetcode.com/problems/design-hit-counter)  |  [Design Hit Counter](/solution/0300-0399/0362.Design%20Hit%20Counter/README_EN.md)  |  `Design`,`Queue`,`Array`,`Hash Table`,`Binary Search`  |  Medium  |  🔒  |
|  [0363](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k)  |  [Max Sum of Rectangle No Larger Than K](/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README_EN.md)  |  `Array`,`Binary Search`,`Dynamic Programming`,`Matrix`,`Ordered Set`  |  Hard  |    |
|  [0364](https://leetcode.com/problems/nested-list-weight-sum-ii)  |  [Nested List Weight Sum II](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README_EN.md)  |  `Stack`,`Depth-First Search`,`Breadth-First Search`  |  Medium  |  🔒  |
|  [0365](https://leetcode.com/problems/water-and-jug-problem)  |  [Water and Jug Problem](/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Math`  |  Medium  |    |
|  [0366](https://leetcode.com/problems/find-leaves-of-binary-tree)  |  [Find Leaves of Binary Tree](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [0367](https://leetcode.com/problems/valid-perfect-square)  |  [Valid Perfect Square](/solution/0300-0399/0367.Valid%20Perfect%20Square/README_EN.md)  |  `Math`,`Binary Search`  |  Easy  |    |
|  [0368](https://leetcode.com/problems/largest-divisible-subset)  |  [Largest Divisible Subset](/solution/0300-0399/0368.Largest%20Divisible%20Subset/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Sorting`  |  Medium  |    |
|  [0369](https://leetcode.com/problems/plus-one-linked-list)  |  [Plus One Linked List](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README_EN.md)  |  `Linked List`,`Math`  |  Medium  |  🔒  |
|  [0370](https://leetcode.com/problems/range-addition)  |  [Range Addition](/solution/0300-0399/0370.Range%20Addition/README_EN.md)  |  `Array`,`Prefix Sum`  |  Medium  |  🔒  |
|  [0371](https://leetcode.com/problems/sum-of-two-integers)  |  [Sum of Two Integers](/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README_EN.md)  |  `Bit Manipulation`,`Math`  |  Medium  |    |
|  [0372](https://leetcode.com/problems/super-pow)  |  [Super Pow](/solution/0300-0399/0372.Super%20Pow/README_EN.md)  |  `Math`,`Divide and Conquer`  |  Medium  |    |
|  [0373](https://leetcode.com/problems/find-k-pairs-with-smallest-sums)  |  [Find K Pairs with Smallest Sums](/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README_EN.md)  |  `Array`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0374](https://leetcode.com/problems/guess-number-higher-or-lower)  |  [Guess Number Higher or Lower](/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README_EN.md)  |  `Binary Search`,`Interactive`  |  Easy  |    |
|  [0375](https://leetcode.com/problems/guess-number-higher-or-lower-ii)  |  [Guess Number Higher or Lower II](/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README_EN.md)  |  `Math`,`Dynamic Programming`,`Game Theory`  |  Medium  |    |
|  [0376](https://leetcode.com/problems/wiggle-subsequence)  |  [Wiggle Subsequence](/solution/0300-0399/0376.Wiggle%20Subsequence/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [0377](https://leetcode.com/problems/combination-sum-iv)  |  [Combination Sum IV](/solution/0300-0399/0377.Combination%20Sum%20IV/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0378](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix)  |  [Kth Smallest Element in a Sorted Matrix](/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README_EN.md)  |  `Array`,`Binary Search`,`Matrix`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0379](https://leetcode.com/problems/design-phone-directory)  |  [Design Phone Directory](/solution/0300-0399/0379.Design%20Phone%20Directory/README_EN.md)  |  `Design`,`Queue`,`Array`,`Hash Table`,`Linked List`  |  Medium  |  🔒  |
|  [0380](https://leetcode.com/problems/insert-delete-getrandom-o1)  |  [Insert Delete GetRandom O(1)](/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Math`,`Randomized`  |  Medium  |    |
|  [0381](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed)  |  [Insert Delete GetRandom O(1) - Duplicates allowed](/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Math`,`Randomized`  |  Hard  |    |
|  [0382](https://leetcode.com/problems/linked-list-random-node)  |  [Linked List Random Node](/solution/0300-0399/0382.Linked%20List%20Random%20Node/README_EN.md)  |  `Reservoir Sampling`,`Linked List`,`Math`,`Randomized`  |  Medium  |    |
|  [0383](https://leetcode.com/problems/ransom-note)  |  [Ransom Note](/solution/0300-0399/0383.Ransom%20Note/README_EN.md)  |  `Hash Table`,`String`,`Counting`  |  Easy  |    |
|  [0384](https://leetcode.com/problems/shuffle-an-array)  |  [Shuffle an Array](/solution/0300-0399/0384.Shuffle%20an%20Array/README_EN.md)  |  `Array`,`Math`,`Randomized`  |  Medium  |    |
|  [0385](https://leetcode.com/problems/mini-parser)  |  [Mini Parser](/solution/0300-0399/0385.Mini%20Parser/README_EN.md)  |  `Stack`,`Depth-First Search`,`String`  |  Medium  |    |
|  [0386](https://leetcode.com/problems/lexicographical-numbers)  |  [Lexicographical Numbers](/solution/0300-0399/0386.Lexicographical%20Numbers/README_EN.md)  |  `Depth-First Search`,`Trie`  |  Medium  |    |
|  [0387](https://leetcode.com/problems/first-unique-character-in-a-string)  |  [First Unique Character in a String](/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README_EN.md)  |  `Queue`,`Hash Table`,`String`,`Counting`  |  Easy  |    |
|  [0388](https://leetcode.com/problems/longest-absolute-file-path)  |  [Longest Absolute File Path](/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README_EN.md)  |  `Stack`,`Depth-First Search`,`String`  |  Medium  |    |
|  [0389](https://leetcode.com/problems/find-the-difference)  |  [Find the Difference](/solution/0300-0399/0389.Find%20the%20Difference/README_EN.md)  |  `Bit Manipulation`,`Hash Table`,`String`,`Sorting`  |  Easy  |    |
|  [0390](https://leetcode.com/problems/elimination-game)  |  [Elimination Game](/solution/0300-0399/0390.Elimination%20Game/README_EN.md)  |  `Math`  |  Medium  |    |
|  [0391](https://leetcode.com/problems/perfect-rectangle)  |  [Perfect Rectangle](/solution/0300-0399/0391.Perfect%20Rectangle/README_EN.md)  |  `Array`,`Line Sweep`  |  Hard  |    |
|  [0392](https://leetcode.com/problems/is-subsequence)  |  [Is Subsequence](/solution/0300-0399/0392.Is%20Subsequence/README_EN.md)  |  `Two Pointers`,`String`,`Dynamic Programming`  |  Easy  |    |
|  [0393](https://leetcode.com/problems/utf-8-validation)  |  [UTF-8 Validation](/solution/0300-0399/0393.UTF-8%20Validation/README_EN.md)  |  `Bit Manipulation`,`Array`  |  Medium  |    |
|  [0394](https://leetcode.com/problems/decode-string)  |  [Decode String](/solution/0300-0399/0394.Decode%20String/README_EN.md)  |  `Stack`,`Recursion`,`String`  |  Medium  |    |
|  [0395](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters)  |  [Longest Substring with At Least K Repeating Characters](/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README_EN.md)  |  `Hash Table`,`String`,`Divide and Conquer`,`Sliding Window`  |  Medium  |    |
|  [0396](https://leetcode.com/problems/rotate-function)  |  [Rotate Function](/solution/0300-0399/0396.Rotate%20Function/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Medium  |    |
|  [0397](https://leetcode.com/problems/integer-replacement)  |  [Integer Replacement](/solution/0300-0399/0397.Integer%20Replacement/README_EN.md)  |  `Bit Manipulation`,`Memoization`,`Dynamic Programming`  |  Medium  |    |
|  [0398](https://leetcode.com/problems/random-pick-index)  |  [Random Pick Index](/solution/0300-0399/0398.Random%20Pick%20Index/README_EN.md)  |  `Reservoir Sampling`,`Hash Table`,`Math`,`Randomized`  |  Medium  |    |
|  [0399](https://leetcode.com/problems/evaluate-division)  |  [Evaluate Division](/solution/0300-0399/0399.Evaluate%20Division/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Shortest Path`  |  Medium  |    |
|  [0400](https://leetcode.com/problems/nth-digit)  |  [Nth Digit](/solution/0400-0499/0400.Nth%20Digit/README_EN.md)  |  `Math`,`Binary Search`  |  Medium  |    |
|  [0401](https://leetcode.com/problems/binary-watch)  |  [Binary Watch](/solution/0400-0499/0401.Binary%20Watch/README_EN.md)  |  `Bit Manipulation`,`Backtracking`  |  Easy  |    |
|  [0402](https://leetcode.com/problems/remove-k-digits)  |  [Remove K Digits](/solution/0400-0499/0402.Remove%20K%20Digits/README_EN.md)  |  `Stack`,`Greedy`,`String`,`Monotonic Stack`  |  Medium  |    |
|  [0403](https://leetcode.com/problems/frog-jump)  |  [Frog Jump](/solution/0400-0499/0403.Frog%20Jump/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [0404](https://leetcode.com/problems/sum-of-left-leaves)  |  [Sum of Left Leaves](/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0405](https://leetcode.com/problems/convert-a-number-to-hexadecimal)  |  [Convert a Number to Hexadecimal](/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README_EN.md)  |  `Bit Manipulation`,`Math`  |  Easy  |    |
|  [0406](https://leetcode.com/problems/queue-reconstruction-by-height)  |  [Queue Reconstruction by Height](/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [0407](https://leetcode.com/problems/trapping-rain-water-ii)  |  [Trapping Rain Water II](/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0408](https://leetcode.com/problems/valid-word-abbreviation)  |  [Valid Word Abbreviation](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |  🔒  |
|  [0409](https://leetcode.com/problems/longest-palindrome)  |  [Longest Palindrome](/solution/0400-0499/0409.Longest%20Palindrome/README_EN.md)  |  `Greedy`,`Hash Table`,`String`  |  Easy  |    |
|  [0410](https://leetcode.com/problems/split-array-largest-sum)  |  [Split Array Largest Sum](/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README_EN.md)  |  `Greedy`,`Array`,`Binary Search`,`Dynamic Programming`  |  Hard  |    |
|  [0411](https://leetcode.com/problems/minimum-unique-word-abbreviation)  |  [Minimum Unique Word Abbreviation](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README_EN.md)  |  `Bit Manipulation`,`String`,`Backtracking`  |  Hard  |  🔒  |
|  [0412](https://leetcode.com/problems/fizz-buzz)  |  [Fizz Buzz](/solution/0400-0499/0412.Fizz%20Buzz/README_EN.md)  |  `Math`,`String`,`Simulation`  |  Easy  |    |
|  [0413](https://leetcode.com/problems/arithmetic-slices)  |  [Arithmetic Slices](/solution/0400-0499/0413.Arithmetic%20Slices/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0414](https://leetcode.com/problems/third-maximum-number)  |  [Third Maximum Number](/solution/0400-0499/0414.Third%20Maximum%20Number/README_EN.md)  |  `Array`,`Sorting`  |  Easy  |    |
|  [0415](https://leetcode.com/problems/add-strings)  |  [Add Strings](/solution/0400-0499/0415.Add%20Strings/README_EN.md)  |  `Math`,`String`,`Simulation`  |  Easy  |    |
|  [0416](https://leetcode.com/problems/partition-equal-subset-sum)  |  [Partition Equal Subset Sum](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0417](https://leetcode.com/problems/pacific-atlantic-water-flow)  |  [Pacific Atlantic Water Flow](/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [0418](https://leetcode.com/problems/sentence-screen-fitting)  |  [Sentence Screen Fitting](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |  🔒  |
|  [0419](https://leetcode.com/problems/battleships-in-a-board)  |  [Battleships in a Board](/solution/0400-0499/0419.Battleships%20in%20a%20Board/README_EN.md)  |  `Depth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [0420](https://leetcode.com/problems/strong-password-checker)  |  [Strong Password Checker](/solution/0400-0499/0420.Strong%20Password%20Checker/README_EN.md)  |  `Greedy`,`String`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0421](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array)  |  [Maximum XOR of Two Numbers in an Array](/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README_EN.md)  |  `Bit Manipulation`,`Trie`,`Array`,`Hash Table`  |  Medium  |    |
|  [0422](https://leetcode.com/problems/valid-word-square)  |  [Valid Word Square](/solution/0400-0499/0422.Valid%20Word%20Square/README_EN.md)  |  `Array`,`Matrix`  |  Easy  |  🔒  |
|  [0423](https://leetcode.com/problems/reconstruct-original-digits-from-english)  |  [Reconstruct Original Digits from English](/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README_EN.md)  |  `Hash Table`,`Math`,`String`  |  Medium  |    |
|  [0424](https://leetcode.com/problems/longest-repeating-character-replacement)  |  [Longest Repeating Character Replacement](/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |    |
|  [0425](https://leetcode.com/problems/word-squares)  |  [Word Squares](/solution/0400-0499/0425.Word%20Squares/README_EN.md)  |  `Trie`,`Array`,`String`,`Backtracking`  |  Hard  |  🔒  |
|  [0426](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list)  |  [Convert Binary Search Tree to Sorted Doubly Linked List](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Linked List`,`Binary Tree`,`Doubly-Linked List`  |  Medium  |  🔒  |
|  [0427](https://leetcode.com/problems/construct-quad-tree)  |  [Construct Quad Tree](/solution/0400-0499/0427.Construct%20Quad%20Tree/README_EN.md)  |  `Tree`,`Array`,`Divide and Conquer`,`Matrix`  |  Medium  |    |
|  [0428](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree)  |  [Serialize and Deserialize N-ary Tree](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`String`  |  Hard  |  🔒  |
|  [0429](https://leetcode.com/problems/n-ary-tree-level-order-traversal)  |  [N-ary Tree Level Order Traversal](/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README_EN.md)  |  `Tree`,`Breadth-First Search`  |  Medium  |    |
|  [0430](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list)  |  [Flatten a Multilevel Doubly Linked List](/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README_EN.md)  |  `Depth-First Search`,`Linked List`,`Doubly-Linked List`  |  Medium  |    |
|  [0431](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree)  |  [Encode N-ary Tree to Binary Tree](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Tree`  |  Hard  |  🔒  |
|  [0432](https://leetcode.com/problems/all-oone-data-structure)  |  [All O`one Data Structure](/solution/0400-0499/0432.All%20O%60one%20Data%20Structure/README_EN.md)  |  `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List`  |  Hard  |    |
|  [0433](https://leetcode.com/problems/minimum-genetic-mutation)  |  [Minimum Genetic Mutation](/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README_EN.md)  |  `Breadth-First Search`,`Hash Table`,`String`  |  Medium  |    |
|  [0434](https://leetcode.com/problems/number-of-segments-in-a-string)  |  [Number of Segments in a String](/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README_EN.md)  |  `String`  |  Easy  |    |
|  [0435](https://leetcode.com/problems/non-overlapping-intervals)  |  [Non-overlapping Intervals](/solution/0400-0499/0435.Non-overlapping%20Intervals/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`,`Sorting`  |  Medium  |    |
|  [0436](https://leetcode.com/problems/find-right-interval)  |  [Find Right Interval](/solution/0400-0499/0436.Find%20Right%20Interval/README_EN.md)  |  `Array`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [0437](https://leetcode.com/problems/path-sum-iii)  |  [Path Sum III](/solution/0400-0499/0437.Path%20Sum%20III/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0438](https://leetcode.com/problems/find-all-anagrams-in-a-string)  |  [Find All Anagrams in a String](/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |    |
|  [0439](https://leetcode.com/problems/ternary-expression-parser)  |  [Ternary Expression Parser](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README_EN.md)  |  `Stack`,`Recursion`,`String`  |  Medium  |  🔒  |
|  [0440](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order)  |  [K-th Smallest in Lexicographical Order](/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README_EN.md)  |  `Trie`  |  Hard  |    |
|  [0441](https://leetcode.com/problems/arranging-coins)  |  [Arranging Coins](/solution/0400-0499/0441.Arranging%20Coins/README_EN.md)  |  `Math`,`Binary Search`  |  Easy  |    |
|  [0442](https://leetcode.com/problems/find-all-duplicates-in-an-array)  |  [Find All Duplicates in an Array](/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [0443](https://leetcode.com/problems/string-compression)  |  [String Compression](/solution/0400-0499/0443.String%20Compression/README_EN.md)  |  `Two Pointers`,`String`  |  Medium  |    |
|  [0444](https://leetcode.com/problems/sequence-reconstruction)  |  [Sequence Reconstruction](/solution/0400-0499/0444.Sequence%20Reconstruction/README_EN.md)  |  `Graph`,`Topological Sort`,`Array`  |  Medium  |  🔒  |
|  [0445](https://leetcode.com/problems/add-two-numbers-ii)  |  [Add Two Numbers II](/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README_EN.md)  |  `Stack`,`Linked List`,`Math`  |  Medium  |    |
|  [0446](https://leetcode.com/problems/arithmetic-slices-ii-subsequence)  |  [Arithmetic Slices II - Subsequence](/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [0447](https://leetcode.com/problems/number-of-boomerangs)  |  [Number of Boomerangs](/solution/0400-0499/0447.Number%20of%20Boomerangs/README_EN.md)  |  `Array`,`Hash Table`,`Math`  |  Medium  |    |
|  [0448](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array)  |  [Find All Numbers Disappeared in an Array](/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README_EN.md)  |  `Array`,`Hash Table`  |  Easy  |    |
|  [0449](https://leetcode.com/problems/serialize-and-deserialize-bst)  |  [Serialize and Deserialize BST](/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Search Tree`,`String`,`Binary Tree`  |  Medium  |    |
|  [0450](https://leetcode.com/problems/delete-node-in-a-bst)  |  [Delete Node in a BST](/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Binary Tree`  |  Medium  |    |
|  [0451](https://leetcode.com/problems/sort-characters-by-frequency)  |  [Sort Characters By Frequency](/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README_EN.md)  |  `Hash Table`,`String`,`Bucket Sort`,`Counting`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0452](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons)  |  [Minimum Number of Arrows to Burst Balloons](/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [0453](https://leetcode.com/problems/minimum-moves-to-equal-array-elements)  |  [Minimum Moves to Equal Array Elements](/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README_EN.md)  |  `Array`,`Math`  |  Easy  |    |
|  [0454](https://leetcode.com/problems/4sum-ii)  |  [4Sum II](/solution/0400-0499/0454.4Sum%20II/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [0455](https://leetcode.com/problems/assign-cookies)  |  [Assign Cookies](/solution/0400-0499/0455.Assign%20Cookies/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Easy  |    |
|  [0456](https://leetcode.com/problems/132-pattern)  |  [132 Pattern](/solution/0400-0499/0456.132%20Pattern/README_EN.md)  |  `Stack`,`Array`,`Binary Search`,`Ordered Set`,`Monotonic Stack`  |  Medium  |    |
|  [0457](https://leetcode.com/problems/circular-array-loop)  |  [Circular Array Loop](/solution/0400-0499/0457.Circular%20Array%20Loop/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`  |  Medium  |    |
|  [0458](https://leetcode.com/problems/poor-pigs)  |  [Poor Pigs](/solution/0400-0499/0458.Poor%20Pigs/README_EN.md)  |  `Math`,`Dynamic Programming`,`Combinatorics`  |  Hard  |    |
|  [0459](https://leetcode.com/problems/repeated-substring-pattern)  |  [Repeated Substring Pattern](/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README_EN.md)  |  `String`,`String Matching`  |  Easy  |    |
|  [0460](https://leetcode.com/problems/lfu-cache)  |  [LFU Cache](/solution/0400-0499/0460.LFU%20Cache/README_EN.md)  |  `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List`  |  Hard  |    |
|  [0461](https://leetcode.com/problems/hamming-distance)  |  [Hamming Distance](/solution/0400-0499/0461.Hamming%20Distance/README_EN.md)  |  `Bit Manipulation`  |  Easy  |    |
|  [0462](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii)  |  [Minimum Moves to Equal Array Elements II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README_EN.md)  |  `Array`,`Math`,`Sorting`  |  Medium  |    |
|  [0463](https://leetcode.com/problems/island-perimeter)  |  [Island Perimeter](/solution/0400-0499/0463.Island%20Perimeter/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`  |  Easy  |    |
|  [0464](https://leetcode.com/problems/can-i-win)  |  [Can I Win](/solution/0400-0499/0464.Can%20I%20Win/README_EN.md)  |  `Bit Manipulation`,`Memoization`,`Math`,`Dynamic Programming`,`Bitmask`,`Game Theory`  |  Medium  |    |
|  [0465](https://leetcode.com/problems/optimal-account-balancing)  |  [Optimal Account Balancing](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README_EN.md)  |  `Array`,`Backtracking`  |  Hard  |  🔒  |
|  [0466](https://leetcode.com/problems/count-the-repetitions)  |  [Count The Repetitions](/solution/0400-0499/0466.Count%20The%20Repetitions/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0467](https://leetcode.com/problems/unique-substrings-in-wraparound-string)  |  [Unique Substrings in Wraparound String](/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [0468](https://leetcode.com/problems/validate-ip-address)  |  [Validate IP Address](/solution/0400-0499/0468.Validate%20IP%20Address/README_EN.md)  |  `String`  |  Medium  |    |
|  [0469](https://leetcode.com/problems/convex-polygon)  |  [Convex Polygon](/solution/0400-0499/0469.Convex%20Polygon/README_EN.md)  |  `Geometry`,`Math`  |  Medium  |  🔒  |
|  [0470](https://leetcode.com/problems/implement-rand10-using-rand7)  |  [Implement Rand10() Using Rand7()](/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README_EN.md)  |  `Math`,`Rejection Sampling`,`Probability and Statistics`,`Randomized`  |  Medium  |    |
|  [0471](https://leetcode.com/problems/encode-string-with-shortest-length)  |  [Encode String with Shortest Length](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |  🔒  |
|  [0472](https://leetcode.com/problems/concatenated-words)  |  [Concatenated Words](/solution/0400-0499/0472.Concatenated%20Words/README_EN.md)  |  `Depth-First Search`,`Trie`,`String`,`Dynamic Programming`  |  Hard  |    |
|  [0473](https://leetcode.com/problems/matchsticks-to-square)  |  [Matchsticks to Square](/solution/0400-0499/0473.Matchsticks%20to%20Square/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Medium  |    |
|  [0474](https://leetcode.com/problems/ones-and-zeroes)  |  [Ones and Zeroes](/solution/0400-0499/0474.Ones%20and%20Zeroes/README_EN.md)  |  `Array`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [0475](https://leetcode.com/problems/heaters)  |  [Heaters](/solution/0400-0499/0475.Heaters/README_EN.md)  |  `Array`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [0476](https://leetcode.com/problems/number-complement)  |  [Number Complement](/solution/0400-0499/0476.Number%20Complement/README_EN.md)  |  `Bit Manipulation`  |  Easy  |    |
|  [0477](https://leetcode.com/problems/total-hamming-distance)  |  [Total Hamming Distance](/solution/0400-0499/0477.Total%20Hamming%20Distance/README_EN.md)  |  `Bit Manipulation`,`Array`,`Math`  |  Medium  |    |
|  [0478](https://leetcode.com/problems/generate-random-point-in-a-circle)  |  [Generate Random Point in a Circle](/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README_EN.md)  |  `Geometry`,`Math`,`Rejection Sampling`,`Randomized`  |  Medium  |    |
|  [0479](https://leetcode.com/problems/largest-palindrome-product)  |  [Largest Palindrome Product](/solution/0400-0499/0479.Largest%20Palindrome%20Product/README_EN.md)  |  `Math`  |  Hard  |    |
|  [0480](https://leetcode.com/problems/sliding-window-median)  |  [Sliding Window Median](/solution/0400-0499/0480.Sliding%20Window%20Median/README_EN.md)  |  `Array`,`Hash Table`,`Sliding Window`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0481](https://leetcode.com/problems/magical-string)  |  [Magical String](/solution/0400-0499/0481.Magical%20String/README_EN.md)  |  `Two Pointers`,`String`  |  Medium  |    |
|  [0482](https://leetcode.com/problems/license-key-formatting)  |  [License Key Formatting](/solution/0400-0499/0482.License%20Key%20Formatting/README_EN.md)  |  `String`  |  Easy  |    |
|  [0483](https://leetcode.com/problems/smallest-good-base)  |  [Smallest Good Base](/solution/0400-0499/0483.Smallest%20Good%20Base/README_EN.md)  |  `Math`,`Binary Search`  |  Hard  |    |
|  [0484](https://leetcode.com/problems/find-permutation)  |  [Find Permutation](/solution/0400-0499/0484.Find%20Permutation/README_EN.md)  |  `Stack`,`Greedy`,`Array`  |  Medium  |  🔒  |
|  [0485](https://leetcode.com/problems/max-consecutive-ones)  |  [Max Consecutive Ones](/solution/0400-0499/0485.Max%20Consecutive%20Ones/README_EN.md)  |  `Array`  |  Easy  |    |
|  [0486](https://leetcode.com/problems/predict-the-winner)  |  [Predict the Winner](/solution/0400-0499/0486.Predict%20the%20Winner/README_EN.md)  |  `Recursion`,`Array`,`Math`,`Dynamic Programming`,`Game Theory`  |  Medium  |    |
|  [0487](https://leetcode.com/problems/max-consecutive-ones-ii)  |  [Max Consecutive Ones II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README_EN.md)  |  `Array`,`Dynamic Programming`,`Sliding Window`  |  Medium  |  🔒  |
|  [0488](https://leetcode.com/problems/zuma-game)  |  [Zuma Game](/solution/0400-0499/0488.Zuma%20Game/README_EN.md)  |  `String`,`Backtracking`  |  Hard  |    |
|  [0489](https://leetcode.com/problems/robot-room-cleaner)  |  [Robot Room Cleaner](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README_EN.md)  |  `Backtracking`,`Interactive`  |  Hard  |  🔒  |
|  [0490](https://leetcode.com/problems/the-maze)  |  [The Maze](/solution/0400-0499/0490.The%20Maze/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`  |  Medium  |  🔒  |
|  [0491](https://leetcode.com/problems/increasing-subsequences)  |  [Increasing Subsequences](/solution/0400-0499/0491.Increasing%20Subsequences/README_EN.md)  |  `Bit Manipulation`,`Array`,`Hash Table`,`Backtracking`  |  Medium  |    |
|  [0492](https://leetcode.com/problems/construct-the-rectangle)  |  [Construct the Rectangle](/solution/0400-0499/0492.Construct%20the%20Rectangle/README_EN.md)  |  `Math`  |  Easy  |    |
|  [0493](https://leetcode.com/problems/reverse-pairs)  |  [Reverse Pairs](/solution/0400-0499/0493.Reverse%20Pairs/README_EN.md)  |  `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort`  |  Hard  |    |
|  [0494](https://leetcode.com/problems/target-sum)  |  [Target Sum](/solution/0400-0499/0494.Target%20Sum/README_EN.md)  |  `Array`,`Dynamic Programming`,`Backtracking`  |  Medium  |    |
|  [0495](https://leetcode.com/problems/teemo-attacking)  |  [Teemo Attacking](/solution/0400-0499/0495.Teemo%20Attacking/README_EN.md)  |  `Array`,`Simulation`  |  Easy  |    |
|  [0496](https://leetcode.com/problems/next-greater-element-i)  |  [Next Greater Element I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README_EN.md)  |  `Stack`,`Array`,`Hash Table`,`Monotonic Stack`  |  Easy  |    |
|  [0497](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles)  |  [Random Point in Non-overlapping Rectangles](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README_EN.md)  |  `Reservoir Sampling`,`Math`,`Binary Search`,`Ordered Set`,`Prefix Sum`,`Randomized`  |  Medium  |    |
|  [0498](https://leetcode.com/problems/diagonal-traverse)  |  [Diagonal Traverse](/solution/0400-0499/0498.Diagonal%20Traverse/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Medium  |    |
|  [0499](https://leetcode.com/problems/the-maze-iii)  |  [The Maze III](/solution/0400-0499/0499.The%20Maze%20III/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)`  |  Hard  |  🔒  |
|  [0500](https://leetcode.com/problems/keyboard-row)  |  [Keyboard Row](/solution/0500-0599/0500.Keyboard%20Row/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Easy  |    |
|  [0501](https://leetcode.com/problems/find-mode-in-binary-search-tree)  |  [Find Mode in Binary Search Tree](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Easy  |    |
|  [0502](https://leetcode.com/problems/ipo)  |  [IPO](/solution/0500-0599/0502.IPO/README_EN.md)  |  `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0503](https://leetcode.com/problems/next-greater-element-ii)  |  [Next Greater Element II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README_EN.md)  |  `Stack`,`Array`,`Monotonic Stack`  |  Medium  |    |
|  [0504](https://leetcode.com/problems/base-7)  |  [Base 7](/solution/0500-0599/0504.Base%207/README_EN.md)  |  `Math`  |  Easy  |    |
|  [0505](https://leetcode.com/problems/the-maze-ii)  |  [The Maze II](/solution/0500-0599/0505.The%20Maze%20II/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)`  |  Medium  |  🔒  |
|  [0506](https://leetcode.com/problems/relative-ranks)  |  [Relative Ranks](/solution/0500-0599/0506.Relative%20Ranks/README_EN.md)  |  `Array`,`Sorting`,`Heap (Priority Queue)`  |  Easy  |    |
|  [0507](https://leetcode.com/problems/perfect-number)  |  [Perfect Number](/solution/0500-0599/0507.Perfect%20Number/README_EN.md)  |  `Math`  |  Easy  |    |
|  [0508](https://leetcode.com/problems/most-frequent-subtree-sum)  |  [Most Frequent Subtree Sum](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README_EN.md)  |  `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree`  |  Medium  |    |
|  [0509](https://leetcode.com/problems/fibonacci-number)  |  [Fibonacci Number](/solution/0500-0599/0509.Fibonacci%20Number/README_EN.md)  |  `Recursion`,`Memoization`,`Math`,`Dynamic Programming`  |  Easy  |    |
|  [0510](https://leetcode.com/problems/inorder-successor-in-bst-ii)  |  [Inorder Successor in BST II](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Binary Tree`  |  Medium  |  🔒  |
|  [0511](https://leetcode.com/problems/game-play-analysis-i)  |  [Game Play Analysis I](/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0512](https://leetcode.com/problems/game-play-analysis-ii)  |  [Game Play Analysis II](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0513](https://leetcode.com/problems/find-bottom-left-tree-value)  |  [Find Bottom Left Tree Value](/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0514](https://leetcode.com/problems/freedom-trail)  |  [Freedom Trail](/solution/0500-0599/0514.Freedom%20Trail/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`String`,`Dynamic Programming`  |  Hard  |    |
|  [0515](https://leetcode.com/problems/find-largest-value-in-each-tree-row)  |  [Find Largest Value in Each Tree Row](/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0516](https://leetcode.com/problems/longest-palindromic-subsequence)  |  [Longest Palindromic Subsequence](/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [0517](https://leetcode.com/problems/super-washing-machines)  |  [Super Washing Machines](/solution/0500-0599/0517.Super%20Washing%20Machines/README_EN.md)  |  `Greedy`,`Array`  |  Hard  |    |
|  [0518](https://leetcode.com/problems/coin-change-2)  |  [Coin Change 2](/solution/0500-0599/0518.Coin%20Change%202/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0519](https://leetcode.com/problems/random-flip-matrix)  |  [Random Flip Matrix](/solution/0500-0599/0519.Random%20Flip%20Matrix/README_EN.md)  |  `Reservoir Sampling`,`Hash Table`,`Math`,`Randomized`  |  Medium  |    |
|  [0520](https://leetcode.com/problems/detect-capital)  |  [Detect Capital](/solution/0500-0599/0520.Detect%20Capital/README_EN.md)  |  `String`  |  Easy  |    |
|  [0521](https://leetcode.com/problems/longest-uncommon-subsequence-i)  |  [Longest Uncommon Subsequence I](/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README_EN.md)  |  `String`  |  Easy  |    |
|  [0522](https://leetcode.com/problems/longest-uncommon-subsequence-ii)  |  [Longest Uncommon Subsequence II](/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`String`,`Sorting`  |  Medium  |    |
|  [0523](https://leetcode.com/problems/continuous-subarray-sum)  |  [Continuous Subarray Sum](/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README_EN.md)  |  `Array`,`Hash Table`,`Math`,`Prefix Sum`  |  Medium  |    |
|  [0524](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting)  |  [Longest Word in Dictionary through Deleting](/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README_EN.md)  |  `Array`,`Two Pointers`,`String`,`Sorting`  |  Medium  |    |
|  [0525](https://leetcode.com/problems/contiguous-array)  |  [Contiguous Array](/solution/0500-0599/0525.Contiguous%20Array/README_EN.md)  |  `Array`,`Hash Table`,`Prefix Sum`  |  Medium  |    |
|  [0526](https://leetcode.com/problems/beautiful-arrangement)  |  [Beautiful Arrangement](/solution/0500-0599/0526.Beautiful%20Arrangement/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Medium  |    |
|  [0527](https://leetcode.com/problems/word-abbreviation)  |  [Word Abbreviation](/solution/0500-0599/0527.Word%20Abbreviation/README_EN.md)  |  `Greedy`,`Trie`,`Array`,`String`,`Sorting`  |  Hard  |  🔒  |
|  [0528](https://leetcode.com/problems/random-pick-with-weight)  |  [Random Pick with Weight](/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README_EN.md)  |  `Math`,`Binary Search`,`Prefix Sum`,`Randomized`  |  Medium  |    |
|  [0529](https://leetcode.com/problems/minesweeper)  |  [Minesweeper](/solution/0500-0599/0529.Minesweeper/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [0530](https://leetcode.com/problems/minimum-absolute-difference-in-bst)  |  [Minimum Absolute Difference in BST](/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Easy  |    |
|  [0531](https://leetcode.com/problems/lonely-pixel-i)  |  [Lonely Pixel I](/solution/0500-0599/0531.Lonely%20Pixel%20I/README_EN.md)  |  `Array`,`Hash Table`,`Matrix`  |  Medium  |  🔒  |
|  [0532](https://leetcode.com/problems/k-diff-pairs-in-an-array)  |  [K-diff Pairs in an Array](/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [0533](https://leetcode.com/problems/lonely-pixel-ii)  |  [Lonely Pixel II](/solution/0500-0599/0533.Lonely%20Pixel%20II/README_EN.md)  |  `Array`,`Hash Table`,`Matrix`  |  Medium  |  🔒  |
|  [0534](https://leetcode.com/problems/game-play-analysis-iii)  |  [Game Play Analysis III](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0535](https://leetcode.com/problems/encode-and-decode-tinyurl)  |  [Encode and Decode TinyURL](/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README_EN.md)  |  `Design`,`Hash Table`,`String`,`Hash Function`  |  Medium  |    |
|  [0536](https://leetcode.com/problems/construct-binary-tree-from-string)  |  [Construct Binary Tree from String](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README_EN.md)  |  `Tree`,`Depth-First Search`,`String`,`Binary Tree`  |  Medium  |  🔒  |
|  [0537](https://leetcode.com/problems/complex-number-multiplication)  |  [Complex Number Multiplication](/solution/0500-0599/0537.Complex%20Number%20Multiplication/README_EN.md)  |  `Math`,`String`,`Simulation`  |  Medium  |    |
|  [0538](https://leetcode.com/problems/convert-bst-to-greater-tree)  |  [Convert BST to Greater Tree](/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Medium  |    |
|  [0539](https://leetcode.com/problems/minimum-time-difference)  |  [Minimum Time Difference](/solution/0500-0599/0539.Minimum%20Time%20Difference/README_EN.md)  |  `Array`,`Math`,`String`,`Sorting`  |  Medium  |    |
|  [0540](https://leetcode.com/problems/single-element-in-a-sorted-array)  |  [Single Element in a Sorted Array](/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [0541](https://leetcode.com/problems/reverse-string-ii)  |  [Reverse String II](/solution/0500-0599/0541.Reverse%20String%20II/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |    |
|  [0542](https://leetcode.com/problems/01-matrix)  |  [01 Matrix](/solution/0500-0599/0542.01%20Matrix/README_EN.md)  |  `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix`  |  Medium  |    |
|  [0543](https://leetcode.com/problems/diameter-of-binary-tree)  |  [Diameter of Binary Tree](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0544](https://leetcode.com/problems/output-contest-matches)  |  [Output Contest Matches](/solution/0500-0599/0544.Output%20Contest%20Matches/README_EN.md)  |  `Recursion`,`String`,`Simulation`  |  Medium  |  🔒  |
|  [0545](https://leetcode.com/problems/boundary-of-binary-tree)  |  [Boundary of Binary Tree](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [0546](https://leetcode.com/problems/remove-boxes)  |  [Remove Boxes](/solution/0500-0599/0546.Remove%20Boxes/README_EN.md)  |  `Memoization`,`Array`,`Dynamic Programming`  |  Hard  |    |
|  [0547](https://leetcode.com/problems/number-of-provinces)  |  [Number of Provinces](/solution/0500-0599/0547.Number%20of%20Provinces/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Medium  |    |
|  [0548](https://leetcode.com/problems/split-array-with-equal-sum)  |  [Split Array with Equal Sum](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README_EN.md)  |  `Array`,`Prefix Sum`  |  Hard  |  🔒  |
|  [0549](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii)  |  [Binary Tree Longest Consecutive Sequence II](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [0550](https://leetcode.com/problems/game-play-analysis-iv)  |  [Game Play Analysis IV](/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0551](https://leetcode.com/problems/student-attendance-record-i)  |  [Student Attendance Record I](/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README_EN.md)  |  `String`  |  Easy  |    |
|  [0552](https://leetcode.com/problems/student-attendance-record-ii)  |  [Student Attendance Record II](/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [0553](https://leetcode.com/problems/optimal-division)  |  [Optimal Division](/solution/0500-0599/0553.Optimal%20Division/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`  |  Medium  |    |
|  [0554](https://leetcode.com/problems/brick-wall)  |  [Brick Wall](/solution/0500-0599/0554.Brick%20Wall/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [0555](https://leetcode.com/problems/split-concatenated-strings)  |  [Split Concatenated Strings](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README_EN.md)  |  `Greedy`,`Array`,`String`  |  Medium  |  🔒  |
|  [0556](https://leetcode.com/problems/next-greater-element-iii)  |  [Next Greater Element III](/solution/0500-0599/0556.Next%20Greater%20Element%20III/README_EN.md)  |  `Math`,`Two Pointers`,`String`  |  Medium  |    |
|  [0557](https://leetcode.com/problems/reverse-words-in-a-string-iii)  |  [Reverse Words in a String III](/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |    |
|  [0558](https://leetcode.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees)  |  [Logical OR of Two Binary Grids Represented as Quad-Trees](/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README_EN.md)  |  `Tree`,`Divide and Conquer`  |  Medium  |    |
|  [0559](https://leetcode.com/problems/maximum-depth-of-n-ary-tree)  |  [Maximum Depth of N-ary Tree](/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`  |  Easy  |    |
|  [0560](https://leetcode.com/problems/subarray-sum-equals-k)  |  [Subarray Sum Equals K](/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README_EN.md)  |  `Array`,`Hash Table`,`Prefix Sum`  |  Medium  |    |
|  [0561](https://leetcode.com/problems/array-partition-i)  |  [Array Partition I](/solution/0500-0599/0561.Array%20Partition%20I/README_EN.md)  |  `Greedy`,`Array`,`Counting Sort`,`Sorting`  |  Easy  |    |
|  [0562](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix)  |  [Longest Line of Consecutive One in Matrix](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |  🔒  |
|  [0563](https://leetcode.com/problems/binary-tree-tilt)  |  [Binary Tree Tilt](/solution/0500-0599/0563.Binary%20Tree%20Tilt/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0564](https://leetcode.com/problems/find-the-closest-palindrome)  |  [Find the Closest Palindrome](/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README_EN.md)  |  `Math`,`String`  |  Hard  |    |
|  [0565](https://leetcode.com/problems/array-nesting)  |  [Array Nesting](/solution/0500-0599/0565.Array%20Nesting/README_EN.md)  |  `Depth-First Search`,`Array`  |  Medium  |    |
|  [0566](https://leetcode.com/problems/reshape-the-matrix)  |  [Reshape the Matrix](/solution/0500-0599/0566.Reshape%20the%20Matrix/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Easy  |    |
|  [0567](https://leetcode.com/problems/permutation-in-string)  |  [Permutation in String](/solution/0500-0599/0567.Permutation%20in%20String/README_EN.md)  |  `Hash Table`,`Two Pointers`,`String`,`Sliding Window`  |  Medium  |    |
|  [0568](https://leetcode.com/problems/maximum-vacation-days)  |  [Maximum Vacation Days](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Hard  |  🔒  |
|  [0569](https://leetcode.com/problems/median-employee-salary)  |  [Median Employee Salary](/solution/0500-0599/0569.Median%20Employee%20Salary/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [0570](https://leetcode.com/problems/managers-with-at-least-5-direct-reports)  |  [Managers with at Least 5 Direct Reports](/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0571](https://leetcode.com/problems/find-median-given-frequency-of-numbers)  |  [Find Median Given Frequency of Numbers](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [0572](https://leetcode.com/problems/subtree-of-another-tree)  |  [Subtree of Another Tree](/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`,`String Matching`,`Hash Function`  |  Easy  |    |
|  [0573](https://leetcode.com/problems/squirrel-simulation)  |  [Squirrel Simulation](/solution/0500-0599/0573.Squirrel%20Simulation/README_EN.md)  |  `Array`,`Math`  |  Medium  |  🔒  |
|  [0574](https://leetcode.com/problems/winning-candidate)  |  [Winning Candidate](/solution/0500-0599/0574.Winning%20Candidate/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0575](https://leetcode.com/problems/distribute-candies)  |  [Distribute Candies](/solution/0500-0599/0575.Distribute%20Candies/README_EN.md)  |  `Array`,`Hash Table`  |  Easy  |    |
|  [0576](https://leetcode.com/problems/out-of-boundary-paths)  |  [Out of Boundary Paths](/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README_EN.md)  |  `Dynamic Programming`  |  Medium  |    |
|  [0577](https://leetcode.com/problems/employee-bonus)  |  [Employee Bonus](/solution/0500-0599/0577.Employee%20Bonus/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0578](https://leetcode.com/problems/get-highest-answer-rate-question)  |  [Get Highest Answer Rate Question](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0579](https://leetcode.com/problems/find-cumulative-salary-of-an-employee)  |  [Find Cumulative Salary of an Employee](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [0580](https://leetcode.com/problems/count-student-number-in-departments)  |  [Count Student Number in Departments](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0581](https://leetcode.com/problems/shortest-unsorted-continuous-subarray)  |  [Shortest Unsorted Continuous Subarray](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README_EN.md)  |  `Stack`,`Greedy`,`Array`,`Two Pointers`,`Sorting`,`Monotonic Stack`  |  Medium  |    |
|  [0582](https://leetcode.com/problems/kill-process)  |  [Kill Process](/solution/0500-0599/0582.Kill%20Process/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table`  |  Medium  |  🔒  |
|  [0583](https://leetcode.com/problems/delete-operation-for-two-strings)  |  [Delete Operation for Two Strings](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [0584](https://leetcode.com/problems/find-customer-referee)  |  [Find Customer Referee](/solution/0500-0599/0584.Find%20Customer%20Referee/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0585](https://leetcode.com/problems/investments-in-2016)  |  [Investments in 2016](/solution/0500-0599/0585.Investments%20in%202016/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0586](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders)  |  [Customer Placing the Largest Number of Orders](/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0587](https://leetcode.com/problems/erect-the-fence)  |  [Erect the Fence](/solution/0500-0599/0587.Erect%20the%20Fence/README_EN.md)  |  `Geometry`,`Array`,`Math`  |  Hard  |    |
|  [0588](https://leetcode.com/problems/design-in-memory-file-system)  |  [Design In-Memory File System](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README_EN.md)  |  `Design`,`Trie`,`Hash Table`,`String`  |  Hard  |  🔒  |
|  [0589](https://leetcode.com/problems/n-ary-tree-preorder-traversal)  |  [N-ary Tree Preorder Traversal](/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`  |  Easy  |    |
|  [0590](https://leetcode.com/problems/n-ary-tree-postorder-traversal)  |  [N-ary Tree Postorder Traversal](/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`  |  Easy  |    |
|  [0591](https://leetcode.com/problems/tag-validator)  |  [Tag Validator](/solution/0500-0599/0591.Tag%20Validator/README_EN.md)  |  `Stack`,`String`  |  Hard  |    |
|  [0592](https://leetcode.com/problems/fraction-addition-and-subtraction)  |  [Fraction Addition and Subtraction](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README_EN.md)  |  `Math`,`String`,`Simulation`  |  Medium  |    |
|  [0593](https://leetcode.com/problems/valid-square)  |  [Valid Square](/solution/0500-0599/0593.Valid%20Square/README_EN.md)  |  `Geometry`,`Math`  |  Medium  |    |
|  [0594](https://leetcode.com/problems/longest-harmonious-subsequence)  |  [Longest Harmonious Subsequence](/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README_EN.md)  |  `Array`,`Hash Table`,`Sorting`  |  Easy  |    |
|  [0595](https://leetcode.com/problems/big-countries)  |  [Big Countries](/solution/0500-0599/0595.Big%20Countries/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0596](https://leetcode.com/problems/classes-more-than-5-students)  |  [Classes More Than 5 Students](/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0597](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate)  |  [Friend Requests I Overall Acceptance Rate](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0598](https://leetcode.com/problems/range-addition-ii)  |  [Range Addition II](/solution/0500-0599/0598.Range%20Addition%20II/README_EN.md)  |  `Array`,`Math`  |  Easy  |    |
|  [0599](https://leetcode.com/problems/minimum-index-sum-of-two-lists)  |  [Minimum Index Sum of Two Lists](/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Easy  |    |
|  [0600](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones)  |  [Non-negative Integers without Consecutive Ones](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [0601](https://leetcode.com/problems/human-traffic-of-stadium)  |  [Human Traffic of Stadium](/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README_EN.md)  |  `Database`  |  Hard  |    |
|  [0602](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends)  |  [Friend Requests II Who Has the Most Friends](/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0603](https://leetcode.com/problems/consecutive-available-seats)  |  [Consecutive Available Seats](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0604](https://leetcode.com/problems/design-compressed-string-iterator)  |  [Design Compressed String Iterator](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`String`,`Iterator`  |  Easy  |  🔒  |
|  [0605](https://leetcode.com/problems/can-place-flowers)  |  [Can Place Flowers](/solution/0600-0699/0605.Can%20Place%20Flowers/README_EN.md)  |  `Greedy`,`Array`  |  Easy  |    |
|  [0606](https://leetcode.com/problems/construct-string-from-binary-tree)  |  [Construct String from Binary Tree](/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`String`,`Binary Tree`  |  Easy  |    |
|  [0607](https://leetcode.com/problems/sales-person)  |  [Sales Person](/solution/0600-0699/0607.Sales%20Person/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0608](https://leetcode.com/problems/tree-node)  |  [Tree Node](/solution/0600-0699/0608.Tree%20Node/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0609](https://leetcode.com/problems/find-duplicate-file-in-system)  |  [Find Duplicate File in System](/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |    |
|  [0610](https://leetcode.com/problems/triangle-judgement)  |  [Triangle Judgement](/solution/0600-0699/0610.Triangle%20Judgement/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0611](https://leetcode.com/problems/valid-triangle-number)  |  [Valid Triangle Number](/solution/0600-0699/0611.Valid%20Triangle%20Number/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [0612](https://leetcode.com/problems/shortest-distance-in-a-plane)  |  [Shortest Distance in a Plane](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0613](https://leetcode.com/problems/shortest-distance-in-a-line)  |  [Shortest Distance in a Line](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0614](https://leetcode.com/problems/second-degree-follower)  |  [Second Degree Follower](/solution/0600-0699/0614.Second%20Degree%20Follower/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [0615](https://leetcode.com/problems/average-salary-departments-vs-company)  |  [Average Salary Departments VS Company](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [0616](https://leetcode.com/problems/add-bold-tag-in-string)  |  [Add Bold Tag in String](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README_EN.md)  |  `Trie`,`Array`,`Hash Table`,`String`,`String Matching`  |  Medium  |  🔒  |
|  [0617](https://leetcode.com/problems/merge-two-binary-trees)  |  [Merge Two Binary Trees](/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0618](https://leetcode.com/problems/students-report-by-geography)  |  [Students Report By Geography](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [0619](https://leetcode.com/problems/biggest-single-number)  |  [Biggest Single Number](/solution/0600-0699/0619.Biggest%20Single%20Number/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [0620](https://leetcode.com/problems/not-boring-movies)  |  [Not Boring Movies](/solution/0600-0699/0620.Not%20Boring%20Movies/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0621](https://leetcode.com/problems/task-scheduler)  |  [Task Scheduler](/solution/0600-0699/0621.Task%20Scheduler/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0622](https://leetcode.com/problems/design-circular-queue)  |  [Design Circular Queue](/solution/0600-0699/0622.Design%20Circular%20Queue/README_EN.md)  |  `Design`,`Queue`,`Array`,`Linked List`  |  Medium  |    |
|  [0623](https://leetcode.com/problems/add-one-row-to-tree)  |  [Add One Row to Tree](/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0624](https://leetcode.com/problems/maximum-distance-in-arrays)  |  [Maximum Distance in Arrays](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |  🔒  |
|  [0625](https://leetcode.com/problems/minimum-factorization)  |  [Minimum Factorization](/solution/0600-0699/0625.Minimum%20Factorization/README_EN.md)  |  `Greedy`,`Math`  |  Medium  |  🔒  |
|  [0626](https://leetcode.com/problems/exchange-seats)  |  [Exchange Seats](/solution/0600-0699/0626.Exchange%20Seats/README_EN.md)  |  `Database`  |  Medium  |    |
|  [0627](https://leetcode.com/problems/swap-salary)  |  [Swap Salary](/solution/0600-0699/0627.Swap%20Salary/README_EN.md)  |  `Database`  |  Easy  |    |
|  [0628](https://leetcode.com/problems/maximum-product-of-three-numbers)  |  [Maximum Product of Three Numbers](/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README_EN.md)  |  `Array`,`Math`,`Sorting`  |  Easy  |    |
|  [0629](https://leetcode.com/problems/k-inverse-pairs-array)  |  [K Inverse Pairs Array](/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [0630](https://leetcode.com/problems/course-schedule-iii)  |  [Course Schedule III](/solution/0600-0699/0630.Course%20Schedule%20III/README_EN.md)  |  `Greedy`,`Array`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0631](https://leetcode.com/problems/design-excel-sum-formula)  |  [Design Excel Sum Formula](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README_EN.md)  |  `Graph`,`Design`,`Topological Sort`  |  Hard  |  🔒  |
|  [0632](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists)  |  [Smallest Range Covering Elements from K Lists](/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Sorting`,`Sliding Window`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0633](https://leetcode.com/problems/sum-of-square-numbers)  |  [Sum of Square Numbers](/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README_EN.md)  |  `Math`,`Two Pointers`,`Binary Search`  |  Medium  |    |
|  [0634](https://leetcode.com/problems/find-the-derangement-of-an-array)  |  [Find the Derangement of An Array](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Medium  |  🔒  |
|  [0635](https://leetcode.com/problems/design-log-storage-system)  |  [Design Log Storage System](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README_EN.md)  |  `Design`,`Hash Table`,`String`,`Ordered Set`  |  Medium  |  🔒  |
|  [0636](https://leetcode.com/problems/exclusive-time-of-functions)  |  [Exclusive Time of Functions](/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README_EN.md)  |  `Stack`,`Array`  |  Medium  |    |
|  [0637](https://leetcode.com/problems/average-of-levels-in-binary-tree)  |  [Average of Levels in Binary Tree](/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0638](https://leetcode.com/problems/shopping-offers)  |  [Shopping Offers](/solution/0600-0699/0638.Shopping%20Offers/README_EN.md)  |  `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Medium  |    |
|  [0639](https://leetcode.com/problems/decode-ways-ii)  |  [Decode Ways II](/solution/0600-0699/0639.Decode%20Ways%20II/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0640](https://leetcode.com/problems/solve-the-equation)  |  [Solve the Equation](/solution/0600-0699/0640.Solve%20the%20Equation/README_EN.md)  |  `Math`,`String`,`Simulation`  |  Medium  |    |
|  [0641](https://leetcode.com/problems/design-circular-deque)  |  [Design Circular Deque](/solution/0600-0699/0641.Design%20Circular%20Deque/README_EN.md)  |  `Design`,`Queue`,`Array`,`Linked List`  |  Medium  |    |
|  [0642](https://leetcode.com/problems/design-search-autocomplete-system)  |  [Design Search Autocomplete System](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README_EN.md)  |  `Design`,`Trie`,`String`,`Data Stream`  |  Hard  |  🔒  |
|  [0643](https://leetcode.com/problems/maximum-average-subarray-i)  |  [Maximum Average Subarray I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README_EN.md)  |  `Array`,`Sliding Window`  |  Easy  |    |
|  [0644](https://leetcode.com/problems/maximum-average-subarray-ii)  |  [Maximum Average Subarray II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README_EN.md)  |  `Array`,`Binary Search`  |  Hard  |  🔒  |
|  [0645](https://leetcode.com/problems/set-mismatch)  |  [Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README_EN.md)  |  `Bit Manipulation`,`Array`,`Hash Table`,`Sorting`  |  Easy  |    |
|  [0646](https://leetcode.com/problems/maximum-length-of-pair-chain)  |  [Maximum Length of Pair Chain](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`,`Sorting`  |  Medium  |    |
|  [0647](https://leetcode.com/problems/palindromic-substrings)  |  [Palindromic Substrings](/solution/0600-0699/0647.Palindromic%20Substrings/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [0648](https://leetcode.com/problems/replace-words)  |  [Replace Words](/solution/0600-0699/0648.Replace%20Words/README_EN.md)  |  `Trie`,`Array`,`Hash Table`,`String`  |  Medium  |    |
|  [0649](https://leetcode.com/problems/dota2-senate)  |  [Dota2 Senate](/solution/0600-0699/0649.Dota2%20Senate/README_EN.md)  |  `Greedy`,`Queue`,`String`  |  Medium  |    |
|  [0650](https://leetcode.com/problems/2-keys-keyboard)  |  [2 Keys Keyboard](/solution/0600-0699/0650.2%20Keys%20Keyboard/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Medium  |    |
|  [0651](https://leetcode.com/problems/4-keys-keyboard)  |  [4 Keys Keyboard](/solution/0600-0699/0651.4%20Keys%20Keyboard/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Medium  |  🔒  |
|  [0652](https://leetcode.com/problems/find-duplicate-subtrees)  |  [Find Duplicate Subtrees](/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0653](https://leetcode.com/problems/two-sum-iv-input-is-a-bst)  |  [Two Sum IV - Input is a BST](/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Search Tree`,`Hash Table`,`Two Pointers`,`Binary Tree`  |  Easy  |    |
|  [0654](https://leetcode.com/problems/maximum-binary-tree)  |  [Maximum Binary Tree](/solution/0600-0699/0654.Maximum%20Binary%20Tree/README_EN.md)  |  `Stack`,`Tree`,`Array`,`Divide and Conquer`,`Binary Tree`,`Monotonic Stack`  |  Medium  |    |
|  [0655](https://leetcode.com/problems/print-binary-tree)  |  [Print Binary Tree](/solution/0600-0699/0655.Print%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0656](https://leetcode.com/problems/coin-path)  |  [Coin Path](/solution/0600-0699/0656.Coin%20Path/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |  🔒  |
|  [0657](https://leetcode.com/problems/robot-return-to-origin)  |  [Robot Return to Origin](/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README_EN.md)  |  `String`,`Simulation`  |  Easy  |    |
|  [0658](https://leetcode.com/problems/find-k-closest-elements)  |  [Find K Closest Elements](/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0659](https://leetcode.com/problems/split-array-into-consecutive-subsequences)  |  [Split Array into Consecutive Subsequences](/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0660](https://leetcode.com/problems/remove-9)  |  [Remove 9](/solution/0600-0699/0660.Remove%209/README_EN.md)  |  `Math`  |  Hard  |  🔒  |
|  [0661](https://leetcode.com/problems/image-smoother)  |  [Image Smoother](/solution/0600-0699/0661.Image%20Smoother/README_EN.md)  |  `Array`,`Matrix`  |  Easy  |    |
|  [0662](https://leetcode.com/problems/maximum-width-of-binary-tree)  |  [Maximum Width of Binary Tree](/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0663](https://leetcode.com/problems/equal-tree-partition)  |  [Equal Tree Partition](/solution/0600-0699/0663.Equal%20Tree%20Partition/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [0664](https://leetcode.com/problems/strange-printer)  |  [Strange Printer](/solution/0600-0699/0664.Strange%20Printer/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0665](https://leetcode.com/problems/non-decreasing-array)  |  [Non-decreasing Array](/solution/0600-0699/0665.Non-decreasing%20Array/README_EN.md)  |  `Array`  |  Medium  |    |
|  [0666](https://leetcode.com/problems/path-sum-iv)  |  [Path Sum IV](/solution/0600-0699/0666.Path%20Sum%20IV/README_EN.md)  |  `Tree`,`Depth-First Search`,`Array`,`Binary Tree`  |  Medium  |  🔒  |
|  [0667](https://leetcode.com/problems/beautiful-arrangement-ii)  |  [Beautiful Arrangement II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README_EN.md)  |  `Array`,`Math`  |  Medium  |    |
|  [0668](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table)  |  [Kth Smallest Number in Multiplication Table](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README_EN.md)  |  `Binary Search`  |  Hard  |    |
|  [0669](https://leetcode.com/problems/trim-a-binary-search-tree)  |  [Trim a Binary Search Tree](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Medium  |    |
|  [0670](https://leetcode.com/problems/maximum-swap)  |  [Maximum Swap](/solution/0600-0699/0670.Maximum%20Swap/README_EN.md)  |  `Greedy`,`Math`  |  Medium  |    |
|  [0671](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree)  |  [Second Minimum Node In a Binary Tree](/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0672](https://leetcode.com/problems/bulb-switcher-ii)  |  [Bulb Switcher II](/solution/0600-0699/0672.Bulb%20Switcher%20II/README_EN.md)  |  `Bit Manipulation`,`Depth-First Search`,`Breadth-First Search`,`Math`  |  Medium  |    |
|  [0673](https://leetcode.com/problems/number-of-longest-increasing-subsequence)  |  [Number of Longest Increasing Subsequence](/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README_EN.md)  |  `Binary Indexed Tree`,`Segment Tree`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [0674](https://leetcode.com/problems/longest-continuous-increasing-subsequence)  |  [Longest Continuous Increasing Subsequence](/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README_EN.md)  |  `Array`  |  Easy  |    |
|  [0675](https://leetcode.com/problems/cut-off-trees-for-golf-event)  |  [Cut Off Trees for Golf Event](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0676](https://leetcode.com/problems/implement-magic-dictionary)  |  [Implement Magic Dictionary](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README_EN.md)  |  `Design`,`Trie`,`Hash Table`,`String`  |  Medium  |    |
|  [0677](https://leetcode.com/problems/map-sum-pairs)  |  [Map Sum Pairs](/solution/0600-0699/0677.Map%20Sum%20Pairs/README_EN.md)  |  `Design`,`Trie`,`Hash Table`,`String`  |  Medium  |    |
|  [0678](https://leetcode.com/problems/valid-parenthesis-string)  |  [Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README_EN.md)  |  `Stack`,`Greedy`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [0679](https://leetcode.com/problems/24-game)  |  [24 Game](/solution/0600-0699/0679.24%20Game/README_EN.md)  |  `Array`,`Math`,`Backtracking`  |  Hard  |    |
|  [0680](https://leetcode.com/problems/valid-palindrome-ii)  |  [Valid Palindrome II](/solution/0600-0699/0680.Valid%20Palindrome%20II/README_EN.md)  |  `Greedy`,`Two Pointers`,`String`  |  Easy  |    |
|  [0681](https://leetcode.com/problems/next-closest-time)  |  [Next Closest Time](/solution/0600-0699/0681.Next%20Closest%20Time/README_EN.md)  |  `String`,`Enumeration`  |  Medium  |  🔒  |
|  [0682](https://leetcode.com/problems/baseball-game)  |  [Baseball Game](/solution/0600-0699/0682.Baseball%20Game/README_EN.md)  |  `Stack`,`Array`,`Simulation`  |  Easy  |    |
|  [0683](https://leetcode.com/problems/k-empty-slots)  |  [K Empty Slots](/solution/0600-0699/0683.K%20Empty%20Slots/README_EN.md)  |  `Binary Indexed Tree`,`Array`,`Ordered Set`,`Sliding Window`  |  Hard  |  🔒  |
|  [0684](https://leetcode.com/problems/redundant-connection)  |  [Redundant Connection](/solution/0600-0699/0684.Redundant%20Connection/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Medium  |    |
|  [0685](https://leetcode.com/problems/redundant-connection-ii)  |  [Redundant Connection II](/solution/0600-0699/0685.Redundant%20Connection%20II/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Hard  |    |
|  [0686](https://leetcode.com/problems/repeated-string-match)  |  [Repeated String Match](/solution/0600-0699/0686.Repeated%20String%20Match/README_EN.md)  |  `String`,`String Matching`  |  Medium  |    |
|  [0687](https://leetcode.com/problems/longest-univalue-path)  |  [Longest Univalue Path](/solution/0600-0699/0687.Longest%20Univalue%20Path/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0688](https://leetcode.com/problems/knight-probability-in-chessboard)  |  [Knight Probability in Chessboard](/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README_EN.md)  |  `Dynamic Programming`  |  Medium  |    |
|  [0689](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays)  |  [Maximum Sum of 3 Non-Overlapping Subarrays](/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [0690](https://leetcode.com/problems/employee-importance)  |  [Employee Importance](/solution/0600-0699/0690.Employee%20Importance/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Hash Table`  |  Easy  |    |
|  [0691](https://leetcode.com/problems/stickers-to-spell-word)  |  [Stickers to Spell Word](/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README_EN.md)  |  `Bit Manipulation`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Hard  |    |
|  [0692](https://leetcode.com/problems/top-k-frequent-words)  |  [Top K Frequent Words](/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README_EN.md)  |  `Trie`,`Hash Table`,`String`,`Bucket Sort`,`Counting`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0693](https://leetcode.com/problems/binary-number-with-alternating-bits)  |  [Binary Number with Alternating Bits](/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README_EN.md)  |  `Bit Manipulation`  |  Easy  |    |
|  [0694](https://leetcode.com/problems/number-of-distinct-islands)  |  [Number of Distinct Islands](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Hash Table`,`Hash Function`  |  Medium  |  🔒  |
|  [0695](https://leetcode.com/problems/max-area-of-island)  |  [Max Area of Island](/solution/0600-0699/0695.Max%20Area%20of%20Island/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Medium  |    |
|  [0696](https://leetcode.com/problems/count-binary-substrings)  |  [Count Binary Substrings](/solution/0600-0699/0696.Count%20Binary%20Substrings/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |    |
|  [0697](https://leetcode.com/problems/degree-of-an-array)  |  [Degree of an Array](/solution/0600-0699/0697.Degree%20of%20an%20Array/README_EN.md)  |  `Array`,`Hash Table`  |  Easy  |    |
|  [0698](https://leetcode.com/problems/partition-to-k-equal-sum-subsets)  |  [Partition to K Equal Sum Subsets](/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README_EN.md)  |  `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Medium  |    |
|  [0699](https://leetcode.com/problems/falling-squares)  |  [Falling Squares](/solution/0600-0699/0699.Falling%20Squares/README_EN.md)  |  `Segment Tree`,`Array`,`Ordered Set`  |  Hard  |    |
|  [0700](https://leetcode.com/problems/search-in-a-binary-search-tree)  |  [Search in a Binary Search Tree](/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Binary Tree`  |  Easy  |    |
|  [0701](https://leetcode.com/problems/insert-into-a-binary-search-tree)  |  [Insert into a Binary Search Tree](/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Binary Tree`  |  Medium  |    |
|  [0702](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size)  |  [Search in a Sorted Array of Unknown Size](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README_EN.md)  |  `Array`,`Binary Search`,`Interactive`  |  Medium  |  🔒  |
|  [0703](https://leetcode.com/problems/kth-largest-element-in-a-stream)  |  [Kth Largest Element in a Stream](/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README_EN.md)  |  `Tree`,`Design`,`Binary Search Tree`,`Binary Tree`,`Data Stream`,`Heap (Priority Queue)`  |  Easy  |    |
|  [0704](https://leetcode.com/problems/binary-search)  |  [Binary Search](/solution/0700-0799/0704.Binary%20Search/README_EN.md)  |  `Array`,`Binary Search`  |  Easy  |    |
|  [0705](https://leetcode.com/problems/design-hashset)  |  [Design HashSet](/solution/0700-0799/0705.Design%20HashSet/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Linked List`,`Hash Function`  |  Easy  |    |
|  [0706](https://leetcode.com/problems/design-hashmap)  |  [Design HashMap](/solution/0700-0799/0706.Design%20HashMap/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Linked List`,`Hash Function`  |  Easy  |    |
|  [0707](https://leetcode.com/problems/design-linked-list)  |  [Design Linked List](/solution/0700-0799/0707.Design%20Linked%20List/README_EN.md)  |  `Design`,`Linked List`  |  Medium  |    |
|  [0708](https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list)  |  [Insert into a Sorted Circular Linked List](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README_EN.md)  |  `Linked List`  |  Medium  |  🔒  |
|  [0709](https://leetcode.com/problems/to-lower-case)  |  [To Lower Case](/solution/0700-0799/0709.To%20Lower%20Case/README_EN.md)  |  `String`  |  Easy  |    |
|  [0710](https://leetcode.com/problems/random-pick-with-blacklist)  |  [Random Pick with Blacklist](/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README_EN.md)  |  `Hash Table`,`Math`,`Binary Search`,`Sorting`,`Randomized`  |  Hard  |    |
|  [0711](https://leetcode.com/problems/number-of-distinct-islands-ii)  |  [Number of Distinct Islands II](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Hash Table`,`Hash Function`  |  Hard  |  🔒  |
|  [0712](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings)  |  [Minimum ASCII Delete Sum for Two Strings](/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [0713](https://leetcode.com/problems/subarray-product-less-than-k)  |  [Subarray Product Less Than K](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README_EN.md)  |  `Array`,`Sliding Window`  |  Medium  |    |
|  [0714](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)  |  [Best Time to Buy and Sell Stock with Transaction Fee](/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [0715](https://leetcode.com/problems/range-module)  |  [Range Module](/solution/0700-0799/0715.Range%20Module/README_EN.md)  |  `Design`,`Segment Tree`,`Ordered Set`  |  Hard  |    |
|  [0716](https://leetcode.com/problems/max-stack)  |  [Max Stack](/solution/0700-0799/0716.Max%20Stack/README_EN.md)  |  `Stack`,`Design`,`Linked List`,`Doubly-Linked List`,`Ordered Set`  |  Easy  |  🔒  |
|  [0717](https://leetcode.com/problems/1-bit-and-2-bit-characters)  |  [1-bit and 2-bit Characters](/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README_EN.md)  |  `Array`  |  Easy  |    |
|  [0718](https://leetcode.com/problems/maximum-length-of-repeated-subarray)  |  [Maximum Length of Repeated Subarray](/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README_EN.md)  |  `Array`,`Binary Search`,`Dynamic Programming`,`Sliding Window`,`Hash Function`,`Rolling Hash`  |  Medium  |    |
|  [0719](https://leetcode.com/problems/find-k-th-smallest-pair-distance)  |  [Find K-th Smallest Pair Distance](/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`,`Sorting`  |  Hard  |    |
|  [0720](https://leetcode.com/problems/longest-word-in-dictionary)  |  [Longest Word in Dictionary](/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README_EN.md)  |  `Trie`,`Array`,`Hash Table`,`String`,`Sorting`  |  Easy  |    |
|  [0721](https://leetcode.com/problems/accounts-merge)  |  [Accounts Merge](/solution/0700-0799/0721.Accounts%20Merge/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`String`  |  Medium  |    |
|  [0722](https://leetcode.com/problems/remove-comments)  |  [Remove Comments](/solution/0700-0799/0722.Remove%20Comments/README_EN.md)  |  `Array`,`String`  |  Medium  |    |
|  [0723](https://leetcode.com/problems/candy-crush)  |  [Candy Crush](/solution/0700-0799/0723.Candy%20Crush/README_EN.md)  |  `Array`,`Two Pointers`,`Matrix`,`Simulation`  |  Medium  |  🔒  |
|  [0724](https://leetcode.com/problems/find-pivot-index)  |  [Find Pivot Index](/solution/0700-0799/0724.Find%20Pivot%20Index/README_EN.md)  |  `Array`,`Prefix Sum`  |  Easy  |    |
|  [0725](https://leetcode.com/problems/split-linked-list-in-parts)  |  [Split Linked List in Parts](/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README_EN.md)  |  `Linked List`  |  Medium  |    |
|  [0726](https://leetcode.com/problems/number-of-atoms)  |  [Number of Atoms](/solution/0700-0799/0726.Number%20of%20Atoms/README_EN.md)  |  `Stack`,`Hash Table`,`String`  |  Hard  |    |
|  [0727](https://leetcode.com/problems/minimum-window-subsequence)  |  [Minimum Window Subsequence](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README_EN.md)  |  `String`,`Dynamic Programming`,`Sliding Window`  |  Hard  |  🔒  |
|  [0728](https://leetcode.com/problems/self-dividing-numbers)  |  [Self Dividing Numbers](/solution/0700-0799/0728.Self%20Dividing%20Numbers/README_EN.md)  |  `Math`  |  Easy  |    |
|  [0729](https://leetcode.com/problems/my-calendar-i)  |  [My Calendar I](/solution/0700-0799/0729.My%20Calendar%20I/README_EN.md)  |  `Design`,`Segment Tree`,`Ordered Set`  |  Medium  |    |
|  [0730](https://leetcode.com/problems/count-different-palindromic-subsequences)  |  [Count Different Palindromic Subsequences](/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0731](https://leetcode.com/problems/my-calendar-ii)  |  [My Calendar II](/solution/0700-0799/0731.My%20Calendar%20II/README_EN.md)  |  `Design`,`Segment Tree`,`Ordered Set`  |  Medium  |    |
|  [0732](https://leetcode.com/problems/my-calendar-iii)  |  [My Calendar III](/solution/0700-0799/0732.My%20Calendar%20III/README_EN.md)  |  `Design`,`Segment Tree`,`Ordered Set`  |  Hard  |    |
|  [0733](https://leetcode.com/problems/flood-fill)  |  [Flood Fill](/solution/0700-0799/0733.Flood%20Fill/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`  |  Easy  |    |
|  [0734](https://leetcode.com/problems/sentence-similarity)  |  [Sentence Similarity](/solution/0700-0799/0734.Sentence%20Similarity/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Easy  |  🔒  |
|  [0735](https://leetcode.com/problems/asteroid-collision)  |  [Asteroid Collision](/solution/0700-0799/0735.Asteroid%20Collision/README_EN.md)  |  `Stack`,`Array`  |  Medium  |    |
|  [0736](https://leetcode.com/problems/parse-lisp-expression)  |  [Parse Lisp Expression](/solution/0700-0799/0736.Parse%20Lisp%20Expression/README_EN.md)  |  `Stack`,`Recursion`,`Hash Table`,`String`  |  Hard  |    |
|  [0737](https://leetcode.com/problems/sentence-similarity-ii)  |  [Sentence Similarity II](/solution/0700-0799/0737.Sentence%20Similarity%20II/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String`  |  Medium  |  🔒  |
|  [0738](https://leetcode.com/problems/monotone-increasing-digits)  |  [Monotone Increasing Digits](/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README_EN.md)  |  `Greedy`,`Math`  |  Medium  |    |
|  [0739](https://leetcode.com/problems/daily-temperatures)  |  [Daily Temperatures](/solution/0700-0799/0739.Daily%20Temperatures/README_EN.md)  |  `Stack`,`Array`,`Monotonic Stack`  |  Medium  |    |
|  [0740](https://leetcode.com/problems/delete-and-earn)  |  [Delete and Earn](/solution/0700-0799/0740.Delete%20and%20Earn/README_EN.md)  |  `Array`,`Hash Table`,`Dynamic Programming`  |  Medium  |    |
|  [0741](https://leetcode.com/problems/cherry-pickup)  |  [Cherry Pickup](/solution/0700-0799/0741.Cherry%20Pickup/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Hard  |    |
|  [0742](https://leetcode.com/problems/closest-leaf-in-a-binary-tree)  |  [Closest Leaf in a Binary Tree](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [0743](https://leetcode.com/problems/network-delay-time)  |  [Network Delay Time](/solution/0700-0799/0743.Network%20Delay%20Time/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0744](https://leetcode.com/problems/find-smallest-letter-greater-than-target)  |  [Find Smallest Letter Greater Than Target](/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README_EN.md)  |  `Array`,`Binary Search`  |  Easy  |    |
|  [0745](https://leetcode.com/problems/prefix-and-suffix-search)  |  [Prefix and Suffix Search](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README_EN.md)  |  `Design`,`Trie`,`String`  |  Hard  |    |
|  [0746](https://leetcode.com/problems/min-cost-climbing-stairs)  |  [Min Cost Climbing Stairs](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Easy  |    |
|  [0747](https://leetcode.com/problems/largest-number-at-least-twice-of-others)  |  [Largest Number At Least Twice of Others](/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README_EN.md)  |  `Array`,`Sorting`  |  Easy  |    |
|  [0748](https://leetcode.com/problems/shortest-completing-word)  |  [Shortest Completing Word](/solution/0700-0799/0748.Shortest%20Completing%20Word/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [0749](https://leetcode.com/problems/contain-virus)  |  [Contain Virus](/solution/0700-0799/0749.Contain%20Virus/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Simulation`  |  Hard  |    |
|  [0750](https://leetcode.com/problems/number-of-corner-rectangles)  |  [Number Of Corner Rectangles](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Matrix`  |  Medium  |  🔒  |
|  [0751](https://leetcode.com/problems/ip-to-cidr)  |  [IP to CIDR](/solution/0700-0799/0751.IP%20to%20CIDR/README_EN.md)  |  `Bit Manipulation`,`String`  |  Medium  |  🔒  |
|  [0752](https://leetcode.com/problems/open-the-lock)  |  [Open the Lock](/solution/0700-0799/0752.Open%20the%20Lock/README_EN.md)  |  `Breadth-First Search`,`Array`,`Hash Table`,`String`  |  Medium  |    |
|  [0753](https://leetcode.com/problems/cracking-the-safe)  |  [Cracking the Safe](/solution/0700-0799/0753.Cracking%20the%20Safe/README_EN.md)  |  `Depth-First Search`,`Graph`,`Eulerian Circuit`  |  Hard  |    |
|  [0754](https://leetcode.com/problems/reach-a-number)  |  [Reach a Number](/solution/0700-0799/0754.Reach%20a%20Number/README_EN.md)  |  `Math`,`Binary Search`  |  Medium  |    |
|  [0755](https://leetcode.com/problems/pour-water)  |  [Pour Water](/solution/0700-0799/0755.Pour%20Water/README_EN.md)  |  `Array`,`Simulation`  |  Medium  |  🔒  |
|  [0756](https://leetcode.com/problems/pyramid-transition-matrix)  |  [Pyramid Transition Matrix](/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README_EN.md)  |  `Bit Manipulation`,`Depth-First Search`,`Breadth-First Search`  |  Medium  |    |
|  [0757](https://leetcode.com/problems/set-intersection-size-at-least-two)  |  [Set Intersection Size At Least Two](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Hard  |    |
|  [0758](https://leetcode.com/problems/bold-words-in-string)  |  [Bold Words in String](/solution/0700-0799/0758.Bold%20Words%20in%20String/README_EN.md)  |  `Trie`,`Array`,`Hash Table`,`String`,`String Matching`  |  Medium  |  🔒  |
|  [0759](https://leetcode.com/problems/employee-free-time)  |  [Employee Free Time](/solution/0700-0799/0759.Employee%20Free%20Time/README_EN.md)  |  `Array`,`Sorting`,`Heap (Priority Queue)`  |  Hard  |  🔒  |
|  [0760](https://leetcode.com/problems/find-anagram-mappings)  |  [Find Anagram Mappings](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README_EN.md)  |  `Array`,`Hash Table`  |  Easy  |  🔒  |
|  [0761](https://leetcode.com/problems/special-binary-string)  |  [Special Binary String](/solution/0700-0799/0761.Special%20Binary%20String/README_EN.md)  |  `Recursion`,`String`  |  Hard  |    |
|  [0762](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation)  |  [Prime Number of Set Bits in Binary Representation](/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README_EN.md)  |  `Bit Manipulation`,`Math`  |  Easy  |    |
|  [0763](https://leetcode.com/problems/partition-labels)  |  [Partition Labels](/solution/0700-0799/0763.Partition%20Labels/README_EN.md)  |  `Greedy`,`Hash Table`,`Two Pointers`,`String`  |  Medium  |    |
|  [0764](https://leetcode.com/problems/largest-plus-sign)  |  [Largest Plus Sign](/solution/0700-0799/0764.Largest%20Plus%20Sign/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0765](https://leetcode.com/problems/couples-holding-hands)  |  [Couples Holding Hands](/solution/0700-0799/0765.Couples%20Holding%20Hands/README_EN.md)  |  `Greedy`,`Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Hard  |    |
|  [0766](https://leetcode.com/problems/toeplitz-matrix)  |  [Toeplitz Matrix](/solution/0700-0799/0766.Toeplitz%20Matrix/README_EN.md)  |  `Array`,`Matrix`  |  Easy  |    |
|  [0767](https://leetcode.com/problems/reorganize-string)  |  [Reorganize String](/solution/0700-0799/0767.Reorganize%20String/README_EN.md)  |  `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0768](https://leetcode.com/problems/max-chunks-to-make-sorted-ii)  |  [Max Chunks To Make Sorted II](/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README_EN.md)  |  `Stack`,`Greedy`,`Array`,`Sorting`,`Monotonic Stack`  |  Hard  |    |
|  [0769](https://leetcode.com/problems/max-chunks-to-make-sorted)  |  [Max Chunks To Make Sorted](/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README_EN.md)  |  `Stack`,`Greedy`,`Array`,`Sorting`,`Monotonic Stack`  |  Medium  |    |
|  [0770](https://leetcode.com/problems/basic-calculator-iv)  |  [Basic Calculator IV](/solution/0700-0799/0770.Basic%20Calculator%20IV/README_EN.md)  |  `Stack`,`Recursion`,`Hash Table`,`Math`,`String`  |  Hard  |    |
|  [0771](https://leetcode.com/problems/jewels-and-stones)  |  [Jewels and Stones](/solution/0700-0799/0771.Jewels%20and%20Stones/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [0772](https://leetcode.com/problems/basic-calculator-iii)  |  [Basic Calculator III](/solution/0700-0799/0772.Basic%20Calculator%20III/README_EN.md)  |  `Stack`,`Recursion`,`Math`,`String`  |  Hard  |  🔒  |
|  [0773](https://leetcode.com/problems/sliding-puzzle)  |  [Sliding Puzzle](/solution/0700-0799/0773.Sliding%20Puzzle/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Hard  |    |
|  [0774](https://leetcode.com/problems/minimize-max-distance-to-gas-station)  |  [Minimize Max Distance to Gas Station](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README_EN.md)  |  `Array`,`Binary Search`  |  Hard  |  🔒  |
|  [0775](https://leetcode.com/problems/global-and-local-inversions)  |  [Global and Local Inversions](/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README_EN.md)  |  `Array`,`Math`  |  Medium  |    |
|  [0776](https://leetcode.com/problems/split-bst)  |  [Split BST](/solution/0700-0799/0776.Split%20BST/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Recursion`,`Binary Tree`  |  Medium  |  🔒  |
|  [0777](https://leetcode.com/problems/swap-adjacent-in-lr-string)  |  [Swap Adjacent in LR String](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README_EN.md)  |  `Two Pointers`,`String`  |  Medium  |    |
|  [0778](https://leetcode.com/problems/swim-in-rising-water)  |  [Swim in Rising Water](/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0779](https://leetcode.com/problems/k-th-symbol-in-grammar)  |  [K-th Symbol in Grammar](/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README_EN.md)  |  `Bit Manipulation`,`Recursion`,`Math`  |  Medium  |    |
|  [0780](https://leetcode.com/problems/reaching-points)  |  [Reaching Points](/solution/0700-0799/0780.Reaching%20Points/README_EN.md)  |  `Math`  |  Hard  |    |
|  [0781](https://leetcode.com/problems/rabbits-in-forest)  |  [Rabbits in Forest](/solution/0700-0799/0781.Rabbits%20in%20Forest/README_EN.md)  |  `Greedy`,`Hash Table`,`Math`  |  Medium  |    |
|  [0782](https://leetcode.com/problems/transform-to-chessboard)  |  [Transform to Chessboard](/solution/0700-0799/0782.Transform%20to%20Chessboard/README_EN.md)  |  `Bit Manipulation`,`Array`,`Math`,`Matrix`  |  Hard  |    |
|  [0783](https://leetcode.com/problems/minimum-distance-between-bst-nodes)  |  [Minimum Distance Between BST Nodes](/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Easy  |    |
|  [0784](https://leetcode.com/problems/letter-case-permutation)  |  [Letter Case Permutation](/solution/0700-0799/0784.Letter%20Case%20Permutation/README_EN.md)  |  `Bit Manipulation`,`String`,`Backtracking`  |  Medium  |    |
|  [0785](https://leetcode.com/problems/is-graph-bipartite)  |  [Is Graph Bipartite](/solution/0700-0799/0785.Is%20Graph%20Bipartite/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Medium  |    |
|  [0786](https://leetcode.com/problems/k-th-smallest-prime-fraction)  |  [K-th Smallest Prime Fraction](/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README_EN.md)  |  `Array`,`Binary Search`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0787](https://leetcode.com/problems/cheapest-flights-within-k-stops)  |  [Cheapest Flights Within K Stops](/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Dynamic Programming`,`Shortest Path`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0788](https://leetcode.com/problems/rotated-digits)  |  [Rotated Digits](/solution/0700-0799/0788.Rotated%20Digits/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Medium  |    |
|  [0789](https://leetcode.com/problems/escape-the-ghosts)  |  [Escape The Ghosts](/solution/0700-0799/0789.Escape%20The%20Ghosts/README_EN.md)  |  `Array`,`Math`  |  Medium  |    |
|  [0790](https://leetcode.com/problems/domino-and-tromino-tiling)  |  [Domino and Tromino Tiling](/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README_EN.md)  |  `Dynamic Programming`  |  Medium  |    |
|  [0791](https://leetcode.com/problems/custom-sort-string)  |  [Custom Sort String](/solution/0700-0799/0791.Custom%20Sort%20String/README_EN.md)  |  `Hash Table`,`String`,`Sorting`  |  Medium  |    |
|  [0792](https://leetcode.com/problems/number-of-matching-subsequences)  |  [Number of Matching Subsequences](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README_EN.md)  |  `Trie`,`Hash Table`,`String`,`Sorting`  |  Medium  |    |
|  [0793](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function)  |  [Preimage Size of Factorial Zeroes Function](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README_EN.md)  |  `Math`,`Binary Search`  |  Hard  |    |
|  [0794](https://leetcode.com/problems/valid-tic-tac-toe-state)  |  [Valid Tic-Tac-Toe State](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README_EN.md)  |  `Array`,`String`  |  Medium  |    |
|  [0795](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum)  |  [Number of Subarrays with Bounded Maximum](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README_EN.md)  |  `Array`,`Two Pointers`  |  Medium  |    |
|  [0796](https://leetcode.com/problems/rotate-string)  |  [Rotate String](/solution/0700-0799/0796.Rotate%20String/README_EN.md)  |  `String`,`String Matching`  |  Easy  |    |
|  [0797](https://leetcode.com/problems/all-paths-from-source-to-target)  |  [All Paths From Source to Target](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Backtracking`  |  Medium  |    |
|  [0798](https://leetcode.com/problems/smallest-rotation-with-highest-score)  |  [Smallest Rotation with Highest Score](/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README_EN.md)  |  `Array`,`Prefix Sum`  |  Hard  |    |
|  [0799](https://leetcode.com/problems/champagne-tower)  |  [Champagne Tower](/solution/0700-0799/0799.Champagne%20Tower/README_EN.md)  |  `Dynamic Programming`  |  Medium  |    |
|  [0800](https://leetcode.com/problems/similar-rgb-color)  |  [Similar RGB Color](/solution/0800-0899/0800.Similar%20RGB%20Color/README_EN.md)  |  `Math`,`String`,`Enumeration`  |  Easy  |  🔒  |
|  [0801](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing)  |  [Minimum Swaps To Make Sequences Increasing](/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [0802](https://leetcode.com/problems/find-eventual-safe-states)  |  [Find Eventual Safe States](/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`  |  Medium  |    |
|  [0803](https://leetcode.com/problems/bricks-falling-when-hit)  |  [Bricks Falling When Hit](/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README_EN.md)  |  `Union Find`,`Array`,`Matrix`  |  Hard  |    |
|  [0804](https://leetcode.com/problems/unique-morse-code-words)  |  [Unique Morse Code Words](/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Easy  |    |
|  [0805](https://leetcode.com/problems/split-array-with-same-average)  |  [Split Array With Same Average](/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README_EN.md)  |  `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [0806](https://leetcode.com/problems/number-of-lines-to-write-string)  |  [Number of Lines To Write String](/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README_EN.md)  |  `Array`,`String`  |  Easy  |    |
|  [0807](https://leetcode.com/problems/max-increase-to-keep-city-skyline)  |  [Max Increase to Keep City Skyline](/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README_EN.md)  |  `Greedy`,`Array`,`Matrix`  |  Medium  |    |
|  [0808](https://leetcode.com/problems/soup-servings)  |  [Soup Servings](/solution/0800-0899/0808.Soup%20Servings/README_EN.md)  |  `Math`,`Dynamic Programming`,`Probability and Statistics`  |  Medium  |    |
|  [0809](https://leetcode.com/problems/expressive-words)  |  [Expressive Words](/solution/0800-0899/0809.Expressive%20Words/README_EN.md)  |  `Array`,`Two Pointers`,`String`  |  Medium  |    |
|  [0810](https://leetcode.com/problems/chalkboard-xor-game)  |  [Chalkboard XOR Game](/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README_EN.md)  |  `Bit Manipulation`,`Brainteaser`,`Array`,`Math`,`Game Theory`  |  Hard  |    |
|  [0811](https://leetcode.com/problems/subdomain-visit-count)  |  [Subdomain Visit Count](/solution/0800-0899/0811.Subdomain%20Visit%20Count/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |    |
|  [0812](https://leetcode.com/problems/largest-triangle-area)  |  [Largest Triangle Area](/solution/0800-0899/0812.Largest%20Triangle%20Area/README_EN.md)  |  `Geometry`,`Array`,`Math`  |  Easy  |    |
|  [0813](https://leetcode.com/problems/largest-sum-of-averages)  |  [Largest Sum of Averages](/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0814](https://leetcode.com/problems/binary-tree-pruning)  |  [Binary Tree Pruning](/solution/0800-0899/0814.Binary%20Tree%20Pruning/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0815](https://leetcode.com/problems/bus-routes)  |  [Bus Routes](/solution/0800-0899/0815.Bus%20Routes/README_EN.md)  |  `Breadth-First Search`,`Array`,`Hash Table`  |  Hard  |    |
|  [0816](https://leetcode.com/problems/ambiguous-coordinates)  |  [Ambiguous Coordinates](/solution/0800-0899/0816.Ambiguous%20Coordinates/README_EN.md)  |  `String`,`Backtracking`  |  Medium  |    |
|  [0817](https://leetcode.com/problems/linked-list-components)  |  [Linked List Components](/solution/0800-0899/0817.Linked%20List%20Components/README_EN.md)  |  `Hash Table`,`Linked List`  |  Medium  |    |
|  [0818](https://leetcode.com/problems/race-car)  |  [Race Car](/solution/0800-0899/0818.Race%20Car/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [0819](https://leetcode.com/problems/most-common-word)  |  [Most Common Word](/solution/0800-0899/0819.Most%20Common%20Word/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [0820](https://leetcode.com/problems/short-encoding-of-words)  |  [Short Encoding of Words](/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README_EN.md)  |  `Trie`,`Array`,`Hash Table`,`String`  |  Medium  |    |
|  [0821](https://leetcode.com/problems/shortest-distance-to-a-character)  |  [Shortest Distance to a Character](/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README_EN.md)  |  `Array`,`Two Pointers`,`String`  |  Easy  |    |
|  [0822](https://leetcode.com/problems/card-flipping-game)  |  [Card Flipping Game](/solution/0800-0899/0822.Card%20Flipping%20Game/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [0823](https://leetcode.com/problems/binary-trees-with-factors)  |  [Binary Trees With Factors](/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README_EN.md)  |  `Array`,`Hash Table`,`Dynamic Programming`  |  Medium  |    |
|  [0824](https://leetcode.com/problems/goat-latin)  |  [Goat Latin](/solution/0800-0899/0824.Goat%20Latin/README_EN.md)  |  `String`  |  Easy  |    |
|  [0825](https://leetcode.com/problems/friends-of-appropriate-ages)  |  [Friends Of Appropriate Ages](/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [0826](https://leetcode.com/problems/most-profit-assigning-work)  |  [Most Profit Assigning Work](/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [0827](https://leetcode.com/problems/making-a-large-island)  |  [Making A Large Island](/solution/0800-0899/0827.Making%20A%20Large%20Island/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Hard  |    |
|  [0828](https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string)  |  [Count Unique Characters of All Substrings of a Given String](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0829](https://leetcode.com/problems/consecutive-numbers-sum)  |  [Consecutive Numbers Sum](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README_EN.md)  |  `Math`,`Enumeration`  |  Hard  |    |
|  [0830](https://leetcode.com/problems/positions-of-large-groups)  |  [Positions of Large Groups](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README_EN.md)  |  `String`  |  Easy  |    |
|  [0831](https://leetcode.com/problems/masking-personal-information)  |  [Masking Personal Information](/solution/0800-0899/0831.Masking%20Personal%20Information/README_EN.md)  |  `String`  |  Medium  |    |
|  [0832](https://leetcode.com/problems/flipping-an-image)  |  [Flipping an Image](/solution/0800-0899/0832.Flipping%20an%20Image/README_EN.md)  |  `Array`,`Two Pointers`,`Matrix`,`Simulation`  |  Easy  |    |
|  [0833](https://leetcode.com/problems/find-and-replace-in-string)  |  [Find And Replace in String](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README_EN.md)  |  `Array`,`String`,`Sorting`  |  Medium  |    |
|  [0834](https://leetcode.com/problems/sum-of-distances-in-tree)  |  [Sum of Distances in Tree](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Graph`,`Dynamic Programming`  |  Hard  |    |
|  [0835](https://leetcode.com/problems/image-overlap)  |  [Image Overlap](/solution/0800-0899/0835.Image%20Overlap/README_EN.md)  |  `Array`,`Matrix`  |  Medium  |    |
|  [0836](https://leetcode.com/problems/rectangle-overlap)  |  [Rectangle Overlap](/solution/0800-0899/0836.Rectangle%20Overlap/README_EN.md)  |  `Geometry`,`Math`  |  Easy  |    |
|  [0837](https://leetcode.com/problems/new-21-game)  |  [New 21 Game](/solution/0800-0899/0837.New%2021%20Game/README_EN.md)  |  `Math`,`Dynamic Programming`,`Sliding Window`,`Probability and Statistics`  |  Medium  |    |
|  [0838](https://leetcode.com/problems/push-dominoes)  |  [Push Dominoes](/solution/0800-0899/0838.Push%20Dominoes/README_EN.md)  |  `Two Pointers`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [0839](https://leetcode.com/problems/similar-string-groups)  |  [Similar String Groups](/solution/0800-0899/0839.Similar%20String%20Groups/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`String`  |  Hard  |    |
|  [0840](https://leetcode.com/problems/magic-squares-in-grid)  |  [Magic Squares In Grid](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README_EN.md)  |  `Array`,`Math`,`Matrix`  |  Medium  |    |
|  [0841](https://leetcode.com/problems/keys-and-rooms)  |  [Keys and Rooms](/solution/0800-0899/0841.Keys%20and%20Rooms/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`  |  Medium  |    |
|  [0842](https://leetcode.com/problems/split-array-into-fibonacci-sequence)  |  [Split Array into Fibonacci Sequence](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README_EN.md)  |  `String`,`Backtracking`  |  Medium  |    |
|  [0843](https://leetcode.com/problems/guess-the-word)  |  [Guess the Word](/solution/0800-0899/0843.Guess%20the%20Word/README_EN.md)  |  `Array`,`Math`,`String`,`Game Theory`,`Interactive`  |  Hard  |    |
|  [0844](https://leetcode.com/problems/backspace-string-compare)  |  [Backspace String Compare](/solution/0800-0899/0844.Backspace%20String%20Compare/README_EN.md)  |  `Stack`,`Two Pointers`,`String`,`Simulation`  |  Easy  |    |
|  [0845](https://leetcode.com/problems/longest-mountain-in-array)  |  [Longest Mountain in Array](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README_EN.md)  |  `Array`,`Two Pointers`,`Dynamic Programming`,`Enumeration`  |  Medium  |    |
|  [0846](https://leetcode.com/problems/hand-of-straights)  |  [Hand of Straights](/solution/0800-0899/0846.Hand%20of%20Straights/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Sorting`  |  Medium  |    |
|  [0847](https://leetcode.com/problems/shortest-path-visiting-all-nodes)  |  [Shortest Path Visiting All Nodes](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README_EN.md)  |  `Bit Manipulation`,`Breadth-First Search`,`Graph`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [0848](https://leetcode.com/problems/shifting-letters)  |  [Shifting Letters](/solution/0800-0899/0848.Shifting%20Letters/README_EN.md)  |  `Array`,`String`  |  Medium  |    |
|  [0849](https://leetcode.com/problems/maximize-distance-to-closest-person)  |  [Maximize Distance to Closest Person](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README_EN.md)  |  `Array`  |  Medium  |    |
|  [0850](https://leetcode.com/problems/rectangle-area-ii)  |  [Rectangle Area II](/solution/0800-0899/0850.Rectangle%20Area%20II/README_EN.md)  |  `Segment Tree`,`Array`,`Ordered Set`,`Line Sweep`  |  Hard  |    |
|  [0851](https://leetcode.com/problems/loud-and-rich)  |  [Loud and Rich](/solution/0800-0899/0851.Loud%20and%20Rich/README_EN.md)  |  `Depth-First Search`,`Graph`,`Topological Sort`,`Array`  |  Medium  |    |
|  [0852](https://leetcode.com/problems/peak-index-in-a-mountain-array)  |  [Peak Index in a Mountain Array](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README_EN.md)  |  `Array`,`Binary Search`  |  Easy  |    |
|  [0853](https://leetcode.com/problems/car-fleet)  |  [Car Fleet](/solution/0800-0899/0853.Car%20Fleet/README_EN.md)  |  `Array`,`Sorting`  |  Medium  |    |
|  [0854](https://leetcode.com/problems/k-similar-strings)  |  [K-Similar Strings](/solution/0800-0899/0854.K-Similar%20Strings/README_EN.md)  |  `Breadth-First Search`,`String`  |  Hard  |    |
|  [0856](https://leetcode.com/problems/score-of-parentheses)  |  [Score of Parentheses](/solution/0800-0899/0856.Score%20of%20Parentheses/README_EN.md)  |  `Stack`,`String`  |  Medium  |    |
|  [0857](https://leetcode.com/problems/minimum-cost-to-hire-k-workers)  |  [Minimum Cost to Hire K Workers](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README_EN.md)  |  `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0858](https://leetcode.com/problems/mirror-reflection)  |  [Mirror Reflection](/solution/0800-0899/0858.Mirror%20Reflection/README_EN.md)  |  `Geometry`,`Math`  |  Medium  |    |
|  [0859](https://leetcode.com/problems/buddy-strings)  |  [Buddy Strings](/solution/0800-0899/0859.Buddy%20Strings/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [0860](https://leetcode.com/problems/lemonade-change)  |  [Lemonade Change](/solution/0800-0899/0860.Lemonade%20Change/README_EN.md)  |  `Greedy`,`Array`  |  Easy  |    |
|  [0861](https://leetcode.com/problems/score-after-flipping-matrix)  |  [Score After Flipping Matrix](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README_EN.md)  |  `Greedy`,`Bit Manipulation`,`Array`,`Matrix`  |  Medium  |    |
|  [0862](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k)  |  [Shortest Subarray with Sum at Least K](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README_EN.md)  |  `Queue`,`Array`,`Binary Search`,`Prefix Sum`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0863](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree)  |  [All Nodes Distance K in Binary Tree](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0864](https://leetcode.com/problems/shortest-path-to-get-all-keys)  |  [Shortest Path to Get All Keys](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README_EN.md)  |  `Bit Manipulation`,`Breadth-First Search`  |  Hard  |    |
|  [0865](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes)  |  [Smallest Subtree with all the Deepest Nodes](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`  |  Medium  |    |
|  [0866](https://leetcode.com/problems/prime-palindrome)  |  [Prime Palindrome](/solution/0800-0899/0866.Prime%20Palindrome/README_EN.md)  |  `Math`  |  Medium  |    |
|  [0867](https://leetcode.com/problems/transpose-matrix)  |  [Transpose Matrix](/solution/0800-0899/0867.Transpose%20Matrix/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Easy  |    |
|  [0868](https://leetcode.com/problems/binary-gap)  |  [Binary Gap](/solution/0800-0899/0868.Binary%20Gap/README_EN.md)  |  `Bit Manipulation`,`Math`  |  Easy  |    |
|  [0869](https://leetcode.com/problems/reordered-power-of-2)  |  [Reordered Power of 2](/solution/0800-0899/0869.Reordered%20Power%20of%202/README_EN.md)  |  `Math`,`Counting`,`Enumeration`,`Sorting`  |  Medium  |    |
|  [0870](https://leetcode.com/problems/advantage-shuffle)  |  [Advantage Shuffle](/solution/0800-0899/0870.Advantage%20Shuffle/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [0871](https://leetcode.com/problems/minimum-number-of-refueling-stops)  |  [Minimum Number of Refueling Stops](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0872](https://leetcode.com/problems/leaf-similar-trees)  |  [Leaf-Similar Trees](/solution/0800-0899/0872.Leaf-Similar%20Trees/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0873](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence)  |  [Length of Longest Fibonacci Subsequence](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README_EN.md)  |  `Array`,`Hash Table`,`Dynamic Programming`  |  Medium  |    |
|  [0874](https://leetcode.com/problems/walking-robot-simulation)  |  [Walking Robot Simulation](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README_EN.md)  |  `Array`,`Simulation`  |  Easy  |    |
|  [0875](https://leetcode.com/problems/koko-eating-bananas)  |  [Koko Eating Bananas](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [0876](https://leetcode.com/problems/middle-of-the-linked-list)  |  [Middle of the Linked List](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README_EN.md)  |  `Linked List`,`Two Pointers`  |  Easy  |    |
|  [0877](https://leetcode.com/problems/stone-game)  |  [Stone Game](/solution/0800-0899/0877.Stone%20Game/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Game Theory`  |  Medium  |    |
|  [0878](https://leetcode.com/problems/nth-magical-number)  |  [Nth Magical Number](/solution/0800-0899/0878.Nth%20Magical%20Number/README_EN.md)  |  `Math`,`Binary Search`  |  Hard  |    |
|  [0879](https://leetcode.com/problems/profitable-schemes)  |  [Profitable Schemes](/solution/0800-0899/0879.Profitable%20Schemes/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [0880](https://leetcode.com/problems/decoded-string-at-index)  |  [Decoded String at Index](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README_EN.md)  |  `Stack`,`String`  |  Medium  |    |
|  [0881](https://leetcode.com/problems/boats-to-save-people)  |  [Boats to Save People](/solution/0800-0899/0881.Boats%20to%20Save%20People/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [0882](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph)  |  [Reachable Nodes In Subdivided Graph](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README_EN.md)  |  `Graph`,`Shortest Path`,`Heap (Priority Queue)`  |  Hard  |    |
|  [0883](https://leetcode.com/problems/projection-area-of-3d-shapes)  |  [Projection Area of 3D Shapes](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README_EN.md)  |  `Geometry`,`Array`,`Math`,`Matrix`  |  Easy  |    |
|  [0884](https://leetcode.com/problems/uncommon-words-from-two-sentences)  |  [Uncommon Words from Two Sentences](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [0885](https://leetcode.com/problems/spiral-matrix-iii)  |  [Spiral Matrix III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Medium  |    |
|  [0886](https://leetcode.com/problems/possible-bipartition)  |  [Possible Bipartition](/solution/0800-0899/0886.Possible%20Bipartition/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Medium  |    |
|  [0887](https://leetcode.com/problems/super-egg-drop)  |  [Super Egg Drop](/solution/0800-0899/0887.Super%20Egg%20Drop/README_EN.md)  |  `Math`,`Binary Search`,`Dynamic Programming`  |  Hard  |    |
|  [0888](https://leetcode.com/problems/fair-candy-swap)  |  [Fair Candy Swap](/solution/0800-0899/0888.Fair%20Candy%20Swap/README_EN.md)  |  `Array`,`Hash Table`,`Binary Search`,`Sorting`  |  Easy  |    |
|  [0889](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal)  |  [Construct Binary Tree from Preorder and Postorder Traversal](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README_EN.md)  |  `Tree`,`Array`,`Hash Table`,`Divide and Conquer`,`Binary Tree`  |  Medium  |    |
|  [0890](https://leetcode.com/problems/find-and-replace-pattern)  |  [Find and Replace Pattern](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |    |
|  [0891](https://leetcode.com/problems/sum-of-subsequence-widths)  |  [Sum of Subsequence Widths](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README_EN.md)  |  `Array`,`Math`,`Sorting`  |  Hard  |    |
|  [0892](https://leetcode.com/problems/surface-area-of-3d-shapes)  |  [Surface Area of 3D Shapes](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README_EN.md)  |  `Geometry`,`Array`,`Math`,`Matrix`  |  Easy  |    |
|  [0893](https://leetcode.com/problems/groups-of-special-equivalent-strings)  |  [Groups of Special-Equivalent Strings](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |    |
|  [0894](https://leetcode.com/problems/all-possible-full-binary-trees)  |  [All Possible Full Binary Trees](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README_EN.md)  |  `Tree`,`Recursion`,`Memoization`,`Dynamic Programming`,`Binary Tree`  |  Medium  |    |
|  [0895](https://leetcode.com/problems/maximum-frequency-stack)  |  [Maximum Frequency Stack](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README_EN.md)  |  `Stack`,`Design`,`Hash Table`,`Ordered Set`  |  Hard  |    |
|  [0896](https://leetcode.com/problems/monotonic-array)  |  [Monotonic Array](/solution/0800-0899/0896.Monotonic%20Array/README_EN.md)  |  `Array`  |  Easy  |    |
|  [0897](https://leetcode.com/problems/increasing-order-search-tree)  |  [Increasing Order Search Tree](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Easy  |    |
|  [0898](https://leetcode.com/problems/bitwise-ors-of-subarrays)  |  [Bitwise ORs of Subarrays](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [0899](https://leetcode.com/problems/orderly-queue)  |  [Orderly Queue](/solution/0800-0899/0899.Orderly%20Queue/README_EN.md)  |  `Math`,`String`,`Sorting`  |  Hard  |    |
|  [0900](https://leetcode.com/problems/rle-iterator)  |  [RLE Iterator](/solution/0900-0999/0900.RLE%20Iterator/README_EN.md)  |  `Design`,`Array`,`Counting`,`Iterator`  |  Medium  |    |
|  [0901](https://leetcode.com/problems/online-stock-span)  |  [Online Stock Span](/solution/0900-0999/0901.Online%20Stock%20Span/README_EN.md)  |  `Stack`,`Design`,`Data Stream`,`Monotonic Stack`  |  Medium  |    |
|  [0902](https://leetcode.com/problems/numbers-at-most-n-given-digit-set)  |  [Numbers At Most N Given Digit Set](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README_EN.md)  |  `Array`,`Math`,`Binary Search`,`Dynamic Programming`  |  Hard  |    |
|  [0903](https://leetcode.com/problems/valid-permutations-for-di-sequence)  |  [Valid Permutations for DI Sequence](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [0904](https://leetcode.com/problems/fruit-into-baskets)  |  [Fruit Into Baskets](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README_EN.md)  |  `Array`,`Hash Table`,`Sliding Window`  |  Medium  |    |
|  [0905](https://leetcode.com/problems/sort-array-by-parity)  |  [Sort Array By Parity](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Easy  |    |
|  [0906](https://leetcode.com/problems/super-palindromes)  |  [Super Palindromes](/solution/0900-0999/0906.Super%20Palindromes/README_EN.md)  |  `Math`,`Enumeration`  |  Hard  |    |
|  [0907](https://leetcode.com/problems/sum-of-subarray-minimums)  |  [Sum of Subarray Minimums](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README_EN.md)  |  `Stack`,`Array`,`Dynamic Programming`,`Monotonic Stack`  |  Medium  |    |
|  [0908](https://leetcode.com/problems/smallest-range-i)  |  [Smallest Range I](/solution/0900-0999/0908.Smallest%20Range%20I/README_EN.md)  |  `Array`,`Math`  |  Easy  |    |
|  [0909](https://leetcode.com/problems/snakes-and-ladders)  |  [Snakes and Ladders](/solution/0900-0999/0909.Snakes%20and%20Ladders/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [0910](https://leetcode.com/problems/smallest-range-ii)  |  [Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README_EN.md)  |  `Greedy`,`Array`,`Math`,`Sorting`  |  Medium  |    |
|  [0911](https://leetcode.com/problems/online-election)  |  [Online Election](/solution/0900-0999/0911.Online%20Election/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Binary Search`  |  Medium  |    |
|  [0912](https://leetcode.com/problems/sort-an-array)  |  [Sort an Array](/solution/0900-0999/0912.Sort%20an%20Array/README_EN.md)  |  `Array`,`Divide and Conquer`,`Bucket Sort`,`Counting Sort`,`Radix Sort`,`Sorting`,`Heap (Priority Queue)`,`Merge Sort`  |  Medium  |    |
|  [0913](https://leetcode.com/problems/cat-and-mouse)  |  [Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README_EN.md)  |  `Breadth-First Search`,`Graph`,`Memoization`,`Math`,`Dynamic Programming`,`Game Theory`  |  Hard  |    |
|  [0914](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards)  |  [X of a Kind in a Deck of Cards](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README_EN.md)  |  `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory`  |  Easy  |    |
|  [0915](https://leetcode.com/problems/partition-array-into-disjoint-intervals)  |  [Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README_EN.md)  |  `Array`  |  Medium  |    |
|  [0916](https://leetcode.com/problems/word-subsets)  |  [Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |    |
|  [0917](https://leetcode.com/problems/reverse-only-letters)  |  [Reverse Only Letters](/solution/0900-0999/0917.Reverse%20Only%20Letters/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |    |
|  [0918](https://leetcode.com/problems/maximum-sum-circular-subarray)  |  [Maximum Sum Circular Subarray](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README_EN.md)  |  `Queue`,`Array`,`Divide and Conquer`,`Dynamic Programming`,`Monotonic Queue`  |  Medium  |    |
|  [0919](https://leetcode.com/problems/complete-binary-tree-inserter)  |  [Complete Binary Tree Inserter](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README_EN.md)  |  `Tree`,`Breadth-First Search`,`Design`,`Binary Tree`  |  Medium  |    |
|  [0920](https://leetcode.com/problems/number-of-music-playlists)  |  [Number of Music Playlists](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README_EN.md)  |  `Math`,`Dynamic Programming`,`Combinatorics`  |  Hard  |    |
|  [0921](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid)  |  [Minimum Add to Make Parentheses Valid](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README_EN.md)  |  `Stack`,`Greedy`,`String`  |  Medium  |    |
|  [0922](https://leetcode.com/problems/sort-array-by-parity-ii)  |  [Sort Array By Parity II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Easy  |    |
|  [0923](https://leetcode.com/problems/3sum-with-multiplicity)  |  [3Sum With Multiplicity](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`Counting`,`Sorting`  |  Medium  |    |
|  [0924](https://leetcode.com/problems/minimize-malware-spread)  |  [Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Hard  |    |
|  [0925](https://leetcode.com/problems/long-pressed-name)  |  [Long Pressed Name](/solution/0900-0999/0925.Long%20Pressed%20Name/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |    |
|  [0926](https://leetcode.com/problems/flip-string-to-monotone-increasing)  |  [Flip String to Monotone Increasing](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [0927](https://leetcode.com/problems/three-equal-parts)  |  [Three Equal Parts](/solution/0900-0999/0927.Three%20Equal%20Parts/README_EN.md)  |  `Array`,`Math`  |  Hard  |    |
|  [0928](https://leetcode.com/problems/minimize-malware-spread-ii)  |  [Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Hard  |    |
|  [0929](https://leetcode.com/problems/unique-email-addresses)  |  [Unique Email Addresses](/solution/0900-0999/0929.Unique%20Email%20Addresses/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Easy  |    |
|  [0930](https://leetcode.com/problems/binary-subarrays-with-sum)  |  [Binary Subarrays With Sum](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README_EN.md)  |  `Array`,`Hash Table`,`Prefix Sum`,`Sliding Window`  |  Medium  |    |
|  [0931](https://leetcode.com/problems/minimum-falling-path-sum)  |  [Minimum Falling Path Sum](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |    |
|  [0932](https://leetcode.com/problems/beautiful-array)  |  [Beautiful Array](/solution/0900-0999/0932.Beautiful%20Array/README_EN.md)  |  `Array`,`Math`,`Divide and Conquer`  |  Medium  |    |
|  [0933](https://leetcode.com/problems/number-of-recent-calls)  |  [Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md)  |  `Design`,`Queue`,`Data Stream`  |  Easy  |    |
|  [0934](https://leetcode.com/problems/shortest-bridge)  |  [Shortest Bridge](/solution/0900-0999/0934.Shortest%20Bridge/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [0935](https://leetcode.com/problems/knight-dialer)  |  [Knight Dialer](/solution/0900-0999/0935.Knight%20Dialer/README_EN.md)  |  `Dynamic Programming`  |  Medium  |    |
|  [0936](https://leetcode.com/problems/stamping-the-sequence)  |  [Stamping The Sequence](/solution/0900-0999/0936.Stamping%20The%20Sequence/README_EN.md)  |  `Stack`,`Greedy`,`Queue`,`String`  |  Hard  |    |
|  [0937](https://leetcode.com/problems/reorder-data-in-log-files)  |  [Reorder Data in Log Files](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README_EN.md)  |  `Array`,`String`,`Sorting`  |  Easy  |    |
|  [0938](https://leetcode.com/problems/range-sum-of-bst)  |  [Range Sum of BST](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Easy  |    |
|  [0939](https://leetcode.com/problems/minimum-area-rectangle)  |  [Minimum Area Rectangle](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README_EN.md)  |  `Geometry`,`Array`,`Hash Table`,`Math`,`Sorting`  |  Medium  |    |
|  [0940](https://leetcode.com/problems/distinct-subsequences-ii)  |  [Distinct Subsequences II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [0941](https://leetcode.com/problems/valid-mountain-array)  |  [Valid Mountain Array](/solution/0900-0999/0941.Valid%20Mountain%20Array/README_EN.md)  |  `Array`  |  Easy  |    |
|  [0942](https://leetcode.com/problems/di-string-match)  |  [DI String Match](/solution/0900-0999/0942.DI%20String%20Match/README_EN.md)  |  `Greedy`,`Array`,`Math`,`Two Pointers`,`String`  |  Easy  |    |
|  [0943](https://leetcode.com/problems/find-the-shortest-superstring)  |  [Find the Shortest Superstring](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README_EN.md)  |  `Bit Manipulation`,`Array`,`String`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [0944](https://leetcode.com/problems/delete-columns-to-make-sorted)  |  [Delete Columns to Make Sorted](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README_EN.md)  |  `Array`,`String`  |  Easy  |    |
|  [0945](https://leetcode.com/problems/minimum-increment-to-make-array-unique)  |  [Minimum Increment to Make Array Unique](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README_EN.md)  |  `Greedy`,`Array`,`Counting`,`Sorting`  |  Medium  |    |
|  [0946](https://leetcode.com/problems/validate-stack-sequences)  |  [Validate Stack Sequences](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README_EN.md)  |  `Stack`,`Array`,`Simulation`  |  Medium  |    |
|  [0947](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column)  |  [Most Stones Removed with Same Row or Column](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README_EN.md)  |  `Depth-First Search`,`Union Find`,`Graph`  |  Medium  |    |
|  [0948](https://leetcode.com/problems/bag-of-tokens)  |  [Bag of Tokens](/solution/0900-0999/0948.Bag%20of%20Tokens/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [0949](https://leetcode.com/problems/largest-time-for-given-digits)  |  [Largest Time for Given Digits](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README_EN.md)  |  `String`,`Enumeration`  |  Medium  |    |
|  [0950](https://leetcode.com/problems/reveal-cards-in-increasing-order)  |  [Reveal Cards In Increasing Order](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README_EN.md)  |  `Queue`,`Array`,`Sorting`,`Simulation`  |  Medium  |    |
|  [0951](https://leetcode.com/problems/flip-equivalent-binary-trees)  |  [Flip Equivalent Binary Trees](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0952](https://leetcode.com/problems/largest-component-size-by-common-factor)  |  [Largest Component Size by Common Factor](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README_EN.md)  |  `Union Find`,`Array`,`Math`  |  Hard  |    |
|  [0953](https://leetcode.com/problems/verifying-an-alien-dictionary)  |  [Verifying an Alien Dictionary](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Easy  |    |
|  [0954](https://leetcode.com/problems/array-of-doubled-pairs)  |  [Array of Doubled Pairs](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Sorting`  |  Medium  |    |
|  [0955](https://leetcode.com/problems/delete-columns-to-make-sorted-ii)  |  [Delete Columns to Make Sorted II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README_EN.md)  |  `Greedy`,`Array`,`String`  |  Medium  |    |
|  [0956](https://leetcode.com/problems/tallest-billboard)  |  [Tallest Billboard](/solution/0900-0999/0956.Tallest%20Billboard/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [0957](https://leetcode.com/problems/prison-cells-after-n-days)  |  [Prison Cells After N Days](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README_EN.md)  |  `Bit Manipulation`,`Array`,`Hash Table`,`Math`  |  Medium  |    |
|  [0958](https://leetcode.com/problems/check-completeness-of-a-binary-tree)  |  [Check Completeness of a Binary Tree](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0959](https://leetcode.com/problems/regions-cut-by-slashes)  |  [Regions Cut By Slashes](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Medium  |    |
|  [0960](https://leetcode.com/problems/delete-columns-to-make-sorted-iii)  |  [Delete Columns to Make Sorted III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README_EN.md)  |  `Array`,`String`,`Dynamic Programming`  |  Hard  |    |
|  [0961](https://leetcode.com/problems/n-repeated-element-in-size-2n-array)  |  [N-Repeated Element in Size 2N Array](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README_EN.md)  |  `Array`,`Hash Table`  |  Easy  |    |
|  [0962](https://leetcode.com/problems/maximum-width-ramp)  |  [Maximum Width Ramp](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README_EN.md)  |  `Stack`,`Array`,`Monotonic Stack`  |  Medium  |    |
|  [0963](https://leetcode.com/problems/minimum-area-rectangle-ii)  |  [Minimum Area Rectangle II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README_EN.md)  |  `Geometry`,`Array`,`Math`  |  Medium  |    |
|  [0964](https://leetcode.com/problems/least-operators-to-express-number)  |  [Least Operators to Express Number](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Hard  |    |
|  [0965](https://leetcode.com/problems/univalued-binary-tree)  |  [Univalued Binary Tree](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0966](https://leetcode.com/problems/vowel-spellchecker)  |  [Vowel Spellchecker](/solution/0900-0999/0966.Vowel%20Spellchecker/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |    |
|  [0967](https://leetcode.com/problems/numbers-with-same-consecutive-differences)  |  [Numbers With Same Consecutive Differences](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README_EN.md)  |  `Breadth-First Search`,`Backtracking`  |  Medium  |    |
|  [0968](https://leetcode.com/problems/binary-tree-cameras)  |  [Binary Tree Cameras](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README_EN.md)  |  `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree`  |  Hard  |    |
|  [0969](https://leetcode.com/problems/pancake-sorting)  |  [Pancake Sorting](/solution/0900-0999/0969.Pancake%20Sorting/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [0970](https://leetcode.com/problems/powerful-integers)  |  [Powerful Integers](/solution/0900-0999/0970.Powerful%20Integers/README_EN.md)  |  `Hash Table`,`Math`  |  Medium  |    |
|  [0971](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal)  |  [Flip Binary Tree To Match Preorder Traversal](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0972](https://leetcode.com/problems/equal-rational-numbers)  |  [Equal Rational Numbers](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README_EN.md)  |  `Math`,`String`  |  Hard  |    |
|  [0973](https://leetcode.com/problems/k-closest-points-to-origin)  |  [K Closest Points to Origin](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README_EN.md)  |  `Geometry`,`Array`,`Math`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [0974](https://leetcode.com/problems/subarray-sums-divisible-by-k)  |  [Subarray Sums Divisible by K](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README_EN.md)  |  `Array`,`Hash Table`,`Prefix Sum`  |  Medium  |    |
|  [0975](https://leetcode.com/problems/odd-even-jump)  |  [Odd Even Jump](/solution/0900-0999/0975.Odd%20Even%20Jump/README_EN.md)  |  `Stack`,`Array`,`Dynamic Programming`,`Ordered Set`,`Monotonic Stack`  |  Hard  |    |
|  [0976](https://leetcode.com/problems/largest-perimeter-triangle)  |  [Largest Perimeter Triangle](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README_EN.md)  |  `Greedy`,`Array`,`Math`,`Sorting`  |  Easy  |    |
|  [0977](https://leetcode.com/problems/squares-of-a-sorted-array)  |  [Squares of a Sorted Array](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Easy  |    |
|  [0978](https://leetcode.com/problems/longest-turbulent-subarray)  |  [Longest Turbulent Subarray](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README_EN.md)  |  `Array`,`Dynamic Programming`,`Sliding Window`  |  Medium  |    |
|  [0979](https://leetcode.com/problems/distribute-coins-in-binary-tree)  |  [Distribute Coins in Binary Tree](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [0980](https://leetcode.com/problems/unique-paths-iii)  |  [Unique Paths III](/solution/0900-0999/0980.Unique%20Paths%20III/README_EN.md)  |  `Bit Manipulation`,`Array`,`Backtracking`,`Matrix`  |  Hard  |    |
|  [0981](https://leetcode.com/problems/time-based-key-value-store)  |  [Time Based Key-Value Store](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README_EN.md)  |  `Design`,`Hash Table`,`String`,`Binary Search`  |  Medium  |    |
|  [0982](https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero)  |  [Triples with Bitwise AND Equal To Zero](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README_EN.md)  |  `Bit Manipulation`,`Array`,`Hash Table`  |  Hard  |    |
|  [0983](https://leetcode.com/problems/minimum-cost-for-tickets)  |  [Minimum Cost For Tickets](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [0984](https://leetcode.com/problems/string-without-aaa-or-bbb)  |  [String Without AAA or BBB](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README_EN.md)  |  `Greedy`,`String`  |  Medium  |    |
|  [0985](https://leetcode.com/problems/sum-of-even-numbers-after-queries)  |  [Sum of Even Numbers After Queries](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README_EN.md)  |  `Array`,`Simulation`  |  Medium  |    |
|  [0986](https://leetcode.com/problems/interval-list-intersections)  |  [Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README_EN.md)  |  `Array`,`Two Pointers`  |  Medium  |    |
|  [0987](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree)  |  [Vertical Order Traversal of a Binary Tree](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`  |  Hard  |    |
|  [0988](https://leetcode.com/problems/smallest-string-starting-from-leaf)  |  [Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README_EN.md)  |  `Tree`,`Depth-First Search`,`String`,`Binary Tree`  |  Medium  |    |
|  [0989](https://leetcode.com/problems/add-to-array-form-of-integer)  |  [Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README_EN.md)  |  `Array`,`Math`  |  Easy  |    |
|  [0990](https://leetcode.com/problems/satisfiability-of-equality-equations)  |  [Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README_EN.md)  |  `Union Find`,`Graph`,`Array`,`String`  |  Medium  |    |
|  [0991](https://leetcode.com/problems/broken-calculator)  |  [Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README_EN.md)  |  `Greedy`,`Math`  |  Medium  |    |
|  [0992](https://leetcode.com/problems/subarrays-with-k-different-integers)  |  [Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README_EN.md)  |  `Array`,`Hash Table`,`Counting`,`Sliding Window`  |  Hard  |    |
|  [0993](https://leetcode.com/problems/cousins-in-binary-tree)  |  [Cousins in Binary Tree](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |    |
|  [0994](https://leetcode.com/problems/rotting-oranges)  |  [Rotting Oranges](/solution/0900-0999/0994.Rotting%20Oranges/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [0995](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips)  |  [Minimum Number of K Consecutive Bit Flips](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README_EN.md)  |  `Bit Manipulation`,`Array`,`Prefix Sum`,`Sliding Window`  |  Hard  |    |
|  [0996](https://leetcode.com/problems/number-of-squareful-arrays)  |  [Number of Squareful Arrays](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README_EN.md)  |  `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Hard  |    |
|  [0997](https://leetcode.com/problems/find-the-town-judge)  |  [Find the Town Judge](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README_EN.md)  |  `Graph`,`Array`,`Hash Table`  |  Easy  |    |
|  [0998](https://leetcode.com/problems/maximum-binary-tree-ii)  |  [Maximum Binary Tree II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README_EN.md)  |  `Tree`,`Binary Tree`  |  Medium  |    |
|  [0999](https://leetcode.com/problems/available-captures-for-rook)  |  [Available Captures for Rook](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Easy  |    |
|  [1000](https://leetcode.com/problems/minimum-cost-to-merge-stones)  |  [Minimum Cost to Merge Stones](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [1001](https://leetcode.com/problems/grid-illumination)  |  [Grid Illumination](/solution/1000-1099/1001.Grid%20Illumination/README_EN.md)  |  `Array`,`Hash Table`  |  Hard  |    |
|  [1002](https://leetcode.com/problems/find-common-characters)  |  [Find Common Characters](/solution/1000-1099/1002.Find%20Common%20Characters/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Easy  |    |
|  [1003](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions)  |  [Check If Word Is Valid After Substitutions](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README_EN.md)  |  `Stack`,`String`  |  Medium  |    |
|  [1004](https://leetcode.com/problems/max-consecutive-ones-iii)  |  [Max Consecutive Ones III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README_EN.md)  |  `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window`  |  Medium  |    |
|  [1005](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations)  |  [Maximize Sum Of Array After K Negations](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Easy  |    |
|  [1006](https://leetcode.com/problems/clumsy-factorial)  |  [Clumsy Factorial](/solution/1000-1099/1006.Clumsy%20Factorial/README_EN.md)  |  `Stack`,`Math`,`Simulation`  |  Medium  |    |
|  [1007](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row)  |  [Minimum Domino Rotations For Equal Row](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [1008](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal)  |  [Construct Binary Search Tree from Preorder Traversal](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README_EN.md)  |  `Stack`,`Tree`,`Binary Search Tree`,`Array`,`Binary Tree`,`Monotonic Stack`  |  Medium  |    |
|  [1009](https://leetcode.com/problems/complement-of-base-10-integer)  |  [Complement of Base 10 Integer](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README_EN.md)  |  `Bit Manipulation`  |  Easy  |    |
|  [1010](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60)  |  [Pairs of Songs With Total Durations Divisible by 60](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README_EN.md)  |  `Array`,`Hash Table`,`Counting`  |  Medium  |    |
|  [1011](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days)  |  [Capacity To Ship Packages Within D Days](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README_EN.md)  |  `Greedy`,`Array`,`Binary Search`  |  Medium  |    |
|  [1012](https://leetcode.com/problems/numbers-with-repeated-digits)  |  [Numbers With Repeated Digits](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Hard  |    |
|  [1013](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum)  |  [Partition Array Into Three Parts With Equal Sum](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README_EN.md)  |  `Greedy`,`Array`  |  Easy  |    |
|  [1014](https://leetcode.com/problems/best-sightseeing-pair)  |  [Best Sightseeing Pair](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1015](https://leetcode.com/problems/smallest-integer-divisible-by-k)  |  [Smallest Integer Divisible by K](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README_EN.md)  |  `Hash Table`,`Math`  |  Medium  |    |
|  [1016](https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n)  |  [Binary String With Substrings Representing 1 To N](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README_EN.md)  |  `String`  |  Medium  |    |
|  [1017](https://leetcode.com/problems/convert-to-base-2)  |  [Convert to Base -2](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README_EN.md)  |  `Math`  |  Medium  |    |
|  [1018](https://leetcode.com/problems/binary-prefix-divisible-by-5)  |  [Binary Prefix Divisible By 5](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1019](https://leetcode.com/problems/next-greater-node-in-linked-list)  |  [Next Greater Node In Linked List](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README_EN.md)  |  `Stack`,`Array`,`Linked List`,`Monotonic Stack`  |  Medium  |    |
|  [1020](https://leetcode.com/problems/number-of-enclaves)  |  [Number of Enclaves](/solution/1000-1099/1020.Number%20of%20Enclaves/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Medium  |    |
|  [1021](https://leetcode.com/problems/remove-outermost-parentheses)  |  [Remove Outermost Parentheses](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README_EN.md)  |  `Stack`,`String`  |  Easy  |    |
|  [1022](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers)  |  [Sum of Root To Leaf Binary Numbers](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Easy  |    |
|  [1023](https://leetcode.com/problems/camelcase-matching)  |  [Camelcase Matching](/solution/1000-1099/1023.Camelcase%20Matching/README_EN.md)  |  `Trie`,`Two Pointers`,`String`,`String Matching`  |  Medium  |    |
|  [1024](https://leetcode.com/problems/video-stitching)  |  [Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [1025](https://leetcode.com/problems/divisor-game)  |  [Divisor Game](/solution/1000-1099/1025.Divisor%20Game/README_EN.md)  |  `Brainteaser`,`Math`,`Dynamic Programming`,`Game Theory`  |  Easy  |    |
|  [1026](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor)  |  [Maximum Difference Between Node and Ancestor](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1027](https://leetcode.com/problems/longest-arithmetic-subsequence)  |  [Longest Arithmetic Subsequence](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README_EN.md)  |  `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`  |  Medium  |    |
|  [1028](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal)  |  [Recover a Tree From Preorder Traversal](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README_EN.md)  |  `Tree`,`Depth-First Search`,`String`,`Binary Tree`  |  Hard  |    |
|  [1029](https://leetcode.com/problems/two-city-scheduling)  |  [Two City Scheduling](/solution/1000-1099/1029.Two%20City%20Scheduling/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [1030](https://leetcode.com/problems/matrix-cells-in-distance-order)  |  [Matrix Cells in Distance Order](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README_EN.md)  |  `Geometry`,`Array`,`Math`,`Matrix`,`Sorting`  |  Easy  |    |
|  [1031](https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays)  |  [Maximum Sum of Two Non-Overlapping Subarrays](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README_EN.md)  |  `Array`,`Dynamic Programming`,`Sliding Window`  |  Medium  |    |
|  [1032](https://leetcode.com/problems/stream-of-characters)  |  [Stream of Characters](/solution/1000-1099/1032.Stream%20of%20Characters/README_EN.md)  |  `Design`,`Trie`,`Array`,`String`,`Data Stream`  |  Hard  |    |
|  [1033](https://leetcode.com/problems/moving-stones-until-consecutive)  |  [Moving Stones Until Consecutive](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README_EN.md)  |  `Brainteaser`,`Math`  |  Medium  |    |
|  [1034](https://leetcode.com/problems/coloring-a-border)  |  [Coloring A Border](/solution/1000-1099/1034.Coloring%20A%20Border/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [1035](https://leetcode.com/problems/uncrossed-lines)  |  [Uncrossed Lines](/solution/1000-1099/1035.Uncrossed%20Lines/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1036](https://leetcode.com/problems/escape-a-large-maze)  |  [Escape a Large Maze](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table`  |  Hard  |    |
|  [1037](https://leetcode.com/problems/valid-boomerang)  |  [Valid Boomerang](/solution/1000-1099/1037.Valid%20Boomerang/README_EN.md)  |  `Geometry`,`Math`  |  Easy  |    |
|  [1038](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree)  |  [Binary Search Tree to Greater Sum Tree](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`  |  Medium  |    |
|  [1039](https://leetcode.com/problems/minimum-score-triangulation-of-polygon)  |  [Minimum Score Triangulation of Polygon](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1040](https://leetcode.com/problems/moving-stones-until-consecutive-ii)  |  [Moving Stones Until Consecutive II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README_EN.md)  |  `Array`,`Math`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [1041](https://leetcode.com/problems/robot-bounded-in-circle)  |  [Robot Bounded In Circle](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README_EN.md)  |  `Math`,`String`,`Simulation`  |  Medium  |    |
|  [1042](https://leetcode.com/problems/flower-planting-with-no-adjacent)  |  [Flower Planting With No Adjacent](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`  |  Medium  |    |
|  [1043](https://leetcode.com/problems/partition-array-for-maximum-sum)  |  [Partition Array for Maximum Sum](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1044](https://leetcode.com/problems/longest-duplicate-substring)  |  [Longest Duplicate Substring](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README_EN.md)  |  `String`,`Binary Search`,`Suffix Array`,`Sliding Window`,`Hash Function`,`Rolling Hash`  |  Hard  |    |
|  [1045](https://leetcode.com/problems/customers-who-bought-all-products)  |  [Customers Who Bought All Products](/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1046](https://leetcode.com/problems/last-stone-weight)  |  [Last Stone Weight](/solution/1000-1099/1046.Last%20Stone%20Weight/README_EN.md)  |  `Array`,`Heap (Priority Queue)`  |  Easy  |    |
|  [1047](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string)  |  [Remove All Adjacent Duplicates In String](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README_EN.md)  |  `Stack`,`String`  |  Easy  |    |
|  [1048](https://leetcode.com/problems/longest-string-chain)  |  [Longest String Chain](/solution/1000-1099/1048.Longest%20String%20Chain/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [1049](https://leetcode.com/problems/last-stone-weight-ii)  |  [Last Stone Weight II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1050](https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times)  |  [Actors and Directors Who Cooperated At Least Three Times](/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1051](https://leetcode.com/problems/height-checker)  |  [Height Checker](/solution/1000-1099/1051.Height%20Checker/README_EN.md)  |  `Array`,`Counting Sort`,`Sorting`  |  Easy  |    |
|  [1052](https://leetcode.com/problems/grumpy-bookstore-owner)  |  [Grumpy Bookstore Owner](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README_EN.md)  |  `Array`,`Sliding Window`  |  Medium  |    |
|  [1053](https://leetcode.com/problems/previous-permutation-with-one-swap)  |  [Previous Permutation With One Swap](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [1054](https://leetcode.com/problems/distant-barcodes)  |  [Distant Barcodes](/solution/1000-1099/1054.Distant%20Barcodes/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1055](https://leetcode.com/problems/shortest-way-to-form-string)  |  [Shortest Way to Form String](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README_EN.md)  |  `Greedy`,`String`,`Dynamic Programming`  |  Medium  |  🔒  |
|  [1056](https://leetcode.com/problems/confusing-number)  |  [Confusing Number](/solution/1000-1099/1056.Confusing%20Number/README_EN.md)  |  `Math`  |  Easy  |  🔒  |
|  [1057](https://leetcode.com/problems/campus-bikes)  |  [Campus Bikes](/solution/1000-1099/1057.Campus%20Bikes/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |  🔒  |
|  [1058](https://leetcode.com/problems/minimize-rounding-error-to-meet-target)  |  [Minimize Rounding Error to Meet Target](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README_EN.md)  |  `Greedy`,`Array`,`Math`,`String`  |  Medium  |  🔒  |
|  [1059](https://leetcode.com/problems/all-paths-from-source-lead-to-destination)  |  [All Paths from Source Lead to Destination](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README_EN.md)  |  `Depth-First Search`,`Graph`  |  Medium  |  🔒  |
|  [1060](https://leetcode.com/problems/missing-element-in-sorted-array)  |  [Missing Element in Sorted Array](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |  🔒  |
|  [1061](https://leetcode.com/problems/lexicographically-smallest-equivalent-string)  |  [Lexicographically Smallest Equivalent String](/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README_EN.md)  |  `Union Find`,`String`  |  Medium  |  🔒  |
|  [1062](https://leetcode.com/problems/longest-repeating-substring)  |  [Longest Repeating Substring](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README_EN.md)  |  `String`,`Binary Search`,`Dynamic Programming`,`Suffix Array`,`Hash Function`,`Rolling Hash`  |  Medium  |  🔒  |
|  [1063](https://leetcode.com/problems/number-of-valid-subarrays)  |  [Number of Valid Subarrays](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README_EN.md)  |  `Stack`,`Array`,`Monotonic Stack`  |  Hard  |  🔒  |
|  [1064](https://leetcode.com/problems/fixed-point)  |  [Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md)  |  `Array`,`Binary Search`  |  Easy  |  🔒  |
|  [1065](https://leetcode.com/problems/index-pairs-of-a-string)  |  [Index Pairs of a String](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README_EN.md)  |  `Trie`,`Array`,`String`,`Sorting`  |  Easy  |  🔒  |
|  [1066](https://leetcode.com/problems/campus-bikes-ii)  |  [Campus Bikes II](/solution/1000-1099/1066.Campus%20Bikes%20II/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Medium  |  🔒  |
|  [1067](https://leetcode.com/problems/digit-count-in-range)  |  [Digit Count in Range](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Hard  |  🔒  |
|  [1068](https://leetcode.com/problems/product-sales-analysis-i)  |  [Product Sales Analysis I](/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1069](https://leetcode.com/problems/product-sales-analysis-ii)  |  [Product Sales Analysis II](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1070](https://leetcode.com/problems/product-sales-analysis-iii)  |  [Product Sales Analysis III](/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1071](https://leetcode.com/problems/greatest-common-divisor-of-strings)  |  [Greatest Common Divisor of Strings](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README_EN.md)  |  `Math`,`String`  |  Easy  |    |
|  [1072](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows)  |  [Flip Columns For Maximum Number of Equal Rows](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README_EN.md)  |  `Array`,`Hash Table`,`Matrix`  |  Medium  |    |
|  [1073](https://leetcode.com/problems/adding-two-negabinary-numbers)  |  [Adding Two Negabinary Numbers](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README_EN.md)  |  `Array`,`Math`  |  Medium  |    |
|  [1074](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target)  |  [Number of Submatrices That Sum to Target](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README_EN.md)  |  `Array`,`Hash Table`,`Matrix`,`Prefix Sum`  |  Hard  |    |
|  [1075](https://leetcode.com/problems/project-employees-i)  |  [Project Employees I](/solution/1000-1099/1075.Project%20Employees%20I/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1076](https://leetcode.com/problems/project-employees-ii)  |  [Project Employees II](/solution/1000-1099/1076.Project%20Employees%20II/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1077](https://leetcode.com/problems/project-employees-iii)  |  [Project Employees III](/solution/1000-1099/1077.Project%20Employees%20III/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1078](https://leetcode.com/problems/occurrences-after-bigram)  |  [Occurrences After Bigram](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README_EN.md)  |  `String`  |  Easy  |    |
|  [1079](https://leetcode.com/problems/letter-tile-possibilities)  |  [Letter Tile Possibilities](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README_EN.md)  |  `String`,`Backtracking`  |  Medium  |    |
|  [1080](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths)  |  [Insufficient Nodes in Root to Leaf Paths](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1081](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters)  |  [Smallest Subsequence of Distinct Characters](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README_EN.md)  |  `Stack`,`Greedy`,`String`,`Monotonic Stack`  |  Medium  |    |
|  [1082](https://leetcode.com/problems/sales-analysis-i)  |  [Sales Analysis I](/solution/1000-1099/1082.Sales%20Analysis%20I/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1083](https://leetcode.com/problems/sales-analysis-ii)  |  [Sales Analysis II](/solution/1000-1099/1083.Sales%20Analysis%20II/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1084](https://leetcode.com/problems/sales-analysis-iii)  |  [Sales Analysis III](/solution/1000-1099/1084.Sales%20Analysis%20III/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1085](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number)  |  [Sum of Digits in the Minimum Number](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README_EN.md)  |  `Array`,`Math`  |  Easy  |  🔒  |
|  [1086](https://leetcode.com/problems/high-five)  |  [High Five](/solution/1000-1099/1086.High%20Five/README_EN.md)  |  `Array`,`Hash Table`,`Sorting`  |  Easy  |  🔒  |
|  [1087](https://leetcode.com/problems/brace-expansion)  |  [Brace Expansion](/solution/1000-1099/1087.Brace%20Expansion/README_EN.md)  |  `Breadth-First Search`,`String`,`Backtracking`  |  Medium  |  🔒  |
|  [1088](https://leetcode.com/problems/confusing-number-ii)  |  [Confusing Number II](/solution/1000-1099/1088.Confusing%20Number%20II/README_EN.md)  |  `Math`,`Backtracking`  |  Hard  |  🔒  |
|  [1089](https://leetcode.com/problems/duplicate-zeros)  |  [Duplicate Zeros](/solution/1000-1099/1089.Duplicate%20Zeros/README_EN.md)  |  `Array`,`Two Pointers`  |  Easy  |    |
|  [1090](https://leetcode.com/problems/largest-values-from-labels)  |  [Largest Values From Labels](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`  |  Medium  |    |
|  [1091](https://leetcode.com/problems/shortest-path-in-binary-matrix)  |  [Shortest Path in Binary Matrix](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [1092](https://leetcode.com/problems/shortest-common-supersequence)  |  [Shortest Common Supersequence](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [1093](https://leetcode.com/problems/statistics-from-a-large-sample)  |  [Statistics from a Large Sample](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README_EN.md)  |  `Math`,`Two Pointers`,`Probability and Statistics`  |  Medium  |    |
|  [1094](https://leetcode.com/problems/car-pooling)  |  [Car Pooling](/solution/1000-1099/1094.Car%20Pooling/README_EN.md)  |  `Array`,`Prefix Sum`,`Sorting`,`Simulation`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1095](https://leetcode.com/problems/find-in-mountain-array)  |  [Find in Mountain Array](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README_EN.md)  |  `Array`,`Binary Search`,`Interactive`  |  Hard  |    |
|  [1096](https://leetcode.com/problems/brace-expansion-ii)  |  [Brace Expansion II](/solution/1000-1099/1096.Brace%20Expansion%20II/README_EN.md)  |  `Stack`,`Breadth-First Search`,`String`,`Backtracking`  |  Hard  |    |
|  [1097](https://leetcode.com/problems/game-play-analysis-v)  |  [Game Play Analysis V](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1098](https://leetcode.com/problems/unpopular-books)  |  [Unpopular Books](/solution/1000-1099/1098.Unpopular%20Books/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1099](https://leetcode.com/problems/two-sum-less-than-k)  |  [Two Sum Less Than K](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`,`Sorting`  |  Easy  |  🔒  |
|  [1100](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters)  |  [Find K-Length Substrings With No Repeated Characters](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |  🔒  |
|  [1101](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends)  |  [The Earliest Moment When Everyone Become Friends](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README_EN.md)  |  `Union Find`,`Array`  |  Medium  |  🔒  |
|  [1102](https://leetcode.com/problems/path-with-maximum-minimum-value)  |  [Path With Maximum Minimum Value](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`,`Heap (Priority Queue)`  |  Medium  |  🔒  |
|  [1103](https://leetcode.com/problems/distribute-candies-to-people)  |  [Distribute Candies to People](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README_EN.md)  |  `Math`,`Simulation`  |  Easy  |    |
|  [1104](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree)  |  [Path In Zigzag Labelled Binary Tree](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README_EN.md)  |  `Tree`,`Math`,`Binary Tree`  |  Medium  |    |
|  [1105](https://leetcode.com/problems/filling-bookcase-shelves)  |  [Filling Bookcase Shelves](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1106](https://leetcode.com/problems/parsing-a-boolean-expression)  |  [Parsing A Boolean Expression](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README_EN.md)  |  `Stack`,`Recursion`,`String`  |  Hard  |    |
|  [1107](https://leetcode.com/problems/new-users-daily-count)  |  [New Users Daily Count](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1108](https://leetcode.com/problems/defanging-an-ip-address)  |  [Defanging an IP Address](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README_EN.md)  |  `String`  |  Easy  |    |
|  [1109](https://leetcode.com/problems/corporate-flight-bookings)  |  [Corporate Flight Bookings](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README_EN.md)  |  `Array`,`Prefix Sum`  |  Medium  |    |
|  [1110](https://leetcode.com/problems/delete-nodes-and-return-forest)  |  [Delete Nodes And Return Forest](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1111](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings)  |  [Maximum Nesting Depth of Two Valid Parentheses Strings](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README_EN.md)  |  `Stack`,`String`  |  Medium  |    |
|  [1112](https://leetcode.com/problems/highest-grade-for-each-student)  |  [Highest Grade For Each Student](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1113](https://leetcode.com/problems/reported-posts)  |  [Reported Posts](/solution/1100-1199/1113.Reported%20Posts/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1114](https://leetcode.com/problems/print-in-order)  |  [Print in Order](/solution/1100-1199/1114.Print%20in%20Order/README_EN.md)  |  `Concurrency`  |  Easy  |    |
|  [1115](https://leetcode.com/problems/print-foobar-alternately)  |  [Print FooBar Alternately](/solution/1100-1199/1115.Print%20FooBar%20Alternately/README_EN.md)  |  `Concurrency`  |  Medium  |    |
|  [1116](https://leetcode.com/problems/print-zero-even-odd)  |  [Print Zero Even Odd](/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README_EN.md)  |  `Concurrency`  |  Medium  |    |
|  [1117](https://leetcode.com/problems/building-h2o)  |  [Building H2O](/solution/1100-1199/1117.Building%20H2O/README_EN.md)  |  `Concurrency`  |  Medium  |    |
|  [1118](https://leetcode.com/problems/number-of-days-in-a-month)  |  [Number of Days in a Month](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README_EN.md)  |  `Math`  |  Easy  |  🔒  |
|  [1119](https://leetcode.com/problems/remove-vowels-from-a-string)  |  [Remove Vowels from a String](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README_EN.md)  |  `String`  |  Easy  |  🔒  |
|  [1120](https://leetcode.com/problems/maximum-average-subtree)  |  [Maximum Average Subtree](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [1121](https://leetcode.com/problems/divide-array-into-increasing-sequences)  |  [Divide Array Into Increasing Sequences](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README_EN.md)  |  `Greedy`,`Array`  |  Hard  |  🔒  |
|  [1122](https://leetcode.com/problems/relative-sort-array)  |  [Relative Sort Array](/solution/1100-1199/1122.Relative%20Sort%20Array/README_EN.md)  |  `Array`,`Hash Table`,`Counting Sort`,`Sorting`  |  Easy  |    |
|  [1123](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves)  |  [Lowest Common Ancestor of Deepest Leaves](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`  |  Medium  |    |
|  [1124](https://leetcode.com/problems/longest-well-performing-interval)  |  [Longest Well-Performing Interval](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README_EN.md)  |  `Stack`,`Array`,`Hash Table`,`Prefix Sum`,`Monotonic Stack`  |  Medium  |    |
|  [1125](https://leetcode.com/problems/smallest-sufficient-team)  |  [Smallest Sufficient Team](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [1126](https://leetcode.com/problems/active-businesses)  |  [Active Businesses](/solution/1100-1199/1126.Active%20Businesses/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1127](https://leetcode.com/problems/user-purchase-platform)  |  [User Purchase Platform](/solution/1100-1199/1127.User%20Purchase%20Platform/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1128](https://leetcode.com/problems/number-of-equivalent-domino-pairs)  |  [Number of Equivalent Domino Pairs](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README_EN.md)  |  `Array`,`Hash Table`,`Counting`  |  Easy  |    |
|  [1129](https://leetcode.com/problems/shortest-path-with-alternating-colors)  |  [Shortest Path with Alternating Colors](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README_EN.md)  |  `Breadth-First Search`,`Graph`  |  Medium  |    |
|  [1130](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values)  |  [Minimum Cost Tree From Leaf Values](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README_EN.md)  |  `Stack`,`Greedy`,`Dynamic Programming`,`Monotonic Stack`  |  Medium  |    |
|  [1131](https://leetcode.com/problems/maximum-of-absolute-value-expression)  |  [Maximum of Absolute Value Expression](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README_EN.md)  |  `Array`,`Math`  |  Medium  |    |
|  [1132](https://leetcode.com/problems/reported-posts-ii)  |  [Reported Posts II](/solution/1100-1199/1132.Reported%20Posts%20II/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1133](https://leetcode.com/problems/largest-unique-number)  |  [Largest Unique Number](/solution/1100-1199/1133.Largest%20Unique%20Number/README_EN.md)  |  `Array`,`Hash Table`,`Sorting`  |  Easy  |  🔒  |
|  [1134](https://leetcode.com/problems/armstrong-number)  |  [Armstrong Number](/solution/1100-1199/1134.Armstrong%20Number/README_EN.md)  |  `Math`  |  Easy  |  🔒  |
|  [1135](https://leetcode.com/problems/connecting-cities-with-minimum-cost)  |  [Connecting Cities With Minimum Cost](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README_EN.md)  |  `Union Find`,`Graph`,`Minimum Spanning Tree`,`Heap (Priority Queue)`  |  Medium  |  🔒  |
|  [1136](https://leetcode.com/problems/parallel-courses)  |  [Parallel Courses](/solution/1100-1199/1136.Parallel%20Courses/README_EN.md)  |  `Graph`,`Topological Sort`  |  Medium  |  🔒  |
|  [1137](https://leetcode.com/problems/n-th-tribonacci-number)  |  [N-th Tribonacci Number](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README_EN.md)  |  `Memoization`,`Math`,`Dynamic Programming`  |  Easy  |    |
|  [1138](https://leetcode.com/problems/alphabet-board-path)  |  [Alphabet Board Path](/solution/1100-1199/1138.Alphabet%20Board%20Path/README_EN.md)  |  `Hash Table`,`String`  |  Medium  |    |
|  [1139](https://leetcode.com/problems/largest-1-bordered-square)  |  [Largest 1-Bordered Square](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |    |
|  [1140](https://leetcode.com/problems/stone-game-ii)  |  [Stone Game II](/solution/1100-1199/1140.Stone%20Game%20II/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Game Theory`  |  Medium  |    |
|  [1141](https://leetcode.com/problems/user-activity-for-the-past-30-days-i)  |  [User Activity for the Past 30 Days I](/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1142](https://leetcode.com/problems/user-activity-for-the-past-30-days-ii)  |  [User Activity for the Past 30 Days II](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1143](https://leetcode.com/problems/longest-common-subsequence)  |  [Longest Common Subsequence](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
|  [1144](https://leetcode.com/problems/decrease-elements-to-make-array-zigzag)  |  [Decrease Elements To Make Array Zigzag](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [1145](https://leetcode.com/problems/binary-tree-coloring-game)  |  [Binary Tree Coloring Game](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1146](https://leetcode.com/problems/snapshot-array)  |  [Snapshot Array](/solution/1100-1199/1146.Snapshot%20Array/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Binary Search`  |  Medium  |    |
|  [1147](https://leetcode.com/problems/longest-chunked-palindrome-decomposition)  |  [Longest Chunked Palindrome Decomposition](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README_EN.md)  |  `Greedy`,`Two Pointers`,`String`,`Dynamic Programming`,`Hash Function`,`Rolling Hash`  |  Hard  |    |
|  [1148](https://leetcode.com/problems/article-views-i)  |  [Article Views I](/solution/1100-1199/1148.Article%20Views%20I/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1149](https://leetcode.com/problems/article-views-ii)  |  [Article Views II](/solution/1100-1199/1149.Article%20Views%20II/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1150](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array)  |  [Check If a Number Is Majority Element in a Sorted Array](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README_EN.md)  |  `Array`,`Binary Search`  |  Easy  |  🔒  |
|  [1151](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together)  |  [Minimum Swaps to Group All 1's Together](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README_EN.md)  |  `Array`,`Sliding Window`  |  Medium  |  🔒  |
|  [1152](https://leetcode.com/problems/analyze-user-website-visit-pattern)  |  [Analyze User Website Visit Pattern](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README_EN.md)  |  `Array`,`Hash Table`,`Sorting`  |  Medium  |  🔒  |
|  [1153](https://leetcode.com/problems/string-transforms-into-another-string)  |  [String Transforms Into Another String](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README_EN.md)  |  `Hash Table`,`String`  |  Hard  |  🔒  |
|  [1154](https://leetcode.com/problems/day-of-the-year)  |  [Day of the Year](/solution/1100-1199/1154.Day%20of%20the%20Year/README_EN.md)  |  `Math`,`String`  |  Easy  |    |
|  [1155](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum)  |  [Number of Dice Rolls With Target Sum](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README_EN.md)  |  `Dynamic Programming`  |  Medium  |    |
|  [1156](https://leetcode.com/problems/swap-for-longest-repeated-character-substring)  |  [Swap For Longest Repeated Character Substring](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README_EN.md)  |  `String`,`Sliding Window`  |  Medium  |    |
|  [1157](https://leetcode.com/problems/online-majority-element-in-subarray)  |  [Online Majority Element In Subarray](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README_EN.md)  |  `Design`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`  |  Hard  |    |
|  [1158](https://leetcode.com/problems/market-analysis-i)  |  [Market Analysis I](/solution/1100-1199/1158.Market%20Analysis%20I/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1159](https://leetcode.com/problems/market-analysis-ii)  |  [Market Analysis II](/solution/1100-1199/1159.Market%20Analysis%20II/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1160](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters)  |  [Find Words That Can Be Formed by Characters](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Easy  |    |
|  [1161](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree)  |  [Maximum Level Sum of a Binary Tree](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1162](https://leetcode.com/problems/as-far-from-land-as-possible)  |  [As Far from Land as Possible](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README_EN.md)  |  `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix`  |  Medium  |    |
|  [1163](https://leetcode.com/problems/last-substring-in-lexicographical-order)  |  [Last Substring in Lexicographical Order](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README_EN.md)  |  `Two Pointers`,`String`  |  Hard  |    |
|  [1164](https://leetcode.com/problems/product-price-at-a-given-date)  |  [Product Price at a Given Date](/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1165](https://leetcode.com/problems/single-row-keyboard)  |  [Single-Row Keyboard](/solution/1100-1199/1165.Single-Row%20Keyboard/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |  🔒  |
|  [1166](https://leetcode.com/problems/design-file-system)  |  [Design File System](/solution/1100-1199/1166.Design%20File%20System/README_EN.md)  |  `Design`,`Trie`,`Hash Table`,`String`  |  Medium  |  🔒  |
|  [1167](https://leetcode.com/problems/minimum-cost-to-connect-sticks)  |  [Minimum Cost to Connect Sticks](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README_EN.md)  |  `Greedy`,`Array`,`Heap (Priority Queue)`  |  Medium  |  🔒  |
|  [1168](https://leetcode.com/problems/optimize-water-distribution-in-a-village)  |  [Optimize Water Distribution in a Village](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README_EN.md)  |  `Union Find`,`Graph`,`Minimum Spanning Tree`  |  Hard  |  🔒  |
|  [1169](https://leetcode.com/problems/invalid-transactions)  |  [Invalid Transactions](/solution/1100-1199/1169.Invalid%20Transactions/README_EN.md)  |  `Array`,`Hash Table`,`String`,`Sorting`  |  Medium  |    |
|  [1170](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character)  |  [Compare Strings by Frequency of the Smallest Character](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README_EN.md)  |  `Array`,`Hash Table`,`String`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [1171](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list)  |  [Remove Zero Sum Consecutive Nodes from Linked List](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README_EN.md)  |  `Hash Table`,`Linked List`  |  Medium  |    |
|  [1172](https://leetcode.com/problems/dinner-plate-stacks)  |  [Dinner Plate Stacks](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README_EN.md)  |  `Stack`,`Design`,`Hash Table`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1173](https://leetcode.com/problems/immediate-food-delivery-i)  |  [Immediate Food Delivery I](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1174](https://leetcode.com/problems/immediate-food-delivery-ii)  |  [Immediate Food Delivery II](/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1175](https://leetcode.com/problems/prime-arrangements)  |  [Prime Arrangements](/solution/1100-1199/1175.Prime%20Arrangements/README_EN.md)  |  `Math`  |  Easy  |    |
|  [1176](https://leetcode.com/problems/diet-plan-performance)  |  [Diet Plan Performance](/solution/1100-1199/1176.Diet%20Plan%20Performance/README_EN.md)  |  `Array`,`Sliding Window`  |  Easy  |  🔒  |
|  [1177](https://leetcode.com/problems/can-make-palindrome-from-substring)  |  [Can Make Palindrome from Substring](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README_EN.md)  |  `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum`  |  Medium  |    |
|  [1178](https://leetcode.com/problems/number-of-valid-words-for-each-puzzle)  |  [Number of Valid Words for Each Puzzle](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README_EN.md)  |  `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`String`  |  Hard  |    |
|  [1179](https://leetcode.com/problems/reformat-department-table)  |  [Reformat Department Table](/solution/1100-1199/1179.Reformat%20Department%20Table/README_EN.md)  |  `Database`  |  Easy  |    |
|  [1180](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter)  |  [Count Substrings with Only One Distinct Letter](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README_EN.md)  |  `Math`,`String`  |  Easy  |  🔒  |
|  [1181](https://leetcode.com/problems/before-and-after-puzzle)  |  [Before and After Puzzle](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README_EN.md)  |  `Array`,`Hash Table`,`String`,`Sorting`  |  Medium  |  🔒  |
|  [1182](https://leetcode.com/problems/shortest-distance-to-target-color)  |  [Shortest Distance to Target Color](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README_EN.md)  |  `Array`,`Binary Search`,`Dynamic Programming`  |  Medium  |  🔒  |
|  [1183](https://leetcode.com/problems/maximum-number-of-ones)  |  [Maximum Number of Ones](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README_EN.md)  |  `Greedy`,`Heap (Priority Queue)`  |  Hard  |  🔒  |
|  [1184](https://leetcode.com/problems/distance-between-bus-stops)  |  [Distance Between Bus Stops](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1185](https://leetcode.com/problems/day-of-the-week)  |  [Day of the Week](/solution/1100-1199/1185.Day%20of%20the%20Week/README_EN.md)  |  `Math`  |  Easy  |    |
|  [1186](https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion)  |  [Maximum Subarray Sum with One Deletion](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1187](https://leetcode.com/problems/make-array-strictly-increasing)  |  [Make Array Strictly Increasing](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README_EN.md)  |  `Array`,`Binary Search`,`Dynamic Programming`  |  Hard  |    |
|  [1188](https://leetcode.com/problems/design-bounded-blocking-queue)  |  [Design Bounded Blocking Queue](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README_EN.md)  |  `Concurrency`  |  Medium  |  🔒  |
|  [1189](https://leetcode.com/problems/maximum-number-of-balloons)  |  [Maximum Number of Balloons](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README_EN.md)  |  `Hash Table`,`String`,`Counting`  |  Easy  |    |
|  [1190](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses)  |  [Reverse Substrings Between Each Pair of Parentheses](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README_EN.md)  |  `Stack`,`String`  |  Medium  |    |
|  [1191](https://leetcode.com/problems/k-concatenation-maximum-sum)  |  [K-Concatenation Maximum Sum](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1192](https://leetcode.com/problems/critical-connections-in-a-network)  |  [Critical Connections in a Network](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README_EN.md)  |  `Depth-First Search`,`Graph`,`Biconnected Component`  |  Hard  |    |
|  [1193](https://leetcode.com/problems/monthly-transactions-i)  |  [Monthly Transactions I](/solution/1100-1199/1193.Monthly%20Transactions%20I/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1194](https://leetcode.com/problems/tournament-winners)  |  [Tournament Winners](/solution/1100-1199/1194.Tournament%20Winners/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1195](https://leetcode.com/problems/fizz-buzz-multithreaded)  |  [Fizz Buzz Multithreaded](/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README_EN.md)  |  `Concurrency`  |  Medium  |    |
|  [1196](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket)  |  [How Many Apples Can You Put into the Basket](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Easy  |  🔒  |
|  [1197](https://leetcode.com/problems/minimum-knight-moves)  |  [Minimum Knight Moves](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README_EN.md)  |  `Breadth-First Search`  |  Medium  |  🔒  |
|  [1198](https://leetcode.com/problems/find-smallest-common-element-in-all-rows)  |  [Find Smallest Common Element in All Rows](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README_EN.md)  |  `Array`,`Hash Table`,`Binary Search`,`Counting`,`Matrix`  |  Medium  |  🔒  |
|  [1199](https://leetcode.com/problems/minimum-time-to-build-blocks)  |  [Minimum Time to Build Blocks](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README_EN.md)  |  `Greedy`,`Math`,`Heap (Priority Queue)`  |  Hard  |  🔒  |
|  [1200](https://leetcode.com/problems/minimum-absolute-difference)  |  [Minimum Absolute Difference](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README_EN.md)  |  `Array`,`Sorting`  |  Easy  |    |
|  [1201](https://leetcode.com/problems/ugly-number-iii)  |  [Ugly Number III](/solution/1200-1299/1201.Ugly%20Number%20III/README_EN.md)  |  `Math`,`Binary Search`,`Number Theory`  |  Medium  |    |
|  [1202](https://leetcode.com/problems/smallest-string-with-swaps)  |  [Smallest String With Swaps](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Hash Table`,`String`  |  Medium  |    |
|  [1203](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies)  |  [Sort Items by Groups Respecting Dependencies](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`  |  Hard  |    |
|  [1204](https://leetcode.com/problems/last-person-to-fit-in-the-bus)  |  [Last Person to Fit in the Bus](/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Bus/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1205](https://leetcode.com/problems/monthly-transactions-ii)  |  [Monthly Transactions II](/solution/1200-1299/1205.Monthly%20Transactions%20II/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1206](https://leetcode.com/problems/design-skiplist)  |  [Design Skiplist](/solution/1200-1299/1206.Design%20Skiplist/README_EN.md)  |  `Design`,`Linked List`  |  Hard  |    |
|  [1207](https://leetcode.com/problems/unique-number-of-occurrences)  |  [Unique Number of Occurrences](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README_EN.md)  |  `Array`,`Hash Table`  |  Easy  |    |
|  [1208](https://leetcode.com/problems/get-equal-substrings-within-budget)  |  [Get Equal Substrings Within Budget](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README_EN.md)  |  `String`,`Binary Search`,`Prefix Sum`,`Sliding Window`  |  Medium  |    |
|  [1209](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii)  |  [Remove All Adjacent Duplicates in String II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README_EN.md)  |  `Stack`,`String`  |  Medium  |    |
|  [1210](https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations)  |  [Minimum Moves to Reach Target with Rotations](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Hard  |    |
|  [1211](https://leetcode.com/problems/queries-quality-and-percentage)  |  [Queries Quality and Percentage](/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1212](https://leetcode.com/problems/team-scores-in-football-tournament)  |  [Team Scores in Football Tournament](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1213](https://leetcode.com/problems/intersection-of-three-sorted-arrays)  |  [Intersection of Three Sorted Arrays](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README_EN.md)  |  `Array`,`Hash Table`,`Binary Search`,`Counting`  |  Easy  |  🔒  |
|  [1214](https://leetcode.com/problems/two-sum-bsts)  |  [Two Sum BSTs](/solution/1200-1299/1214.Two%20Sum%20BSTs/README_EN.md)  |  `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Two Pointers`,`Binary Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [1215](https://leetcode.com/problems/stepping-numbers)  |  [Stepping Numbers](/solution/1200-1299/1215.Stepping%20Numbers/README_EN.md)  |  `Breadth-First Search`,`Backtracking`  |  Medium  |  🔒  |
|  [1216](https://leetcode.com/problems/valid-palindrome-iii)  |  [Valid Palindrome III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |  🔒  |
|  [1217](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position)  |  [Minimum Cost to Move Chips to The Same Position](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README_EN.md)  |  `Greedy`,`Array`,`Math`  |  Easy  |    |
|  [1218](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference)  |  [Longest Arithmetic Subsequence of Given Difference](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README_EN.md)  |  `Array`,`Hash Table`,`Dynamic Programming`  |  Medium  |    |
|  [1219](https://leetcode.com/problems/path-with-maximum-gold)  |  [Path with Maximum Gold](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README_EN.md)  |  `Array`,`Backtracking`,`Matrix`  |  Medium  |    |
|  [1220](https://leetcode.com/problems/count-vowels-permutation)  |  [Count Vowels Permutation](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [1221](https://leetcode.com/problems/split-a-string-in-balanced-strings)  |  [Split a String in Balanced Strings](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README_EN.md)  |  `Greedy`,`String`,`Counting`  |  Easy  |    |
|  [1222](https://leetcode.com/problems/queens-that-can-attack-the-king)  |  [Queens That Can Attack the King](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Medium  |    |
|  [1223](https://leetcode.com/problems/dice-roll-simulation)  |  [Dice Roll Simulation](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [1224](https://leetcode.com/problems/maximum-equal-frequency)  |  [Maximum Equal Frequency](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README_EN.md)  |  `Array`,`Hash Table`  |  Hard  |    |
|  [1225](https://leetcode.com/problems/report-contiguous-dates)  |  [Report Contiguous Dates](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1226](https://leetcode.com/problems/the-dining-philosophers)  |  [The Dining Philosophers](/solution/1200-1299/1226.The%20Dining%20Philosophers/README_EN.md)  |  `Concurrency`  |  Medium  |    |
|  [1227](https://leetcode.com/problems/airplane-seat-assignment-probability)  |  [Airplane Seat Assignment Probability](/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README_EN.md)  |  `Brainteaser`,`Math`,`Dynamic Programming`,`Probability and Statistics`  |  Medium  |    |
|  [1228](https://leetcode.com/problems/missing-number-in-arithmetic-progression)  |  [Missing Number In Arithmetic Progression](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README_EN.md)  |  `Array`,`Math`  |  Easy  |  🔒  |
|  [1229](https://leetcode.com/problems/meeting-scheduler)  |  [Meeting Scheduler](/solution/1200-1299/1229.Meeting%20Scheduler/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Medium  |  🔒  |
|  [1230](https://leetcode.com/problems/toss-strange-coins)  |  [Toss Strange Coins](/solution/1200-1299/1230.Toss%20Strange%20Coins/README_EN.md)  |  `Math`,`Dynamic Programming`,`Probability and Statistics`  |  Medium  |  🔒  |
|  [1231](https://leetcode.com/problems/divide-chocolate)  |  [Divide Chocolate](/solution/1200-1299/1231.Divide%20Chocolate/README_EN.md)  |  `Array`,`Binary Search`  |  Hard  |  🔒  |
|  [1232](https://leetcode.com/problems/check-if-it-is-a-straight-line)  |  [Check If It Is a Straight Line](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README_EN.md)  |  `Geometry`,`Array`,`Math`  |  Easy  |    |
|  [1233](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem)  |  [Remove Sub-Folders from the Filesystem](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README_EN.md)  |  `Trie`,`Array`,`String`  |  Medium  |    |
|  [1234](https://leetcode.com/problems/replace-the-substring-for-balanced-string)  |  [Replace the Substring for Balanced String](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README_EN.md)  |  `String`,`Sliding Window`  |  Medium  |    |
|  [1235](https://leetcode.com/problems/maximum-profit-in-job-scheduling)  |  [Maximum Profit in Job Scheduling](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README_EN.md)  |  `Array`,`Binary Search`,`Dynamic Programming`,`Sorting`  |  Hard  |    |
|  [1236](https://leetcode.com/problems/web-crawler)  |  [Web Crawler](/solution/1200-1299/1236.Web%20Crawler/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`String`,`Interactive`  |  Medium  |  🔒  |
|  [1237](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation)  |  [Find Positive Integer Solution for a Given Equation](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README_EN.md)  |  `Math`,`Two Pointers`,`Binary Search`,`Interactive`  |  Medium  |    |
|  [1238](https://leetcode.com/problems/circular-permutation-in-binary-representation)  |  [Circular Permutation in Binary Representation](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README_EN.md)  |  `Bit Manipulation`,`Math`,`Backtracking`  |  Medium  |    |
|  [1239](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters)  |  [Maximum Length of a Concatenated String with Unique Characters](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README_EN.md)  |  `Bit Manipulation`,`Array`,`String`,`Backtracking`  |  Medium  |    |
|  [1240](https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares)  |  [Tiling a Rectangle with the Fewest Squares](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README_EN.md)  |  `Dynamic Programming`,`Backtracking`  |  Hard  |    |
|  [1241](https://leetcode.com/problems/number-of-comments-per-post)  |  [Number of Comments per Post](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1242](https://leetcode.com/problems/web-crawler-multithreaded)  |  [Web Crawler Multithreaded](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Concurrency`  |  Medium  |  🔒  |
|  [1243](https://leetcode.com/problems/array-transformation)  |  [Array Transformation](/solution/1200-1299/1243.Array%20Transformation/README_EN.md)  |  `Array`,`Simulation`  |  Easy  |  🔒  |
|  [1244](https://leetcode.com/problems/design-a-leaderboard)  |  [Design A Leaderboard](/solution/1200-1299/1244.Design%20A%20Leaderboard/README_EN.md)  |  `Design`,`Hash Table`,`Sorting`  |  Medium  |  🔒  |
|  [1245](https://leetcode.com/problems/tree-diameter)  |  [Tree Diameter](/solution/1200-1299/1245.Tree%20Diameter/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`  |  Medium  |  🔒  |
|  [1246](https://leetcode.com/problems/palindrome-removal)  |  [Palindrome Removal](/solution/1200-1299/1246.Palindrome%20Removal/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |  🔒  |
|  [1247](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal)  |  [Minimum Swaps to Make Strings Equal](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README_EN.md)  |  `Greedy`,`Math`,`String`  |  Medium  |    |
|  [1248](https://leetcode.com/problems/count-number-of-nice-subarrays)  |  [Count Number of Nice Subarrays](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README_EN.md)  |  `Array`,`Hash Table`,`Math`,`Sliding Window`  |  Medium  |    |
|  [1249](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses)  |  [Minimum Remove to Make Valid Parentheses](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README_EN.md)  |  `Stack`,`String`  |  Medium  |    |
|  [1250](https://leetcode.com/problems/check-if-it-is-a-good-array)  |  [Check If It Is a Good Array](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README_EN.md)  |  `Array`,`Math`,`Number Theory`  |  Hard  |    |
|  [1251](https://leetcode.com/problems/average-selling-price)  |  [Average Selling Price](/solution/1200-1299/1251.Average%20Selling%20Price/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1252](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix)  |  [Cells with Odd Values in a Matrix](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README_EN.md)  |  `Array`,`Math`,`Simulation`  |  Easy  |    |
|  [1253](https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix)  |  [Reconstruct a 2-Row Binary Matrix](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README_EN.md)  |  `Greedy`,`Array`,`Matrix`  |  Medium  |    |
|  [1254](https://leetcode.com/problems/number-of-closed-islands)  |  [Number of Closed Islands](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Medium  |    |
|  [1255](https://leetcode.com/problems/maximum-score-words-formed-by-letters)  |  [Maximum Score Words Formed by Letters](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README_EN.md)  |  `Bit Manipulation`,`Array`,`String`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Hard  |    |
|  [1256](https://leetcode.com/problems/encode-number)  |  [Encode Number](/solution/1200-1299/1256.Encode%20Number/README_EN.md)  |  `Bit Manipulation`,`Math`,`String`  |  Medium  |  🔒  |
|  [1257](https://leetcode.com/problems/smallest-common-region)  |  [Smallest Common Region](/solution/1200-1299/1257.Smallest%20Common%20Region/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table`,`String`  |  Medium  |  🔒  |
|  [1258](https://leetcode.com/problems/synonymous-sentences)  |  [Synonymous Sentences](/solution/1200-1299/1258.Synonymous%20Sentences/README_EN.md)  |  `Union Find`,`Array`,`Hash Table`,`String`,`Backtracking`  |  Medium  |  🔒  |
|  [1259](https://leetcode.com/problems/handshakes-that-dont-cross)  |  [Handshakes That Don't Cross](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Hard  |  🔒  |
|  [1260](https://leetcode.com/problems/shift-2d-grid)  |  [Shift 2D Grid](/solution/1200-1299/1260.Shift%202D%20Grid/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Easy  |    |
|  [1261](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree)  |  [Find Elements in a Contaminated Binary Tree](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Tree`  |  Medium  |    |
|  [1262](https://leetcode.com/problems/greatest-sum-divisible-by-three)  |  [Greatest Sum Divisible by Three](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [1263](https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location)  |  [Minimum Moves to Move a Box to Their Target Location](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1264](https://leetcode.com/problems/page-recommendations)  |  [Page Recommendations](/solution/1200-1299/1264.Page%20Recommendations/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1265](https://leetcode.com/problems/print-immutable-linked-list-in-reverse)  |  [Print Immutable Linked List in Reverse](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README_EN.md)  |  `Stack`,`Recursion`,`Linked List`,`Two Pointers`  |  Medium  |  🔒  |
|  [1266](https://leetcode.com/problems/minimum-time-visiting-all-points)  |  [Minimum Time Visiting All Points](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README_EN.md)  |  `Geometry`,`Array`,`Math`  |  Easy  |    |
|  [1267](https://leetcode.com/problems/count-servers-that-communicate)  |  [Count Servers that Communicate](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Counting`,`Matrix`  |  Medium  |    |
|  [1268](https://leetcode.com/problems/search-suggestions-system)  |  [Search Suggestions System](/solution/1200-1299/1268.Search%20Suggestions%20System/README_EN.md)  |  `Trie`,`Array`,`String`  |  Medium  |    |
|  [1269](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps)  |  [Number of Ways to Stay in the Same Place After Some Steps](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [1270](https://leetcode.com/problems/all-people-report-to-the-given-manager)  |  [All People Report to the Given Manager](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1271](https://leetcode.com/problems/hexspeak)  |  [Hexspeak](/solution/1200-1299/1271.Hexspeak/README_EN.md)  |  `Math`,`String`  |  Easy  |  🔒  |
|  [1272](https://leetcode.com/problems/remove-interval)  |  [Remove Interval](/solution/1200-1299/1272.Remove%20Interval/README_EN.md)  |  `Array`  |  Medium  |  🔒  |
|  [1273](https://leetcode.com/problems/delete-tree-nodes)  |  [Delete Tree Nodes](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`  |  Medium  |  🔒  |
|  [1274](https://leetcode.com/problems/number-of-ships-in-a-rectangle)  |  [Number of Ships in a Rectangle](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README_EN.md)  |  `Array`,`Divide and Conquer`,`Interactive`  |  Hard  |  🔒  |
|  [1275](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game)  |  [Find Winner on a Tic Tac Toe Game](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README_EN.md)  |  `Array`,`Hash Table`,`Matrix`,`Simulation`  |  Easy  |    |
|  [1276](https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients)  |  [Number of Burgers with No Waste of Ingredients](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README_EN.md)  |  `Math`  |  Medium  |    |
|  [1277](https://leetcode.com/problems/count-square-submatrices-with-all-ones)  |  [Count Square Submatrices with All Ones](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |    |
|  [1278](https://leetcode.com/problems/palindrome-partitioning-iii)  |  [Palindrome Partitioning III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [1279](https://leetcode.com/problems/traffic-light-controlled-intersection)  |  [Traffic Light Controlled Intersection](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README_EN.md)  |  `Concurrency`  |  Easy  |  🔒  |
|  [1280](https://leetcode.com/problems/students-and-examinations)  |  [Students and Examinations](/solution/1200-1299/1280.Students%20and%20Examinations/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1281](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer)  |  [Subtract the Product and Sum of Digits of an Integer](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README_EN.md)  |  `Math`  |  Easy  |    |
|  [1282](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to)  |  [Group the People Given the Group Size They Belong To](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [1283](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold)  |  [Find the Smallest Divisor Given a Threshold](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [1284](https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix)  |  [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README_EN.md)  |  `Bit Manipulation`,`Breadth-First Search`,`Array`,`Matrix`  |  Hard  |    |
|  [1285](https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges)  |  [Find the Start and End Number of Continuous Ranges](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1286](https://leetcode.com/problems/iterator-for-combination)  |  [Iterator for Combination](/solution/1200-1299/1286.Iterator%20for%20Combination/README_EN.md)  |  `Design`,`String`,`Backtracking`,`Iterator`  |  Medium  |    |
|  [1287](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array)  |  [Element Appearing More Than 25% In Sorted Array](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1288](https://leetcode.com/problems/remove-covered-intervals)  |  [Remove Covered Intervals](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README_EN.md)  |  `Array`,`Sorting`  |  Medium  |    |
|  [1289](https://leetcode.com/problems/minimum-falling-path-sum-ii)  |  [Minimum Falling Path Sum II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Hard  |    |
|  [1290](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer)  |  [Convert Binary Number in a Linked List to Integer](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README_EN.md)  |  `Linked List`,`Math`  |  Easy  |    |
|  [1291](https://leetcode.com/problems/sequential-digits)  |  [Sequential Digits](/solution/1200-1299/1291.Sequential%20Digits/README_EN.md)  |  `Enumeration`  |  Medium  |    |
|  [1292](https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold)  |  [Maximum Side Length of a Square with Sum Less than or Equal to Threshold](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README_EN.md)  |  `Array`,`Binary Search`,`Matrix`,`Prefix Sum`  |  Medium  |    |
|  [1293](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination)  |  [Shortest Path in a Grid with Obstacles Elimination](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Hard  |    |
|  [1294](https://leetcode.com/problems/weather-type-in-each-country)  |  [Weather Type in Each Country](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1295](https://leetcode.com/problems/find-numbers-with-even-number-of-digits)  |  [Find Numbers with Even Number of Digits](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1296](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers)  |  [Divide Array in Sets of K Consecutive Numbers](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Sorting`  |  Medium  |    |
|  [1297](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring)  |  [Maximum Number of Occurrences of a Substring](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |    |
|  [1298](https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes)  |  [Maximum Candies You Can Get from Boxes](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README_EN.md)  |  `Breadth-First Search`,`Array`  |  Hard  |    |
|  [1299](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side)  |  [Replace Elements with Greatest Element on Right Side](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1300](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target)  |  [Sum of Mutated Array Closest to Target](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README_EN.md)  |  `Array`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [1301](https://leetcode.com/problems/number-of-paths-with-max-score)  |  [Number of Paths with Max Score](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Hard  |    |
|  [1302](https://leetcode.com/problems/deepest-leaves-sum)  |  [Deepest Leaves Sum](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1303](https://leetcode.com/problems/find-the-team-size)  |  [Find the Team Size](/solution/1300-1399/1303.Find%20the%20Team%20Size/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1304](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero)  |  [Find N Unique Integers Sum up to Zero](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README_EN.md)  |  `Array`,`Math`  |  Easy  |    |
|  [1305](https://leetcode.com/problems/all-elements-in-two-binary-search-trees)  |  [All Elements in Two Binary Search Trees](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`,`Sorting`  |  Medium  |    |
|  [1306](https://leetcode.com/problems/jump-game-iii)  |  [Jump Game III](/solution/1300-1399/1306.Jump%20Game%20III/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`  |  Medium  |    |
|  [1307](https://leetcode.com/problems/verbal-arithmetic-puzzle)  |  [Verbal Arithmetic Puzzle](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README_EN.md)  |  `Array`,`Math`,`String`,`Backtracking`  |  Hard  |    |
|  [1308](https://leetcode.com/problems/running-total-for-different-genders)  |  [Running Total for Different Genders](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1309](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping)  |  [Decrypt String from Alphabet to Integer Mapping](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README_EN.md)  |  `String`  |  Easy  |    |
|  [1310](https://leetcode.com/problems/xor-queries-of-a-subarray)  |  [XOR Queries of a Subarray](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README_EN.md)  |  `Bit Manipulation`,`Array`,`Prefix Sum`  |  Medium  |    |
|  [1311](https://leetcode.com/problems/get-watched-videos-by-your-friends)  |  [Get Watched Videos by Your Friends](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README_EN.md)  |  `Breadth-First Search`,`Array`,`Hash Table`,`Sorting`  |  Medium  |    |
|  [1312](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome)  |  [Minimum Insertion Steps to Make a String Palindrome](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [1313](https://leetcode.com/problems/decompress-run-length-encoded-list)  |  [Decompress Run-Length Encoded List](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1314](https://leetcode.com/problems/matrix-block-sum)  |  [Matrix Block Sum](/solution/1300-1399/1314.Matrix%20Block%20Sum/README_EN.md)  |  `Array`,`Matrix`,`Prefix Sum`  |  Medium  |    |
|  [1315](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent)  |  [Sum of Nodes with Even-Valued Grandparent](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1316](https://leetcode.com/problems/distinct-echo-substrings)  |  [Distinct Echo Substrings](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README_EN.md)  |  `Trie`,`String`,`Dynamic Programming`,`Sliding Window`,`Hash Function`,`Rolling Hash`  |  Hard  |    |
|  [1317](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers)  |  [Convert Integer to the Sum of Two No-Zero Integers](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README_EN.md)  |  `Math`  |  Easy  |    |
|  [1318](https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c)  |  [Minimum Flips to Make a OR b Equal to c](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README_EN.md)  |  `Bit Manipulation`  |  Medium  |    |
|  [1319](https://leetcode.com/problems/number-of-operations-to-make-network-connected)  |  [Number of Operations to Make Network Connected](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`  |  Medium  |    |
|  [1320](https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers)  |  [Minimum Distance to Type a Word Using Two Fingers](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [1321](https://leetcode.com/problems/restaurant-growth)  |  [Restaurant Growth](/solution/1300-1399/1321.Restaurant%20Growth/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1322](https://leetcode.com/problems/ads-performance)  |  [Ads Performance](/solution/1300-1399/1322.Ads%20Performance/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1323](https://leetcode.com/problems/maximum-69-number)  |  [Maximum 69 Number](/solution/1300-1399/1323.Maximum%2069%20Number/README_EN.md)  |  `Greedy`,`Math`  |  Easy  |    |
|  [1324](https://leetcode.com/problems/print-words-vertically)  |  [Print Words Vertically](/solution/1300-1399/1324.Print%20Words%20Vertically/README_EN.md)  |  `Array`,`String`,`Simulation`  |  Medium  |    |
|  [1325](https://leetcode.com/problems/delete-leaves-with-a-given-value)  |  [Delete Leaves With a Given Value](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`  |  Medium  |    |
|  [1326](https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden)  |  [Minimum Number of Taps to Open to Water a Garden](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Hard  |    |
|  [1327](https://leetcode.com/problems/list-the-products-ordered-in-a-period)  |  [List the Products Ordered in a Period](/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1328](https://leetcode.com/problems/break-a-palindrome)  |  [Break a Palindrome](/solution/1300-1399/1328.Break%20a%20Palindrome/README_EN.md)  |  `Greedy`,`String`  |  Medium  |    |
|  [1329](https://leetcode.com/problems/sort-the-matrix-diagonally)  |  [Sort the Matrix Diagonally](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README_EN.md)  |  `Array`,`Matrix`,`Sorting`  |  Medium  |    |
|  [1330](https://leetcode.com/problems/reverse-subarray-to-maximize-array-value)  |  [Reverse Subarray To Maximize Array Value](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README_EN.md)  |  `Greedy`,`Array`,`Math`  |  Hard  |    |
|  [1331](https://leetcode.com/problems/rank-transform-of-an-array)  |  [Rank Transform of an Array](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README_EN.md)  |  `Array`,`Hash Table`,`Sorting`  |  Easy  |    |
|  [1332](https://leetcode.com/problems/remove-palindromic-subsequences)  |  [Remove Palindromic Subsequences](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |    |
|  [1333](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance)  |  [Filter Restaurants by Vegan-Friendly, Price and Distance](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README_EN.md)  |  `Array`,`Sorting`  |  Medium  |    |
|  [1334](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance)  |  [Find the City With the Smallest Number of Neighbors at a Threshold Distance](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README_EN.md)  |  `Graph`,`Dynamic Programming`,`Shortest Path`  |  Medium  |    |
|  [1335](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule)  |  [Minimum Difficulty of a Job Schedule](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [1336](https://leetcode.com/problems/number-of-transactions-per-visit)  |  [Number of Transactions per Visit](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1337](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix)  |  [The K Weakest Rows in a Matrix](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README_EN.md)  |  `Array`,`Binary Search`,`Matrix`,`Sorting`,`Heap (Priority Queue)`  |  Easy  |    |
|  [1338](https://leetcode.com/problems/reduce-array-size-to-the-half)  |  [Reduce Array Size to The Half](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1339](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree)  |  [Maximum Product of Splitted Binary Tree](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1340](https://leetcode.com/problems/jump-game-v)  |  [Jump Game V](/solution/1300-1399/1340.Jump%20Game%20V/README_EN.md)  |  `Array`,`Dynamic Programming`,`Sorting`  |  Hard  |    |
|  [1341](https://leetcode.com/problems/movie-rating)  |  [Movie Rating](/solution/1300-1399/1341.Movie%20Rating/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1342](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero)  |  [Number of Steps to Reduce a Number to Zero](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README_EN.md)  |  `Bit Manipulation`,`Math`  |  Easy  |    |
|  [1343](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold)  |  [Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README_EN.md)  |  `Array`,`Sliding Window`  |  Medium  |    |
|  [1344](https://leetcode.com/problems/angle-between-hands-of-a-clock)  |  [Angle Between Hands of a Clock](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README_EN.md)  |  `Math`  |  Medium  |    |
|  [1345](https://leetcode.com/problems/jump-game-iv)  |  [Jump Game IV](/solution/1300-1399/1345.Jump%20Game%20IV/README_EN.md)  |  `Breadth-First Search`,`Array`,`Hash Table`  |  Hard  |    |
|  [1346](https://leetcode.com/problems/check-if-n-and-its-double-exist)  |  [Check If N and Its Double Exist](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting`  |  Easy  |    |
|  [1347](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram)  |  [Minimum Number of Steps to Make Two Strings Anagram](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README_EN.md)  |  `Hash Table`,`String`  |  Medium  |    |
|  [1348](https://leetcode.com/problems/tweet-counts-per-frequency)  |  [Tweet Counts Per Frequency](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README_EN.md)  |  `Design`,`Hash Table`,`Binary Search`,`Ordered Set`,`Sorting`  |  Medium  |    |
|  [1349](https://leetcode.com/problems/maximum-students-taking-exam)  |  [Maximum Students Taking Exam](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix`  |  Hard  |    |
|  [1350](https://leetcode.com/problems/students-with-invalid-departments)  |  [Students With Invalid Departments](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1351](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix)  |  [Count Negative Numbers in a Sorted Matrix](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README_EN.md)  |  `Array`,`Binary Search`,`Matrix`  |  Easy  |    |
|  [1352](https://leetcode.com/problems/product-of-the-last-k-numbers)  |  [Product of the Last K Numbers](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README_EN.md)  |  `Design`,`Queue`,`Array`,`Math`,`Data Stream`  |  Medium  |    |
|  [1353](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended)  |  [Maximum Number of Events That Can Be Attended](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README_EN.md)  |  `Greedy`,`Array`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1354](https://leetcode.com/problems/construct-target-array-with-multiple-sums)  |  [Construct Target Array With Multiple Sums](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README_EN.md)  |  `Array`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1355](https://leetcode.com/problems/activity-participants)  |  [Activity Participants](/solution/1300-1399/1355.Activity%20Participants/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1356](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits)  |  [Sort Integers by The Number of 1 Bits](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README_EN.md)  |  `Bit Manipulation`,`Array`,`Counting`,`Sorting`  |  Easy  |    |
|  [1357](https://leetcode.com/problems/apply-discount-every-n-orders)  |  [Apply Discount Every n Orders](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README_EN.md)  |  `Design`,`Array`,`Hash Table`  |  Medium  |    |
|  [1358](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters)  |  [Number of Substrings Containing All Three Characters](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |    |
|  [1359](https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options)  |  [Count All Valid Pickup and Delivery Options](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README_EN.md)  |  `Math`,`Dynamic Programming`,`Combinatorics`  |  Hard  |    |
|  [1360](https://leetcode.com/problems/number-of-days-between-two-dates)  |  [Number of Days Between Two Dates](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README_EN.md)  |  `Math`,`String`  |  Easy  |    |
|  [1361](https://leetcode.com/problems/validate-binary-tree-nodes)  |  [Validate Binary Tree Nodes](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Binary Tree`  |  Medium  |    |
|  [1362](https://leetcode.com/problems/closest-divisors)  |  [Closest Divisors](/solution/1300-1399/1362.Closest%20Divisors/README_EN.md)  |  `Math`  |  Medium  |    |
|  [1363](https://leetcode.com/problems/largest-multiple-of-three)  |  [Largest Multiple of Three](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Hard  |    |
|  [1364](https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer)  |  [Number of Trusted Contacts of a Customer](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1365](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number)  |  [How Many Numbers Are Smaller Than the Current Number](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README_EN.md)  |  `Array`,`Hash Table`,`Counting`,`Sorting`  |  Easy  |    |
|  [1366](https://leetcode.com/problems/rank-teams-by-votes)  |  [Rank Teams by Votes](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README_EN.md)  |  `Array`,`Hash Table`,`String`,`Counting`,`Sorting`  |  Medium  |    |
|  [1367](https://leetcode.com/problems/linked-list-in-binary-tree)  |  [Linked List in Binary Tree](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Linked List`,`Binary Tree`  |  Medium  |    |
|  [1368](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid)  |  [Minimum Cost to Make at Least One Valid Path in a Grid](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README_EN.md)  |  `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1369](https://leetcode.com/problems/get-the-second-most-recent-activity)  |  [Get the Second Most Recent Activity](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1370](https://leetcode.com/problems/increasing-decreasing-string)  |  [Increasing Decreasing String](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README_EN.md)  |  `Hash Table`,`String`,`Counting`  |  Easy  |    |
|  [1371](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts)  |  [Find the Longest Substring Containing Vowels in Even Counts](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README_EN.md)  |  `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum`  |  Medium  |    |
|  [1372](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree)  |  [Longest ZigZag Path in a Binary Tree](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree`  |  Medium  |    |
|  [1373](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree)  |  [Maximum Sum BST in Binary Tree](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Search Tree`,`Dynamic Programming`,`Binary Tree`  |  Hard  |    |
|  [1374](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts)  |  [Generate a String With Characters That Have Odd Counts](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README_EN.md)  |  `String`  |  Easy  |    |
|  [1375](https://leetcode.com/problems/bulb-switcher-iii)  |  [Bulb Switcher III](/solution/1300-1399/1375.Bulb%20Switcher%20III/README_EN.md)  |  `Array`  |  Medium  |    |
|  [1376](https://leetcode.com/problems/time-needed-to-inform-all-employees)  |  [Time Needed to Inform All Employees](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`  |  Medium  |    |
|  [1377](https://leetcode.com/problems/frog-position-after-t-seconds)  |  [Frog Position After T Seconds](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph`  |  Hard  |    |
|  [1378](https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier)  |  [Replace Employee ID With The Unique Identifier](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1379](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree)  |  [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1380](https://leetcode.com/problems/lucky-numbers-in-a-matrix)  |  [Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README_EN.md)  |  `Array`,`Matrix`  |  Easy  |    |
|  [1381](https://leetcode.com/problems/design-a-stack-with-increment-operation)  |  [Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README_EN.md)  |  `Stack`,`Design`,`Array`  |  Medium  |    |
|  [1382](https://leetcode.com/problems/balance-a-binary-search-tree)  |  [Balance a Binary Search Tree](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README_EN.md)  |  `Greedy`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Divide and Conquer`,`Binary Tree`  |  Medium  |    |
|  [1383](https://leetcode.com/problems/maximum-performance-of-a-team)  |  [Maximum Performance of a Team](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README_EN.md)  |  `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1384](https://leetcode.com/problems/total-sales-amount-by-year)  |  [Total Sales Amount by Year](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1385](https://leetcode.com/problems/find-the-distance-value-between-two-arrays)  |  [Find the Distance Value Between Two Arrays](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`,`Sorting`  |  Easy  |    |
|  [1386](https://leetcode.com/problems/cinema-seat-allocation)  |  [Cinema Seat Allocation](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README_EN.md)  |  `Greedy`,`Bit Manipulation`,`Array`,`Hash Table`  |  Medium  |    |
|  [1387](https://leetcode.com/problems/sort-integers-by-the-power-value)  |  [Sort Integers by The Power Value](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README_EN.md)  |  `Memoization`,`Dynamic Programming`,`Sorting`  |  Medium  |    |
|  [1388](https://leetcode.com/problems/pizza-with-3n-slices)  |  [Pizza With 3n Slices](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1389](https://leetcode.com/problems/create-target-array-in-the-given-order)  |  [Create Target Array in the Given Order](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README_EN.md)  |  `Array`,`Simulation`  |  Easy  |    |
|  [1390](https://leetcode.com/problems/four-divisors)  |  [Four Divisors](/solution/1300-1399/1390.Four%20Divisors/README_EN.md)  |  `Array`,`Math`  |  Medium  |    |
|  [1391](https://leetcode.com/problems/check-if-there-is-a-valid-path-in-a-grid)  |  [Check if There is a Valid Path in a Grid](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Medium  |    |
|  [1392](https://leetcode.com/problems/longest-happy-prefix)  |  [Longest Happy Prefix](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README_EN.md)  |  `String`,`String Matching`,`Hash Function`,`Rolling Hash`  |  Hard  |    |
|  [1393](https://leetcode.com/problems/capital-gainloss)  |  [Capital GainLoss](/solution/1300-1399/1393.Capital%20GainLoss/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1394](https://leetcode.com/problems/find-lucky-integer-in-an-array)  |  [Find Lucky Integer in an Array](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README_EN.md)  |  `Array`,`Hash Table`,`Counting`  |  Easy  |    |
|  [1395](https://leetcode.com/problems/count-number-of-teams)  |  [Count Number of Teams](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README_EN.md)  |  `Binary Indexed Tree`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [1396](https://leetcode.com/problems/design-underground-system)  |  [Design Underground System](/solution/1300-1399/1396.Design%20Underground%20System/README_EN.md)  |  `Design`,`Hash Table`,`String`  |  Medium  |    |
|  [1397](https://leetcode.com/problems/find-all-good-strings)  |  [Find All Good Strings](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README_EN.md)  |  `String`,`Dynamic Programming`,`String Matching`  |  Hard  |    |
|  [1398](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c)  |  [Customers Who Bought Products A and B but Not C](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1399](https://leetcode.com/problems/count-largest-group)  |  [Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README_EN.md)  |  `Hash Table`,`Math`  |  Easy  |    |
|  [1400](https://leetcode.com/problems/construct-k-palindrome-strings)  |  [Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README_EN.md)  |  `Greedy`,`Hash Table`,`String`,`Counting`  |  Medium  |    |
|  [1401](https://leetcode.com/problems/circle-and-rectangle-overlapping)  |  [Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README_EN.md)  |  `Geometry`,`Math`  |  Medium  |    |
|  [1402](https://leetcode.com/problems/reducing-dishes)  |  [Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`,`Sorting`  |  Hard  |    |
|  [1403](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order)  |  [Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Easy  |    |
|  [1404](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one)  |  [Number of Steps to Reduce a Number in Binary Representation to One](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README_EN.md)  |  `Bit Manipulation`,`String`  |  Medium  |    |
|  [1405](https://leetcode.com/problems/longest-happy-string)  |  [Longest Happy String](/solution/1400-1499/1405.Longest%20Happy%20String/README_EN.md)  |  `Greedy`,`String`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1406](https://leetcode.com/problems/stone-game-iii)  |  [Stone Game III](/solution/1400-1499/1406.Stone%20Game%20III/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Game Theory`  |  Hard  |    |
|  [1407](https://leetcode.com/problems/top-travellers)  |  [Top Travellers](/solution/1400-1499/1407.Top%20Travellers/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1408](https://leetcode.com/problems/string-matching-in-an-array)  |  [String Matching in an Array](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README_EN.md)  |  `String`,`String Matching`  |  Easy  |    |
|  [1409](https://leetcode.com/problems/queries-on-a-permutation-with-key)  |  [Queries on a Permutation With Key](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README_EN.md)  |  `Binary Indexed Tree`,`Array`,`Simulation`  |  Medium  |    |
|  [1410](https://leetcode.com/problems/html-entity-parser)  |  [HTML Entity Parser](/solution/1400-1499/1410.HTML%20Entity%20Parser/README_EN.md)  |  `Hash Table`,`String`  |  Medium  |    |
|  [1411](https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid)  |  [Number of Ways to Paint N × 3 Grid](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [1412](https://leetcode.com/problems/find-the-quiet-students-in-all-exams)  |  [Find the Quiet Students in All Exams](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1413](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum)  |  [Minimum Value to Get Positive Step by Step Sum](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README_EN.md)  |  `Array`,`Prefix Sum`  |  Easy  |    |
|  [1414](https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k)  |  [Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README_EN.md)  |  `Greedy`  |  Medium  |    |
|  [1415](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n)  |  [The k-th Lexicographical String of All Happy Strings of Length n](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README_EN.md)  |  `String`,`Backtracking`  |  Medium  |    |
|  [1416](https://leetcode.com/problems/restore-the-array)  |  [Restore The Array](/solution/1400-1499/1416.Restore%20The%20Array/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [1417](https://leetcode.com/problems/reformat-the-string)  |  [Reformat The String](/solution/1400-1499/1417.Reformat%20The%20String/README_EN.md)  |  `String`  |  Easy  |    |
|  [1418](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant)  |  [Display Table of Food Orders in a Restaurant](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README_EN.md)  |  `Array`,`Hash Table`,`String`,`Ordered Set`,`Sorting`  |  Medium  |    |
|  [1419](https://leetcode.com/problems/minimum-number-of-frogs-croaking)  |  [Minimum Number of Frogs Croaking](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README_EN.md)  |  `String`,`Counting`  |  Medium  |    |
|  [1420](https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons)  |  [Build Array Where You Can Find The Maximum Exactly K Comparisons](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [1421](https://leetcode.com/problems/npv-queries)  |  [NPV Queries](/solution/1400-1499/1421.NPV%20Queries/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1422](https://leetcode.com/problems/maximum-score-after-splitting-a-string)  |  [Maximum Score After Splitting a String](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README_EN.md)  |  `String`  |  Easy  |    |
|  [1423](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards)  |  [Maximum Points You Can Obtain from Cards](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README_EN.md)  |  `Array`,`Prefix Sum`,`Sliding Window`  |  Medium  |    |
|  [1424](https://leetcode.com/problems/diagonal-traverse-ii)  |  [Diagonal Traverse II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README_EN.md)  |  `Array`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1425](https://leetcode.com/problems/constrained-subsequence-sum)  |  [Constrained Subsequence Sum](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README_EN.md)  |  `Queue`,`Array`,`Dynamic Programming`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1426](https://leetcode.com/problems/counting-elements)  |  [Counting Elements](/solution/1400-1499/1426.Counting%20Elements/README_EN.md)  |  `Array`,`Hash Table`  |  Easy  |  🔒  |
|  [1427](https://leetcode.com/problems/perform-string-shifts)  |  [Perform String Shifts](/solution/1400-1499/1427.Perform%20String%20Shifts/README_EN.md)  |  `Array`,`Math`,`String`  |  Easy  |  🔒  |
|  [1428](https://leetcode.com/problems/leftmost-column-with-at-least-a-one)  |  [Leftmost Column with at Least a One](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README_EN.md)  |  `Array`,`Binary Search`,`Interactive`,`Matrix`  |  Medium  |  🔒  |
|  [1429](https://leetcode.com/problems/first-unique-number)  |  [First Unique Number](/solution/1400-1499/1429.First%20Unique%20Number/README_EN.md)  |  `Design`,`Queue`,`Array`,`Hash Table`,`Data Stream`  |  Medium  |  🔒  |
|  [1430](https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree)  |  [Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [1431](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies)  |  [Kids With the Greatest Number of Candies](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1432](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer)  |  [Max Difference You Can Get From Changing an Integer](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README_EN.md)  |  `Greedy`,`Math`  |  Medium  |    |
|  [1433](https://leetcode.com/problems/check-if-a-string-can-break-another-string)  |  [Check If a String Can Break Another String](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README_EN.md)  |  `Greedy`,`String`,`Sorting`  |  Medium  |    |
|  [1434](https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other)  |  [Number of Ways to Wear Different Hats to Each Other](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [1435](https://leetcode.com/problems/create-a-session-bar-chart)  |  [Create a Session Bar Chart](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1436](https://leetcode.com/problems/destination-city)  |  [Destination City](/solution/1400-1499/1436.Destination%20City/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [1437](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away)  |  [Check If All 1's Are at Least Length K Places Away](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1438](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit)  |  [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README_EN.md)  |  `Queue`,`Array`,`Ordered Set`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1439](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows)  |  [Find the Kth Smallest Sum of a Matrix With Sorted Rows](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README_EN.md)  |  `Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1440](https://leetcode.com/problems/evaluate-boolean-expression)  |  [Evaluate Boolean Expression](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1441](https://leetcode.com/problems/build-an-array-with-stack-operations)  |  [Build an Array With Stack Operations](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README_EN.md)  |  `Stack`,`Array`,`Simulation`  |  Easy  |    |
|  [1442](https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor)  |  [Count Triplets That Can Form Two Arrays of Equal XOR](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README_EN.md)  |  `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Prefix Sum`  |  Medium  |    |
|  [1443](https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree)  |  [Minimum Time to Collect All Apples in a Tree](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`  |  Medium  |    |
|  [1444](https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza)  |  [Number of Ways of Cutting a Pizza](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README_EN.md)  |  `Memoization`,`Array`,`Dynamic Programming`,`Matrix`  |  Hard  |    |
|  [1445](https://leetcode.com/problems/apples-oranges)  |  [Apples & Oranges](/solution/1400-1499/1445.Apples%20%26%20Oranges/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1446](https://leetcode.com/problems/consecutive-characters)  |  [Consecutive Characters](/solution/1400-1499/1446.Consecutive%20Characters/README_EN.md)  |  `String`  |  Easy  |    |
|  [1447](https://leetcode.com/problems/simplified-fractions)  |  [Simplified Fractions](/solution/1400-1499/1447.Simplified%20Fractions/README_EN.md)  |  `Math`  |  Medium  |    |
|  [1448](https://leetcode.com/problems/count-good-nodes-in-binary-tree)  |  [Count Good Nodes in Binary Tree](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1449](https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target)  |  [Form Largest Integer With Digits That Add up to Target](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [1450](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time)  |  [Number of Students Doing Homework at a Given Time](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1451](https://leetcode.com/problems/rearrange-words-in-a-sentence)  |  [Rearrange Words in a Sentence](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README_EN.md)  |  `String`,`Sorting`  |  Medium  |    |
|  [1452](https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list)  |  [People Whose List of Favorite Companies Is Not a Subset of Another List](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |    |
|  [1453](https://leetcode.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard)  |  [Maximum Number of Darts Inside of a Circular Dartboard](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README_EN.md)  |  `Geometry`,`Array`,`Math`  |  Hard  |    |
|  [1454](https://leetcode.com/problems/active-users)  |  [Active Users](/solution/1400-1499/1454.Active%20Users/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1455](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence)  |  [Check If a Word Occurs As a Prefix of Any Word in a Sentence](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README_EN.md)  |  `String`,`String Matching`  |  Easy  |    |
|  [1456](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length)  |  [Maximum Number of Vowels in a Substring of Given Length](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README_EN.md)  |  `String`,`Sliding Window`  |  Medium  |    |
|  [1457](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree)  |  [Pseudo-Palindromic Paths in a Binary Tree](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README_EN.md)  |  `Bit Manipulation`,`Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1458](https://leetcode.com/problems/max-dot-product-of-two-subsequences)  |  [Max Dot Product of Two Subsequences](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [1459](https://leetcode.com/problems/rectangles-area)  |  [Rectangles Area](/solution/1400-1499/1459.Rectangles%20Area/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1460](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays)  |  [Make Two Arrays Equal by Reversing Sub-arrays](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Sub-arrays/README_EN.md)  |  `Array`,`Hash Table`,`Sorting`  |  Easy  |    |
|  [1461](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k)  |  [Check If a String Contains All Binary Codes of Size K](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README_EN.md)  |  `Bit Manipulation`,`Hash Table`,`String`,`Hash Function`,`Rolling Hash`  |  Medium  |    |
|  [1462](https://leetcode.com/problems/course-schedule-iv)  |  [Course Schedule IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`  |  Medium  |    |
|  [1463](https://leetcode.com/problems/cherry-pickup-ii)  |  [Cherry Pickup II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Hard  |    |
|  [1464](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array)  |  [Maximum Product of Two Elements in an Array](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README_EN.md)  |  `Array`,`Sorting`,`Heap (Priority Queue)`  |  Easy  |    |
|  [1465](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts)  |  [Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [1466](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero)  |  [Reorder Routes to Make All Paths Lead to the City Zero](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`  |  Medium  |    |
|  [1467](https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls)  |  [Probability of a Two Boxes Having The Same Number of Distinct Balls](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README_EN.md)  |  `Math`,`Dynamic Programming`,`Backtracking`,`Combinatorics`,`Probability and Statistics`  |  Hard  |    |
|  [1468](https://leetcode.com/problems/calculate-salaries)  |  [Calculate Salaries](/solution/1400-1499/1468.Calculate%20Salaries/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1469](https://leetcode.com/problems/find-all-the-lonely-nodes)  |  [Find All The Lonely Nodes](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree`  |  Easy  |  🔒  |
|  [1470](https://leetcode.com/problems/shuffle-the-array)  |  [Shuffle the Array](/solution/1400-1499/1470.Shuffle%20the%20Array/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1471](https://leetcode.com/problems/the-k-strongest-values-in-an-array)  |  [The k Strongest Values in an Array](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [1472](https://leetcode.com/problems/design-browser-history)  |  [Design Browser History](/solution/1400-1499/1472.Design%20Browser%20History/README_EN.md)  |  `Stack`,`Design`,`Array`,`Linked List`,`Data Stream`,`Doubly-Linked List`  |  Medium  |    |
|  [1473](https://leetcode.com/problems/paint-house-iii)  |  [Paint House III](/solution/1400-1499/1473.Paint%20House%20III/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [1474](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list)  |  [Delete N Nodes After M Nodes of a Linked List](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README_EN.md)  |  `Linked List`  |  Easy  |  🔒  |
|  [1475](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop)  |  [Final Prices With a Special Discount in a Shop](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README_EN.md)  |  `Stack`,`Array`,`Monotonic Stack`  |  Easy  |    |
|  [1476](https://leetcode.com/problems/subrectangle-queries)  |  [Subrectangle Queries](/solution/1400-1499/1476.Subrectangle%20Queries/README_EN.md)  |  `Design`,`Array`,`Matrix`  |  Medium  |    |
|  [1477](https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum)  |  [Find Two Non-overlapping Sub-arrays Each With Target Sum](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README_EN.md)  |  `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sliding Window`  |  Medium  |    |
|  [1478](https://leetcode.com/problems/allocate-mailboxes)  |  [Allocate Mailboxes](/solution/1400-1499/1478.Allocate%20Mailboxes/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Sorting`  |  Hard  |    |
|  [1479](https://leetcode.com/problems/sales-by-day-of-the-week)  |  [Sales by Day of the Week](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1480](https://leetcode.com/problems/running-sum-of-1d-array)  |  [Running Sum of 1d Array](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README_EN.md)  |  `Array`,`Prefix Sum`  |  Easy  |    |
|  [1481](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals)  |  [Least Number of Unique Integers after K Removals](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`  |  Medium  |    |
|  [1482](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets)  |  [Minimum Number of Days to Make m Bouquets](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [1483](https://leetcode.com/problems/kth-ancestor-of-a-tree-node)  |  [Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Search`,`Dynamic Programming`  |  Hard  |    |
|  [1484](https://leetcode.com/problems/group-sold-products-by-the-date)  |  [Group Sold Products By The Date](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1485](https://leetcode.com/problems/clone-binary-tree-with-random-pointer)  |  [Clone Binary Tree With Random Pointer](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`  |  Medium  |  🔒  |
|  [1486](https://leetcode.com/problems/xor-operation-in-an-array)  |  [XOR Operation in an Array](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README_EN.md)  |  `Bit Manipulation`,`Math`  |  Easy  |    |
|  [1487](https://leetcode.com/problems/making-file-names-unique)  |  [Making File Names Unique](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |    |
|  [1488](https://leetcode.com/problems/avoid-flood-in-the-city)  |  [Avoid Flood in The City](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Binary Search`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1489](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree)  |  [Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README_EN.md)  |  `Union Find`,`Graph`,`Minimum Spanning Tree`,`Sorting`,`Strongly Connected Component`  |  Hard  |    |
|  [1490](https://leetcode.com/problems/clone-n-ary-tree)  |  [Clone N-ary Tree](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`  |  Medium  |  🔒  |
|  [1491](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary)  |  [Average Salary Excluding the Minimum and Maximum Salary](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README_EN.md)  |  `Array`,`Sorting`  |  Easy  |    |
|  [1492](https://leetcode.com/problems/the-kth-factor-of-n)  |  [The kth Factor of n](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README_EN.md)  |  `Math`  |  Medium  |    |
|  [1493](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element)  |  [Longest Subarray of 1's After Deleting One Element](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README_EN.md)  |  `Math`,`Dynamic Programming`,`Sliding Window`  |  Medium  |    |
|  [1494](https://leetcode.com/problems/parallel-courses-ii)  |  [Parallel Courses II](/solution/1400-1499/1494.Parallel%20Courses%20II/README_EN.md)  |  `Bit Manipulation`,`Graph`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [1495](https://leetcode.com/problems/friendly-movies-streamed-last-month)  |  [Friendly Movies Streamed Last Month](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1496](https://leetcode.com/problems/path-crossing)  |  [Path Crossing](/solution/1400-1499/1496.Path%20Crossing/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [1497](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k)  |  [Check If Array Pairs Are Divisible by k](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README_EN.md)  |  `Array`,`Hash Table`,`Counting`  |  Medium  |    |
|  [1498](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition)  |  [Number of Subsequences That Satisfy the Given Sum Condition](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [1499](https://leetcode.com/problems/max-value-of-equation)  |  [Max Value of Equation](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README_EN.md)  |  `Queue`,`Array`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1500](https://leetcode.com/problems/design-a-file-sharing-system)  |  [Design a File Sharing System](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README_EN.md)  |  `Design`,`Hash Table`,`Data Stream`,`Heap (Priority Queue)`  |  Medium  |  🔒  |
|  [1501](https://leetcode.com/problems/countries-you-can-safely-invest-in)  |  [Countries You Can Safely Invest In](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1502](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence)  |  [Can Make Arithmetic Progression From Sequence](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README_EN.md)  |  `Array`,`Sorting`  |  Easy  |    |
|  [1503](https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank)  |  [Last Moment Before All Ants Fall Out of a Plank](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README_EN.md)  |  `Brainteaser`,`Array`,`Simulation`  |  Medium  |    |
|  [1504](https://leetcode.com/problems/count-submatrices-with-all-ones)  |  [Count Submatrices With All Ones](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README_EN.md)  |  `Stack`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack`  |  Medium  |    |
|  [1505](https://leetcode.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits)  |  [Minimum Possible Integer After at Most K Adjacent Swaps On Digits](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README_EN.md)  |  `Greedy`,`Binary Indexed Tree`,`Segment Tree`,`String`  |  Hard  |    |
|  [1506](https://leetcode.com/problems/find-root-of-n-ary-tree)  |  [Find Root of N-Ary Tree](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README_EN.md)  |  `Bit Manipulation`,`Tree`,`Depth-First Search`,`Hash Table`  |  Medium  |  🔒  |
|  [1507](https://leetcode.com/problems/reformat-date)  |  [Reformat Date](/solution/1500-1599/1507.Reformat%20Date/README_EN.md)  |  `String`  |  Easy  |    |
|  [1508](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums)  |  [Range Sum of Sorted Subarray Sums](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [1509](https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves)  |  [Minimum Difference Between Largest and Smallest Value in Three Moves](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [1510](https://leetcode.com/problems/stone-game-iv)  |  [Stone Game IV](/solution/1500-1599/1510.Stone%20Game%20IV/README_EN.md)  |  `Math`,`Dynamic Programming`,`Game Theory`  |  Hard  |    |
|  [1511](https://leetcode.com/problems/customer-order-frequency)  |  [Customer Order Frequency](/solution/1500-1599/1511.Customer%20Order%20Frequency/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1512](https://leetcode.com/problems/number-of-good-pairs)  |  [Number of Good Pairs](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README_EN.md)  |  `Array`,`Hash Table`,`Math`,`Counting`  |  Easy  |    |
|  [1513](https://leetcode.com/problems/number-of-substrings-with-only-1s)  |  [Number of Substrings With Only 1s](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README_EN.md)  |  `Math`,`String`  |  Medium  |    |
|  [1514](https://leetcode.com/problems/path-with-maximum-probability)  |  [Path with Maximum Probability](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README_EN.md)  |  `Graph`,`Shortest Path`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1515](https://leetcode.com/problems/best-position-for-a-service-centre)  |  [Best Position for a Service Centre](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README_EN.md)  |  `Geometry`,`Math`,`Randomized`  |  Hard  |    |
|  [1516](https://leetcode.com/problems/move-sub-tree-of-n-ary-tree)  |  [Move Sub-Tree of N-Ary Tree](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`  |  Hard  |  🔒  |
|  [1517](https://leetcode.com/problems/find-users-with-valid-e-mails)  |  [Find Users With Valid E-Mails](/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1518](https://leetcode.com/problems/water-bottles)  |  [Water Bottles](/solution/1500-1599/1518.Water%20Bottles/README_EN.md)  |  `Math`,`Simulation`  |  Easy  |    |
|  [1519](https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label)  |  [Number of Nodes in the Sub-Tree With the Same Label](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`  |  Medium  |    |
|  [1520](https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings)  |  [Maximum Number of Non-Overlapping Substrings](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README_EN.md)  |  `Greedy`,`String`  |  Hard  |    |
|  [1521](https://leetcode.com/problems/find-a-value-of-a-mysterious-function-closest-to-target)  |  [Find a Value of a Mysterious Function Closest to Target](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README_EN.md)  |  `Bit Manipulation`,`Segment Tree`,`Array`,`Binary Search`  |  Hard  |    |
|  [1522](https://leetcode.com/problems/diameter-of-n-ary-tree)  |  [Diameter of N-Ary Tree](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`  |  Medium  |  🔒  |
|  [1523](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range)  |  [Count Odd Numbers in an Interval Range](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README_EN.md)  |  `Math`  |  Easy  |    |
|  [1524](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum)  |  [Number of Sub-arrays With Odd Sum](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Prefix Sum`  |  Medium  |    |
|  [1525](https://leetcode.com/problems/number-of-good-ways-to-split-a-string)  |  [Number of Good Ways to Split a String](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README_EN.md)  |  `Bit Manipulation`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [1526](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array)  |  [Minimum Number of Increments on Subarrays to Form a Target Array](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README_EN.md)  |  `Stack`,`Greedy`,`Array`,`Dynamic Programming`,`Monotonic Stack`  |  Hard  |    |
|  [1527](https://leetcode.com/problems/patients-with-a-condition)  |  [Patients With a Condition](/solution/1500-1599/1527.Patients%20With%20a%20Condition/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1528](https://leetcode.com/problems/shuffle-string)  |  [Shuffle String](/solution/1500-1599/1528.Shuffle%20String/README_EN.md)  |  `Array`,`String`  |  Easy  |    |
|  [1529](https://leetcode.com/problems/bulb-switcher-iv)  |  [Bulb Switcher IV](/solution/1500-1599/1529.Bulb%20Switcher%20IV/README_EN.md)  |  `Greedy`,`String`  |  Medium  |    |
|  [1530](https://leetcode.com/problems/number-of-good-leaf-nodes-pairs)  |  [Number of Good Leaf Nodes Pairs](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1531](https://leetcode.com/problems/string-compression-ii)  |  [String Compression II](/solution/1500-1599/1531.String%20Compression%20II/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [1532](https://leetcode.com/problems/the-most-recent-three-orders)  |  [The Most Recent Three Orders](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1533](https://leetcode.com/problems/find-the-index-of-the-large-integer)  |  [Find the Index of the Large Integer](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README_EN.md)  |  `Array`,`Binary Search`,`Interactive`  |  Medium  |  🔒  |
|  [1534](https://leetcode.com/problems/count-good-triplets)  |  [Count Good Triplets](/solution/1500-1599/1534.Count%20Good%20Triplets/README_EN.md)  |  `Array`,`Enumeration`  |  Easy  |    |
|  [1535](https://leetcode.com/problems/find-the-winner-of-an-array-game)  |  [Find the Winner of an Array Game](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README_EN.md)  |  `Array`,`Simulation`  |  Medium  |    |
|  [1536](https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid)  |  [Minimum Swaps to Arrange a Binary Grid](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README_EN.md)  |  `Greedy`,`Array`,`Matrix`  |  Medium  |    |
|  [1537](https://leetcode.com/problems/get-the-maximum-score)  |  [Get the Maximum Score](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`,`Dynamic Programming`  |  Hard  |    |
|  [1538](https://leetcode.com/problems/guess-the-majority-in-a-hidden-array)  |  [Guess the Majority in a Hidden Array](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README_EN.md)  |  `Array`,`Math`,`Interactive`  |  Medium  |  🔒  |
|  [1539](https://leetcode.com/problems/kth-missing-positive-number)  |  [Kth Missing Positive Number](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README_EN.md)  |  `Array`,`Binary Search`  |  Easy  |    |
|  [1540](https://leetcode.com/problems/can-convert-string-in-k-moves)  |  [Can Convert String in K Moves](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README_EN.md)  |  `Hash Table`,`String`  |  Medium  |    |
|  [1541](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string)  |  [Minimum Insertions to Balance a Parentheses String](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README_EN.md)  |  `Stack`,`Greedy`,`String`  |  Medium  |    |
|  [1542](https://leetcode.com/problems/find-longest-awesome-substring)  |  [Find Longest Awesome Substring](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README_EN.md)  |  `Bit Manipulation`,`Hash Table`,`String`  |  Hard  |    |
|  [1543](https://leetcode.com/problems/fix-product-name-format)  |  [Fix Product Name Format](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1544](https://leetcode.com/problems/make-the-string-great)  |  [Make The String Great](/solution/1500-1599/1544.Make%20The%20String%20Great/README_EN.md)  |  `Stack`,`String`  |  Easy  |    |
|  [1545](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string)  |  [Find Kth Bit in Nth Binary String](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README_EN.md)  |  `Recursion`,`String`  |  Medium  |    |
|  [1546](https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target)  |  [Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Prefix Sum`  |  Medium  |    |
|  [1547](https://leetcode.com/problems/minimum-cost-to-cut-a-stick)  |  [Minimum Cost to Cut a Stick](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [1548](https://leetcode.com/problems/the-most-similar-path-in-a-graph)  |  [The Most Similar Path in a Graph](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README_EN.md)  |  `Graph`,`Dynamic Programming`  |  Hard  |  🔒  |
|  [1549](https://leetcode.com/problems/the-most-recent-orders-for-each-product)  |  [The Most Recent Orders for Each Product](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1550](https://leetcode.com/problems/three-consecutive-odds)  |  [Three Consecutive Odds](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1551](https://leetcode.com/problems/minimum-operations-to-make-array-equal)  |  [Minimum Operations to Make Array Equal](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README_EN.md)  |  `Math`  |  Medium  |    |
|  [1552](https://leetcode.com/problems/magnetic-force-between-two-balls)  |  [Magnetic Force Between Two Balls](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README_EN.md)  |  `Array`,`Binary Search`,`Sorting`  |  Medium  |    |
|  [1553](https://leetcode.com/problems/minimum-number-of-days-to-eat-n-oranges)  |  [Minimum Number of Days to Eat N Oranges](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README_EN.md)  |  `Memoization`,`Dynamic Programming`  |  Hard  |    |
|  [1554](https://leetcode.com/problems/strings-differ-by-one-character)  |  [Strings Differ by One Character](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README_EN.md)  |  `Hash Table`,`String`,`Hash Function`,`Rolling Hash`  |  Medium  |  🔒  |
|  [1555](https://leetcode.com/problems/bank-account-summary)  |  [Bank Account Summary](/solution/1500-1599/1555.Bank%20Account%20Summary/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1556](https://leetcode.com/problems/thousand-separator)  |  [Thousand Separator](/solution/1500-1599/1556.Thousand%20Separator/README_EN.md)  |  `String`  |  Easy  |    |
|  [1557](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes)  |  [Minimum Number of Vertices to Reach All Nodes](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README_EN.md)  |  `Graph`  |  Medium  |    |
|  [1558](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array)  |  [Minimum Numbers of Function Calls to Make Target Array](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [1559](https://leetcode.com/problems/detect-cycles-in-2d-grid)  |  [Detect Cycles in 2D Grid](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Hard  |    |
|  [1560](https://leetcode.com/problems/most-visited-sector-in-a-circular-track)  |  [Most Visited Sector in  a Circular Track](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README_EN.md)  |  `Array`,`Simulation`  |  Easy  |    |
|  [1561](https://leetcode.com/problems/maximum-number-of-coins-you-can-get)  |  [Maximum Number of Coins You Can Get](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README_EN.md)  |  `Greedy`,`Array`,`Math`,`Game Theory`,`Sorting`  |  Medium  |    |
|  [1562](https://leetcode.com/problems/find-latest-group-of-size-m)  |  [Find Latest Group of Size M](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README_EN.md)  |  `Array`,`Binary Search`,`Simulation`  |  Medium  |    |
|  [1563](https://leetcode.com/problems/stone-game-v)  |  [Stone Game V](/solution/1500-1599/1563.Stone%20Game%20V/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Game Theory`  |  Hard  |    |
|  [1564](https://leetcode.com/problems/put-boxes-into-the-warehouse-i)  |  [Put Boxes Into the Warehouse I](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |  🔒  |
|  [1565](https://leetcode.com/problems/unique-orders-and-customers-per-month)  |  [Unique Orders and Customers Per Month](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1566](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times)  |  [Detect Pattern of Length M Repeated K or More Times](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README_EN.md)  |  `Array`,`Enumeration`  |  Easy  |    |
|  [1567](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product)  |  [Maximum Length of Subarray With Positive Product](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [1568](https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island)  |  [Minimum Number of Days to Disconnect Island](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Strongly Connected Component`  |  Hard  |    |
|  [1569](https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst)  |  [Number of Ways to Reorder Array to Get Same BST](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README_EN.md)  |  `Tree`,`Union Find`,`Binary Search Tree`,`Memoization`,`Array`,`Math`,`Divide and Conquer`,`Dynamic Programming`,`Binary Tree`,`Combinatorics`  |  Hard  |    |
|  [1570](https://leetcode.com/problems/dot-product-of-two-sparse-vectors)  |  [Dot Product of Two Sparse Vectors](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Two Pointers`  |  Medium  |  🔒  |
|  [1571](https://leetcode.com/problems/warehouse-manager)  |  [Warehouse Manager](/solution/1500-1599/1571.Warehouse%20Manager/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1572](https://leetcode.com/problems/matrix-diagonal-sum)  |  [Matrix Diagonal Sum](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README_EN.md)  |  `Array`,`Matrix`  |  Easy  |    |
|  [1573](https://leetcode.com/problems/number-of-ways-to-split-a-string)  |  [Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README_EN.md)  |  `Math`,`String`  |  Medium  |    |
|  [1574](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted)  |  [Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_EN.md)  |  `Stack`,`Array`,`Two Pointers`,`Binary Search`,`Monotonic Stack`  |  Medium  |    |
|  [1575](https://leetcode.com/problems/count-all-possible-routes)  |  [Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md)  |  `Memoization`,`Array`,`Dynamic Programming`  |  Hard  |    |
|  [1576](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters)  |  [Replace All 's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md)  |  `String`  |  Easy  |    |
|  [1577](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers)  |  [Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README_EN.md)  |  `Array`,`Hash Table`,`Math`,`Two Pointers`  |  Medium  |    |
|  [1578](https://leetcode.com/problems/minimum-deletion-cost-to-avoid-repeating-letters)  |  [Minimum Deletion Cost to Avoid Repeating Letters](/solution/1500-1599/1578.Minimum%20Deletion%20Cost%20to%20Avoid%20Repeating%20Letters/README_EN.md)  |  `Greedy`,`Array`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [1579](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable)  |  [Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README_EN.md)  |  `Union Find`,`Graph`  |  Hard  |    |
|  [1580](https://leetcode.com/problems/put-boxes-into-the-warehouse-ii)  |  [Put Boxes Into the Warehouse II](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |  🔒  |
|  [1581](https://leetcode.com/problems/customer-who-visited-but-did-not-make-any-transactions)  |  [Customer Who Visited but Did Not Make Any Transactions](/solution/1500-1599/1581.Customer%20Who%20Visited%20but%20Did%20Not%20Make%20Any%20Transactions/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1582](https://leetcode.com/problems/special-positions-in-a-binary-matrix)  |  [Special Positions in a Binary Matrix](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README_EN.md)  |  `Array`,`Matrix`  |  Easy  |    |
|  [1583](https://leetcode.com/problems/count-unhappy-friends)  |  [Count Unhappy Friends](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README_EN.md)  |  `Array`,`Simulation`  |  Medium  |    |
|  [1584](https://leetcode.com/problems/min-cost-to-connect-all-points)  |  [Min Cost to Connect All Points](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README_EN.md)  |  `Union Find`,`Array`,`Minimum Spanning Tree`  |  Medium  |    |
|  [1585](https://leetcode.com/problems/check-if-string-is-transformable-with-substring-sort-operations)  |  [Check If String Is Transformable With Substring Sort Operations](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README_EN.md)  |  `Greedy`,`String`,`Sorting`  |  Hard  |    |
|  [1586](https://leetcode.com/problems/binary-search-tree-iterator-ii)  |  [Binary Search Tree Iterator II](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README_EN.md)  |  `Stack`,`Tree`,`Design`,`Binary Search Tree`,`Binary Tree`,`Iterator`  |  Medium  |  🔒  |
|  [1587](https://leetcode.com/problems/bank-account-summary-ii)  |  [Bank Account Summary II](/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1588](https://leetcode.com/problems/sum-of-all-odd-length-subarrays)  |  [Sum of All Odd Length Subarrays](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README_EN.md)  |  `Array`,`Prefix Sum`  |  Easy  |    |
|  [1589](https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation)  |  [Maximum Sum Obtained of Any Permutation](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README_EN.md)  |  `Greedy`,`Array`,`Prefix Sum`,`Sorting`  |  Medium  |    |
|  [1590](https://leetcode.com/problems/make-sum-divisible-by-p)  |  [Make Sum Divisible by P](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README_EN.md)  |  `Array`,`Hash Table`,`Prefix Sum`  |  Medium  |    |
|  [1591](https://leetcode.com/problems/strange-printer-ii)  |  [Strange Printer II](/solution/1500-1599/1591.Strange%20Printer%20II/README_EN.md)  |  `Graph`,`Topological Sort`,`Array`,`Matrix`  |  Hard  |    |
|  [1592](https://leetcode.com/problems/rearrange-spaces-between-words)  |  [Rearrange Spaces Between Words](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README_EN.md)  |  `String`  |  Easy  |    |
|  [1593](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings)  |  [Split a String Into the Max Number of Unique Substrings](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README_EN.md)  |  `Hash Table`,`String`,`Backtracking`  |  Medium  |    |
|  [1594](https://leetcode.com/problems/maximum-non-negative-product-in-a-matrix)  |  [Maximum Non Negative Product in a Matrix](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |    |
|  [1595](https://leetcode.com/problems/minimum-cost-to-connect-two-groups-of-points)  |  [Minimum Cost to Connect Two Groups of Points](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix`  |  Hard  |    |
|  [1596](https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer)  |  [The Most Frequently Ordered Products for Each Customer](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1597](https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression)  |  [Build Binary Expression Tree From Infix Expression](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README_EN.md)  |  `Stack`,`Tree`,`String`,`Binary Tree`  |  Hard  |  🔒  |
|  [1598](https://leetcode.com/problems/crawler-log-folder)  |  [Crawler Log Folder](/solution/1500-1599/1598.Crawler%20Log%20Folder/README_EN.md)  |  `Stack`,`Array`,`String`  |  Easy  |    |
|  [1599](https://leetcode.com/problems/maximum-profit-of-operating-a-centennial-wheel)  |  [Maximum Profit of Operating a Centennial Wheel](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README_EN.md)  |  `Array`,`Simulation`  |  Medium  |    |
|  [1600](https://leetcode.com/problems/throne-inheritance)  |  [Throne Inheritance](/solution/1600-1699/1600.Throne%20Inheritance/README_EN.md)  |  `Tree`,`Depth-First Search`,`Design`,`Hash Table`  |  Medium  |    |
|  [1601](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests)  |  [Maximum Number of Achievable Transfer Requests](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README_EN.md)  |  `Bit Manipulation`,`Enumeration`  |  Hard  |    |
|  [1602](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree)  |  [Find Nearest Right Node in Binary Tree](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README_EN.md)  |  `Tree`,`Breadth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [1603](https://leetcode.com/problems/design-parking-system)  |  [Design Parking System](/solution/1600-1699/1603.Design%20Parking%20System/README_EN.md)  |  `Design`,`Counting`,`Simulation`  |  Easy  |    |
|  [1604](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period)  |  [Alert Using Same Key-Card Three or More Times in a One Hour Period](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README_EN.md)  |  `Array`,`Hash Table`,`String`,`Sorting`  |  Medium  |    |
|  [1605](https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums)  |  [Find Valid Matrix Given Row and Column Sums](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README_EN.md)  |  `Greedy`,`Array`,`Matrix`  |  Medium  |    |
|  [1606](https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests)  |  [Find Servers That Handled Most Number of Requests](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README_EN.md)  |  `Greedy`,`Array`,`Ordered Set`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1607](https://leetcode.com/problems/sellers-with-no-sales)  |  [Sellers With No Sales](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1608](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x)  |  [Special Array With X Elements Greater Than or Equal X](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README_EN.md)  |  `Array`,`Binary Search`,`Sorting`  |  Easy  |    |
|  [1609](https://leetcode.com/problems/even-odd-tree)  |  [Even Odd Tree](/solution/1600-1699/1609.Even%20Odd%20Tree/README_EN.md)  |  `Tree`,`Breadth-First Search`,`Binary Tree`  |  Medium  |    |
|  [1610](https://leetcode.com/problems/maximum-number-of-visible-points)  |  [Maximum Number of Visible Points](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README_EN.md)  |  `Geometry`,`Array`,`Math`,`Sorting`,`Sliding Window`  |  Hard  |    |
|  [1611](https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero)  |  [Minimum One Bit Operations to Make Integers Zero](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README_EN.md)  |  `Bit Manipulation`,`Memoization`,`Dynamic Programming`  |  Hard  |    |
|  [1612](https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent)  |  [Check If Two Expression Trees are Equivalent](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [1613](https://leetcode.com/problems/find-the-missing-ids)  |  [Find the Missing IDs](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1614](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses)  |  [Maximum Nesting Depth of the Parentheses](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README_EN.md)  |  `Stack`,`String`  |  Easy  |    |
|  [1615](https://leetcode.com/problems/maximal-network-rank)  |  [Maximal Network Rank](/solution/1600-1699/1615.Maximal%20Network%20Rank/README_EN.md)  |  `Graph`  |  Medium  |    |
|  [1616](https://leetcode.com/problems/split-two-strings-to-make-palindrome)  |  [Split Two Strings to Make Palindrome](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README_EN.md)  |  `Greedy`,`Two Pointers`,`String`  |  Medium  |    |
|  [1617](https://leetcode.com/problems/count-subtrees-with-max-distance-between-cities)  |  [Count Subtrees With Max Distance Between Cities](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README_EN.md)  |  `Bit Manipulation`,`Tree`,`Dynamic Programming`,`Bitmask`,`Enumeration`  |  Hard  |    |
|  [1618](https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen)  |  [Maximum Font to Fit a Sentence in a Screen](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README_EN.md)  |  `Array`,`String`,`Binary Search`,`Interactive`  |  Medium  |  🔒  |
|  [1619](https://leetcode.com/problems/mean-of-array-after-removing-some-elements)  |  [Mean of Array After Removing Some Elements](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README_EN.md)  |  `Array`,`Sorting`  |  Easy  |    |
|  [1620](https://leetcode.com/problems/coordinate-with-maximum-network-quality)  |  [Coordinate With Maximum Network Quality](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README_EN.md)  |  `Array`,`Enumeration`  |  Medium  |    |
|  [1621](https://leetcode.com/problems/number-of-sets-of-k-non-overlapping-line-segments)  |  [Number of Sets of K Non-Overlapping Line Segments](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Medium  |    |
|  [1622](https://leetcode.com/problems/fancy-sequence)  |  [Fancy Sequence](/solution/1600-1699/1622.Fancy%20Sequence/README_EN.md)  |  `Design`,`Segment Tree`,`Math`  |  Hard  |    |
|  [1623](https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country)  |  [All Valid Triplets That Can Represent a Country](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1624](https://leetcode.com/problems/largest-substring-between-two-equal-characters)  |  [Largest Substring Between Two Equal Characters](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [1625](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations)  |  [Lexicographically Smallest String After Applying Operations](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README_EN.md)  |  `Breadth-First Search`,`String`  |  Medium  |    |
|  [1626](https://leetcode.com/problems/best-team-with-no-conflicts)  |  [Best Team With No Conflicts](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README_EN.md)  |  `Array`,`Dynamic Programming`,`Sorting`  |  Medium  |    |
|  [1627](https://leetcode.com/problems/graph-connectivity-with-threshold)  |  [Graph Connectivity With Threshold](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README_EN.md)  |  `Union Find`,`Array`,`Math`  |  Hard  |    |
|  [1628](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function)  |  [Design an Expression Tree With Evaluate Function](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README_EN.md)  |  `Stack`,`Tree`,`Design`,`Math`,`Binary Tree`  |  Medium  |  🔒  |
|  [1629](https://leetcode.com/problems/slowest-key)  |  [Slowest Key](/solution/1600-1699/1629.Slowest%20Key/README_EN.md)  |  `Array`,`String`  |  Easy  |    |
|  [1630](https://leetcode.com/problems/arithmetic-subarrays)  |  [Arithmetic Subarrays](/solution/1600-1699/1630.Arithmetic%20Subarrays/README_EN.md)  |  `Array`,`Sorting`  |  Medium  |    |
|  [1631](https://leetcode.com/problems/path-with-minimum-effort)  |  [Path With Minimum Effort](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1632](https://leetcode.com/problems/rank-transform-of-a-matrix)  |  [Rank Transform of a Matrix](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README_EN.md)  |  `Greedy`,`Union Find`,`Graph`,`Topological Sort`,`Array`,`Matrix`  |  Hard  |    |
|  [1633](https://leetcode.com/problems/percentage-of-users-attended-a-contest)  |  [Percentage of Users Attended a Contest](/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1634](https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists)  |  [Add Two Polynomials Represented as Linked Lists](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README_EN.md)  |  `Linked List`,`Math`,`Two Pointers`  |  Medium  |  🔒  |
|  [1635](https://leetcode.com/problems/hopper-company-queries-i)  |  [Hopper Company Queries I](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1636](https://leetcode.com/problems/sort-array-by-increasing-frequency)  |  [Sort Array by Increasing Frequency](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README_EN.md)  |  `Array`,`Hash Table`,`Sorting`  |  Easy  |    |
|  [1637](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points)  |  [Widest Vertical Area Between Two Points Containing No Points](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README_EN.md)  |  `Array`,`Sorting`  |  Medium  |    |
|  [1638](https://leetcode.com/problems/count-substrings-that-differ-by-one-character)  |  [Count Substrings That Differ by One Character](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README_EN.md)  |  `Hash Table`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [1639](https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary)  |  [Number of Ways to Form a Target String Given a Dictionary](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README_EN.md)  |  `Array`,`String`,`Dynamic Programming`  |  Hard  |    |
|  [1640](https://leetcode.com/problems/check-array-formation-through-concatenation)  |  [Check Array Formation Through Concatenation](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README_EN.md)  |  `Array`,`Hash Table`  |  Easy  |    |
|  [1641](https://leetcode.com/problems/count-sorted-vowel-strings)  |  [Count Sorted Vowel Strings](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README_EN.md)  |  `Dynamic Programming`  |  Medium  |    |
|  [1642](https://leetcode.com/problems/furthest-building-you-can-reach)  |  [Furthest Building You Can Reach](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README_EN.md)  |  `Greedy`,`Array`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1643](https://leetcode.com/problems/kth-smallest-instructions)  |  [Kth Smallest Instructions](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Combinatorics`  |  Hard  |    |
|  [1644](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii)  |  [Lowest Common Ancestor of a Binary Tree II](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [1645](https://leetcode.com/problems/hopper-company-queries-ii)  |  [Hopper Company Queries II](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1646](https://leetcode.com/problems/get-maximum-in-generated-array)  |  [Get Maximum in Generated Array](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README_EN.md)  |  `Array`,`Dynamic Programming`,`Simulation`  |  Easy  |    |
|  [1647](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique)  |  [Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README_EN.md)  |  `Greedy`,`String`,`Sorting`  |  Medium  |    |
|  [1648](https://leetcode.com/problems/sell-diminishing-valued-colored-balls)  |  [Sell Diminishing-Valued Colored Balls](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README_EN.md)  |  `Greedy`,`Array`,`Math`,`Binary Search`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1649](https://leetcode.com/problems/create-sorted-array-through-instructions)  |  [Create Sorted Array through Instructions](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README_EN.md)  |  `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort`  |  Hard  |    |
|  [1650](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii)  |  [Lowest Common Ancestor of a Binary Tree III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README_EN.md)  |  `Tree`,`Hash Table`,`Binary Tree`  |  Medium  |  🔒  |
|  [1651](https://leetcode.com/problems/hopper-company-queries-iii)  |  [Hopper Company Queries III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1652](https://leetcode.com/problems/defuse-the-bomb)  |  [Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1653](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced)  |  [Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README_EN.md)  |  `Stack`,`String`,`Dynamic Programming`  |  Medium  |    |
|  [1654](https://leetcode.com/problems/minimum-jumps-to-reach-home)  |  [Minimum Jumps to Reach Home](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README_EN.md)  |  `Breadth-First Search`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [1655](https://leetcode.com/problems/distribute-repeating-integers)  |  [Distribute Repeating Integers](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Hard  |    |
|  [1656](https://leetcode.com/problems/design-an-ordered-stream)  |  [Design an Ordered Stream](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Data Stream`  |  Easy  |    |
|  [1657](https://leetcode.com/problems/determine-if-two-strings-are-close)  |  [Determine if Two Strings Are Close](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README_EN.md)  |  `Hash Table`,`String`,`Sorting`  |  Medium  |    |
|  [1658](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero)  |  [Minimum Operations to Reduce X to Zero](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Prefix Sum`  |  Medium  |    |
|  [1659](https://leetcode.com/problems/maximize-grid-happiness)  |  [Maximize Grid Happiness](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README_EN.md)  |  `Bit Manipulation`,`Memoization`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [1660](https://leetcode.com/problems/correct-a-binary-tree)  |  [Correct a Binary Tree](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`  |  Medium  |  🔒  |
|  [1661](https://leetcode.com/problems/average-time-of-process-per-machine)  |  [Average Time of Process per Machine](/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1662](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent)  |  [Check If Two String Arrays are Equivalent](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README_EN.md)  |  `Array`,`String`  |  Easy  |    |
|  [1663](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value)  |  [Smallest String With A Given Numeric Value](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README_EN.md)  |  `Greedy`,`String`  |  Medium  |    |
|  [1664](https://leetcode.com/problems/ways-to-make-a-fair-array)  |  [Ways to Make a Fair Array](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1665](https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks)  |  [Minimum Initial Energy to Finish Tasks](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Hard  |    |
|  [1666](https://leetcode.com/problems/change-the-root-of-a-binary-tree)  |  [Change the Root of a Binary Tree](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [1667](https://leetcode.com/problems/fix-names-in-a-table)  |  [Fix Names in a Table](/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1668](https://leetcode.com/problems/maximum-repeating-substring)  |  [Maximum Repeating Substring](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README_EN.md)  |  `String`,`String Matching`  |  Easy  |    |
|  [1669](https://leetcode.com/problems/merge-in-between-linked-lists)  |  [Merge In Between Linked Lists](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README_EN.md)  |  `Linked List`  |  Medium  |    |
|  [1670](https://leetcode.com/problems/design-front-middle-back-queue)  |  [Design Front Middle Back Queue](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README_EN.md)  |  `Design`,`Queue`,`Array`,`Linked List`,`Data Stream`  |  Medium  |    |
|  [1671](https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array)  |  [Minimum Number of Removals to Make Mountain Array](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README_EN.md)  |  `Greedy`,`Array`,`Binary Search`,`Dynamic Programming`  |  Hard  |    |
|  [1672](https://leetcode.com/problems/richest-customer-wealth)  |  [Richest Customer Wealth](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README_EN.md)  |  `Array`,`Matrix`  |  Easy  |    |
|  [1673](https://leetcode.com/problems/find-the-most-competitive-subsequence)  |  [Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README_EN.md)  |  `Stack`,`Greedy`,`Array`,`Monotonic Stack`  |  Medium  |    |
|  [1674](https://leetcode.com/problems/minimum-moves-to-make-array-complementary)  |  [Minimum Moves to Make Array Complementary](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README_EN.md)  |  `Array`,`Hash Table`,`Prefix Sum`  |  Medium  |    |
|  [1675](https://leetcode.com/problems/minimize-deviation-in-array)  |  [Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README_EN.md)  |  `Greedy`,`Array`,`Ordered Set`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1676](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv)  |  [Lowest Common Ancestor of a Binary Tree IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README_EN.md)  |  `Tree`,`Depth-First Search`,`Binary Tree`  |  Medium  |  🔒  |
|  [1677](https://leetcode.com/problems/products-worth-over-invoices)  |  [Product's Worth Over Invoices](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1678](https://leetcode.com/problems/goal-parser-interpretation)  |  [Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README_EN.md)  |  `String`  |  Easy  |    |
|  [1679](https://leetcode.com/problems/max-number-of-k-sum-pairs)  |  [Max Number of K-Sum Pairs](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [1680](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers)  |  [Concatenation of Consecutive Binary Numbers](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README_EN.md)  |  `Bit Manipulation`,`Math`,`Simulation`  |  Medium  |    |
|  [1681](https://leetcode.com/problems/minimum-incompatibility)  |  [Minimum Incompatibility](/solution/1600-1699/1681.Minimum%20Incompatibility/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [1682](https://leetcode.com/problems/longest-palindromic-subsequence-ii)  |  [Longest Palindromic Subsequence II](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |  🔒  |
|  [1683](https://leetcode.com/problems/invalid-tweets)  |  [Invalid Tweets](/solution/1600-1699/1683.Invalid%20Tweets/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1684](https://leetcode.com/problems/count-the-number-of-consistent-strings)  |  [Count the Number of Consistent Strings](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README_EN.md)  |  `Bit Manipulation`,`Array`,`Hash Table`,`String`  |  Easy  |    |
|  [1685](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array)  |  [Sum of Absolute Differences in a Sorted Array](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README_EN.md)  |  `Array`,`Math`,`Prefix Sum`  |  Medium  |    |
|  [1686](https://leetcode.com/problems/stone-game-vi)  |  [Stone Game VI](/solution/1600-1699/1686.Stone%20Game%20VI/README_EN.md)  |  `Greedy`,`Array`,`Math`,`Game Theory`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1687](https://leetcode.com/problems/delivering-boxes-from-storage-to-ports)  |  [Delivering Boxes from Storage to Ports](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README_EN.md)  |  `Segment Tree`,`Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1688](https://leetcode.com/problems/count-of-matches-in-tournament)  |  [Count of Matches in Tournament](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README_EN.md)  |  `Math`,`Simulation`  |  Easy  |    |
|  [1689](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers)  |  [Partitioning Into Minimum Number Of Deci-Binary Numbers](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README_EN.md)  |  `Greedy`,`String`  |  Medium  |    |
|  [1690](https://leetcode.com/problems/stone-game-vii)  |  [Stone Game VII](/solution/1600-1699/1690.Stone%20Game%20VII/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Game Theory`  |  Medium  |    |
|  [1691](https://leetcode.com/problems/maximum-height-by-stacking-cuboids)  |  [Maximum Height by Stacking Cuboids](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README_EN.md)  |  `Array`,`Dynamic Programming`,`Sorting`  |  Hard  |    |
|  [1692](https://leetcode.com/problems/count-ways-to-distribute-candies)  |  [Count Ways to Distribute Candies](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README_EN.md)  |  `Dynamic Programming`  |  Hard  |  🔒  |
|  [1693](https://leetcode.com/problems/daily-leads-and-partners)  |  [Daily Leads and Partners](/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1694](https://leetcode.com/problems/reformat-phone-number)  |  [Reformat Phone Number](/solution/1600-1699/1694.Reformat%20Phone%20Number/README_EN.md)  |  `String`  |  Easy  |    |
|  [1695](https://leetcode.com/problems/maximum-erasure-value)  |  [Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README_EN.md)  |  `Array`,`Hash Table`,`Sliding Window`  |  Medium  |    |
|  [1696](https://leetcode.com/problems/jump-game-vi)  |  [Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README_EN.md)  |  `Queue`,`Array`,`Dynamic Programming`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1697](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths)  |  [Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README_EN.md)  |  `Union Find`,`Graph`,`Array`,`Sorting`  |  Hard  |    |
|  [1698](https://leetcode.com/problems/number-of-distinct-substrings-in-a-string)  |  [Number of Distinct Substrings in a String](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README_EN.md)  |  `Trie`,`String`,`Suffix Array`,`Hash Function`,`Rolling Hash`  |  Medium  |  🔒  |
|  [1699](https://leetcode.com/problems/number-of-calls-between-two-persons)  |  [Number of Calls Between Two Persons](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1700](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch)  |  [Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README_EN.md)  |  `Stack`,`Queue`,`Array`,`Simulation`  |  Easy  |    |
|  [1701](https://leetcode.com/problems/average-waiting-time)  |  [Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README_EN.md)  |  `Array`,`Simulation`  |  Medium  |    |
|  [1702](https://leetcode.com/problems/maximum-binary-string-after-change)  |  [Maximum Binary String After Change](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README_EN.md)  |  `Greedy`,`String`  |  Medium  |    |
|  [1703](https://leetcode.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones)  |  [Minimum Adjacent Swaps for K Consecutive Ones](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README_EN.md)  |  `Greedy`,`Array`,`Prefix Sum`,`Sliding Window`  |  Hard  |    |
|  [1704](https://leetcode.com/problems/determine-if-string-halves-are-alike)  |  [Determine if String Halves Are Alike](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README_EN.md)  |  `String`,`Counting`  |  Easy  |    |
|  [1705](https://leetcode.com/problems/maximum-number-of-eaten-apples)  |  [Maximum Number of Eaten Apples](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README_EN.md)  |  `Greedy`,`Array`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1706](https://leetcode.com/problems/where-will-the-ball-fall)  |  [Where Will the Ball Fall](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README_EN.md)  |  `Depth-First Search`,`Array`,`Dynamic Programming`,`Matrix`,`Simulation`  |  Medium  |    |
|  [1707](https://leetcode.com/problems/maximum-xor-with-an-element-from-array)  |  [Maximum XOR With an Element From Array](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README_EN.md)  |  `Bit Manipulation`,`Trie`,`Array`  |  Hard  |    |
|  [1708](https://leetcode.com/problems/largest-subarray-length-k)  |  [Largest Subarray Length K](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README_EN.md)  |  `Greedy`,`Array`  |  Easy  |  🔒  |
|  [1709](https://leetcode.com/problems/biggest-window-between-visits)  |  [Biggest Window Between Visits](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1710](https://leetcode.com/problems/maximum-units-on-a-truck)  |  [Maximum Units on a Truck](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Easy  |    |
|  [1711](https://leetcode.com/problems/count-good-meals)  |  [Count Good Meals](/solution/1700-1799/1711.Count%20Good%20Meals/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [1712](https://leetcode.com/problems/ways-to-split-array-into-three-subarrays)  |  [Ways to Split Array Into Three Subarrays](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README_EN.md)  |  `Array`,`Two Pointers`,`Binary Search`,`Prefix Sum`  |  Medium  |    |
|  [1713](https://leetcode.com/problems/minimum-operations-to-make-a-subsequence)  |  [Minimum Operations to Make a Subsequence](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Binary Search`  |  Hard  |    |
|  [1714](https://leetcode.com/problems/sum-of-special-evenly-spaced-elements-in-array)  |  [Sum Of Special Evenly-Spaced Elements In Array](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |  🔒  |
|  [1715](https://leetcode.com/problems/count-apples-and-oranges)  |  [Count Apples and Oranges](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1716](https://leetcode.com/problems/calculate-money-in-leetcode-bank)  |  [Calculate Money in Leetcode Bank](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README_EN.md)  |  `Math`  |  Easy  |    |
|  [1717](https://leetcode.com/problems/maximum-score-from-removing-substrings)  |  [Maximum Score From Removing Substrings](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README_EN.md)  |  `Stack`,`Greedy`,`String`  |  Medium  |    |
|  [1718](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence)  |  [Construct the Lexicographically Largest Valid Sequence](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README_EN.md)  |  `Array`,`Backtracking`  |  Medium  |    |
|  [1719](https://leetcode.com/problems/number-of-ways-to-reconstruct-a-tree)  |  [Number Of Ways To Reconstruct A Tree](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README_EN.md)  |  `Tree`,`Graph`,`Topological Sort`  |  Hard  |    |
|  [1720](https://leetcode.com/problems/decode-xored-array)  |  [Decode XORed Array](/solution/1700-1799/1720.Decode%20XORed%20Array/README_EN.md)  |  `Bit Manipulation`,`Array`  |  Easy  |    |
|  [1721](https://leetcode.com/problems/swapping-nodes-in-a-linked-list)  |  [Swapping Nodes in a Linked List](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README_EN.md)  |  `Linked List`,`Two Pointers`  |  Medium  |    |
|  [1722](https://leetcode.com/problems/minimize-hamming-distance-after-swap-operations)  |  [Minimize Hamming Distance After Swap Operations](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README_EN.md)  |  `Depth-First Search`,`Union Find`,`Array`  |  Medium  |    |
|  [1723](https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs)  |  [Find Minimum Time to Finish All Jobs](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Hard  |    |
|  [1724](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths-ii)  |  [Checking Existence of Edge Length Limited Paths II](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README_EN.md)  |  `Union Find`,`Graph`,`Minimum Spanning Tree`  |  Hard  |  🔒  |
|  [1725](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square)  |  [Number Of Rectangles That Can Form The Largest Square](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1726](https://leetcode.com/problems/tuple-with-same-product)  |  [Tuple with Same Product](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [1727](https://leetcode.com/problems/largest-submatrix-with-rearrangements)  |  [Largest Submatrix With Rearrangements](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README_EN.md)  |  `Greedy`,`Array`,`Matrix`,`Sorting`  |  Medium  |    |
|  [1728](https://leetcode.com/problems/cat-and-mouse-ii)  |  [Cat and Mouse II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README_EN.md)  |  `Breadth-First Search`,`Graph`,`Memoization`,`Math`,`Dynamic Programming`,`Game Theory`  |  Hard  |    |
|  [1729](https://leetcode.com/problems/find-followers-count)  |  [Find Followers Count](/solution/1700-1799/1729.Find%20Followers%20Count/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1730](https://leetcode.com/problems/shortest-path-to-get-food)  |  [Shortest Path to Get Food](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Medium  |  🔒  |
|  [1731](https://leetcode.com/problems/the-number-of-employees-which-report-to-each-employee)  |  [The Number of Employees Which Report to Each Employee](/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1732](https://leetcode.com/problems/find-the-highest-altitude)  |  [Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README_EN.md)  |  `Array`,`Prefix Sum`  |  Easy  |    |
|  [1733](https://leetcode.com/problems/minimum-number-of-people-to-teach)  |  [Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [1734](https://leetcode.com/problems/decode-xored-permutation)  |  [Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README_EN.md)  |  `Bit Manipulation`,`Array`  |  Medium  |    |
|  [1735](https://leetcode.com/problems/count-ways-to-make-array-with-product)  |  [Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`  |  Hard  |    |
|  [1736](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits)  |  [Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README_EN.md)  |  `String`  |  Easy  |    |
|  [1737](https://leetcode.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions)  |  [Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README_EN.md)  |  `Hash Table`,`String`,`Counting`,`Prefix Sum`  |  Medium  |    |
|  [1738](https://leetcode.com/problems/find-kth-largest-xor-coordinate-value)  |  [Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README_EN.md)  |  `Bit Manipulation`,`Array`,`Divide and Conquer`,`Matrix`,`Prefix Sum`,`Quickselect`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1739](https://leetcode.com/problems/building-boxes)  |  [Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README_EN.md)  |  `Greedy`,`Math`,`Binary Search`  |  Hard  |    |
|  [1740](https://leetcode.com/problems/find-distance-in-a-binary-tree)  |  [Find Distance in a Binary Tree](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`  |  Medium  |  🔒  |
|  [1741](https://leetcode.com/problems/find-total-time-spent-by-each-employee)  |  [Find Total Time Spent by Each Employee](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1742](https://leetcode.com/problems/maximum-number-of-balls-in-a-box)  |  [Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README_EN.md)  |  `Hash Table`,`Math`,`Counting`  |  Easy  |    |
|  [1743](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs)  |  [Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [1744](https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day)  |  [Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README_EN.md)  |  `Array`,`Prefix Sum`  |  Medium  |    |
|  [1745](https://leetcode.com/problems/palindrome-partitioning-iv)  |  [Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [1746](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation)  |  [Maximum Subarray Sum After One Operation](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |  🔒  |
|  [1747](https://leetcode.com/problems/leetflex-banned-accounts)  |  [Leetflex Banned Accounts](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1748](https://leetcode.com/problems/sum-of-unique-elements)  |  [Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README_EN.md)  |  `Array`,`Hash Table`,`Counting`  |  Easy  |    |
|  [1749](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray)  |  [Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1750](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends)  |  [Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README_EN.md)  |  `Two Pointers`,`String`  |  Medium  |    |
|  [1751](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii)  |  [Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md)  |  `Array`,`Binary Search`,`Dynamic Programming`  |  Hard  |    |
|  [1752](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated)  |  [Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1753](https://leetcode.com/problems/maximum-score-from-removing-stones)  |  [Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README_EN.md)  |  `Greedy`,`Math`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1754](https://leetcode.com/problems/largest-merge-of-two-strings)  |  [Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README_EN.md)  |  `Greedy`,`Two Pointers`,`String`  |  Medium  |    |
|  [1755](https://leetcode.com/problems/closest-subsequence-sum)  |  [Closest Subsequence Sum](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README_EN.md)  |  `Bit Manipulation`,`Array`,`Two Pointers`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [1756](https://leetcode.com/problems/design-most-recently-used-queue)  |  [Design Most Recently Used Queue](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README_EN.md)  |  `Stack`,`Design`,`Array`,`Hash Table`,`Ordered Set`  |  Medium  |  🔒  |
|  [1757](https://leetcode.com/problems/recyclable-and-low-fat-products)  |  [Recyclable and Low Fat Products](/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1758](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string)  |  [Minimum Changes To Make Alternating Binary String](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README_EN.md)  |  `String`  |  Easy  |    |
|  [1759](https://leetcode.com/problems/count-number-of-homogenous-substrings)  |  [Count Number of Homogenous Substrings](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README_EN.md)  |  `Math`,`String`  |  Medium  |    |
|  [1760](https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag)  |  [Minimum Limit of Balls in a Bag](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [1761](https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph)  |  [Minimum Degree of a Connected Trio in a Graph](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README_EN.md)  |  `Graph`  |  Hard  |    |
|  [1762](https://leetcode.com/problems/buildings-with-an-ocean-view)  |  [Buildings With an Ocean View](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README_EN.md)  |  `Stack`,`Array`,`Monotonic Stack`  |  Medium  |  🔒  |
|  [1763](https://leetcode.com/problems/longest-nice-substring)  |  [Longest Nice Substring](/solution/1700-1799/1763.Longest%20Nice%20Substring/README_EN.md)  |  `Bit Manipulation`,`Hash Table`,`String`,`Sliding Window`  |  Easy  |    |
|  [1764](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array)  |  [Form Array by Concatenating Subarrays of Another Array](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README_EN.md)  |  `Greedy`,`Array`,`String Matching`  |  Medium  |    |
|  [1765](https://leetcode.com/problems/map-of-highest-peak)  |  [Map of Highest Peak](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [1766](https://leetcode.com/problems/tree-of-coprimes)  |  [Tree of Coprimes](/solution/1700-1799/1766.Tree%20of%20Coprimes/README_EN.md)  |  `Tree`,`Depth-First Search`,`Breadth-First Search`,`Math`  |  Hard  |    |
|  [1767](https://leetcode.com/problems/find-the-subtasks-that-did-not-execute)  |  [Find the Subtasks That Did Not Execute](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1768](https://leetcode.com/problems/merge-strings-alternately)  |  [Merge Strings Alternately](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |    |
|  [1769](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box)  |  [Minimum Number of Operations to Move All Balls to Each Box](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README_EN.md)  |  `Array`,`String`  |  Medium  |    |
|  [1770](https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations)  |  [Maximum Score from Performing Multiplication Operations](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1771](https://leetcode.com/problems/maximize-palindrome-length-from-subsequences)  |  [Maximize Palindrome Length From Subsequences](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
|  [1772](https://leetcode.com/problems/sort-features-by-popularity)  |  [Sort Features by Popularity](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README_EN.md)  |  `Array`,`Hash Table`,`String`,`Sorting`  |  Medium  |  🔒  |
|  [1773](https://leetcode.com/problems/count-items-matching-a-rule)  |  [Count Items Matching a Rule](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README_EN.md)  |  `Array`,`String`  |  Easy  |    |
|  [1774](https://leetcode.com/problems/closest-dessert-cost)  |  [Closest Dessert Cost](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README_EN.md)  |  `Array`,`Dynamic Programming`,`Backtracking`  |  Medium  |    |
|  [1775](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations)  |  [Equal Sum Arrays With Minimum Number of Operations](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README_EN.md)  |  `Greedy`,`Array`,`Hash Table`,`Counting`  |  Medium  |    |
|  [1776](https://leetcode.com/problems/car-fleet-ii)  |  [Car Fleet II](/solution/1700-1799/1776.Car%20Fleet%20II/README_EN.md)  |  `Stack`,`Array`,`Math`,`Monotonic Stack`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1777](https://leetcode.com/problems/products-price-for-each-store)  |  [Product's Price for Each Store](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1778](https://leetcode.com/problems/shortest-path-in-a-hidden-grid)  |  [Shortest Path in a Hidden Grid](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Interactive`  |  Medium  |  🔒  |
|  [1779](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate)  |  [Find Nearest Point That Has the Same X or Y Coordinate](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1780](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three)  |  [Check if Number is a Sum of Powers of Three](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README_EN.md)  |  `Math`  |  Medium  |    |
|  [1781](https://leetcode.com/problems/sum-of-beauty-of-all-substrings)  |  [Sum of Beauty of All Substrings](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README_EN.md)  |  `Hash Table`,`String`,`Counting`  |  Medium  |    |
|  [1782](https://leetcode.com/problems/count-pairs-of-nodes)  |  [Count Pairs Of Nodes](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README_EN.md)  |  `Graph`,`Two Pointers`,`Binary Search`  |  Hard  |    |
|  [1783](https://leetcode.com/problems/grand-slam-titles)  |  [Grand Slam Titles](/solution/1700-1799/1783.Grand%20Slam%20Titles/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1784](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)  |  [Check if Binary String Has at Most One Segment of Ones](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README_EN.md)  |  `String`  |  Easy  |    |
|  [1785](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum)  |  [Minimum Elements to Add to Form a Given Sum](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [1786](https://leetcode.com/problems/number-of-restricted-paths-from-first-to-last-node)  |  [Number of Restricted Paths From First to Last Node](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README_EN.md)  |  `Graph`,`Topological Sort`,`Dynamic Programming`,`Shortest Path`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1787](https://leetcode.com/problems/make-the-xor-of-all-segments-equal-to-zero)  |  [Make the XOR of All Segments Equal to Zero](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`  |  Hard  |    |
|  [1788](https://leetcode.com/problems/maximize-the-beauty-of-the-garden)  |  [Maximize the Beauty of the Garden](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README_EN.md)  |  `Greedy`,`Array`,`Prefix Sum`  |  Hard  |  🔒  |
|  [1789](https://leetcode.com/problems/primary-department-for-each-employee)  |  [Primary Department for Each Employee](/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1790](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal)  |  [Check if One String Swap Can Make Strings Equal](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README_EN.md)  |  `Hash Table`,`String`,`Counting`  |  Easy  |    |
|  [1791](https://leetcode.com/problems/find-center-of-star-graph)  |  [Find Center of Star Graph](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README_EN.md)  |  `Graph`  |  Easy  |    |
|  [1792](https://leetcode.com/problems/maximum-average-pass-ratio)  |  [Maximum Average Pass Ratio](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README_EN.md)  |  `Greedy`,`Array`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1793](https://leetcode.com/problems/maximum-score-of-a-good-subarray)  |  [Maximum Score of a Good Subarray](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README_EN.md)  |  `Stack`,`Array`,`Two Pointers`,`Monotonic Stack`  |  Hard  |    |
|  [1794](https://leetcode.com/problems/count-pairs-of-equal-substrings-with-minimum-difference)  |  [Count Pairs of Equal Substrings With Minimum Difference](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README_EN.md)  |  `Greedy`,`Hash Table`,`String`  |  Medium  |  🔒  |
|  [1795](https://leetcode.com/problems/rearrange-products-table)  |  [Rearrange Products Table](/solution/1700-1799/1795.Rearrange%20Products%20Table/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1796](https://leetcode.com/problems/second-largest-digit-in-a-string)  |  [Second Largest Digit in a String](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [1797](https://leetcode.com/problems/design-authentication-manager)  |  [Design Authentication Manager](/solution/1700-1799/1797.Design%20Authentication%20Manager/README_EN.md)  |  `Design`,`Hash Table`  |  Medium  |    |
|  [1798](https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make)  |  [Maximum Number of Consecutive Values You Can Make](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [1799](https://leetcode.com/problems/maximize-score-after-n-operations)  |  [Maximize Score After N Operations](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README_EN.md)  |  `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask`,`Number Theory`  |  Hard  |    |
|  [1800](https://leetcode.com/problems/maximum-ascending-subarray-sum)  |  [Maximum Ascending Subarray Sum](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1801](https://leetcode.com/problems/number-of-orders-in-the-backlog)  |  [Number of Orders in the Backlog](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README_EN.md)  |  `Array`,`Simulation`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1802](https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array)  |  [Maximum Value at a Given Index in a Bounded Array](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README_EN.md)  |  `Greedy`,`Binary Search`  |  Medium  |    |
|  [1803](https://leetcode.com/problems/count-pairs-with-xor-in-a-range)  |  [Count Pairs With XOR in a Range](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README_EN.md)  |  `Bit Manipulation`,`Trie`,`Array`  |  Hard  |    |
|  [1804](https://leetcode.com/problems/implement-trie-ii-prefix-tree)  |  [Implement Trie II (Prefix Tree)](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README_EN.md)  |  `Design`,`Trie`,`Hash Table`,`String`  |  Medium  |  🔒  |
|  [1805](https://leetcode.com/problems/number-of-different-integers-in-a-string)  |  [Number of Different Integers in a String](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [1806](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation)  |  [Minimum Number of Operations to Reinitialize a Permutation](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README_EN.md)  |  `Array`,`Math`,`Simulation`  |  Medium  |    |
|  [1807](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string)  |  [Evaluate the Bracket Pairs of a String](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Medium  |    |
|  [1808](https://leetcode.com/problems/maximize-number-of-nice-divisors)  |  [Maximize Number of Nice Divisors](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README_EN.md)  |  `Recursion`,`Math`  |  Hard  |    |
|  [1809](https://leetcode.com/problems/ad-free-sessions)  |  [Ad-Free Sessions](/solution/1800-1899/1809.Ad-Free%20Sessions/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1810](https://leetcode.com/problems/minimum-path-cost-in-a-hidden-grid)  |  [Minimum Path Cost in a Hidden Grid](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Graph`,`Interactive`,`Heap (Priority Queue)`  |  Medium  |  🔒  |
|  [1811](https://leetcode.com/problems/find-interview-candidates)  |  [Find Interview Candidates](/solution/1800-1899/1811.Find%20Interview%20Candidates/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1812](https://leetcode.com/problems/determine-color-of-a-chessboard-square)  |  [Determine Color of a Chessboard Square](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README_EN.md)  |  `Math`,`String`  |  Easy  |    |
|  [1813](https://leetcode.com/problems/sentence-similarity-iii)  |  [Sentence Similarity III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README_EN.md)  |  `Array`,`Two Pointers`,`String`  |  Medium  |    |
|  [1814](https://leetcode.com/problems/count-nice-pairs-in-an-array)  |  [Count Nice Pairs in an Array](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README_EN.md)  |  `Array`,`Hash Table`,`Math`,`Counting`  |  Medium  |    |
|  [1815](https://leetcode.com/problems/maximum-number-of-groups-getting-fresh-donuts)  |  [Maximum Number of Groups Getting Fresh Donuts](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README_EN.md)  |  `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [1816](https://leetcode.com/problems/truncate-sentence)  |  [Truncate Sentence](/solution/1800-1899/1816.Truncate%20Sentence/README_EN.md)  |  `Array`,`String`  |  Easy  |    |
|  [1817](https://leetcode.com/problems/finding-the-users-active-minutes)  |  [Finding the Users Active Minutes](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [1818](https://leetcode.com/problems/minimum-absolute-sum-difference)  |  [Minimum Absolute Sum Difference](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README_EN.md)  |  `Greedy`,`Array`,`Binary Search`,`Ordered Set`  |  Medium  |    |
|  [1819](https://leetcode.com/problems/number-of-different-subsequences-gcds)  |  [Number of Different Subsequences GCDs](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README_EN.md)  |  `Array`,`Math`,`Counting`,`Number Theory`  |  Hard  |    |
|  [1820](https://leetcode.com/problems/maximum-number-of-accepted-invitations)  |  [Maximum Number of Accepted Invitations](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README_EN.md)  |  `Array`,`Backtracking`,`Matrix`  |  Medium  |  🔒  |
|  [1821](https://leetcode.com/problems/find-customers-with-positive-revenue-this-year)  |  [Find Customers With Positive Revenue this Year](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1822](https://leetcode.com/problems/sign-of-the-product-of-an-array)  |  [Sign of the Product of an Array](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README_EN.md)  |  `Array`,`Math`  |  Easy  |    |
|  [1823](https://leetcode.com/problems/find-the-winner-of-the-circular-game)  |  [Find the Winner of the Circular Game](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README_EN.md)  |  `Recursion`,`Array`,`Math`,`Simulation`  |  Medium  |    |
|  [1824](https://leetcode.com/problems/minimum-sideway-jumps)  |  [Minimum Sideway Jumps](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`  |  Medium  |    |
|  [1825](https://leetcode.com/problems/finding-mk-average)  |  [Finding MK Average](/solution/1800-1899/1825.Finding%20MK%20Average/README_EN.md)  |  `Design`,`Queue`,`Ordered Set`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1826](https://leetcode.com/problems/faulty-sensor)  |  [Faulty Sensor](/solution/1800-1899/1826.Faulty%20Sensor/README_EN.md)  |  `Array`,`Two Pointers`  |  Easy  |  🔒  |
|  [1827](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing)  |  [Minimum Operations to Make the Array Increasing](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README_EN.md)  |  `Greedy`,`Array`  |  Easy  |    |
|  [1828](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle)  |  [Queries on Number of Points Inside a Circle](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README_EN.md)  |  `Geometry`,`Array`,`Math`  |  Medium  |    |
|  [1829](https://leetcode.com/problems/maximum-xor-for-each-query)  |  [Maximum XOR for Each Query](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README_EN.md)  |  `Bit Manipulation`,`Array`,`Prefix Sum`  |  Medium  |    |
|  [1830](https://leetcode.com/problems/minimum-number-of-operations-to-make-string-sorted)  |  [Minimum Number of Operations to Make String Sorted](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README_EN.md)  |  `Math`,`String`,`Combinatorics`  |  Hard  |    |
|  [1831](https://leetcode.com/problems/maximum-transaction-each-day)  |  [Maximum Transaction Each Day](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1832](https://leetcode.com/problems/check-if-the-sentence-is-pangram)  |  [Check if the Sentence Is Pangram](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [1833](https://leetcode.com/problems/maximum-ice-cream-bars)  |  [Maximum Ice Cream Bars](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [1834](https://leetcode.com/problems/single-threaded-cpu)  |  [Single-Threaded CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README_EN.md)  |  `Array`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1835](https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and)  |  [Find XOR Sum of All Pairs Bitwise AND](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README_EN.md)  |  `Bit Manipulation`,`Array`,`Math`  |  Hard  |    |
|  [1836](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list)  |  [Remove Duplicates From an Unsorted Linked List](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README_EN.md)  |  `Hash Table`,`Linked List`  |  Medium  |  🔒  |
|  [1837](https://leetcode.com/problems/sum-of-digits-in-base-k)  |  [Sum of Digits in Base K](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README_EN.md)  |  `Math`  |  Easy  |    |
|  [1838](https://leetcode.com/problems/frequency-of-the-most-frequent-element)  |  [Frequency of the Most Frequent Element](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README_EN.md)  |  `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window`  |  Medium  |    |
|  [1839](https://leetcode.com/problems/longest-substring-of-all-vowels-in-order)  |  [Longest Substring Of All Vowels in Order](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README_EN.md)  |  `String`,`Sliding Window`  |  Medium  |    |
|  [1840](https://leetcode.com/problems/maximum-building-height)  |  [Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md)  |  `Array`,`Math`  |  Hard  |    |
|  [1841](https://leetcode.com/problems/league-statistics)  |  [League Statistics](/solution/1800-1899/1841.League%20Statistics/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1842](https://leetcode.com/problems/next-palindrome-using-same-digits)  |  [Next Palindrome Using Same Digits](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README_EN.md)  |  `Two Pointers`,`String`  |  Hard  |  🔒  |
|  [1843](https://leetcode.com/problems/suspicious-bank-accounts)  |  [Suspicious Bank Accounts](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1844](https://leetcode.com/problems/replace-all-digits-with-characters)  |  [Replace All Digits with Characters](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README_EN.md)  |  `String`  |  Easy  |    |
|  [1845](https://leetcode.com/problems/seat-reservation-manager)  |  [Seat Reservation Manager](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README_EN.md)  |  `Design`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1846](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging)  |  [Maximum Element After Decreasing and Rearranging](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [1847](https://leetcode.com/problems/closest-room)  |  [Closest Room](/solution/1800-1899/1847.Closest%20Room/README_EN.md)  |  `Array`,`Binary Search`,`Sorting`  |  Hard  |    |
|  [1848](https://leetcode.com/problems/minimum-distance-to-the-target-element)  |  [Minimum Distance to the Target Element](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1849](https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values)  |  [Splitting a String Into Descending Consecutive Values](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README_EN.md)  |  `String`,`Backtracking`  |  Medium  |    |
|  [1850](https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number)  |  [Minimum Adjacent Swaps to Reach the Kth Smallest Number](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README_EN.md)  |  `Greedy`,`Two Pointers`,`String`  |  Medium  |    |
|  [1851](https://leetcode.com/problems/minimum-interval-to-include-each-query)  |  [Minimum Interval to Include Each Query](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README_EN.md)  |  `Array`,`Binary Search`,`Sorting`,`Line Sweep`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1852](https://leetcode.com/problems/distinct-numbers-in-each-subarray)  |  [Distinct Numbers in Each Subarray](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README_EN.md)  |  `Array`,`Hash Table`,`Sliding Window`  |  Medium  |  🔒  |
|  [1853](https://leetcode.com/problems/convert-date-format)  |  [Convert Date Format](/solution/1800-1899/1853.Convert%20Date%20Format/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1854](https://leetcode.com/problems/maximum-population-year)  |  [Maximum Population Year](/solution/1800-1899/1854.Maximum%20Population%20Year/README_EN.md)  |  `Array`,`Counting`  |  Easy  |    |
|  [1855](https://leetcode.com/problems/maximum-distance-between-a-pair-of-values)  |  [Maximum Distance Between a Pair of Values](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`,`Binary Search`  |  Medium  |    |
|  [1856](https://leetcode.com/problems/maximum-subarray-min-product)  |  [Maximum Subarray Min-Product](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README_EN.md)  |  `Stack`,`Array`,`Prefix Sum`,`Monotonic Stack`  |  Medium  |    |
|  [1857](https://leetcode.com/problems/largest-color-value-in-a-directed-graph)  |  [Largest Color Value in a Directed Graph](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README_EN.md)  |  `Graph`,`Topological Sort`,`Memoization`,`Hash Table`,`Dynamic Programming`,`Counting`  |  Hard  |    |
|  [1858](https://leetcode.com/problems/longest-word-with-all-prefixes)  |  [Longest Word With All Prefixes](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README_EN.md)  |  `Depth-First Search`,`Trie`  |  Medium  |  🔒  |
|  [1859](https://leetcode.com/problems/sorting-the-sentence)  |  [Sorting the Sentence](/solution/1800-1899/1859.Sorting%20the%20Sentence/README_EN.md)  |  `String`,`Sorting`  |  Easy  |    |
|  [1860](https://leetcode.com/problems/incremental-memory-leak)  |  [Incremental Memory Leak](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README_EN.md)  |  `Simulation`  |  Medium  |    |
|  [1861](https://leetcode.com/problems/rotating-the-box)  |  [Rotating the Box](/solution/1800-1899/1861.Rotating%20the%20Box/README_EN.md)  |  `Array`,`Two Pointers`,`Matrix`  |  Medium  |    |
|  [1862](https://leetcode.com/problems/sum-of-floored-pairs)  |  [Sum of Floored Pairs](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README_EN.md)  |  `Array`,`Math`,`Binary Search`,`Prefix Sum`  |  Hard  |    |
|  [1863](https://leetcode.com/problems/sum-of-all-subset-xor-totals)  |  [Sum of All Subset XOR Totals](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README_EN.md)  |  `Bit Manipulation`,`Array`,`Backtracking`  |  Easy  |    |
|  [1864](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating)  |  [Minimum Number of Swaps to Make the Binary String Alternating](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md)  |  `Greedy`,`String`  |  Medium  |    |
|  [1865](https://leetcode.com/problems/finding-pairs-with-a-certain-sum)  |  [Finding Pairs With a Certain Sum](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README_EN.md)  |  `Design`,`Array`,`Hash Table`  |  Medium  |    |
|  [1866](https://leetcode.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible)  |  [Number of Ways to Rearrange Sticks With K Sticks Visible](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README_EN.md)  |  `Math`,`Dynamic Programming`,`Combinatorics`  |  Hard  |    |
|  [1867](https://leetcode.com/problems/orders-with-maximum-quantity-above-average)  |  [Orders With Maximum Quantity Above Average](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1868](https://leetcode.com/problems/product-of-two-run-length-encoded-arrays)  |  [Product of Two Run-Length Encoded Arrays](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README_EN.md)  |  `Array`,`Two Pointers`  |  Medium  |  🔒  |
|  [1869](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros)  |  [Longer Contiguous Segments of Ones than Zeros](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README_EN.md)  |  `String`  |  Easy  |    |
|  [1870](https://leetcode.com/problems/minimum-speed-to-arrive-on-time)  |  [Minimum Speed to Arrive on Time](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |    |
|  [1871](https://leetcode.com/problems/jump-game-vii)  |  [Jump Game VII](/solution/1800-1899/1871.Jump%20Game%20VII/README_EN.md)  |  `Two Pointers`,`String`,`Prefix Sum`  |  Medium  |    |
|  [1872](https://leetcode.com/problems/stone-game-viii)  |  [Stone Game VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README_EN.md)  |  `Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Prefix Sum`  |  Hard  |    |
|  [1873](https://leetcode.com/problems/calculate-special-bonus)  |  [Calculate Special Bonus](/solution/1800-1899/1873.Calculate%20Special%20Bonus/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1874](https://leetcode.com/problems/minimize-product-sum-of-two-arrays)  |  [Minimize Product Sum of Two Arrays](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |  🔒  |
|  [1875](https://leetcode.com/problems/group-employees-of-the-same-salary)  |  [Group Employees of the Same Salary](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1876](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters)  |  [Substrings of Size Three with Distinct Characters](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README_EN.md)  |  `Hash Table`,`String`,`Counting`,`Sliding Window`  |  Easy  |    |
|  [1877](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array)  |  [Minimize Maximum Pair Sum in Array](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README_EN.md)  |  `Greedy`,`Array`,`Two Pointers`,`Sorting`  |  Medium  |    |
|  [1878](https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid)  |  [Get Biggest Three Rhombus Sums in a Grid](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README_EN.md)  |  `Array`,`Math`,`Matrix`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1879](https://leetcode.com/problems/minimum-xor-sum-of-two-arrays)  |  [Minimum XOR Sum of Two Arrays](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`  |  Hard  |    |
|  [1880](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words)  |  [Check if Word Equals Summation of Two Words](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README_EN.md)  |  `String`  |  Easy  |    |
|  [1881](https://leetcode.com/problems/maximum-value-after-insertion)  |  [Maximum Value after Insertion](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README_EN.md)  |  `Greedy`,`String`  |  Medium  |    |
|  [1882](https://leetcode.com/problems/process-tasks-using-servers)  |  [Process Tasks Using Servers](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README_EN.md)  |  `Array`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1883](https://leetcode.com/problems/minimum-skips-to-arrive-at-meeting-on-time)  |  [Minimum Skips to Arrive at Meeting On Time](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [1884](https://leetcode.com/problems/egg-drop-with-2-eggs-and-n-floors)  |  [Egg Drop With 2 Eggs and N Floors](/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Medium  |    |
|  [1885](https://leetcode.com/problems/count-pairs-in-two-arrays)  |  [Count Pairs in Two Arrays](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README_EN.md)  |  `Array`,`Binary Search`,`Sorting`  |  Medium  |  🔒  |
|  [1886](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation)  |  [Determine Whether Matrix Can Be Obtained By Rotation](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README_EN.md)  |  `Array`,`Matrix`  |  Easy  |    |
|  [1887](https://leetcode.com/problems/reduction-operations-to-make-the-array-elements-equal)  |  [Reduction Operations to Make the Array Elements Equal](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README_EN.md)  |  `Array`,`Sorting`  |  Medium  |    |
|  [1888](https://leetcode.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating)  |  [Minimum Number of Flips to Make the Binary String Alternating](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md)  |  `Greedy`,`String`  |  Medium  |    |
|  [1889](https://leetcode.com/problems/minimum-space-wasted-from-packaging)  |  [Minimum Space Wasted From Packaging](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README_EN.md)  |  `Array`,`Binary Search`,`Prefix Sum`,`Sorting`  |  Hard  |    |
|  [1890](https://leetcode.com/problems/the-latest-login-in-2020)  |  [The Latest Login in 2020](/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README_EN.md)  |  `Database`  |  Easy  |  🔒  |
|  [1891](https://leetcode.com/problems/cutting-ribbons)  |  [Cutting Ribbons](/solution/1800-1899/1891.Cutting%20Ribbons/README_EN.md)  |  `Array`,`Binary Search`  |  Medium  |  🔒  |
|  [1892](https://leetcode.com/problems/page-recommendations-ii)  |  [Page Recommendations II](/solution/1800-1899/1892.Page%20Recommendations%20II/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1893](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered)  |  [Check if All the Integers in a Range Are Covered](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README_EN.md)  |  `Array`,`Hash Table`,`Prefix Sum`  |  Easy  |    |
|  [1894](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk)  |  [Find the Student that Will Replace the Chalk](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README_EN.md)  |  `Array`,`Binary Search`,`Prefix Sum`,`Simulation`  |  Medium  |    |
|  [1895](https://leetcode.com/problems/largest-magic-square)  |  [Largest Magic Square](/solution/1800-1899/1895.Largest%20Magic%20Square/README_EN.md)  |  `Array`,`Matrix`,`Prefix Sum`  |  Medium  |    |
|  [1896](https://leetcode.com/problems/minimum-cost-to-change-the-final-value-of-expression)  |  [Minimum Cost to Change the Final Value of Expression](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README_EN.md)  |  `Stack`,`Math`,`String`,`Dynamic Programming`  |  Hard  |    |
|  [1897](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal)  |  [Redistribute Characters to Make All Strings Equal](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README_EN.md)  |  `Hash Table`,`String`,`Counting`  |  Easy  |    |
|  [1898](https://leetcode.com/problems/maximum-number-of-removable-characters)  |  [Maximum Number of Removable Characters](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README_EN.md)  |  `Array`,`String`,`Binary Search`  |  Medium  |    |
|  [1899](https://leetcode.com/problems/merge-triplets-to-form-target-triplet)  |  [Merge Triplets to Form Target Triplet](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [1900](https://leetcode.com/problems/the-earliest-and-latest-rounds-where-players-compete)  |  [The Earliest and Latest Rounds Where Players Compete](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README_EN.md)  |  `Memoization`,`Dynamic Programming`  |  Hard  |    |
|  [1901](https://leetcode.com/problems/find-a-peak-element-ii)  |  [Find a Peak Element II](/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README_EN.md)  |  `Array`,`Binary Search`,`Divide and Conquer`,`Matrix`  |  Medium  |    |
|  [1902](https://leetcode.com/problems/depth-of-bst-given-insertion-order)  |  [Depth of BST Given Insertion Order](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README_EN.md)  |  `Tree`,`Binary Search Tree`,`Binary Tree`,`Ordered Set`  |  Medium  |  🔒  |
|  [1903](https://leetcode.com/problems/largest-odd-number-in-string)  |  [Largest Odd Number in String](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README_EN.md)  |  `Greedy`,`Math`,`String`  |  Easy  |    |
|  [1904](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played)  |  [The Number of Full Rounds You Have Played](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README_EN.md)  |  `Math`,`String`  |  Medium  |    |
|  [1905](https://leetcode.com/problems/count-sub-islands)  |  [Count Sub Islands](/solution/1900-1999/1905.Count%20Sub%20Islands/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix`  |  Medium  |    |
|  [1906](https://leetcode.com/problems/minimum-absolute-difference-queries)  |  [Minimum Absolute Difference Queries](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README_EN.md)  |  `Array`,`Hash Table`  |  Medium  |    |
|  [1907](https://leetcode.com/problems/count-salary-categories)  |  [Count Salary Categories](/solution/1900-1999/1907.Count%20Salary%20Categories/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
|  [1908](https://leetcode.com/problems/game-of-nim)  |  [Game of Nim](/solution/1900-1999/1908.Game%20of%20Nim/README_EN.md)  |  `Bit Manipulation`,`Brainteaser`,`Array`,`Math`,`Dynamic Programming`,`Game Theory`  |  Medium  |  🔒  |
|  [1909](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing)  |  [Remove One Element to Make the Array Strictly Increasing](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1910](https://leetcode.com/problems/remove-all-occurrences-of-a-substring)  |  [Remove All Occurrences of a Substring](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README_EN.md)  |  `String`  |  Medium  |    |
|  [1911](https://leetcode.com/problems/maximum-alternating-subsequence-sum)  |  [Maximum Alternating Subsequence Sum](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1912](https://leetcode.com/problems/design-movie-rental-system)  |  [Design Movie Rental System](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README_EN.md)  |  `Design`,`Array`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)`  |  Hard  |    |
|  [1913](https://leetcode.com/problems/maximum-product-difference-between-two-pairs)  |  [Maximum Product Difference Between Two Pairs](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README_EN.md)  |  `Array`,`Sorting`  |  Easy  |    |
|  [1914](https://leetcode.com/problems/cyclically-rotating-a-grid)  |  [Cyclically Rotating a Grid](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README_EN.md)  |  `Array`,`Matrix`,`Simulation`  |  Medium  |    |
|  [1915](https://leetcode.com/problems/number-of-wonderful-substrings)  |  [Number of Wonderful Substrings](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README_EN.md)  |  `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum`  |  Medium  |    |
|  [1916](https://leetcode.com/problems/count-ways-to-build-rooms-in-an-ant-colony)  |  [Count Ways to Build Rooms in an Ant Colony](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README_EN.md)  |  `Tree`,`Graph`,`Topological Sort`,`Math`,`Dynamic Programming`,`Combinatorics`  |  Hard  |    |
|  [1917](https://leetcode.com/problems/leetcodify-friends-recommendations)  |  [Leetcodify Friends Recommendations](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README_EN.md)  |  `Database`  |  Hard  |  🔒  |
|  [1918](https://leetcode.com/problems/kth-smallest-subarray-sum)  |  [Kth Smallest Subarray Sum](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README_EN.md)  |  `Array`,`Binary Search`,`Sliding Window`  |  Medium  |  🔒  |
|  [1919](https://leetcode.com/problems/leetcodify-similar-friends)  |  [Leetcodify Similar Friends](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README_EN.md)  |    |  Hard  |  🔒  |
|  [1920](https://leetcode.com/problems/build-array-from-permutation)  |  [Build Array from Permutation](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README_EN.md)  |  `Array`,`Simulation`  |  Easy  |    |
|  [1921](https://leetcode.com/problems/eliminate-maximum-number-of-monsters)  |  [Eliminate Maximum Number of Monsters](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [1922](https://leetcode.com/problems/count-good-numbers)  |  [Count Good Numbers](/solution/1900-1999/1922.Count%20Good%20Numbers/README_EN.md)  |  `Recursion`,`Math`  |  Medium  |    |
|  [1923](https://leetcode.com/problems/longest-common-subpath)  |  [Longest Common Subpath](/solution/1900-1999/1923.Longest%20Common%20Subpath/README_EN.md)  |  `Array`,`Binary Search`,`Suffix Array`,`Hash Function`,`Rolling Hash`  |  Hard  |    |
|  [1924](https://leetcode.com/problems/erect-the-fence-ii)  |  [Erect the Fence II](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README_EN.md)  |    |  Hard  |  🔒  |
|  [1925](https://leetcode.com/problems/count-square-sum-triples)  |  [Count Square Sum Triples](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README_EN.md)  |  `Math`,`Enumeration`  |  Easy  |    |
|  [1926](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze)  |  [Nearest Exit from Entrance in Maze](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README_EN.md)  |  `Breadth-First Search`,`Array`,`Matrix`  |  Medium  |    |
|  [1927](https://leetcode.com/problems/sum-game)  |  [Sum Game](/solution/1900-1999/1927.Sum%20Game/README_EN.md)  |  `Greedy`,`Math`,`Game Theory`  |  Medium  |    |
|  [1928](https://leetcode.com/problems/minimum-cost-to-reach-destination-in-time)  |  [Minimum Cost to Reach Destination in Time](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README_EN.md)  |  `Graph`,`Dynamic Programming`  |  Hard  |    |
|  [1929](https://leetcode.com/problems/concatenation-of-array)  |  [Concatenation of Array](/solution/1900-1999/1929.Concatenation%20of%20Array/README_EN.md)  |  `Array`  |  Easy  |    |
|  [1930](https://leetcode.com/problems/unique-length-3-palindromic-subsequences)  |  [Unique Length-3 Palindromic Subsequences](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README_EN.md)  |  `Hash Table`,`String`,`Prefix Sum`  |  Medium  |    |
|  [1931](https://leetcode.com/problems/painting-a-grid-with-three-different-colors)  |  [Painting a Grid With Three Different Colors](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README_EN.md)  |  `Dynamic Programming`  |  Hard  |    |
|  [1932](https://leetcode.com/problems/merge-bsts-to-create-single-bst)  |  [Merge BSTs to Create Single BST](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README_EN.md)  |  `Tree`,`Depth-First Search`,`Hash Table`,`Binary Search`,`Binary Tree`  |  Hard  |    |
|  [1933](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings)  |  [Check if String Is Decomposable Into Value-Equal Substrings](/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README_EN.md)  |    |  Easy  |  🔒  |
|  [1934](https://leetcode.com/problems/confirmation-rate)  |  [Confirmation Rate](/solution/1900-1999/1934.Confirmation%20Rate/README_EN.md)  |    |  Medium  |  🔒  |
|  [1935](https://leetcode.com/problems/maximum-number-of-words-you-can-type)  |  [Maximum Number of Words You Can Type](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README_EN.md)  |  `Hash Table`,`String`  |  Easy  |    |
|  [1936](https://leetcode.com/problems/add-minimum-number-of-rungs)  |  [Add Minimum Number of Rungs](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README_EN.md)  |    |  Medium  |    |
|  [1937](https://leetcode.com/problems/maximum-number-of-points-with-cost)  |  [Maximum Number of Points with Cost](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README_EN.md)  |    |  Medium  |    |
|  [1938](https://leetcode.com/problems/maximum-genetic-difference-query)  |  [Maximum Genetic Difference Query](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README_EN.md)  |    |  Hard  |    |
|  [1939](https://leetcode.com/problems/users-that-actively-request-confirmation-messages)  |  [Users That Actively Request Confirmation Messages](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README_EN.md)  |    |  Easy  |  🔒  |
|  [1940](https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays)  |  [Longest Common Subsequence Between Sorted Arrays](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README_EN.md)  |    |  Medium  |  🔒  |
|  [1941](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences)  |  [Check if All Characters Have Equal Number of Occurrences](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README_EN.md)  |  `Hash Table`,`String`,`Counting`  |  Easy  |    |
|  [1942](https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair)  |  [The Number of the Smallest Unoccupied Chair](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README_EN.md)  |  `Array`,`Ordered Set`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1943](https://leetcode.com/problems/describe-the-painting)  |  [Describe the Painting](/solution/1900-1999/1943.Describe%20the%20Painting/README_EN.md)  |  `Array`,`Prefix Sum`  |  Medium  |    |
|  [1944](https://leetcode.com/problems/number-of-visible-people-in-a-queue)  |  [Number of Visible People in a Queue](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README_EN.md)  |  `Stack`,`Array`,`Monotonic Stack`  |  Hard  |    |
|  [1945](https://leetcode.com/problems/sum-of-digits-of-string-after-convert)  |  [Sum of Digits of String After Convert](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README_EN.md)  |  `String`,`Simulation`  |  Easy  |    |
|  [1946](https://leetcode.com/problems/largest-number-after-mutating-substring)  |  [Largest Number After Mutating Substring](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README_EN.md)  |  `Greedy`,`Array`,`String`  |  Medium  |    |
|  [1947](https://leetcode.com/problems/maximum-compatibility-score-sum)  |  [Maximum Compatibility Score Sum](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask`  |  Medium  |    |
|  [1948](https://leetcode.com/problems/delete-duplicate-folders-in-system)  |  [Delete Duplicate Folders in System](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README_EN.md)  |  `Trie`,`Array`,`Hash Table`,`String`,`Hash Function`  |  Hard  |    |
|  [1949](https://leetcode.com/problems/strong-friendship)  |  [Strong Friendship](/solution/1900-1999/1949.Strong%20Friendship/README_EN.md)  |    |  Medium  |  🔒  |
|  [1950](https://leetcode.com/problems/maximum-of-minimum-values-in-all-subarrays)  |  [Maximum of Minimum Values in All Subarrays](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README_EN.md)  |    |  Medium  |  🔒  |
|  [1951](https://leetcode.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers)  |  [All the Pairs With the Maximum Number of Common Followers](/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README_EN.md)  |    |  Medium  |  🔒  |
|  [1952](https://leetcode.com/problems/three-divisors)  |  [Three Divisors](/solution/1900-1999/1952.Three%20Divisors/README_EN.md)  |  `Math`  |  Easy  |    |
|  [1953](https://leetcode.com/problems/maximum-number-of-weeks-for-which-you-can-work)  |  [Maximum Number of Weeks for Which You Can Work](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |    |
|  [1954](https://leetcode.com/problems/minimum-garden-perimeter-to-collect-enough-apples)  |  [Minimum Garden Perimeter to Collect Enough Apples](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README_EN.md)  |  `Math`,`Binary Search`  |  Medium  |    |
|  [1955](https://leetcode.com/problems/count-number-of-special-subsequences)  |  [Count Number of Special Subsequences](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |    |
|  [1956](https://leetcode.com/problems/minimum-time-for-k-virus-variants-to-spread)  |  [Minimum Time For K Virus Variants to Spread](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README_EN.md)  |    |  Hard  |  🔒  |
|  [1957](https://leetcode.com/problems/delete-characters-to-make-fancy-string)  |  [Delete Characters to Make Fancy String](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README_EN.md)  |  `String`  |  Easy  |    |
|  [1958](https://leetcode.com/problems/check-if-move-is-legal)  |  [Check if Move is Legal](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README_EN.md)  |  `Array`,`Enumeration`,`Matrix`  |  Medium  |    |
|  [1959](https://leetcode.com/problems/minimum-total-space-wasted-with-k-resizing-operations)  |  [Minimum Total Space Wasted With K Resizing Operations](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Medium  |    |
|  [1960](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings)  |  [Maximum Product of the Length of Two Palindromic Substrings](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README_EN.md)  |  `String`,`Hash Function`,`Rolling Hash`  |  Hard  |    |
|  [1961](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array)  |  [Check If String Is a Prefix of Array](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README_EN.md)  |  `Array`,`String`  |  Easy  |    |
|  [1962](https://leetcode.com/problems/remove-stones-to-minimize-the-total)  |  [Remove Stones to Minimize the Total](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README_EN.md)  |  `Array`,`Heap (Priority Queue)`  |  Medium  |    |
|  [1963](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced)  |  [Minimum Number of Swaps to Make the String Balanced](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README_EN.md)  |  `Stack`,`Greedy`,`Two Pointers`,`String`  |  Medium  |    |
|  [1964](https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position)  |  [Find the Longest Valid Obstacle Course at Each Position](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README_EN.md)  |  `Binary Indexed Tree`,`Array`,`Binary Search`  |  Hard  |    |
|  [1965](https://leetcode.com/problems/employees-with-missing-information)  |  [Employees With Missing Information](/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README_EN.md)  |    |  Easy  |  🔒  |
|  [1966](https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array)  |  [Binary Searchable Numbers in an Unsorted Array](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README_EN.md)  |    |  Medium  |  🔒  |
|  [1967](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word)  |  [Number of Strings That Appear as Substrings in Word](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README_EN.md)  |  `String`  |  Easy  |    |
|  [1968](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors)  |  [Array With Elements Not Equal to Average of Neighbors](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README_EN.md)  |  `Greedy`,`Array`,`Sorting`  |  Medium  |    |
|  [1969](https://leetcode.com/problems/minimum-non-zero-product-of-the-array-elements)  |  [Minimum Non-Zero Product of the Array Elements](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README_EN.md)  |  `Greedy`,`Recursion`,`Math`  |  Medium  |    |
|  [1970](https://leetcode.com/problems/last-day-where-you-can-still-cross)  |  [Last Day Where You Can Still Cross](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`  |  Hard  |    |
|  [1971](https://leetcode.com/problems/find-if-path-exists-in-graph)  |  [Find if Path Exists in Graph](/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README_EN.md)  |    |  Easy  |    |
|  [1972](https://leetcode.com/problems/first-and-last-call-on-the-same-day)  |  [First and Last Call On the Same Day](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README_EN.md)  |    |  Hard  |  🔒  |

## Copyright

[@Doocs](https://github.com/doocs)