mirror of https://github.com/doocs/leetcode.git
3643 lines
695 KiB
Markdown
3643 lines
695 KiB
Markdown
# 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 | [Two Sum](/solution/0000-0099/0001.Two%20Sum/README_EN.md) | `Array`,`Hash Table` | Easy | |
|
||
| 0002 | [Add Two Numbers](/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md) | `Recursion`,`Linked List`,`Math` | Medium | |
|
||
| 0003 | [Longest Substring Without Repeating Characters](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | |
|
||
| 0004 | [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 | [Longest Palindromic Substring](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Medium | |
|
||
| 0006 | [Zigzag Conversion](/solution/0000-0099/0006.Zigzag%20Conversion/README_EN.md) | `String` | Medium | |
|
||
| 0007 | [Reverse Integer](/solution/0000-0099/0007.Reverse%20Integer/README_EN.md) | `Math` | Medium | |
|
||
| 0008 | [String to Integer (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README_EN.md) | `String` | Medium | |
|
||
| 0009 | [Palindrome Number](/solution/0000-0099/0009.Palindrome%20Number/README_EN.md) | `Math` | Easy | |
|
||
| 0010 | [Regular Expression Matching](/solution/0000-0099/0010.Regular%20Expression%20Matching/README_EN.md) | `Recursion`,`String`,`Dynamic Programming` | Hard | |
|
||
| 0011 | [Container With Most Water](/solution/0000-0099/0011.Container%20With%20Most%20Water/README_EN.md) | `Greedy`,`Array`,`Two Pointers` | Medium | |
|
||
| 0012 | [Integer to Roman](/solution/0000-0099/0012.Integer%20to%20Roman/README_EN.md) | `Hash Table`,`Math`,`String` | Medium | |
|
||
| 0013 | [Roman to Integer](/solution/0000-0099/0013.Roman%20to%20Integer/README_EN.md) | `Hash Table`,`Math`,`String` | Easy | |
|
||
| 0014 | [Longest Common Prefix](/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md) | `Trie`,`Array`,`String` | Easy | |
|
||
| 0015 | [3Sum](/solution/0000-0099/0015.3Sum/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | |
|
||
| 0016 | [3Sum Closest](/solution/0000-0099/0016.3Sum%20Closest/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | |
|
||
| 0017 | [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 | [4Sum](/solution/0000-0099/0018.4Sum/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | |
|
||
| 0019 | [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 | [Valid Parentheses](/solution/0000-0099/0020.Valid%20Parentheses/README_EN.md) | `Stack`,`String` | Easy | |
|
||
| 0021 | [Merge Two Sorted Lists](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README_EN.md) | `Recursion`,`Linked List` | Easy | |
|
||
| 0022 | [Generate Parentheses](/solution/0000-0099/0022.Generate%20Parentheses/README_EN.md) | `String`,`Dynamic Programming`,`Backtracking` | Medium | |
|
||
| 0023 | [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 | [Swap Nodes in Pairs](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README_EN.md) | `Recursion`,`Linked List` | Medium | |
|
||
| 0025 | [Reverse Nodes in k-Group](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README_EN.md) | `Recursion`,`Linked List` | Hard | |
|
||
| 0026 | [Remove Duplicates from Sorted Array](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md) | `Array`,`Two Pointers` | Easy | |
|
||
| 0027 | [Remove Element](/solution/0000-0099/0027.Remove%20Element/README_EN.md) | `Array`,`Two Pointers` | Easy | |
|
||
| 0028 | [Find the Index of the First Occurrence in a String](/solution/0000-0099/0028.Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String/README_EN.md) | `Two Pointers`,`String`,`String Matching` | Easy | |
|
||
| 0029 | [Divide Two Integers](/solution/0000-0099/0029.Divide%20Two%20Integers/README_EN.md) | `Bit Manipulation`,`Math` | Medium | |
|
||
| 0030 | [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 | [Next Permutation](/solution/0000-0099/0031.Next%20Permutation/README_EN.md) | `Array`,`Two Pointers` | Medium | |
|
||
| 0032 | [Longest Valid Parentheses](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README_EN.md) | `Stack`,`String`,`Dynamic Programming` | Hard | |
|
||
| 0033 | [Search in Rotated Sorted Array](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | |
|
||
| 0034 | [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 | [Search Insert Position](/solution/0000-0099/0035.Search%20Insert%20Position/README_EN.md) | `Array`,`Binary Search` | Easy | |
|
||
| 0036 | [Valid Sudoku](/solution/0000-0099/0036.Valid%20Sudoku/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | |
|
||
| 0037 | [Sudoku Solver](/solution/0000-0099/0037.Sudoku%20Solver/README_EN.md) | `Array`,`Hash Table`,`Backtracking`,`Matrix` | Hard | |
|
||
| 0038 | [Count and Say](/solution/0000-0099/0038.Count%20and%20Say/README_EN.md) | `String` | Medium | |
|
||
| 0039 | [Combination Sum](/solution/0000-0099/0039.Combination%20Sum/README_EN.md) | `Array`,`Backtracking` | Medium | |
|
||
| 0040 | [Combination Sum II](/solution/0000-0099/0040.Combination%20Sum%20II/README_EN.md) | `Array`,`Backtracking` | Medium | |
|
||
| 0041 | [First Missing Positive](/solution/0000-0099/0041.First%20Missing%20Positive/README_EN.md) | `Array`,`Hash Table` | Hard | |
|
||
| 0042 | [Trapping Rain Water](/solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md) | `Stack`,`Array`,`Two Pointers`,`Dynamic Programming`,`Monotonic Stack` | Hard | |
|
||
| 0043 | [Multiply Strings](/solution/0000-0099/0043.Multiply%20Strings/README_EN.md) | `Math`,`String`,`Simulation` | Medium | |
|
||
| 0044 | [Wildcard Matching](/solution/0000-0099/0044.Wildcard%20Matching/README_EN.md) | `Greedy`,`Recursion`,`String`,`Dynamic Programming` | Hard | |
|
||
| 0045 | [Jump Game II](/solution/0000-0099/0045.Jump%20Game%20II/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | |
|
||
| 0046 | [Permutations](/solution/0000-0099/0046.Permutations/README_EN.md) | `Array`,`Backtracking` | Medium | |
|
||
| 0047 | [Permutations II](/solution/0000-0099/0047.Permutations%20II/README_EN.md) | `Array`,`Backtracking`,`Sorting` | Medium | |
|
||
| 0048 | [Rotate Image](/solution/0000-0099/0048.Rotate%20Image/README_EN.md) | `Array`,`Math`,`Matrix` | Medium | |
|
||
| 0049 | [Group Anagrams](/solution/0000-0099/0049.Group%20Anagrams/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | |
|
||
| 0050 | [Pow(x, n)](/solution/0000-0099/0050.Pow%28x%2C%20n%29/README_EN.md) | `Recursion`,`Math` | Medium | |
|
||
| 0051 | [N-Queens](/solution/0000-0099/0051.N-Queens/README_EN.md) | `Array`,`Backtracking` | Hard | |
|
||
| 0052 | [N-Queens II](/solution/0000-0099/0052.N-Queens%20II/README_EN.md) | `Backtracking` | Hard | |
|
||
| 0053 | [Maximum Subarray](/solution/0000-0099/0053.Maximum%20Subarray/README_EN.md) | `Array`,`Divide and Conquer`,`Dynamic Programming` | Medium | |
|
||
| 0054 | [Spiral Matrix](/solution/0000-0099/0054.Spiral%20Matrix/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | |
|
||
| 0055 | [Jump Game](/solution/0000-0099/0055.Jump%20Game/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | |
|
||
| 0056 | [Merge Intervals](/solution/0000-0099/0056.Merge%20Intervals/README_EN.md) | `Array`,`Sorting` | Medium | |
|
||
| 0057 | [Insert Interval](/solution/0000-0099/0057.Insert%20Interval/README_EN.md) | `Array` | Medium | |
|
||
| 0058 | [Length of Last Word](/solution/0000-0099/0058.Length%20of%20Last%20Word/README_EN.md) | `String` | Easy | |
|
||
| 0059 | [Spiral Matrix II](/solution/0000-0099/0059.Spiral%20Matrix%20II/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | |
|
||
| 0060 | [Permutation Sequence](/solution/0000-0099/0060.Permutation%20Sequence/README_EN.md) | `Recursion`,`Math` | Hard | |
|
||
| 0061 | [Rotate List](/solution/0000-0099/0061.Rotate%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | |
|
||
| 0062 | [Unique Paths](/solution/0000-0099/0062.Unique%20Paths/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | |
|
||
| 0063 | [Unique Paths II](/solution/0000-0099/0063.Unique%20Paths%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | |
|
||
| 0064 | [Minimum Path Sum](/solution/0000-0099/0064.Minimum%20Path%20Sum/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | |
|
||
| 0065 | [Valid Number](/solution/0000-0099/0065.Valid%20Number/README_EN.md) | `String` | Hard | |
|
||
| 0066 | [Plus One](/solution/0000-0099/0066.Plus%20One/README_EN.md) | `Array`,`Math` | Easy | |
|
||
| 0067 | [Add Binary](/solution/0000-0099/0067.Add%20Binary/README_EN.md) | `Bit Manipulation`,`Math`,`String`,`Simulation` | Easy | |
|
||
| 0068 | [Text Justification](/solution/0000-0099/0068.Text%20Justification/README_EN.md) | `Array`,`String`,`Simulation` | Hard | |
|
||
| 0069 | [Sqrt(x)](/solution/0000-0099/0069.Sqrt%28x%29/README_EN.md) | `Math`,`Binary Search` | Easy | |
|
||
| 0070 | [Climbing Stairs](/solution/0000-0099/0070.Climbing%20Stairs/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Easy | |
|
||
| 0071 | [Simplify Path](/solution/0000-0099/0071.Simplify%20Path/README_EN.md) | `Stack`,`String` | Medium | |
|
||
| 0072 | [Edit Distance](/solution/0000-0099/0072.Edit%20Distance/README_EN.md) | `String`,`Dynamic Programming` | Medium | |
|
||
| 0073 | [Set Matrix Zeroes](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | |
|
||
| 0074 | [Search a 2D Matrix](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | |
|
||
| 0075 | [Sort Colors](/solution/0000-0099/0075.Sort%20Colors/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | |
|
||
| 0076 | [Minimum Window Substring](/solution/0000-0099/0076.Minimum%20Window%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | |
|
||
| 0077 | [Combinations](/solution/0000-0099/0077.Combinations/README_EN.md) | `Backtracking` | Medium | |
|
||
| 0078 | [Subsets](/solution/0000-0099/0078.Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking` | Medium | |
|
||
| 0079 | [Word Search](/solution/0000-0099/0079.Word%20Search/README_EN.md) | `Depth-First Search`,`Array`,`String`,`Backtracking`,`Matrix` | Medium | |
|
||
| 0080 | [Remove Duplicates from Sorted Array II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md) | `Array`,`Two Pointers` | Medium | |
|
||
| 0081 | [Search in Rotated Sorted Array II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README_EN.md) | `Array`,`Binary Search` | Medium | |
|
||
| 0082 | [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 | [Remove Duplicates from Sorted List](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README_EN.md) | `Linked List` | Easy | |
|
||
| 0084 | [Largest Rectangle in Histogram](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Hard | |
|
||
| 0085 | [Maximal Rectangle](/solution/0000-0099/0085.Maximal%20Rectangle/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack` | Hard | |
|
||
| 0086 | [Partition List](/solution/0000-0099/0086.Partition%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | |
|
||
| 0087 | [Scramble String](/solution/0000-0099/0087.Scramble%20String/README_EN.md) | `String`,`Dynamic Programming` | Hard | |
|
||
| 0088 | [Merge Sorted Array](/solution/0000-0099/0088.Merge%20Sorted%20Array/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | |
|
||
| 0089 | [Gray Code](/solution/0000-0099/0089.Gray%20Code/README_EN.md) | `Bit Manipulation`,`Math`,`Backtracking` | Medium | |
|
||
| 0090 | [Subsets II](/solution/0000-0099/0090.Subsets%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking` | Medium | |
|
||
| 0091 | [Decode Ways](/solution/0000-0099/0091.Decode%20Ways/README_EN.md) | `String`,`Dynamic Programming` | Medium | |
|
||
| 0092 | [Reverse Linked List II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README_EN.md) | `Linked List` | Medium | |
|
||
| 0093 | [Restore IP Addresses](/solution/0000-0099/0093.Restore%20IP%20Addresses/README_EN.md) | `String`,`Backtracking` | Medium | |
|
||
| 0094 | [Binary Tree Inorder Traversal](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Easy | |
|
||
| 0095 | [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 | [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 | [Interleaving String](/solution/0000-0099/0097.Interleaving%20String/README_EN.md) | `String`,`Dynamic Programming` | Medium | |
|
||
| 0098 | [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 | [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 | [Same Tree](/solution/0100-0199/0100.Same%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | |
|
||
| 0101 | [Symmetric Tree](/solution/0100-0199/0101.Symmetric%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | |
|
||
| 0102 | [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 | [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 | [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 | [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 | [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 | [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 | [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 | [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 | [Balanced Binary Tree](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | |
|
||
| 0111 | [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 | [Path Sum](/solution/0100-0199/0112.Path%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | |
|
||
| 0113 | [Path Sum II](/solution/0100-0199/0113.Path%20Sum%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Backtracking`,`Binary Tree` | Medium | |
|
||
| 0114 | [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 | [Distinct Subsequences](/solution/0100-0199/0115.Distinct%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | |
|
||
| 0116 | [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`,`Linked List`,`Binary Tree` | Medium | |
|
||
| 0117 | [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`,`Linked List`,`Binary Tree` | Medium | |
|
||
| 0118 | [Pascal's Triangle](/solution/0100-0199/0118.Pascal%27s%20Triangle/README_EN.md) | `Array`,`Dynamic Programming` | Easy | |
|
||
| 0119 | [Pascal's Triangle II](/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README_EN.md) | `Array`,`Dynamic Programming` | Easy | |
|
||
| 0120 | [Triangle](/solution/0100-0199/0120.Triangle/README_EN.md) | `Array`,`Dynamic Programming` | Medium | |
|
||
| 0121 | [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 | [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` | Medium | |
|
||
| 0123 | [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 | [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 | [Valid Palindrome](/solution/0100-0199/0125.Valid%20Palindrome/README_EN.md) | `Two Pointers`,`String` | Easy | |
|
||
| 0126 | [Word Ladder II](/solution/0100-0199/0126.Word%20Ladder%20II/README_EN.md) | `Breadth-First Search`,`Hash Table`,`String`,`Backtracking` | Hard | |
|
||
| 0127 | [Word Ladder](/solution/0100-0199/0127.Word%20Ladder/README_EN.md) | `Breadth-First Search`,`Hash Table`,`String` | Hard | |
|
||
| 0128 | [Longest Consecutive Sequence](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README_EN.md) | `Union Find`,`Array`,`Hash Table` | Medium | |
|
||
| 0129 | [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 | [Surrounded Regions](/solution/0100-0199/0130.Surrounded%20Regions/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | |
|
||
| 0131 | [Palindrome Partitioning](/solution/0100-0199/0131.Palindrome%20Partitioning/README_EN.md) | `String`,`Dynamic Programming`,`Backtracking` | Medium | |
|
||
| 0132 | [Palindrome Partitioning II](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | |
|
||
| 0133 | [Clone Graph](/solution/0100-0199/0133.Clone%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Hash Table` | Medium | |
|
||
| 0134 | [Gas Station](/solution/0100-0199/0134.Gas%20Station/README_EN.md) | `Greedy`,`Array` | Medium | |
|
||
| 0135 | [Candy](/solution/0100-0199/0135.Candy/README_EN.md) | `Greedy`,`Array` | Hard | |
|
||
| 0136 | [Single Number](/solution/0100-0199/0136.Single%20Number/README_EN.md) | `Bit Manipulation`,`Array` | Easy | |
|
||
| 0137 | [Single Number II](/solution/0100-0199/0137.Single%20Number%20II/README_EN.md) | `Bit Manipulation`,`Array` | Medium | |
|
||
| 0138 | [Copy List with Random Pointer](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README_EN.md) | `Hash Table`,`Linked List` | Medium | |
|
||
| 0139 | [Word Break](/solution/0100-0199/0139.Word%20Break/README_EN.md) | `Trie`,`Memoization`,`Array`,`Hash Table`,`String`,`Dynamic Programming` | Medium | |
|
||
| 0140 | [Word Break II](/solution/0100-0199/0140.Word%20Break%20II/README_EN.md) | `Trie`,`Memoization`,`Array`,`Hash Table`,`String`,`Dynamic Programming`,`Backtracking` | Hard | |
|
||
| 0141 | [Linked List Cycle](/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md) | `Hash Table`,`Linked List`,`Two Pointers` | Easy | |
|
||
| 0142 | [Linked List Cycle II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md) | `Hash Table`,`Linked List`,`Two Pointers` | Medium | |
|
||
| 0143 | [Reorder List](/solution/0100-0199/0143.Reorder%20List/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Two Pointers` | Medium | |
|
||
| 0144 | [Binary Tree Preorder Traversal](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Easy | |
|
||
| 0145 | [Binary Tree Postorder Traversal](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Easy | |
|
||
| 0146 | [LRU Cache](/solution/0100-0199/0146.LRU%20Cache/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List` | Medium | |
|
||
| 0147 | [Insertion Sort List](/solution/0100-0199/0147.Insertion%20Sort%20List/README_EN.md) | `Linked List`,`Sorting` | Medium | |
|
||
| 0148 | [Sort List](/solution/0100-0199/0148.Sort%20List/README_EN.md) | `Linked List`,`Two Pointers`,`Divide and Conquer`,`Sorting`,`Merge Sort` | Medium | |
|
||
| 0149 | [Max Points on a Line](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README_EN.md) | `Geometry`,`Array`,`Hash Table`,`Math` | Hard | |
|
||
| 0150 | [Evaluate Reverse Polish Notation](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README_EN.md) | `Stack`,`Array`,`Math` | Medium | |
|
||
| 0151 | [Reverse Words in a String](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README_EN.md) | `Two Pointers`,`String` | Medium | |
|
||
| 0152 | [Maximum Product Subarray](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README_EN.md) | `Array`,`Dynamic Programming` | Medium | |
|
||
| 0153 | [Find Minimum in Rotated Sorted Array](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | |
|
||
| 0154 | [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 | [Min Stack](/solution/0100-0199/0155.Min%20Stack/README_EN.md) | `Stack`,`Design` | Medium | |
|
||
| 0156 | [Binary Tree Upside Down](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 |
|
||
| 0157 | [Read N Characters Given Read4](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README_EN.md) | `Array`,`Interactive`,`Simulation` | Easy | 🔒 |
|
||
| 0158 | [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) | `Array`,`Interactive`,`Simulation` | Hard | 🔒 |
|
||
| 0159 | [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 | [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 | [One Edit Distance](/solution/0100-0199/0161.One%20Edit%20Distance/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 |
|
||
| 0162 | [Find Peak Element](/solution/0100-0199/0162.Find%20Peak%20Element/README_EN.md) | `Array`,`Binary Search` | Medium | |
|
||
| 0163 | [Missing Ranges](/solution/0100-0199/0163.Missing%20Ranges/README_EN.md) | `Array` | Easy | 🔒 |
|
||
| 0164 | [Maximum Gap](/solution/0100-0199/0164.Maximum%20Gap/README_EN.md) | `Array`,`Bucket Sort`,`Radix Sort`,`Sorting` | Medium | |
|
||
| 0165 | [Compare Version Numbers](/solution/0100-0199/0165.Compare%20Version%20Numbers/README_EN.md) | `Two Pointers`,`String` | Medium | |
|
||
| 0166 | [Fraction to Recurring Decimal](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README_EN.md) | `Hash Table`,`Math`,`String` | Medium | |
|
||
| 0167 | [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` | Medium | |
|
||
| 0168 | [Excel Sheet Column Title](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README_EN.md) | `Math`,`String` | Easy | |
|
||
| 0169 | [Majority Element](/solution/0100-0199/0169.Majority%20Element/README_EN.md) | `Array`,`Hash Table`,`Divide and Conquer`,`Counting`,`Sorting` | Easy | |
|
||
| 0170 | [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 | [Excel Sheet Column Number](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README_EN.md) | `Math`,`String` | Easy | |
|
||
| 0172 | [Factorial Trailing Zeroes](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README_EN.md) | `Math` | Medium | |
|
||
| 0173 | [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 | [Dungeon Game](/solution/0100-0199/0174.Dungeon%20Game/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | |
|
||
| 0175 | [Combine Two Tables](/solution/0100-0199/0175.Combine%20Two%20Tables/README_EN.md) | `Database` | Easy | |
|
||
| 0176 | [Second Highest Salary](/solution/0100-0199/0176.Second%20Highest%20Salary/README_EN.md) | `Database` | Medium | |
|
||
| 0177 | [Nth Highest Salary](/solution/0100-0199/0177.Nth%20Highest%20Salary/README_EN.md) | `Database` | Medium | |
|
||
| 0178 | [Rank Scores](/solution/0100-0199/0178.Rank%20Scores/README_EN.md) | `Database` | Medium | |
|
||
| 0179 | [Largest Number](/solution/0100-0199/0179.Largest%20Number/README_EN.md) | `Greedy`,`Array`,`String`,`Sorting` | Medium | |
|
||
| 0180 | [Consecutive Numbers](/solution/0100-0199/0180.Consecutive%20Numbers/README_EN.md) | `Database` | Medium | |
|
||
| 0181 | [Employees Earning More Than Their Managers](/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README_EN.md) | `Database` | Easy | |
|
||
| 0182 | [Duplicate Emails](/solution/0100-0199/0182.Duplicate%20Emails/README_EN.md) | `Database` | Easy | |
|
||
| 0183 | [Customers Who Never Order](/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README_EN.md) | `Database` | Easy | |
|
||
| 0184 | [Department Highest Salary](/solution/0100-0199/0184.Department%20Highest%20Salary/README_EN.md) | `Database` | Medium | |
|
||
| 0185 | [Department Top Three Salaries](/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README_EN.md) | `Database` | Hard | |
|
||
| 0186 | [Reverse Words in a String II](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 |
|
||
| 0187 | [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 | [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 | [Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README_EN.md) | `Array`,`Math`,`Two Pointers` | Medium | |
|
||
| 0190 | [Reverse Bits](/solution/0100-0199/0190.Reverse%20Bits/README_EN.md) | `Bit Manipulation`,`Divide and Conquer` | Easy | |
|
||
| 0191 | [Number of 1 Bits](/solution/0100-0199/0191.Number%20of%201%20Bits/README_EN.md) | `Bit Manipulation`,`Divide and Conquer` | Easy | |
|
||
| 0192 | [Word Frequency](/solution/0100-0199/0192.Word%20Frequency/README_EN.md) | `Shell` | Medium | |
|
||
| 0193 | [Valid Phone Numbers](/solution/0100-0199/0193.Valid%20Phone%20Numbers/README_EN.md) | `Shell` | Easy | |
|
||
| 0194 | [Transpose File](/solution/0100-0199/0194.Transpose%20File/README_EN.md) | `Shell` | Medium | |
|
||
| 0195 | [Tenth Line](/solution/0100-0199/0195.Tenth%20Line/README_EN.md) | `Shell` | Easy | |
|
||
| 0196 | [Delete Duplicate Emails](/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README_EN.md) | `Database` | Easy | |
|
||
| 0197 | [Rising Temperature](/solution/0100-0199/0197.Rising%20Temperature/README_EN.md) | `Database` | Easy | |
|
||
| 0198 | [House Robber](/solution/0100-0199/0198.House%20Robber/README_EN.md) | `Array`,`Dynamic Programming` | Medium | |
|
||
| 0199 | [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 | [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 | [Bitwise AND of Numbers Range](/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README_EN.md) | `Bit Manipulation` | Medium | |
|
||
| 0202 | [Happy Number](/solution/0200-0299/0202.Happy%20Number/README_EN.md) | `Hash Table`,`Math`,`Two Pointers` | Easy | |
|
||
| 0203 | [Remove Linked List Elements](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README_EN.md) | `Recursion`,`Linked List` | Easy | |
|
||
| 0204 | [Count Primes](/solution/0200-0299/0204.Count%20Primes/README_EN.md) | `Array`,`Math`,`Enumeration`,`Number Theory` | Medium | |
|
||
| 0205 | [Isomorphic Strings](/solution/0200-0299/0205.Isomorphic%20Strings/README_EN.md) | `Hash Table`,`String` | Easy | |
|
||
| 0206 | [Reverse Linked List](/solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md) | `Recursion`,`Linked List` | Easy | |
|
||
| 0207 | [Course Schedule](/solution/0200-0299/0207.Course%20Schedule/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | |
|
||
| 0208 | [Implement Trie (Prefix Tree)](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | |
|
||
| 0209 | [Minimum Size Subarray Sum](/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | |
|
||
| 0210 | [Course Schedule II](/solution/0200-0299/0210.Course%20Schedule%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | |
|
||
| 0211 | [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 | [Word Search II](/solution/0200-0299/0212.Word%20Search%20II/README_EN.md) | `Trie`,`Array`,`String`,`Backtracking`,`Matrix` | Hard | |
|
||
| 0213 | [House Robber II](/solution/0200-0299/0213.House%20Robber%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | |
|
||
| 0214 | [Shortest Palindrome](/solution/0200-0299/0214.Shortest%20Palindrome/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | |
|
||
| 0215 | [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 | [Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md) | `Array`,`Backtracking` | Medium | |
|
||
| 0217 | [Contains Duplicate](/solution/0200-0299/0217.Contains%20Duplicate/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | |
|
||
| 0218 | [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 | [Contains Duplicate II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Easy | |
|
||
| 0220 | [Contains Duplicate III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README_EN.md) | `Array`,`Bucket Sort`,`Ordered Set`,`Sorting`,`Sliding Window` | Hard | |
|
||
| 0221 | [Maximal Square](/solution/0200-0299/0221.Maximal%20Square/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | |
|
||
| 0222 | [Count Complete Tree Nodes](/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README_EN.md) | `Bit Manipulation`,`Tree`,`Binary Search`,`Binary Tree` | Easy | |
|
||
| 0223 | [Rectangle Area](/solution/0200-0299/0223.Rectangle%20Area/README_EN.md) | `Geometry`,`Math` | Medium | |
|
||
| 0224 | [Basic Calculator](/solution/0200-0299/0224.Basic%20Calculator/README_EN.md) | `Stack`,`Recursion`,`Math`,`String` | Hard | |
|
||
| 0225 | [Implement Stack using Queues](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README_EN.md) | `Stack`,`Design`,`Queue` | Easy | |
|
||
| 0226 | [Invert Binary Tree](/solution/0200-0299/0226.Invert%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | |
|
||
| 0227 | [Basic Calculator II](/solution/0200-0299/0227.Basic%20Calculator%20II/README_EN.md) | `Stack`,`Math`,`String` | Medium | |
|
||
| 0228 | [Summary Ranges](/solution/0200-0299/0228.Summary%20Ranges/README_EN.md) | `Array` | Easy | |
|
||
| 0229 | [Majority Element II](/solution/0200-0299/0229.Majority%20Element%20II/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Medium | |
|
||
| 0230 | [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 | [Power of Two](/solution/0200-0299/0231.Power%20of%20Two/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Easy | |
|
||
| 0232 | [Implement Queue using Stacks](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README_EN.md) | `Stack`,`Design`,`Queue` | Easy | |
|
||
| 0233 | [Number of Digit One](/solution/0200-0299/0233.Number%20of%20Digit%20One/README_EN.md) | `Recursion`,`Math`,`Dynamic Programming` | Hard | |
|
||
| 0234 | [Palindrome Linked List](/solution/0200-0299/0234.Palindrome%20Linked%20List/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Two Pointers` | Easy | |
|
||
| 0235 | [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` | Medium | |
|
||
| 0236 | [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 | [Delete Node in a Linked List](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README_EN.md) | `Linked List` | Medium | |
|
||
| 0238 | [Product of Array Except Self](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README_EN.md) | `Array`,`Prefix Sum` | Medium | |
|
||
| 0239 | [Sliding Window Maximum](/solution/0200-0299/0239.Sliding%20Window%20Maximum/README_EN.md) | `Queue`,`Array`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | |
|
||
| 0240 | [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 | [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 | [Valid Anagram](/solution/0200-0299/0242.Valid%20Anagram/README_EN.md) | `Hash Table`,`String`,`Sorting` | Easy | |
|
||
| 0243 | [Shortest Word Distance](/solution/0200-0299/0243.Shortest%20Word%20Distance/README_EN.md) | `Array`,`String` | Easy | 🔒 |
|
||
| 0244 | [Shortest Word Distance II](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README_EN.md) | `Design`,`Array`,`Hash Table`,`Two Pointers`,`String` | Medium | 🔒 |
|
||
| 0245 | [Shortest Word Distance III](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README_EN.md) | `Array`,`String` | Medium | 🔒 |
|
||
| 0246 | [Strobogrammatic Number](/solution/0200-0299/0246.Strobogrammatic%20Number/README_EN.md) | `Hash Table`,`Two Pointers`,`String` | Easy | 🔒 |
|
||
| 0247 | [Strobogrammatic Number II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README_EN.md) | `Recursion`,`Array`,`String` | Medium | 🔒 |
|
||
| 0248 | [Strobogrammatic Number III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README_EN.md) | `Recursion`,`Array`,`String` | Hard | 🔒 |
|
||
| 0249 | [Group Shifted Strings](/solution/0200-0299/0249.Group%20Shifted%20Strings/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | 🔒 |
|
||
| 0250 | [Count Univalue Subtrees](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 |
|
||
| 0251 | [Flatten 2D Vector](/solution/0200-0299/0251.Flatten%202D%20Vector/README_EN.md) | `Design`,`Array`,`Two Pointers`,`Iterator` | Medium | 🔒 |
|
||
| 0252 | [Meeting Rooms](/solution/0200-0299/0252.Meeting%20Rooms/README_EN.md) | `Array`,`Sorting` | Easy | 🔒 |
|
||
| 0253 | [Meeting Rooms II](/solution/0200-0299/0253.Meeting%20Rooms%20II/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 0254 | [Factor Combinations](/solution/0200-0299/0254.Factor%20Combinations/README_EN.md) | `Backtracking` | Medium | 🔒 |
|
||
| 0255 | [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`,`Array`,`Binary Tree`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 0256 | [Paint House](/solution/0200-0299/0256.Paint%20House/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 0257 | [Binary Tree Paths](/solution/0200-0299/0257.Binary%20Tree%20Paths/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Backtracking`,`Binary Tree` | Easy | |
|
||
| 0258 | [Add Digits](/solution/0200-0299/0258.Add%20Digits/README_EN.md) | `Math`,`Number Theory`,`Simulation` | Easy | |
|
||
| 0259 | [3Sum Smaller](/solution/0200-0299/0259.3Sum%20Smaller/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | 🔒 |
|
||
| 0260 | [Single Number III](/solution/0200-0299/0260.Single%20Number%20III/README_EN.md) | `Bit Manipulation`,`Array` | Medium | |
|
||
| 0261 | [Graph Valid Tree](/solution/0200-0299/0261.Graph%20Valid%20Tree/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | 🔒 |
|
||
| 0262 | [Trips and Users](/solution/0200-0299/0262.Trips%20and%20Users/README_EN.md) | `Database` | Hard | |
|
||
| 0263 | [Ugly Number](/solution/0200-0299/0263.Ugly%20Number/README_EN.md) | `Math` | Easy | |
|
||
| 0264 | [Ugly Number II](/solution/0200-0299/0264.Ugly%20Number%20II/README_EN.md) | `Hash Table`,`Math`,`Dynamic Programming`,`Heap (Priority Queue)` | Medium | |
|
||
| 0265 | [Paint House II](/solution/0200-0299/0265.Paint%20House%20II/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 |
|
||
| 0266 | [Palindrome Permutation](/solution/0200-0299/0266.Palindrome%20Permutation/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String` | Easy | 🔒 |
|
||
| 0267 | [Palindrome Permutation II](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | 🔒 |
|
||
| 0268 | [Missing Number](/solution/0200-0299/0268.Missing%20Number/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Binary Search`,`Sorting` | Easy | |
|
||
| 0269 | [Alien Dictionary](/solution/0200-0299/0269.Alien%20Dictionary/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Array`,`String` | Hard | 🔒 |
|
||
| 0270 | [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 | [Encode and Decode Strings](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README_EN.md) | `Design`,`Array`,`String` | Medium | 🔒 |
|
||
| 0272 | [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 | [Integer to English Words](/solution/0200-0299/0273.Integer%20to%20English%20Words/README_EN.md) | `Recursion`,`Math`,`String` | Hard | |
|
||
| 0274 | [H-Index](/solution/0200-0299/0274.H-Index/README_EN.md) | `Array`,`Counting Sort`,`Sorting` | Medium | |
|
||
| 0275 | [H-Index II](/solution/0200-0299/0275.H-Index%20II/README_EN.md) | `Array`,`Binary Search` | Medium | |
|
||
| 0276 | [Paint Fence](/solution/0200-0299/0276.Paint%20Fence/README_EN.md) | `Dynamic Programming` | Medium | 🔒 |
|
||
| 0277 | [Find the Celebrity](/solution/0200-0299/0277.Find%20the%20Celebrity/README_EN.md) | `Graph`,`Two Pointers`,`Interactive` | Medium | 🔒 |
|
||
| 0278 | [First Bad Version](/solution/0200-0299/0278.First%20Bad%20Version/README_EN.md) | `Binary Search`,`Interactive` | Easy | |
|
||
| 0279 | [Perfect Squares](/solution/0200-0299/0279.Perfect%20Squares/README_EN.md) | `Breadth-First Search`,`Math`,`Dynamic Programming` | Medium | |
|
||
| 0280 | [Wiggle Sort](/solution/0200-0299/0280.Wiggle%20Sort/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 |
|
||
| 0281 | [Zigzag Iterator](/solution/0200-0299/0281.Zigzag%20Iterator/README_EN.md) | `Design`,`Queue`,`Array`,`Iterator` | Medium | 🔒 |
|
||
| 0282 | [Expression Add Operators](/solution/0200-0299/0282.Expression%20Add%20Operators/README_EN.md) | `Math`,`String`,`Backtracking` | Hard | |
|
||
| 0283 | [Move Zeroes](/solution/0200-0299/0283.Move%20Zeroes/README_EN.md) | `Array`,`Two Pointers` | Easy | |
|
||
| 0284 | [Peeking Iterator](/solution/0200-0299/0284.Peeking%20Iterator/README_EN.md) | `Design`,`Array`,`Iterator` | Medium | |
|
||
| 0285 | [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 | [Walls and Gates](/solution/0200-0299/0286.Walls%20and%20Gates/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 |
|
||
| 0287 | [Find the Duplicate Number](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Binary Search` | Medium | |
|
||
| 0288 | [Unique Word Abbreviation](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README_EN.md) | `Design`,`Array`,`Hash Table`,`String` | Medium | 🔒 |
|
||
| 0289 | [Game of Life](/solution/0200-0299/0289.Game%20of%20Life/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | |
|
||
| 0290 | [Word Pattern](/solution/0200-0299/0290.Word%20Pattern/README_EN.md) | `Hash Table`,`String` | Easy | |
|
||
| 0291 | [Word Pattern II](/solution/0200-0299/0291.Word%20Pattern%20II/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | 🔒 |
|
||
| 0292 | [Nim Game](/solution/0200-0299/0292.Nim%20Game/README_EN.md) | `Brainteaser`,`Math`,`Game Theory` | Easy | |
|
||
| 0293 | [Flip Game](/solution/0200-0299/0293.Flip%20Game/README_EN.md) | `String` | Easy | 🔒 |
|
||
| 0294 | [Flip Game II](/solution/0200-0299/0294.Flip%20Game%20II/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming`,`Backtracking`,`Game Theory` | Medium | 🔒 |
|
||
| 0295 | [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 | [Best Meeting Point](/solution/0200-0299/0296.Best%20Meeting%20Point/README_EN.md) | `Array`,`Math`,`Matrix`,`Sorting` | Hard | 🔒 |
|
||
| 0297 | [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 | [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 | [Bulls and Cows](/solution/0200-0299/0299.Bulls%20and%20Cows/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | |
|
||
| 0300 | [Longest Increasing Subsequence](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Medium | |
|
||
| 0301 | [Remove Invalid Parentheses](/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README_EN.md) | `Breadth-First Search`,`String`,`Backtracking` | Hard | |
|
||
| 0302 | [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 | [Range Sum Query - Immutable](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README_EN.md) | `Design`,`Array`,`Prefix Sum` | Easy | |
|
||
| 0304 | [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 | [Number of Islands II](/solution/0300-0399/0305.Number%20of%20Islands%20II/README_EN.md) | `Union Find`,`Array`,`Hash Table` | Hard | 🔒 |
|
||
| 0306 | [Additive Number](/solution/0300-0399/0306.Additive%20Number/README_EN.md) | `String`,`Backtracking` | Medium | |
|
||
| 0307 | [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 | [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` | Medium | 🔒 |
|
||
| 0309 | [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 | [Minimum Height Trees](/solution/0300-0399/0310.Minimum%20Height%20Trees/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | |
|
||
| 0311 | [Sparse Matrix Multiplication](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | 🔒 |
|
||
| 0312 | [Burst Balloons](/solution/0300-0399/0312.Burst%20Balloons/README_EN.md) | `Array`,`Dynamic Programming` | Hard | |
|
||
| 0313 | [Super Ugly Number](/solution/0300-0399/0313.Super%20Ugly%20Number/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | |
|
||
| 0314 | [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`,`Sorting` | Medium | 🔒 |
|
||
| 0315 | [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 | [Remove Duplicate Letters](/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Medium | |
|
||
| 0317 | [Shortest Distance from All Buildings](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | 🔒 |
|
||
| 0318 | [Maximum Product of Word Lengths](/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README_EN.md) | `Bit Manipulation`,`Array`,`String` | Medium | |
|
||
| 0319 | [Bulb Switcher](/solution/0300-0399/0319.Bulb%20Switcher/README_EN.md) | `Brainteaser`,`Math` | Medium | |
|
||
| 0320 | [Generalized Abbreviation](/solution/0300-0399/0320.Generalized%20Abbreviation/README_EN.md) | `Bit Manipulation`,`String`,`Backtracking` | Medium | 🔒 |
|
||
| 0321 | [Create Maximum Number](/solution/0300-0399/0321.Create%20Maximum%20Number/README_EN.md) | `Stack`,`Greedy`,`Array`,`Two Pointers`,`Monotonic Stack` | Hard | |
|
||
| 0322 | [Coin Change](/solution/0300-0399/0322.Coin%20Change/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming` | Medium | |
|
||
| 0323 | [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 | [Wiggle Sort II](/solution/0300-0399/0324.Wiggle%20Sort%20II/README_EN.md) | `Greedy`,`Array`,`Divide and Conquer`,`Quickselect`,`Sorting` | Medium | |
|
||
| 0325 | [Maximum Size Subarray Sum Equals k](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | 🔒 |
|
||
| 0326 | [Power of Three](/solution/0300-0399/0326.Power%20of%20Three/README_EN.md) | `Recursion`,`Math` | Easy | |
|
||
| 0327 | [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 | [Odd Even Linked List](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README_EN.md) | `Linked List` | Medium | |
|
||
| 0329 | [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`,`Array`,`Dynamic Programming`,`Matrix` | Hard | |
|
||
| 0330 | [Patching Array](/solution/0300-0399/0330.Patching%20Array/README_EN.md) | `Greedy`,`Array` | Hard | |
|
||
| 0331 | [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 | [Reconstruct Itinerary](/solution/0300-0399/0332.Reconstruct%20Itinerary/README_EN.md) | `Depth-First Search`,`Graph`,`Eulerian Circuit` | Hard | |
|
||
| 0333 | [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 | [Increasing Triplet Subsequence](/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README_EN.md) | `Greedy`,`Array` | Medium | |
|
||
| 0335 | [Self Crossing](/solution/0300-0399/0335.Self%20Crossing/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | |
|
||
| 0336 | [Palindrome Pairs](/solution/0300-0399/0336.Palindrome%20Pairs/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Hard | |
|
||
| 0337 | [House Robber III](/solution/0300-0399/0337.House%20Robber%20III/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Medium | |
|
||
| 0338 | [Counting Bits](/solution/0300-0399/0338.Counting%20Bits/README_EN.md) | `Bit Manipulation`,`Dynamic Programming` | Easy | |
|
||
| 0339 | [Nested List Weight Sum](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README_EN.md) | `Depth-First Search`,`Breadth-First Search` | Medium | 🔒 |
|
||
| 0340 | [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 | [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 | [Power of Four](/solution/0300-0399/0342.Power%20of%20Four/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Easy | |
|
||
| 0343 | [Integer Break](/solution/0300-0399/0343.Integer%20Break/README_EN.md) | `Math`,`Dynamic Programming` | Medium | |
|
||
| 0344 | [Reverse String](/solution/0300-0399/0344.Reverse%20String/README_EN.md) | `Two Pointers`,`String` | Easy | |
|
||
| 0345 | [Reverse Vowels of a String](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README_EN.md) | `Two Pointers`,`String` | Easy | |
|
||
| 0346 | [Moving Average from Data Stream](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README_EN.md) | `Design`,`Queue`,`Array`,`Data Stream` | Easy | 🔒 |
|
||
| 0347 | [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 | [Design Tic-Tac-Toe](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README_EN.md) | `Design`,`Array`,`Hash Table`,`Matrix`,`Simulation` | Medium | 🔒 |
|
||
| 0349 | [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 | [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 | [Android Unlock Patterns](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README_EN.md) | `Bit Manipulation`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | 🔒 |
|
||
| 0352 | [Data Stream as Disjoint Intervals](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README_EN.md) | `Design`,`Binary Search`,`Ordered Set` | Hard | |
|
||
| 0353 | [Design Snake Game](/solution/0300-0399/0353.Design%20Snake%20Game/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Simulation` | Medium | 🔒 |
|
||
| 0354 | [Russian Doll Envelopes](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | |
|
||
| 0355 | [Design Twitter](/solution/0300-0399/0355.Design%20Twitter/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Heap (Priority Queue)` | Medium | |
|
||
| 0356 | [Line Reflection](/solution/0300-0399/0356.Line%20Reflection/README_EN.md) | `Array`,`Hash Table`,`Math` | Medium | 🔒 |
|
||
| 0357 | [Count Numbers with Unique Digits](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README_EN.md) | `Math`,`Dynamic Programming`,`Backtracking` | Medium | |
|
||
| 0358 | [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 | [Logger Rate Limiter](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README_EN.md) | `Design`,`Hash Table`,`Data Stream` | Easy | 🔒 |
|
||
| 0360 | [Sort Transformed Array](/solution/0300-0399/0360.Sort%20Transformed%20Array/README_EN.md) | `Array`,`Math`,`Two Pointers`,`Sorting` | Medium | 🔒 |
|
||
| 0361 | [Bomb Enemy](/solution/0300-0399/0361.Bomb%20Enemy/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | 🔒 |
|
||
| 0362 | [Design Hit Counter](/solution/0300-0399/0362.Design%20Hit%20Counter/README_EN.md) | `Design`,`Queue`,`Array`,`Binary Search`,`Data Stream` | Medium | 🔒 |
|
||
| 0363 | [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`,`Matrix`,`Ordered Set`,`Prefix Sum` | Hard | |
|
||
| 0364 | [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 | [Water and Jug Problem](/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Math` | Medium | |
|
||
| 0366 | [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 | [Valid Perfect Square](/solution/0300-0399/0367.Valid%20Perfect%20Square/README_EN.md) | `Math`,`Binary Search` | Easy | |
|
||
| 0368 | [Largest Divisible Subset](/solution/0300-0399/0368.Largest%20Divisible%20Subset/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Sorting` | Medium | |
|
||
| 0369 | [Plus One Linked List](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README_EN.md) | `Linked List`,`Math` | Medium | 🔒 |
|
||
| 0370 | [Range Addition](/solution/0300-0399/0370.Range%20Addition/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 |
|
||
| 0371 | [Sum of Two Integers](/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README_EN.md) | `Bit Manipulation`,`Math` | Medium | |
|
||
| 0372 | [Super Pow](/solution/0300-0399/0372.Super%20Pow/README_EN.md) | `Math`,`Divide and Conquer` | Medium | |
|
||
| 0373 | [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 | [Guess Number Higher or Lower](/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README_EN.md) | `Binary Search`,`Interactive` | Easy | |
|
||
| 0375 | [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 | [Wiggle Subsequence](/solution/0300-0399/0376.Wiggle%20Subsequence/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | |
|
||
| 0377 | [Combination Sum IV](/solution/0300-0399/0377.Combination%20Sum%20IV/README_EN.md) | `Array`,`Dynamic Programming` | Medium | |
|
||
| 0378 | [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 | [Design Phone Directory](/solution/0300-0399/0379.Design%20Phone%20Directory/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Linked List` | Medium | 🔒 |
|
||
| 0380 | [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 | [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 | [Linked List Random Node](/solution/0300-0399/0382.Linked%20List%20Random%20Node/README_EN.md) | `Reservoir Sampling`,`Linked List`,`Math`,`Randomized` | Medium | |
|
||
| 0383 | [Ransom Note](/solution/0300-0399/0383.Ransom%20Note/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | |
|
||
| 0384 | [Shuffle an Array](/solution/0300-0399/0384.Shuffle%20an%20Array/README_EN.md) | `Design`,`Array`,`Math`,`Randomized` | Medium | |
|
||
| 0385 | [Mini Parser](/solution/0300-0399/0385.Mini%20Parser/README_EN.md) | `Stack`,`Depth-First Search`,`String` | Medium | |
|
||
| 0386 | [Lexicographical Numbers](/solution/0300-0399/0386.Lexicographical%20Numbers/README_EN.md) | `Depth-First Search`,`Trie` | Medium | |
|
||
| 0387 | [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 | [Longest Absolute File Path](/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README_EN.md) | `Stack`,`Depth-First Search`,`String` | Medium | |
|
||
| 0389 | [Find the Difference](/solution/0300-0399/0389.Find%20the%20Difference/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Sorting` | Easy | |
|
||
| 0390 | [Elimination Game](/solution/0300-0399/0390.Elimination%20Game/README_EN.md) | `Recursion`,`Math` | Medium | |
|
||
| 0391 | [Perfect Rectangle](/solution/0300-0399/0391.Perfect%20Rectangle/README_EN.md) | `Array`,`Line Sweep` | Hard | |
|
||
| 0392 | [Is Subsequence](/solution/0300-0399/0392.Is%20Subsequence/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Easy | |
|
||
| 0393 | [UTF-8 Validation](/solution/0300-0399/0393.UTF-8%20Validation/README_EN.md) | `Bit Manipulation`,`Array` | Medium | |
|
||
| 0394 | [Decode String](/solution/0300-0399/0394.Decode%20String/README_EN.md) | `Stack`,`Recursion`,`String` | Medium | |
|
||
| 0395 | [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 | [Rotate Function](/solution/0300-0399/0396.Rotate%20Function/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | |
|
||
| 0397 | [Integer Replacement](/solution/0300-0399/0397.Integer%20Replacement/README_EN.md) | `Greedy`,`Bit Manipulation`,`Memoization`,`Dynamic Programming` | Medium | |
|
||
| 0398 | [Random Pick Index](/solution/0300-0399/0398.Random%20Pick%20Index/README_EN.md) | `Reservoir Sampling`,`Hash Table`,`Math`,`Randomized` | Medium | |
|
||
| 0399 | [Evaluate Division](/solution/0300-0399/0399.Evaluate%20Division/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`String`,`Shortest Path` | Medium | |
|
||
| 0400 | [Nth Digit](/solution/0400-0499/0400.Nth%20Digit/README_EN.md) | `Math`,`Binary Search` | Medium | |
|
||
| 0401 | [Binary Watch](/solution/0400-0499/0401.Binary%20Watch/README_EN.md) | `Bit Manipulation`,`Backtracking` | Easy | |
|
||
| 0402 | [Remove K Digits](/solution/0400-0499/0402.Remove%20K%20Digits/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Medium | |
|
||
| 0403 | [Frog Jump](/solution/0400-0499/0403.Frog%20Jump/README_EN.md) | `Array`,`Dynamic Programming` | Hard | |
|
||
| 0404 | [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 | [Convert a Number to Hexadecimal](/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README_EN.md) | `Bit Manipulation`,`Math`,`String` | Easy | |
|
||
| 0406 | [Queue Reconstruction by Height](/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Sorting` | Medium | |
|
||
| 0407 | [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 | [Valid Word Abbreviation](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README_EN.md) | `Two Pointers`,`String` | Easy | 🔒 |
|
||
| 0409 | [Longest Palindrome](/solution/0400-0499/0409.Longest%20Palindrome/README_EN.md) | `Greedy`,`Hash Table`,`String` | Easy | |
|
||
| 0410 | [Split Array Largest Sum](/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming`,`Prefix Sum` | Hard | |
|
||
| 0411 | [Minimum Unique Word Abbreviation](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Backtracking` | Hard | 🔒 |
|
||
| 0412 | [Fizz Buzz](/solution/0400-0499/0412.Fizz%20Buzz/README_EN.md) | `Math`,`String`,`Simulation` | Easy | |
|
||
| 0413 | [Arithmetic Slices](/solution/0400-0499/0413.Arithmetic%20Slices/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | |
|
||
| 0414 | [Third Maximum Number](/solution/0400-0499/0414.Third%20Maximum%20Number/README_EN.md) | `Array`,`Sorting` | Easy | |
|
||
| 0415 | [Add Strings](/solution/0400-0499/0415.Add%20Strings/README_EN.md) | `Math`,`String`,`Simulation` | Easy | |
|
||
| 0416 | [Partition Equal Subset Sum](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | |
|
||
| 0417 | [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 | [Sentence Screen Fitting](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 0419 | [Battleships in a Board](/solution/0400-0499/0419.Battleships%20in%20a%20Board/README_EN.md) | `Depth-First Search`,`Array`,`Matrix` | Medium | |
|
||
| 0420 | [Strong Password Checker](/solution/0400-0499/0420.Strong%20Password%20Checker/README_EN.md) | `Greedy`,`String`,`Heap (Priority Queue)` | Hard | |
|
||
| 0421 | [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 | [Valid Word Square](/solution/0400-0499/0422.Valid%20Word%20Square/README_EN.md) | `Array`,`Matrix` | Easy | 🔒 |
|
||
| 0423 | [Reconstruct Original Digits from English](/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README_EN.md) | `Hash Table`,`Math`,`String` | Medium | |
|
||
| 0424 | [Longest Repeating Character Replacement](/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | |
|
||
| 0425 | [Word Squares](/solution/0400-0499/0425.Word%20Squares/README_EN.md) | `Trie`,`Array`,`String`,`Backtracking` | Hard | 🔒 |
|
||
| 0426 | [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 | [Construct Quad Tree](/solution/0400-0499/0427.Construct%20Quad%20Tree/README_EN.md) | `Tree`,`Array`,`Divide and Conquer`,`Matrix` | Medium | |
|
||
| 0428 | [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 | [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 | [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 | [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 | [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 | [Minimum Genetic Mutation](/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README_EN.md) | `Breadth-First Search`,`Hash Table`,`String` | Medium | |
|
||
| 0434 | [Number of Segments in a String](/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README_EN.md) | `String` | Easy | |
|
||
| 0435 | [Non-overlapping Intervals](/solution/0400-0499/0435.Non-overlapping%20Intervals/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | |
|
||
| 0436 | [Find Right Interval](/solution/0400-0499/0436.Find%20Right%20Interval/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | |
|
||
| 0437 | [Path Sum III](/solution/0400-0499/0437.Path%20Sum%20III/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | |
|
||
| 0438 | [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 | [Ternary Expression Parser](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README_EN.md) | `Stack`,`Recursion`,`String` | Medium | 🔒 |
|
||
| 0440 | [K-th Smallest in Lexicographical Order](/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README_EN.md) | `Trie` | Hard | |
|
||
| 0441 | [Arranging Coins](/solution/0400-0499/0441.Arranging%20Coins/README_EN.md) | `Math`,`Binary Search` | Easy | |
|
||
| 0442 | [Find All Duplicates in an Array](/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Medium | |
|
||
| 0443 | [String Compression](/solution/0400-0499/0443.String%20Compression/README_EN.md) | `Two Pointers`,`String` | Medium | |
|
||
| 0444 | [Sequence Reconstruction](/solution/0400-0499/0444.Sequence%20Reconstruction/README_EN.md) | `Graph`,`Topological Sort`,`Array` | Medium | 🔒 |
|
||
| 0445 | [Add Two Numbers II](/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README_EN.md) | `Stack`,`Linked List`,`Math` | Medium | |
|
||
| 0446 | [Arithmetic Slices II - Subsequence](/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README_EN.md) | `Array`,`Dynamic Programming` | Hard | |
|
||
| 0447 | [Number of Boomerangs](/solution/0400-0499/0447.Number%20of%20Boomerangs/README_EN.md) | `Array`,`Hash Table`,`Math` | Medium | |
|
||
| 0448 | [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 | [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 | [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 | [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 | [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 | [Minimum Moves to Equal Array Elements](/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README_EN.md) | `Array`,`Math` | Medium | |
|
||
| 0454 | [4Sum II](/solution/0400-0499/0454.4Sum%20II/README_EN.md) | `Array`,`Hash Table` | Medium | |
|
||
| 0455 | [Assign Cookies](/solution/0400-0499/0455.Assign%20Cookies/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Easy | |
|
||
| 0456 | [132 Pattern](/solution/0400-0499/0456.132%20Pattern/README_EN.md) | `Stack`,`Array`,`Binary Search`,`Ordered Set`,`Monotonic Stack` | Medium | |
|
||
| 0457 | [Circular Array Loop](/solution/0400-0499/0457.Circular%20Array%20Loop/README_EN.md) | `Array`,`Hash Table`,`Two Pointers` | Medium | |
|
||
| 0458 | [Poor Pigs](/solution/0400-0499/0458.Poor%20Pigs/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | |
|
||
| 0459 | [Repeated Substring Pattern](/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README_EN.md) | `String`,`String Matching` | Easy | |
|
||
| 0460 | [LFU Cache](/solution/0400-0499/0460.LFU%20Cache/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List` | Hard | |
|
||
| 0461 | [Hamming Distance](/solution/0400-0499/0461.Hamming%20Distance/README_EN.md) | `Bit Manipulation` | Easy | |
|
||
| 0462 | [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 | [Island Perimeter](/solution/0400-0499/0463.Island%20Perimeter/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Easy | |
|
||
| 0464 | [Can I Win](/solution/0400-0499/0464.Can%20I%20Win/README_EN.md) | `Bit Manipulation`,`Memoization`,`Math`,`Dynamic Programming`,`Bitmask`,`Game Theory` | Medium | |
|
||
| 0465 | [Optimal Account Balancing](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | 🔒 |
|
||
| 0466 | [Count The Repetitions](/solution/0400-0499/0466.Count%20The%20Repetitions/README_EN.md) | `String`,`Dynamic Programming` | Hard | |
|
||
| 0467 | [Unique Substrings in Wraparound String](/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README_EN.md) | `String`,`Dynamic Programming` | Medium | |
|
||
| 0468 | [Validate IP Address](/solution/0400-0499/0468.Validate%20IP%20Address/README_EN.md) | `String` | Medium | |
|
||
| 0469 | [Convex Polygon](/solution/0400-0499/0469.Convex%20Polygon/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | 🔒 |
|
||
| 0470 | [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 | [Encode String with Shortest Length](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README_EN.md) | `String`,`Dynamic Programming` | Hard | 🔒 |
|
||
| 0472 | [Concatenated Words](/solution/0400-0499/0472.Concatenated%20Words/README_EN.md) | `Depth-First Search`,`Trie`,`Array`,`String`,`Dynamic Programming` | Hard | |
|
||
| 0473 | [Matchsticks to Square](/solution/0400-0499/0473.Matchsticks%20to%20Square/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | |
|
||
| 0474 | [Ones and Zeroes](/solution/0400-0499/0474.Ones%20and%20Zeroes/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | |
|
||
| 0475 | [Heaters](/solution/0400-0499/0475.Heaters/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | |
|
||
| 0476 | [Number Complement](/solution/0400-0499/0476.Number%20Complement/README_EN.md) | `Bit Manipulation` | Easy | |
|
||
| 0477 | [Total Hamming Distance](/solution/0400-0499/0477.Total%20Hamming%20Distance/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | |
|
||
| 0478 | [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 | [Largest Palindrome Product](/solution/0400-0499/0479.Largest%20Palindrome%20Product/README_EN.md) | `Math`,`Enumeration` | Hard | |
|
||
| 0480 | [Sliding Window Median](/solution/0400-0499/0480.Sliding%20Window%20Median/README_EN.md) | `Array`,`Hash Table`,`Sliding Window`,`Heap (Priority Queue)` | Hard | |
|
||
| 0481 | [Magical String](/solution/0400-0499/0481.Magical%20String/README_EN.md) | `Two Pointers`,`String` | Medium | |
|
||
| 0482 | [License Key Formatting](/solution/0400-0499/0482.License%20Key%20Formatting/README_EN.md) | `String` | Easy | |
|
||
| 0483 | [Smallest Good Base](/solution/0400-0499/0483.Smallest%20Good%20Base/README_EN.md) | `Math`,`Binary Search` | Hard | |
|
||
| 0484 | [Find Permutation](/solution/0400-0499/0484.Find%20Permutation/README_EN.md) | `Stack`,`Greedy`,`Array`,`String` | Medium | 🔒 |
|
||
| 0485 | [Max Consecutive Ones](/solution/0400-0499/0485.Max%20Consecutive%20Ones/README_EN.md) | `Array` | Easy | |
|
||
| 0486 | [Predict the Winner](/solution/0400-0499/0486.Predict%20the%20Winner/README_EN.md) | `Recursion`,`Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | |
|
||
| 0487 | [Max Consecutive Ones II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | 🔒 |
|
||
| 0488 | [Zuma Game](/solution/0400-0499/0488.Zuma%20Game/README_EN.md) | `Stack`,`Breadth-First Search`,`Memoization`,`String`,`Dynamic Programming` | Hard | |
|
||
| 0489 | [Robot Room Cleaner](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README_EN.md) | `Backtracking`,`Interactive` | Hard | 🔒 |
|
||
| 0490 | [The Maze](/solution/0400-0499/0490.The%20Maze/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 |
|
||
| 0491 | [Non-decreasing Subsequences](/solution/0400-0499/0491.Non-decreasing%20Subsequences/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Backtracking` | Medium | |
|
||
| 0492 | [Construct the Rectangle](/solution/0400-0499/0492.Construct%20the%20Rectangle/README_EN.md) | `Math` | Easy | |
|
||
| 0493 | [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 | [Target Sum](/solution/0400-0499/0494.Target%20Sum/README_EN.md) | `Array`,`Dynamic Programming`,`Backtracking` | Medium | |
|
||
| 0495 | [Teemo Attacking](/solution/0400-0499/0495.Teemo%20Attacking/README_EN.md) | `Array`,`Simulation` | Easy | |
|
||
| 0496 | [Next Greater Element I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README_EN.md) | `Stack`,`Array`,`Hash Table`,`Monotonic Stack` | Easy | |
|
||
| 0497 | [Random Point in Non-overlapping Rectangles](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README_EN.md) | `Reservoir Sampling`,`Array`,`Math`,`Binary Search`,`Ordered Set`,`Prefix Sum`,`Randomized` | Medium | |
|
||
| 0498 | [Diagonal Traverse](/solution/0400-0499/0498.Diagonal%20Traverse/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | |
|
||
| 0499 | [The Maze III](/solution/0400-0499/0499.The%20Maze%20III/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`String`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | 🔒 |
|
||
| 0500 | [Keyboard Row](/solution/0500-0599/0500.Keyboard%20Row/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | |
|
||
| 0501 | [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 | [IPO](/solution/0500-0599/0502.IPO/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | |
|
||
| 0503 | [Next Greater Element II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | |
|
||
| 0504 | [Base 7](/solution/0500-0599/0504.Base%207/README_EN.md) | `Math`,`String` | Easy | |
|
||
| 0505 | [The Maze II](/solution/0500-0599/0505.The%20Maze%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 0506 | [Relative Ranks](/solution/0500-0599/0506.Relative%20Ranks/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Easy | |
|
||
| 0507 | [Perfect Number](/solution/0500-0599/0507.Perfect%20Number/README_EN.md) | `Math` | Easy | |
|
||
| 0508 | [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 | [Fibonacci Number](/solution/0500-0599/0509.Fibonacci%20Number/README_EN.md) | `Recursion`,`Memoization`,`Math`,`Dynamic Programming` | Easy | |
|
||
| 0510 | [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 | [Game Play Analysis I](/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README_EN.md) | `Database` | Easy | |
|
||
| 0512 | [Game Play Analysis II](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 0513 | [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 | [Freedom Trail](/solution/0500-0599/0514.Freedom%20Trail/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`String`,`Dynamic Programming` | Hard | |
|
||
| 0515 | [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 | [Longest Palindromic Subsequence](/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README_EN.md) | `String`,`Dynamic Programming` | Medium | |
|
||
| 0517 | [Super Washing Machines](/solution/0500-0599/0517.Super%20Washing%20Machines/README_EN.md) | `Greedy`,`Array` | Hard | |
|
||
| 0518 | [Coin Change II](/solution/0500-0599/0518.Coin%20Change%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | |
|
||
| 0519 | [Random Flip Matrix](/solution/0500-0599/0519.Random%20Flip%20Matrix/README_EN.md) | `Reservoir Sampling`,`Hash Table`,`Math`,`Randomized` | Medium | |
|
||
| 0520 | [Detect Capital](/solution/0500-0599/0520.Detect%20Capital/README_EN.md) | `String` | Easy | |
|
||
| 0521 | [Longest Uncommon Subsequence I](/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README_EN.md) | `String` | Easy | |
|
||
| 0522 | [Longest Uncommon Subsequence II](/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`String`,`Sorting` | Medium | |
|
||
| 0523 | [Continuous Subarray Sum](/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README_EN.md) | `Array`,`Hash Table`,`Math`,`Prefix Sum` | Medium | |
|
||
| 0524 | [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 | [Contiguous Array](/solution/0500-0599/0525.Contiguous%20Array/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | |
|
||
| 0526 | [Beautiful Arrangement](/solution/0500-0599/0526.Beautiful%20Arrangement/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | |
|
||
| 0527 | [Word Abbreviation](/solution/0500-0599/0527.Word%20Abbreviation/README_EN.md) | `Greedy`,`Trie`,`Array`,`String`,`Sorting` | Hard | 🔒 |
|
||
| 0528 | [Random Pick with Weight](/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README_EN.md) | `Array`,`Math`,`Binary Search`,`Prefix Sum`,`Randomized` | Medium | |
|
||
| 0529 | [Minesweeper](/solution/0500-0599/0529.Minesweeper/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | |
|
||
| 0530 | [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 | [Lonely Pixel I](/solution/0500-0599/0531.Lonely%20Pixel%20I/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | 🔒 |
|
||
| 0532 | [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 | [Lonely Pixel II](/solution/0500-0599/0533.Lonely%20Pixel%20II/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | 🔒 |
|
||
| 0534 | [Game Play Analysis III](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 0535 | [Encode and Decode TinyURL](/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README_EN.md) | `Design`,`Hash Table`,`String`,`Hash Function` | Medium | |
|
||
| 0536 | [Construct Binary Tree from String](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | 🔒 |
|
||
| 0537 | [Complex Number Multiplication](/solution/0500-0599/0537.Complex%20Number%20Multiplication/README_EN.md) | `Math`,`String`,`Simulation` | Medium | |
|
||
| 0538 | [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 | [Minimum Time Difference](/solution/0500-0599/0539.Minimum%20Time%20Difference/README_EN.md) | `Array`,`Math`,`String`,`Sorting` | Medium | |
|
||
| 0540 | [Single Element in a Sorted Array](/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | |
|
||
| 0541 | [Reverse String II](/solution/0500-0599/0541.Reverse%20String%20II/README_EN.md) | `Two Pointers`,`String` | Easy | |
|
||
| 0542 | [01 Matrix](/solution/0500-0599/0542.01%20Matrix/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | |
|
||
| 0543 | [Diameter of Binary Tree](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | |
|
||
| 0544 | [Output Contest Matches](/solution/0500-0599/0544.Output%20Contest%20Matches/README_EN.md) | `Recursion`,`String`,`Simulation` | Medium | 🔒 |
|
||
| 0545 | [Boundary of Binary Tree](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 |
|
||
| 0546 | [Remove Boxes](/solution/0500-0599/0546.Remove%20Boxes/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Hard | |
|
||
| 0547 | [Number of Provinces](/solution/0500-0599/0547.Number%20of%20Provinces/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | |
|
||
| 0548 | [Split Array with Equal Sum](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Hard | 🔒 |
|
||
| 0549 | [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 | [Game Play Analysis IV](/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README_EN.md) | `Database` | Medium | |
|
||
| 0551 | [Student Attendance Record I](/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README_EN.md) | `String` | Easy | |
|
||
| 0552 | [Student Attendance Record II](/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README_EN.md) | `Dynamic Programming` | Hard | |
|
||
| 0553 | [Optimal Division](/solution/0500-0599/0553.Optimal%20Division/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | |
|
||
| 0554 | [Brick Wall](/solution/0500-0599/0554.Brick%20Wall/README_EN.md) | `Array`,`Hash Table` | Medium | |
|
||
| 0555 | [Split Concatenated Strings](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README_EN.md) | `Greedy`,`Array`,`String` | Medium | 🔒 |
|
||
| 0556 | [Next Greater Element III](/solution/0500-0599/0556.Next%20Greater%20Element%20III/README_EN.md) | `Math`,`Two Pointers`,`String` | Medium | |
|
||
| 0557 | [Reverse Words in a String III](/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README_EN.md) | `Two Pointers`,`String` | Easy | |
|
||
| 0558 | [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 | [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 | [Subarray Sum Equals K](/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | |
|
||
| 0561 | [Array Partition](/solution/0500-0599/0561.Array%20Partition/README_EN.md) | `Greedy`,`Array`,`Counting Sort`,`Sorting` | Easy | |
|
||
| 0562 | [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 | [Binary Tree Tilt](/solution/0500-0599/0563.Binary%20Tree%20Tilt/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | |
|
||
| 0564 | [Find the Closest Palindrome](/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README_EN.md) | `Math`,`String` | Hard | |
|
||
| 0565 | [Array Nesting](/solution/0500-0599/0565.Array%20Nesting/README_EN.md) | `Depth-First Search`,`Array` | Medium | |
|
||
| 0566 | [Reshape the Matrix](/solution/0500-0599/0566.Reshape%20the%20Matrix/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | |
|
||
| 0567 | [Permutation in String](/solution/0500-0599/0567.Permutation%20in%20String/README_EN.md) | `Hash Table`,`Two Pointers`,`String`,`Sliding Window` | Medium | |
|
||
| 0568 | [Maximum Vacation Days](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | 🔒 |
|
||
| 0569 | [Median Employee Salary](/solution/0500-0599/0569.Median%20Employee%20Salary/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 0570 | [Managers with at Least 5 Direct Reports](/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README_EN.md) | `Database` | Medium | |
|
||
| 0571 | [Find Median Given Frequency of Numbers](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 0572 | [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 | [Squirrel Simulation](/solution/0500-0599/0573.Squirrel%20Simulation/README_EN.md) | `Array`,`Math` | Medium | 🔒 |
|
||
| 0574 | [Winning Candidate](/solution/0500-0599/0574.Winning%20Candidate/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 0575 | [Distribute Candies](/solution/0500-0599/0575.Distribute%20Candies/README_EN.md) | `Array`,`Hash Table` | Easy | |
|
||
| 0576 | [Out of Boundary Paths](/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README_EN.md) | `Dynamic Programming` | Medium | |
|
||
| 0577 | [Employee Bonus](/solution/0500-0599/0577.Employee%20Bonus/README_EN.md) | `Database` | Easy | |
|
||
| 0578 | [Get Highest Answer Rate Question](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 0579 | [Find Cumulative Salary of an Employee](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 0580 | [Count Student Number in Departments](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 0581 | [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 | [Kill Process](/solution/0500-0599/0582.Kill%20Process/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Medium | 🔒 |
|
||
| 0583 | [Delete Operation for Two Strings](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Medium | |
|
||
| 0584 | [Find Customer Referee](/solution/0500-0599/0584.Find%20Customer%20Referee/README_EN.md) | `Database` | Easy | |
|
||
| 0585 | [Investments in 2016](/solution/0500-0599/0585.Investments%20in%202016/README_EN.md) | `Database` | Medium | |
|
||
| 0586 | [Customer Placing the Largest Number of Orders](/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README_EN.md) | `Database` | Easy | |
|
||
| 0587 | [Erect the Fence](/solution/0500-0599/0587.Erect%20the%20Fence/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | |
|
||
| 0588 | [Design In-Memory File System](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String`,`Sorting` | Hard | 🔒 |
|
||
| 0589 | [N-ary Tree Preorder Traversal](/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search` | Easy | |
|
||
| 0590 | [N-ary Tree Postorder Traversal](/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search` | Easy | |
|
||
| 0591 | [Tag Validator](/solution/0500-0599/0591.Tag%20Validator/README_EN.md) | `Stack`,`String` | Hard | |
|
||
| 0592 | [Fraction Addition and Subtraction](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README_EN.md) | `Math`,`String`,`Simulation` | Medium | |
|
||
| 0593 | [Valid Square](/solution/0500-0599/0593.Valid%20Square/README_EN.md) | `Geometry`,`Math` | Medium | |
|
||
| 0594 | [Longest Harmonious Subsequence](/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting`,`Sliding Window` | Easy | |
|
||
| 0595 | [Big Countries](/solution/0500-0599/0595.Big%20Countries/README_EN.md) | `Database` | Easy | |
|
||
| 0596 | [Classes With at Least 5 Students](/solution/0500-0599/0596.Classes%20With%20at%20Least%205%20Students/README_EN.md) | `Database` | Easy | |
|
||
| 0597 | [Friend Requests I Overall Acceptance Rate](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 0598 | [Range Addition II](/solution/0500-0599/0598.Range%20Addition%20II/README_EN.md) | `Array`,`Math` | Easy | |
|
||
| 0599 | [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 | [Non-negative Integers without Consecutive Ones](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README_EN.md) | `Dynamic Programming` | Hard | |
|
||
| 0601 | [Human Traffic of Stadium](/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README_EN.md) | `Database` | Hard | |
|
||
| 0602 | [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 | [Consecutive Available Seats](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 0604 | [Design Compressed String Iterator](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README_EN.md) | `Design`,`Array`,`String`,`Iterator` | Easy | 🔒 |
|
||
| 0605 | [Can Place Flowers](/solution/0600-0699/0605.Can%20Place%20Flowers/README_EN.md) | `Greedy`,`Array` | Easy | |
|
||
| 0606 | [Construct String from Binary Tree](/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | |
|
||
| 0607 | [Sales Person](/solution/0600-0699/0607.Sales%20Person/README_EN.md) | `Database` | Easy | |
|
||
| 0608 | [Tree Node](/solution/0600-0699/0608.Tree%20Node/README_EN.md) | `Database` | Medium | |
|
||
| 0609 | [Find Duplicate File in System](/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | |
|
||
| 0610 | [Triangle Judgement](/solution/0600-0699/0610.Triangle%20Judgement/README_EN.md) | `Database` | Easy | |
|
||
| 0611 | [Valid Triangle Number](/solution/0600-0699/0611.Valid%20Triangle%20Number/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | |
|
||
| 0612 | [Shortest Distance in a Plane](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 0613 | [Shortest Distance in a Line](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 0614 | [Second Degree Follower](/solution/0600-0699/0614.Second%20Degree%20Follower/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 0615 | [Average Salary Departments VS Company](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 0616 | [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 | [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 | [Students Report By Geography](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 0619 | [Biggest Single Number](/solution/0600-0699/0619.Biggest%20Single%20Number/README_EN.md) | `Database` | Easy | |
|
||
| 0620 | [Not Boring Movies](/solution/0600-0699/0620.Not%20Boring%20Movies/README_EN.md) | `Database` | Easy | |
|
||
| 0621 | [Task Scheduler](/solution/0600-0699/0621.Task%20Scheduler/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | |
|
||
| 0622 | [Design Circular Queue](/solution/0600-0699/0622.Design%20Circular%20Queue/README_EN.md) | `Design`,`Queue`,`Array`,`Linked List` | Medium | |
|
||
| 0623 | [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 | [Maximum Distance in Arrays](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README_EN.md) | `Greedy`,`Array` | Medium | |
|
||
| 0625 | [Minimum Factorization](/solution/0600-0699/0625.Minimum%20Factorization/README_EN.md) | `Greedy`,`Math` | Medium | 🔒 |
|
||
| 0626 | [Exchange Seats](/solution/0600-0699/0626.Exchange%20Seats/README_EN.md) | `Database` | Medium | |
|
||
| 0627 | [Swap Salary](/solution/0600-0699/0627.Swap%20Salary/README_EN.md) | `Database` | Easy | |
|
||
| 0628 | [Maximum Product of Three Numbers](/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README_EN.md) | `Array`,`Math`,`Sorting` | Easy | |
|
||
| 0629 | [K Inverse Pairs Array](/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README_EN.md) | `Dynamic Programming` | Hard | |
|
||
| 0630 | [Course Schedule III](/solution/0600-0699/0630.Course%20Schedule%20III/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | |
|
||
| 0631 | [Design Excel Sum Formula](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README_EN.md) | `Graph`,`Design`,`Topological Sort`,`Array`,`Hash Table`,`String`,`Matrix` | Hard | 🔒 |
|
||
| 0632 | [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 | [Sum of Square Numbers](/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README_EN.md) | `Math`,`Two Pointers`,`Binary Search` | Medium | |
|
||
| 0634 | [Find the Derangement of An Array](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | 🔒 |
|
||
| 0635 | [Design Log Storage System](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README_EN.md) | `Design`,`Hash Table`,`String`,`Ordered Set` | Medium | 🔒 |
|
||
| 0636 | [Exclusive Time of Functions](/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README_EN.md) | `Stack`,`Array` | Medium | |
|
||
| 0637 | [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 | [Shopping Offers](/solution/0600-0699/0638.Shopping%20Offers/README_EN.md) | `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | |
|
||
| 0639 | [Decode Ways II](/solution/0600-0699/0639.Decode%20Ways%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | |
|
||
| 0640 | [Solve the Equation](/solution/0600-0699/0640.Solve%20the%20Equation/README_EN.md) | `Math`,`String`,`Simulation` | Medium | |
|
||
| 0641 | [Design Circular Deque](/solution/0600-0699/0641.Design%20Circular%20Deque/README_EN.md) | `Design`,`Queue`,`Array`,`Linked List` | Medium | |
|
||
| 0642 | [Design Search Autocomplete System](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README_EN.md) | `Depth-First Search`,`Design`,`Trie`,`String`,`Data Stream`,`Sorting`,`Heap (Priority Queue)` | Hard | 🔒 |
|
||
| 0643 | [Maximum Average Subarray I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README_EN.md) | `Array`,`Sliding Window` | Easy | |
|
||
| 0644 | [Maximum Average Subarray II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum` | Hard | 🔒 |
|
||
| 0645 | [Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Sorting` | Easy | |
|
||
| 0646 | [Maximum Length of Pair Chain](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | |
|
||
| 0647 | [Palindromic Substrings](/solution/0600-0699/0647.Palindromic%20Substrings/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Medium | |
|
||
| 0648 | [Replace Words](/solution/0600-0699/0648.Replace%20Words/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | |
|
||
| 0649 | [Dota2 Senate](/solution/0600-0699/0649.Dota2%20Senate/README_EN.md) | `Greedy`,`Queue`,`String` | Medium | |
|
||
| 0650 | [2 Keys Keyboard](/solution/0600-0699/0650.2%20Keys%20Keyboard/README_EN.md) | `Math`,`Dynamic Programming` | Medium | |
|
||
| 0651 | [4 Keys Keyboard](/solution/0600-0699/0651.4%20Keys%20Keyboard/README_EN.md) | `Math`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 0652 | [Find Duplicate Subtrees](/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree` | Medium | |
|
||
| 0653 | [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 | [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 | [Print Binary Tree](/solution/0600-0699/0655.Print%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | |
|
||
| 0656 | [Coin Path](/solution/0600-0699/0656.Coin%20Path/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 |
|
||
| 0657 | [Robot Return to Origin](/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README_EN.md) | `String`,`Simulation` | Easy | |
|
||
| 0658 | [Find K Closest Elements](/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting`,`Sliding Window`,`Heap (Priority Queue)` | Medium | |
|
||
| 0659 | [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 | [Remove 9](/solution/0600-0699/0660.Remove%209/README_EN.md) | `Math` | Hard | 🔒 |
|
||
| 0661 | [Image Smoother](/solution/0600-0699/0661.Image%20Smoother/README_EN.md) | `Array`,`Matrix` | Easy | |
|
||
| 0662 | [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 | [Equal Tree Partition](/solution/0600-0699/0663.Equal%20Tree%20Partition/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 |
|
||
| 0664 | [Strange Printer](/solution/0600-0699/0664.Strange%20Printer/README_EN.md) | `String`,`Dynamic Programming` | Hard | |
|
||
| 0665 | [Non-decreasing Array](/solution/0600-0699/0665.Non-decreasing%20Array/README_EN.md) | `Array` | Medium | |
|
||
| 0666 | [Path Sum IV](/solution/0600-0699/0666.Path%20Sum%20IV/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Binary Tree` | Medium | 🔒 |
|
||
| 0667 | [Beautiful Arrangement II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README_EN.md) | `Array`,`Math` | Medium | |
|
||
| 0668 | [Kth Smallest Number in Multiplication Table](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README_EN.md) | `Math`,`Binary Search` | Hard | |
|
||
| 0669 | [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 | [Maximum Swap](/solution/0600-0699/0670.Maximum%20Swap/README_EN.md) | `Greedy`,`Math` | Medium | |
|
||
| 0671 | [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 | [Bulb Switcher II](/solution/0600-0699/0672.Bulb%20Switcher%20II/README_EN.md) | `Bit Manipulation`,`Depth-First Search`,`Breadth-First Search`,`Math` | Medium | |
|
||
| 0673 | [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 | [Longest Continuous Increasing Subsequence](/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README_EN.md) | `Array` | Easy | |
|
||
| 0675 | [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 | [Implement Magic Dictionary](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README_EN.md) | `Depth-First Search`,`Design`,`Trie`,`Hash Table`,`String` | Medium | |
|
||
| 0677 | [Map Sum Pairs](/solution/0600-0699/0677.Map%20Sum%20Pairs/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | |
|
||
| 0678 | [Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Dynamic Programming` | Medium | |
|
||
| 0679 | [24 Game](/solution/0600-0699/0679.24%20Game/README_EN.md) | `Array`,`Math`,`Backtracking` | Hard | |
|
||
| 0680 | [Valid Palindrome II](/solution/0600-0699/0680.Valid%20Palindrome%20II/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Easy | |
|
||
| 0681 | [Next Closest Time](/solution/0600-0699/0681.Next%20Closest%20Time/README_EN.md) | `Hash Table`,`String`,`Backtracking`,`Enumeration` | Medium | 🔒 |
|
||
| 0682 | [Baseball Game](/solution/0600-0699/0682.Baseball%20Game/README_EN.md) | `Stack`,`Array`,`Simulation` | Easy | |
|
||
| 0683 | [K Empty Slots](/solution/0600-0699/0683.K%20Empty%20Slots/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Queue`,`Array`,`Ordered Set`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | 🔒 |
|
||
| 0684 | [Redundant Connection](/solution/0600-0699/0684.Redundant%20Connection/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | |
|
||
| 0685 | [Redundant Connection II](/solution/0600-0699/0685.Redundant%20Connection%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Hard | |
|
||
| 0686 | [Repeated String Match](/solution/0600-0699/0686.Repeated%20String%20Match/README_EN.md) | `String`,`String Matching` | Medium | |
|
||
| 0687 | [Longest Univalue Path](/solution/0600-0699/0687.Longest%20Univalue%20Path/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | |
|
||
| 0688 | [Knight Probability in Chessboard](/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README_EN.md) | `Dynamic Programming` | Medium | |
|
||
| 0689 | [Maximum Sum of 3 Non-Overlapping Subarrays](/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum`,`Sliding Window` | Hard | |
|
||
| 0690 | [Employee Importance](/solution/0600-0699/0690.Employee%20Importance/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Medium | |
|
||
| 0691 | [Stickers to Spell Word](/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README_EN.md) | `Bit Manipulation`,`Memoization`,`Array`,`Hash Table`,`String`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | |
|
||
| 0692 | [Top K Frequent Words](/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Bucket Sort`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | |
|
||
| 0693 | [Binary Number with Alternating Bits](/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README_EN.md) | `Bit Manipulation` | Easy | |
|
||
| 0694 | [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 | [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 | [Count Binary Substrings](/solution/0600-0699/0696.Count%20Binary%20Substrings/README_EN.md) | `Two Pointers`,`String` | Easy | |
|
||
| 0697 | [Degree of an Array](/solution/0600-0699/0697.Degree%20of%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | |
|
||
| 0698 | [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 | [Falling Squares](/solution/0600-0699/0699.Falling%20Squares/README_EN.md) | `Segment Tree`,`Array`,`Ordered Set` | Hard | |
|
||
| 0700 | [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 | [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 | [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 | [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 | [Binary Search](/solution/0700-0799/0704.Binary%20Search/README_EN.md) | `Array`,`Binary Search` | Easy | |
|
||
| 0705 | [Design HashSet](/solution/0700-0799/0705.Design%20HashSet/README_EN.md) | `Design`,`Array`,`Hash Table`,`Linked List`,`Hash Function` | Easy | |
|
||
| 0706 | [Design HashMap](/solution/0700-0799/0706.Design%20HashMap/README_EN.md) | `Design`,`Array`,`Hash Table`,`Linked List`,`Hash Function` | Easy | |
|
||
| 0707 | [Design Linked List](/solution/0700-0799/0707.Design%20Linked%20List/README_EN.md) | `Design`,`Linked List` | Medium | |
|
||
| 0708 | [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 | [To Lower Case](/solution/0700-0799/0709.To%20Lower%20Case/README_EN.md) | `String` | Easy | |
|
||
| 0710 | [Random Pick with Blacklist](/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README_EN.md) | `Array`,`Hash Table`,`Math`,`Binary Search`,`Sorting`,`Randomized` | Hard | |
|
||
| 0711 | [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 | [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 | [Subarray Product Less Than K](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | |
|
||
| 0714 | [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 | [Range Module](/solution/0700-0799/0715.Range%20Module/README_EN.md) | `Design`,`Segment Tree`,`Ordered Set` | Hard | |
|
||
| 0716 | [Max Stack](/solution/0700-0799/0716.Max%20Stack/README_EN.md) | `Stack`,`Design`,`Linked List`,`Doubly-Linked List`,`Ordered Set` | Hard | 🔒 |
|
||
| 0717 | [1-bit and 2-bit Characters](/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README_EN.md) | `Array` | Easy | |
|
||
| 0718 | [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 | [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 | [Longest Word in Dictionary](/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | |
|
||
| 0721 | [Accounts Merge](/solution/0700-0799/0721.Accounts%20Merge/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | |
|
||
| 0722 | [Remove Comments](/solution/0700-0799/0722.Remove%20Comments/README_EN.md) | `Array`,`String` | Medium | |
|
||
| 0723 | [Candy Crush](/solution/0700-0799/0723.Candy%20Crush/README_EN.md) | `Array`,`Two Pointers`,`Matrix`,`Simulation` | Medium | 🔒 |
|
||
| 0724 | [Find Pivot Index](/solution/0700-0799/0724.Find%20Pivot%20Index/README_EN.md) | `Array`,`Prefix Sum` | Easy | |
|
||
| 0725 | [Split Linked List in Parts](/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README_EN.md) | `Linked List` | Medium | |
|
||
| 0726 | [Number of Atoms](/solution/0700-0799/0726.Number%20of%20Atoms/README_EN.md) | `Stack`,`Hash Table`,`String`,`Sorting` | Hard | |
|
||
| 0727 | [Minimum Window Subsequence](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README_EN.md) | `String`,`Dynamic Programming`,`Sliding Window` | Hard | 🔒 |
|
||
| 0728 | [Self Dividing Numbers](/solution/0700-0799/0728.Self%20Dividing%20Numbers/README_EN.md) | `Math` | Easy | |
|
||
| 0729 | [My Calendar I](/solution/0700-0799/0729.My%20Calendar%20I/README_EN.md) | `Design`,`Segment Tree`,`Array`,`Binary Search`,`Ordered Set` | Medium | |
|
||
| 0730 | [Count Different Palindromic Subsequences](/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | |
|
||
| 0731 | [My Calendar II](/solution/0700-0799/0731.My%20Calendar%20II/README_EN.md) | `Design`,`Segment Tree`,`Array`,`Binary Search`,`Ordered Set`,`Prefix Sum` | Medium | |
|
||
| 0732 | [My Calendar III](/solution/0700-0799/0732.My%20Calendar%20III/README_EN.md) | `Design`,`Segment Tree`,`Binary Search`,`Ordered Set`,`Prefix Sum` | Hard | |
|
||
| 0733 | [Flood Fill](/solution/0700-0799/0733.Flood%20Fill/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Easy | |
|
||
| 0734 | [Sentence Similarity](/solution/0700-0799/0734.Sentence%20Similarity/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | 🔒 |
|
||
| 0735 | [Asteroid Collision](/solution/0700-0799/0735.Asteroid%20Collision/README_EN.md) | `Stack`,`Array`,`Simulation` | Medium | |
|
||
| 0736 | [Parse Lisp Expression](/solution/0700-0799/0736.Parse%20Lisp%20Expression/README_EN.md) | `Stack`,`Recursion`,`Hash Table`,`String` | Hard | |
|
||
| 0737 | [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 | [Monotone Increasing Digits](/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README_EN.md) | `Greedy`,`Math` | Medium | |
|
||
| 0739 | [Daily Temperatures](/solution/0700-0799/0739.Daily%20Temperatures/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | |
|
||
| 0740 | [Delete and Earn](/solution/0700-0799/0740.Delete%20and%20Earn/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | |
|
||
| 0741 | [Cherry Pickup](/solution/0700-0799/0741.Cherry%20Pickup/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | |
|
||
| 0742 | [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 | [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 | [Find Smallest Letter Greater Than Target](/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README_EN.md) | `Array`,`Binary Search` | Easy | |
|
||
| 0745 | [Prefix and Suffix Search](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README_EN.md) | `Design`,`Trie`,`Array`,`Hash Table`,`String` | Hard | |
|
||
| 0746 | [Min Cost Climbing Stairs](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README_EN.md) | `Array`,`Dynamic Programming` | Easy | |
|
||
| 0747 | [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 | [Shortest Completing Word](/solution/0700-0799/0748.Shortest%20Completing%20Word/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | |
|
||
| 0749 | [Contain Virus](/solution/0700-0799/0749.Contain%20Virus/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Simulation` | Hard | |
|
||
| 0750 | [Number Of Corner Rectangles](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Matrix` | Medium | 🔒 |
|
||
| 0751 | [IP to CIDR](/solution/0700-0799/0751.IP%20to%20CIDR/README_EN.md) | `Bit Manipulation`,`String` | Medium | 🔒 |
|
||
| 0752 | [Open the Lock](/solution/0700-0799/0752.Open%20the%20Lock/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table`,`String` | Medium | |
|
||
| 0753 | [Cracking the Safe](/solution/0700-0799/0753.Cracking%20the%20Safe/README_EN.md) | `Depth-First Search`,`Graph`,`Eulerian Circuit` | Hard | |
|
||
| 0754 | [Reach a Number](/solution/0700-0799/0754.Reach%20a%20Number/README_EN.md) | `Math`,`Binary Search` | Medium | |
|
||
| 0755 | [Pour Water](/solution/0700-0799/0755.Pour%20Water/README_EN.md) | `Array`,`Simulation` | Medium | 🔒 |
|
||
| 0756 | [Pyramid Transition Matrix](/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README_EN.md) | `Bit Manipulation`,`Depth-First Search`,`Breadth-First Search` | Medium | |
|
||
| 0757 | [Set Intersection Size At Least Two](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | |
|
||
| 0758 | [Bold Words in String](/solution/0700-0799/0758.Bold%20Words%20in%20String/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`String Matching` | Medium | 🔒 |
|
||
| 0759 | [Employee Free Time](/solution/0700-0799/0759.Employee%20Free%20Time/README_EN.md) | `Array`,`Sorting`,`Line Sweep`,`Heap (Priority Queue)` | Hard | 🔒 |
|
||
| 0760 | [Find Anagram Mappings](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README_EN.md) | `Array`,`Hash Table` | Easy | 🔒 |
|
||
| 0761 | [Special Binary String](/solution/0700-0799/0761.Special%20Binary%20String/README_EN.md) | `Recursion`,`String` | Hard | |
|
||
| 0762 | [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 | [Partition Labels](/solution/0700-0799/0763.Partition%20Labels/README_EN.md) | `Greedy`,`Hash Table`,`Two Pointers`,`String` | Medium | |
|
||
| 0764 | [Largest Plus Sign](/solution/0700-0799/0764.Largest%20Plus%20Sign/README_EN.md) | `Array`,`Dynamic Programming` | Medium | |
|
||
| 0765 | [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 | [Toeplitz Matrix](/solution/0700-0799/0766.Toeplitz%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | |
|
||
| 0767 | [Reorganize String](/solution/0700-0799/0767.Reorganize%20String/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | |
|
||
| 0768 | [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 | [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 | [Basic Calculator IV](/solution/0700-0799/0770.Basic%20Calculator%20IV/README_EN.md) | `Stack`,`Recursion`,`Hash Table`,`Math`,`String` | Hard | |
|
||
| 0771 | [Jewels and Stones](/solution/0700-0799/0771.Jewels%20and%20Stones/README_EN.md) | `Hash Table`,`String` | Easy | |
|
||
| 0772 | [Basic Calculator III](/solution/0700-0799/0772.Basic%20Calculator%20III/README_EN.md) | `Stack`,`Recursion`,`Math`,`String` | Hard | 🔒 |
|
||
| 0773 | [Sliding Puzzle](/solution/0700-0799/0773.Sliding%20Puzzle/README_EN.md) | `Breadth-First Search`,`Memoization`,`Array`,`Dynamic Programming`,`Backtracking`,`Matrix` | Hard | |
|
||
| 0774 | [Minimize Max Distance to Gas Station](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README_EN.md) | `Array`,`Binary Search` | Hard | 🔒 |
|
||
| 0775 | [Global and Local Inversions](/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README_EN.md) | `Array`,`Math` | Medium | |
|
||
| 0776 | [Split BST](/solution/0700-0799/0776.Split%20BST/README_EN.md) | `Tree`,`Binary Search Tree`,`Recursion`,`Binary Tree` | Medium | 🔒 |
|
||
| 0777 | [Swap Adjacent in LR String](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README_EN.md) | `Two Pointers`,`String` | Medium | |
|
||
| 0778 | [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 | [K-th Symbol in Grammar](/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Medium | |
|
||
| 0780 | [Reaching Points](/solution/0700-0799/0780.Reaching%20Points/README_EN.md) | `Math` | Hard | |
|
||
| 0781 | [Rabbits in Forest](/solution/0700-0799/0781.Rabbits%20in%20Forest/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Math` | Medium | |
|
||
| 0782 | [Transform to Chessboard](/solution/0700-0799/0782.Transform%20to%20Chessboard/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Matrix` | Hard | |
|
||
| 0783 | [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 | [Letter Case Permutation](/solution/0700-0799/0784.Letter%20Case%20Permutation/README_EN.md) | `Bit Manipulation`,`String`,`Backtracking` | Medium | |
|
||
| 0785 | [Is Graph Bipartite](/solution/0700-0799/0785.Is%20Graph%20Bipartite/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | |
|
||
| 0786 | [K-th Smallest Prime Fraction](/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | |
|
||
| 0787 | [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 | [Rotated Digits](/solution/0700-0799/0788.Rotated%20Digits/README_EN.md) | `Math`,`Dynamic Programming` | Medium | |
|
||
| 0789 | [Escape The Ghosts](/solution/0700-0799/0789.Escape%20The%20Ghosts/README_EN.md) | `Array`,`Math` | Medium | |
|
||
| 0790 | [Domino and Tromino Tiling](/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README_EN.md) | `Dynamic Programming` | Medium | |
|
||
| 0791 | [Custom Sort String](/solution/0700-0799/0791.Custom%20Sort%20String/README_EN.md) | `Hash Table`,`String`,`Sorting` | Medium | |
|
||
| 0792 | [Number of Matching Subsequences](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | |
|
||
| 0793 | [Preimage Size of Factorial Zeroes Function](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README_EN.md) | `Math`,`Binary Search` | Hard | |
|
||
| 0794 | [Valid Tic-Tac-Toe State](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README_EN.md) | `Array`,`Matrix` | Medium | |
|
||
| 0795 | [Number of Subarrays with Bounded Maximum](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README_EN.md) | `Array`,`Two Pointers` | Medium | |
|
||
| 0796 | [Rotate String](/solution/0700-0799/0796.Rotate%20String/README_EN.md) | `String`,`String Matching` | Easy | |
|
||
| 0797 | [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 | [Smallest Rotation with Highest Score](/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README_EN.md) | `Array`,`Prefix Sum` | Hard | |
|
||
| 0799 | [Champagne Tower](/solution/0700-0799/0799.Champagne%20Tower/README_EN.md) | `Dynamic Programming` | Medium | |
|
||
| 0800 | [Similar RGB Color](/solution/0800-0899/0800.Similar%20RGB%20Color/README_EN.md) | `Math`,`String`,`Enumeration` | Easy | 🔒 |
|
||
| 0801 | [Minimum Swaps To Make Sequences Increasing](/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README_EN.md) | `Array`,`Dynamic Programming` | Hard | |
|
||
| 0802 | [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 | [Bricks Falling When Hit](/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README_EN.md) | `Union Find`,`Array`,`Matrix` | Hard | |
|
||
| 0804 | [Unique Morse Code Words](/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | |
|
||
| 0805 | [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 | [Number of Lines To Write String](/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README_EN.md) | `Array`,`String` | Easy | |
|
||
| 0807 | [Max Increase to Keep City Skyline](/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | |
|
||
| 0808 | [Soup Servings](/solution/0800-0899/0808.Soup%20Servings/README_EN.md) | `Math`,`Dynamic Programming`,`Probability and Statistics` | Medium | |
|
||
| 0809 | [Expressive Words](/solution/0800-0899/0809.Expressive%20Words/README_EN.md) | `Array`,`Two Pointers`,`String` | Medium | |
|
||
| 0810 | [Chalkboard XOR Game](/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array`,`Math`,`Game Theory` | Hard | |
|
||
| 0811 | [Subdomain Visit Count](/solution/0800-0899/0811.Subdomain%20Visit%20Count/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | |
|
||
| 0812 | [Largest Triangle Area](/solution/0800-0899/0812.Largest%20Triangle%20Area/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | |
|
||
| 0813 | [Largest Sum of Averages](/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | |
|
||
| 0814 | [Binary Tree Pruning](/solution/0800-0899/0814.Binary%20Tree%20Pruning/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | |
|
||
| 0815 | [Bus Routes](/solution/0800-0899/0815.Bus%20Routes/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table` | Hard | |
|
||
| 0816 | [Ambiguous Coordinates](/solution/0800-0899/0816.Ambiguous%20Coordinates/README_EN.md) | `String`,`Backtracking`,`Enumeration` | Medium | |
|
||
| 0817 | [Linked List Components](/solution/0800-0899/0817.Linked%20List%20Components/README_EN.md) | `Array`,`Hash Table`,`Linked List` | Medium | |
|
||
| 0818 | [Race Car](/solution/0800-0899/0818.Race%20Car/README_EN.md) | `Dynamic Programming` | Hard | |
|
||
| 0819 | [Most Common Word](/solution/0800-0899/0819.Most%20Common%20Word/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Easy | |
|
||
| 0820 | [Short Encoding of Words](/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | |
|
||
| 0821 | [Shortest Distance to a Character](/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README_EN.md) | `Array`,`Two Pointers`,`String` | Easy | |
|
||
| 0822 | [Card Flipping Game](/solution/0800-0899/0822.Card%20Flipping%20Game/README_EN.md) | `Array`,`Hash Table` | Medium | |
|
||
| 0823 | [Binary Trees With Factors](/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Sorting` | Medium | |
|
||
| 0824 | [Goat Latin](/solution/0800-0899/0824.Goat%20Latin/README_EN.md) | `String` | Easy | |
|
||
| 0825 | [Friends Of Appropriate Ages](/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | |
|
||
| 0826 | [Most Profit Assigning Work](/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | |
|
||
| 0827 | [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 | [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) | `Hash Table`,`String`,`Dynamic Programming` | Hard | Weekly Contest 83 |
|
||
| 0829 | [Consecutive Numbers Sum](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README_EN.md) | `Math`,`Enumeration` | Hard | Weekly Contest 83 |
|
||
| 0830 | [Positions of Large Groups](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README_EN.md) | `String` | Easy | Weekly Contest 83 |
|
||
| 0831 | [Masking Personal Information](/solution/0800-0899/0831.Masking%20Personal%20Information/README_EN.md) | `String` | Medium | Weekly Contest 83 |
|
||
| 0832 | [Flipping an Image](/solution/0800-0899/0832.Flipping%20an%20Image/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Matrix`,`Simulation` | Easy | Weekly Contest 84 |
|
||
| 0833 | [Find And Replace in String](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 84 |
|
||
| 0834 | [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 | Weekly Contest 84 |
|
||
| 0835 | [Image Overlap](/solution/0800-0899/0835.Image%20Overlap/README_EN.md) | `Array`,`Matrix` | Medium | Weekly Contest 84 |
|
||
| 0836 | [Rectangle Overlap](/solution/0800-0899/0836.Rectangle%20Overlap/README_EN.md) | `Geometry`,`Math` | Easy | Weekly Contest 85 |
|
||
| 0837 | [New 21 Game](/solution/0800-0899/0837.New%2021%20Game/README_EN.md) | `Math`,`Dynamic Programming`,`Sliding Window`,`Probability and Statistics` | Medium | Weekly Contest 85 |
|
||
| 0838 | [Push Dominoes](/solution/0800-0899/0838.Push%20Dominoes/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Medium | Weekly Contest 85 |
|
||
| 0839 | [Similar String Groups](/solution/0800-0899/0839.Similar%20String%20Groups/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String` | Hard | Weekly Contest 85 |
|
||
| 0840 | [Magic Squares In Grid](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README_EN.md) | `Array`,`Hash Table`,`Math`,`Matrix` | Medium | Weekly Contest 86 |
|
||
| 0841 | [Keys and Rooms](/solution/0800-0899/0841.Keys%20and%20Rooms/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 86 |
|
||
| 0842 | [Split Array into Fibonacci Sequence](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README_EN.md) | `String`,`Backtracking` | Medium | Weekly Contest 86 |
|
||
| 0843 | [Guess the Word](/solution/0800-0899/0843.Guess%20the%20Word/README_EN.md) | `Array`,`Math`,`String`,`Game Theory`,`Interactive` | Hard | Weekly Contest 86 |
|
||
| 0844 | [Backspace String Compare](/solution/0800-0899/0844.Backspace%20String%20Compare/README_EN.md) | `Stack`,`Two Pointers`,`String`,`Simulation` | Easy | Weekly Contest 87 |
|
||
| 0845 | [Longest Mountain in Array](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README_EN.md) | `Array`,`Two Pointers`,`Dynamic Programming`,`Enumeration` | Medium | Weekly Contest 87 |
|
||
| 0846 | [Hand of Straights](/solution/0800-0899/0846.Hand%20of%20Straights/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 87 |
|
||
| 0847 | [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 | Weekly Contest 87 |
|
||
| 0848 | [Shifting Letters](/solution/0800-0899/0848.Shifting%20Letters/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Weekly Contest 88 |
|
||
| 0849 | [Maximize Distance to Closest Person](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README_EN.md) | `Array` | Medium | Weekly Contest 88 |
|
||
| 0850 | [Rectangle Area II](/solution/0800-0899/0850.Rectangle%20Area%20II/README_EN.md) | `Segment Tree`,`Array`,`Ordered Set`,`Line Sweep` | Hard | Weekly Contest 88 |
|
||
| 0851 | [Loud and Rich](/solution/0800-0899/0851.Loud%20and%20Rich/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort`,`Array` | Medium | Weekly Contest 88 |
|
||
| 0852 | [Peak Index in a Mountain Array](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 89 |
|
||
| 0853 | [Car Fleet](/solution/0800-0899/0853.Car%20Fleet/README_EN.md) | `Stack`,`Array`,`Sorting`,`Monotonic Stack` | Medium | Weekly Contest 89 |
|
||
| 0854 | [K-Similar Strings](/solution/0800-0899/0854.K-Similar%20Strings/README_EN.md) | `Breadth-First Search`,`String` | Hard | Weekly Contest 89 |
|
||
| 0855 | [Exam Room](/solution/0800-0899/0855.Exam%20Room/README_EN.md) | `Design`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 89 |
|
||
| 0856 | [Score of Parentheses](/solution/0800-0899/0856.Score%20of%20Parentheses/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 90 |
|
||
| 0857 | [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 | Weekly Contest 90 |
|
||
| 0858 | [Mirror Reflection](/solution/0800-0899/0858.Mirror%20Reflection/README_EN.md) | `Geometry`,`Math`,`Number Theory` | Medium | Weekly Contest 90 |
|
||
| 0859 | [Buddy Strings](/solution/0800-0899/0859.Buddy%20Strings/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 90 |
|
||
| 0860 | [Lemonade Change](/solution/0800-0899/0860.Lemonade%20Change/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 91 |
|
||
| 0861 | [Score After Flipping Matrix](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Matrix` | Medium | Weekly Contest 91 |
|
||
| 0862 | [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 | Weekly Contest 91 |
|
||
| 0863 | [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`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 91 |
|
||
| 0864 | [Shortest Path to Get All Keys](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Matrix` | Hard | Weekly Contest 92 |
|
||
| 0865 | [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 | Weekly Contest 92 |
|
||
| 0866 | [Prime Palindrome](/solution/0800-0899/0866.Prime%20Palindrome/README_EN.md) | `Math`,`Number Theory` | Medium | Weekly Contest 92 |
|
||
| 0867 | [Transpose Matrix](/solution/0800-0899/0867.Transpose%20Matrix/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 92 |
|
||
| 0868 | [Binary Gap](/solution/0800-0899/0868.Binary%20Gap/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 93 |
|
||
| 0869 | [Reordered Power of 2](/solution/0800-0899/0869.Reordered%20Power%20of%202/README_EN.md) | `Hash Table`,`Math`,`Counting`,`Enumeration`,`Sorting` | Medium | Weekly Contest 93 |
|
||
| 0870 | [Advantage Shuffle](/solution/0800-0899/0870.Advantage%20Shuffle/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 93 |
|
||
| 0871 | [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 | Weekly Contest 93 |
|
||
| 0872 | [Leaf-Similar Trees](/solution/0800-0899/0872.Leaf-Similar%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | Weekly Contest 94 |
|
||
| 0873 | [Length of Longest Fibonacci Subsequence](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | Weekly Contest 94 |
|
||
| 0874 | [Walking Robot Simulation](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 94 |
|
||
| 0875 | [Koko Eating Bananas](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 94 |
|
||
| 0876 | [Middle of the Linked List](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Easy | Weekly Contest 95 |
|
||
| 0877 | [Stone Game](/solution/0800-0899/0877.Stone%20Game/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | Weekly Contest 95 |
|
||
| 0878 | [Nth Magical Number](/solution/0800-0899/0878.Nth%20Magical%20Number/README_EN.md) | `Math`,`Binary Search` | Hard | Weekly Contest 95 |
|
||
| 0879 | [Profitable Schemes](/solution/0800-0899/0879.Profitable%20Schemes/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 95 |
|
||
| 0880 | [Decoded String at Index](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 96 |
|
||
| 0881 | [Boats to Save People](/solution/0800-0899/0881.Boats%20to%20Save%20People/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 96 |
|
||
| 0882 | [Reachable Nodes In Subdivided Graph](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 96 |
|
||
| 0883 | [Projection Area of 3D Shapes](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README_EN.md) | `Geometry`,`Array`,`Math`,`Matrix` | Easy | Weekly Contest 96 |
|
||
| 0884 | [Uncommon Words from Two Sentences](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 97 |
|
||
| 0885 | [Spiral Matrix III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 97 |
|
||
| 0886 | [Possible Bipartition](/solution/0800-0899/0886.Possible%20Bipartition/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Weekly Contest 97 |
|
||
| 0887 | [Super Egg Drop](/solution/0800-0899/0887.Super%20Egg%20Drop/README_EN.md) | `Math`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 97 |
|
||
| 0888 | [Fair Candy Swap](/solution/0800-0899/0888.Fair%20Candy%20Swap/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sorting` | Easy | Weekly Contest 98 |
|
||
| 0889 | [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 | Weekly Contest 98 |
|
||
| 0890 | [Find and Replace Pattern](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 98 |
|
||
| 0891 | [Sum of Subsequence Widths](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README_EN.md) | `Array`,`Math`,`Sorting` | Hard | Weekly Contest 98 |
|
||
| 0892 | [Surface Area of 3D Shapes](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README_EN.md) | `Geometry`,`Array`,`Math`,`Matrix` | Easy | Weekly Contest 99 |
|
||
| 0893 | [Groups of Special-Equivalent Strings](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 99 |
|
||
| 0894 | [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 | Weekly Contest 99 |
|
||
| 0895 | [Maximum Frequency Stack](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README_EN.md) | `Stack`,`Design`,`Hash Table`,`Ordered Set` | Hard | Weekly Contest 99 |
|
||
| 0896 | [Monotonic Array](/solution/0800-0899/0896.Monotonic%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 100 |
|
||
| 0897 | [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 | Weekly Contest 100 |
|
||
| 0898 | [Bitwise ORs of Subarrays](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 100 |
|
||
| 0899 | [Orderly Queue](/solution/0800-0899/0899.Orderly%20Queue/README_EN.md) | `Math`,`String`,`Sorting` | Hard | Weekly Contest 100 |
|
||
| 0900 | [RLE Iterator](/solution/0900-0999/0900.RLE%20Iterator/README_EN.md) | `Design`,`Array`,`Counting`,`Iterator` | Medium | Weekly Contest 101 |
|
||
| 0901 | [Online Stock Span](/solution/0900-0999/0901.Online%20Stock%20Span/README_EN.md) | `Stack`,`Design`,`Data Stream`,`Monotonic Stack` | Medium | Weekly Contest 101 |
|
||
| 0902 | [Numbers At Most N Given Digit Set](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README_EN.md) | `Array`,`Math`,`String`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 101 |
|
||
| 0903 | [Valid Permutations for DI Sequence](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 101 |
|
||
| 0904 | [Fruit Into Baskets](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 102 |
|
||
| 0905 | [Sort Array By Parity](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 102 |
|
||
| 0906 | [Super Palindromes](/solution/0900-0999/0906.Super%20Palindromes/README_EN.md) | `Math`,`String`,`Enumeration` | Hard | Weekly Contest 102 |
|
||
| 0907 | [Sum of Subarray Minimums](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Medium | Weekly Contest 102 |
|
||
| 0908 | [Smallest Range I](/solution/0900-0999/0908.Smallest%20Range%20I/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 103 |
|
||
| 0909 | [Snakes and Ladders](/solution/0900-0999/0909.Snakes%20and%20Ladders/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 103 |
|
||
| 0910 | [Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | Weekly Contest 103 |
|
||
| 0911 | [Online Election](/solution/0900-0999/0911.Online%20Election/README_EN.md) | `Design`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 103 |
|
||
| 0912 | [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 | [Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README_EN.md) | `Graph`,`Topological Sort`,`Memoization`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | Weekly Contest 104 |
|
||
| 0914 | [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 | Weekly Contest 104 |
|
||
| 0915 | [Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README_EN.md) | `Array` | Medium | Weekly Contest 104 |
|
||
| 0916 | [Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 104 |
|
||
| 0917 | [Reverse Only Letters](/solution/0900-0999/0917.Reverse%20Only%20Letters/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 105 |
|
||
| 0918 | [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 | Weekly Contest 105 |
|
||
| 0919 | [Complete Binary Tree Inserter](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README_EN.md) | `Tree`,`Breadth-First Search`,`Design`,`Binary Tree` | Medium | Weekly Contest 105 |
|
||
| 0920 | [Number of Music Playlists](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 105 |
|
||
| 0921 | [Minimum Add to Make Parentheses Valid](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Weekly Contest 106 |
|
||
| 0922 | [Sort Array By Parity II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 106 |
|
||
| 0923 | [3Sum With Multiplicity](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Counting`,`Sorting` | Medium | Weekly Contest 106 |
|
||
| 0924 | [Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Hard | Weekly Contest 106 |
|
||
| 0925 | [Long Pressed Name](/solution/0900-0999/0925.Long%20Pressed%20Name/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 107 |
|
||
| 0926 | [Flip String to Monotone Increasing](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README_EN.md) | `String`,`Dynamic Programming` | Medium | Weekly Contest 107 |
|
||
| 0927 | [Three Equal Parts](/solution/0900-0999/0927.Three%20Equal%20Parts/README_EN.md) | `Array`,`Math` | Hard | Weekly Contest 107 |
|
||
| 0928 | [Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Hard | Weekly Contest 107 |
|
||
| 0929 | [Unique Email Addresses](/solution/0900-0999/0929.Unique%20Email%20Addresses/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 108 |
|
||
| 0930 | [Binary Subarrays With Sum](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 108 |
|
||
| 0931 | [Minimum Falling Path Sum](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 108 |
|
||
| 0932 | [Beautiful Array](/solution/0900-0999/0932.Beautiful%20Array/README_EN.md) | `Array`,`Math`,`Divide and Conquer` | Medium | Weekly Contest 108 |
|
||
| 0933 | [Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md) | `Design`,`Queue`,`Data Stream` | Easy | Weekly Contest 109 |
|
||
| 0934 | [Shortest Bridge](/solution/0900-0999/0934.Shortest%20Bridge/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 109 |
|
||
| 0935 | [Knight Dialer](/solution/0900-0999/0935.Knight%20Dialer/README_EN.md) | `Dynamic Programming` | Medium | Weekly Contest 109 |
|
||
| 0936 | [Stamping The Sequence](/solution/0900-0999/0936.Stamping%20The%20Sequence/README_EN.md) | `Stack`,`Greedy`,`Queue`,`String` | Hard | Weekly Contest 109 |
|
||
| 0937 | [Reorder Data in Log Files](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README_EN.md) | `Array`,`String`,`Sorting` | Medium | Weekly Contest 110 |
|
||
| 0938 | [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 | Weekly Contest 110 |
|
||
| 0939 | [Minimum Area Rectangle](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README_EN.md) | `Geometry`,`Array`,`Hash Table`,`Math`,`Sorting` | Medium | Weekly Contest 110 |
|
||
| 0940 | [Distinct Subsequences II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 110 |
|
||
| 0941 | [Valid Mountain Array](/solution/0900-0999/0941.Valid%20Mountain%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 111 |
|
||
| 0942 | [DI String Match](/solution/0900-0999/0942.DI%20String%20Match/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`String` | Easy | Weekly Contest 111 |
|
||
| 0943 | [Find the Shortest Superstring](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 111 |
|
||
| 0944 | [Delete Columns to Make Sorted](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 111 |
|
||
| 0945 | [Minimum Increment to Make Array Unique](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README_EN.md) | `Greedy`,`Array`,`Counting`,`Sorting` | Medium | Weekly Contest 112 |
|
||
| 0946 | [Validate Stack Sequences](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README_EN.md) | `Stack`,`Array`,`Simulation` | Medium | Weekly Contest 112 |
|
||
| 0947 | [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`,`Hash Table` | Medium | Weekly Contest 112 |
|
||
| 0948 | [Bag of Tokens](/solution/0900-0999/0948.Bag%20of%20Tokens/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 112 |
|
||
| 0949 | [Largest Time for Given Digits](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README_EN.md) | `Array`,`String`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 113 |
|
||
| 0950 | [Reveal Cards In Increasing Order](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README_EN.md) | `Queue`,`Array`,`Sorting`,`Simulation` | Medium | Weekly Contest 113 |
|
||
| 0951 | [Flip Equivalent Binary Trees](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 113 |
|
||
| 0952 | [Largest Component Size by Common Factor](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README_EN.md) | `Union Find`,`Array`,`Hash Table`,`Math`,`Number Theory` | Hard | Weekly Contest 113 |
|
||
| 0953 | [Verifying an Alien Dictionary](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 114 |
|
||
| 0954 | [Array of Doubled Pairs](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 114 |
|
||
| 0955 | [Delete Columns to Make Sorted II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README_EN.md) | `Greedy`,`Array`,`String` | Medium | Weekly Contest 114 |
|
||
| 0956 | [Tallest Billboard](/solution/0900-0999/0956.Tallest%20Billboard/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 114 |
|
||
| 0957 | [Prison Cells After N Days](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math` | Medium | Weekly Contest 115 |
|
||
| 0958 | [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 | Weekly Contest 115 |
|
||
| 0959 | [Regions Cut By Slashes](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 115 |
|
||
| 0960 | [Delete Columns to Make Sorted III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Hard | Weekly Contest 115 |
|
||
| 0961 | [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 | Weekly Contest 116 |
|
||
| 0962 | [Maximum Width Ramp](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README_EN.md) | `Stack`,`Array`,`Two Pointers`,`Monotonic Stack` | Medium | Weekly Contest 116 |
|
||
| 0963 | [Minimum Area Rectangle II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | Weekly Contest 116 |
|
||
| 0964 | [Least Operators to Express Number](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Hard | Weekly Contest 116 |
|
||
| 0965 | [Univalued Binary Tree](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | Weekly Contest 117 |
|
||
| 0966 | [Vowel Spellchecker](/solution/0900-0999/0966.Vowel%20Spellchecker/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 117 |
|
||
| 0967 | [Numbers With Same Consecutive Differences](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README_EN.md) | `Breadth-First Search`,`Backtracking` | Medium | Weekly Contest 117 |
|
||
| 0968 | [Binary Tree Cameras](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Hard | Weekly Contest 117 |
|
||
| 0969 | [Pancake Sorting](/solution/0900-0999/0969.Pancake%20Sorting/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 118 |
|
||
| 0970 | [Powerful Integers](/solution/0900-0999/0970.Powerful%20Integers/README_EN.md) | `Hash Table`,`Math`,`Enumeration` | Medium | Weekly Contest 118 |
|
||
| 0971 | [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 | Weekly Contest 118 |
|
||
| 0972 | [Equal Rational Numbers](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README_EN.md) | `Math`,`String` | Hard | Weekly Contest 118 |
|
||
| 0973 | [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 | Weekly Contest 119 |
|
||
| 0974 | [Subarray Sums Divisible by K](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 119 |
|
||
| 0975 | [Odd Even Jump](/solution/0900-0999/0975.Odd%20Even%20Jump/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Ordered Set`,`Sorting`,`Monotonic Stack` | Hard | Weekly Contest 119 |
|
||
| 0976 | [Largest Perimeter Triangle](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Easy | Weekly Contest 119 |
|
||
| 0977 | [Squares of a Sorted Array](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 120 |
|
||
| 0978 | [Longest Turbulent Subarray](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | Weekly Contest 120 |
|
||
| 0979 | [Distribute Coins in Binary Tree](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 120 |
|
||
| 0980 | [Unique Paths III](/solution/0900-0999/0980.Unique%20Paths%20III/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Matrix` | Hard | Weekly Contest 120 |
|
||
| 0981 | [Time Based Key-Value Store](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README_EN.md) | `Design`,`Hash Table`,`String`,`Binary Search` | Medium | Weekly Contest 121 |
|
||
| 0982 | [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 | Weekly Contest 121 |
|
||
| 0983 | [Minimum Cost For Tickets](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 121 |
|
||
| 0984 | [String Without AAA or BBB](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 121 |
|
||
| 0985 | [Sum of Even Numbers After Queries](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 122 |
|
||
| 0986 | [Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README_EN.md) | `Array`,`Two Pointers`,`Line Sweep` | Medium | Weekly Contest 122 |
|
||
| 0987 | [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`,`Sorting` | Hard | Weekly Contest 122 |
|
||
| 0988 | [Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Backtracking`,`Binary Tree` | Medium | Weekly Contest 122 |
|
||
| 0989 | [Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 123 |
|
||
| 0990 | [Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README_EN.md) | `Union Find`,`Graph`,`Array`,`String` | Medium | Weekly Contest 123 |
|
||
| 0991 | [Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 123 |
|
||
| 0992 | [Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sliding Window` | Hard | Weekly Contest 123 |
|
||
| 0993 | [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 | Weekly Contest 124 |
|
||
| 0994 | [Rotting Oranges](/solution/0900-0999/0994.Rotting%20Oranges/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 124 |
|
||
| 0995 | [Minimum Number of K Consecutive Bit Flips](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README_EN.md) | `Bit Manipulation`,`Queue`,`Array`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 124 |
|
||
| 0996 | [Number of Squareful Arrays](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Weekly Contest 124 |
|
||
| 0997 | [Find the Town Judge](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README_EN.md) | `Graph`,`Array`,`Hash Table` | Easy | Weekly Contest 125 |
|
||
| 0998 | [Maximum Binary Tree II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README_EN.md) | `Tree`,`Binary Tree` | Medium | Weekly Contest 125 |
|
||
| 0999 | [Available Captures for Rook](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 125 |
|
||
| 1000 | [Minimum Cost to Merge Stones](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 126 |
|
||
| 1001 | [Grid Illumination](/solution/1000-1099/1001.Grid%20Illumination/README_EN.md) | `Array`,`Hash Table` | Hard | Weekly Contest 125 |
|
||
| 1002 | [Find Common Characters](/solution/1000-1099/1002.Find%20Common%20Characters/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 126 |
|
||
| 1003 | [Check If Word Is Valid After Substitutions](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 126 |
|
||
| 1004 | [Max Consecutive Ones III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 126 |
|
||
| 1005 | [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 | Weekly Contest 127 |
|
||
| 1006 | [Clumsy Factorial](/solution/1000-1099/1006.Clumsy%20Factorial/README_EN.md) | `Stack`,`Math`,`Simulation` | Medium | Weekly Contest 127 |
|
||
| 1007 | [Minimum Domino Rotations For Equal Row](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 127 |
|
||
| 1008 | [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 | Weekly Contest 127 |
|
||
| 1009 | [Complement of Base 10 Integer](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 128 |
|
||
| 1010 | [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 | Weekly Contest 128 |
|
||
| 1011 | [Capacity To Ship Packages Within D Days](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 128 |
|
||
| 1012 | [Numbers With Repeated Digits](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Weekly Contest 128 |
|
||
| 1013 | [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 | Weekly Contest 129 |
|
||
| 1014 | [Best Sightseeing Pair](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 129 |
|
||
| 1015 | [Smallest Integer Divisible by K](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README_EN.md) | `Hash Table`,`Math` | Medium | Weekly Contest 129 |
|
||
| 1016 | [Binary String With Substrings Representing 1 To N](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 129 |
|
||
| 1017 | [Convert to Base -2](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README_EN.md) | `Math` | Medium | Weekly Contest 130 |
|
||
| 1018 | [Binary Prefix Divisible By 5](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 130 |
|
||
| 1019 | [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 | Weekly Contest 130 |
|
||
| 1020 | [Number of Enclaves](/solution/1000-1099/1020.Number%20of%20Enclaves/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 130 |
|
||
| 1021 | [Remove Outermost Parentheses](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 131 |
|
||
| 1022 | [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 | Weekly Contest 131 |
|
||
| 1023 | [Camelcase Matching](/solution/1000-1099/1023.Camelcase%20Matching/README_EN.md) | `Trie`,`Array`,`Two Pointers`,`String`,`String Matching` | Medium | Weekly Contest 131 |
|
||
| 1024 | [Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 131 |
|
||
| 1025 | [Divisor Game](/solution/1000-1099/1025.Divisor%20Game/README_EN.md) | `Brainteaser`,`Math`,`Dynamic Programming`,`Game Theory` | Easy | Weekly Contest 132 |
|
||
| 1026 | [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 | Weekly Contest 132 |
|
||
| 1027 | [Longest Arithmetic Subsequence](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming` | Medium | Weekly Contest 132 |
|
||
| 1028 | [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 | Weekly Contest 132 |
|
||
| 1029 | [Two City Scheduling](/solution/1000-1099/1029.Two%20City%20Scheduling/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 133 |
|
||
| 1030 | [Matrix Cells in Distance Order](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README_EN.md) | `Geometry`,`Array`,`Math`,`Matrix`,`Sorting` | Easy | Weekly Contest 133 |
|
||
| 1031 | [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 | Weekly Contest 133 |
|
||
| 1032 | [Stream of Characters](/solution/1000-1099/1032.Stream%20of%20Characters/README_EN.md) | `Design`,`Trie`,`Array`,`String`,`Data Stream` | Hard | Weekly Contest 133 |
|
||
| 1033 | [Moving Stones Until Consecutive](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README_EN.md) | `Brainteaser`,`Math` | Medium | Weekly Contest 134 |
|
||
| 1034 | [Coloring A Border](/solution/1000-1099/1034.Coloring%20A%20Border/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 134 |
|
||
| 1035 | [Uncrossed Lines](/solution/1000-1099/1035.Uncrossed%20Lines/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 134 |
|
||
| 1036 | [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 | Weekly Contest 134 |
|
||
| 1037 | [Valid Boomerang](/solution/1000-1099/1037.Valid%20Boomerang/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | Weekly Contest 135 |
|
||
| 1038 | [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 | Weekly Contest 135 |
|
||
| 1039 | [Minimum Score Triangulation of Polygon](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 135 |
|
||
| 1040 | [Moving Stones Until Consecutive II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README_EN.md) | `Array`,`Math`,`Sorting`,`Sliding Window` | Medium | Weekly Contest 135 |
|
||
| 1041 | [Robot Bounded In Circle](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README_EN.md) | `Math`,`String`,`Simulation` | Medium | Weekly Contest 136 |
|
||
| 1042 | [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 | Weekly Contest 136 |
|
||
| 1043 | [Partition Array for Maximum Sum](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 136 |
|
||
| 1044 | [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 | Weekly Contest 136 |
|
||
| 1045 | [Customers Who Bought All Products](/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README_EN.md) | `Database` | Medium | |
|
||
| 1046 | [Last Stone Weight](/solution/1000-1099/1046.Last%20Stone%20Weight/README_EN.md) | `Array`,`Heap (Priority Queue)` | Easy | Weekly Contest 137 |
|
||
| 1047 | [Remove All Adjacent Duplicates In String](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 137 |
|
||
| 1048 | [Longest String Chain](/solution/1000-1099/1048.Longest%20String%20Chain/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`String`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 137 |
|
||
| 1049 | [Last Stone Weight II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 137 |
|
||
| 1050 | [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 | [Height Checker](/solution/1000-1099/1051.Height%20Checker/README_EN.md) | `Array`,`Counting Sort`,`Sorting` | Easy | Weekly Contest 138 |
|
||
| 1052 | [Grumpy Bookstore Owner](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 138 |
|
||
| 1053 | [Previous Permutation With One Swap](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 138 |
|
||
| 1054 | [Distant Barcodes](/solution/1000-1099/1054.Distant%20Barcodes/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 138 |
|
||
| 1055 | [Shortest Way to Form String](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README_EN.md) | `Greedy`,`Two Pointers`,`String`,`Binary Search` | Medium | 🔒 |
|
||
| 1056 | [Confusing Number](/solution/1000-1099/1056.Confusing%20Number/README_EN.md) | `Math` | Easy | 🔒 |
|
||
| 1057 | [Campus Bikes](/solution/1000-1099/1057.Campus%20Bikes/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 1058 | [Minimize Rounding Error to Meet Target](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README_EN.md) | `Greedy`,`Array`,`Math`,`String`,`Sorting` | Medium | 🔒 |
|
||
| 1059 | [All Paths from Source Lead to Destination](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README_EN.md) | `Graph`,`Topological Sort` | Medium | 🔒 |
|
||
| 1060 | [Missing Element in Sorted Array](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 |
|
||
| 1061 | [Lexicographically Smallest Equivalent String](/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README_EN.md) | `Union Find`,`String` | Medium | |
|
||
| 1062 | [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 | [Number of Valid Subarrays](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Hard | 🔒 |
|
||
| 1064 | [Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md) | `Array`,`Binary Search` | Easy | Biweekly Contest 1 |
|
||
| 1065 | [Index Pairs of a String](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README_EN.md) | `Trie`,`Array`,`String`,`Sorting` | Easy | Biweekly Contest 1 |
|
||
| 1066 | [Campus Bikes II](/solution/1000-1099/1066.Campus%20Bikes%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Biweekly Contest 1 |
|
||
| 1067 | [Digit Count in Range](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Biweekly Contest 1 |
|
||
| 1068 | [Product Sales Analysis I](/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README_EN.md) | `Database` | Easy | |
|
||
| 1069 | [Product Sales Analysis II](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1070 | [Product Sales Analysis III](/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README_EN.md) | `Database` | Medium | |
|
||
| 1071 | [Greatest Common Divisor of Strings](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 139 |
|
||
| 1072 | [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 | Weekly Contest 139 |
|
||
| 1073 | [Adding Two Negabinary Numbers](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 139 |
|
||
| 1074 | [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 | Weekly Contest 139 |
|
||
| 1075 | [Project Employees I](/solution/1000-1099/1075.Project%20Employees%20I/README_EN.md) | `Database` | Easy | |
|
||
| 1076 | [Project Employees II](/solution/1000-1099/1076.Project%20Employees%20II/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1077 | [Project Employees III](/solution/1000-1099/1077.Project%20Employees%20III/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1078 | [Occurrences After Bigram](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README_EN.md) | `String` | Easy | Weekly Contest 140 |
|
||
| 1079 | [Letter Tile Possibilities](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README_EN.md) | `Hash Table`,`String`,`Backtracking`,`Counting` | Medium | Weekly Contest 140 |
|
||
| 1080 | [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 | Weekly Contest 140 |
|
||
| 1081 | [Smallest Subsequence of Distinct Characters](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Medium | Weekly Contest 140 |
|
||
| 1082 | [Sales Analysis I](/solution/1000-1099/1082.Sales%20Analysis%20I/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1083 | [Sales Analysis II](/solution/1000-1099/1083.Sales%20Analysis%20II/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1084 | [Sales Analysis III](/solution/1000-1099/1084.Sales%20Analysis%20III/README_EN.md) | `Database` | Easy | |
|
||
| 1085 | [Sum of Digits in the Minimum Number](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 2 |
|
||
| 1086 | [High Five](/solution/1000-1099/1086.High%20Five/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Easy | Biweekly Contest 2 |
|
||
| 1087 | [Brace Expansion](/solution/1000-1099/1087.Brace%20Expansion/README_EN.md) | `Breadth-First Search`,`String`,`Backtracking` | Medium | Biweekly Contest 2 |
|
||
| 1088 | [Confusing Number II](/solution/1000-1099/1088.Confusing%20Number%20II/README_EN.md) | `Math`,`Backtracking` | Hard | Biweekly Contest 2 |
|
||
| 1089 | [Duplicate Zeros](/solution/1000-1099/1089.Duplicate%20Zeros/README_EN.md) | `Array`,`Two Pointers` | Easy | Weekly Contest 141 |
|
||
| 1090 | [Largest Values From Labels](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Weekly Contest 141 |
|
||
| 1091 | [Shortest Path in Binary Matrix](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 141 |
|
||
| 1092 | [Shortest Common Supersequence](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 141 |
|
||
| 1093 | [Statistics from a Large Sample](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README_EN.md) | `Array`,`Math`,`Probability and Statistics` | Medium | Weekly Contest 142 |
|
||
| 1094 | [Car Pooling](/solution/1000-1099/1094.Car%20Pooling/README_EN.md) | `Array`,`Prefix Sum`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Weekly Contest 142 |
|
||
| 1095 | [Find in Mountain Array](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Hard | Weekly Contest 142 |
|
||
| 1096 | [Brace Expansion II](/solution/1000-1099/1096.Brace%20Expansion%20II/README_EN.md) | `Stack`,`Breadth-First Search`,`String`,`Backtracking` | Hard | Weekly Contest 142 |
|
||
| 1097 | [Game Play Analysis V](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1098 | [Unpopular Books](/solution/1000-1099/1098.Unpopular%20Books/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1099 | [Two Sum Less Than K](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Biweekly Contest 3 |
|
||
| 1100 | [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 | Biweekly Contest 3 |
|
||
| 1101 | [The Earliest Moment When Everyone Become Friends](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README_EN.md) | `Union Find`,`Array`,`Sorting` | Medium | Biweekly Contest 3 |
|
||
| 1102 | [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`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Medium | Biweekly Contest 3 |
|
||
| 1103 | [Distribute Candies to People](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 143 |
|
||
| 1104 | [Path In Zigzag Labelled Binary Tree](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README_EN.md) | `Tree`,`Math`,`Binary Tree` | Medium | Weekly Contest 143 |
|
||
| 1105 | [Filling Bookcase Shelves](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 143 |
|
||
| 1106 | [Parsing A Boolean Expression](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README_EN.md) | `Stack`,`Recursion`,`String` | Hard | Weekly Contest 143 |
|
||
| 1107 | [New Users Daily Count](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1108 | [Defanging an IP Address](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README_EN.md) | `String` | Easy | Weekly Contest 144 |
|
||
| 1109 | [Corporate Flight Bookings](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 144 |
|
||
| 1110 | [Delete Nodes And Return Forest](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 144 |
|
||
| 1111 | [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 | Weekly Contest 144 |
|
||
| 1112 | [Highest Grade For Each Student](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1113 | [Reported Posts](/solution/1100-1199/1113.Reported%20Posts/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1114 | [Print in Order](/solution/1100-1199/1114.Print%20in%20Order/README_EN.md) | `Concurrency` | Easy | |
|
||
| 1115 | [Print FooBar Alternately](/solution/1100-1199/1115.Print%20FooBar%20Alternately/README_EN.md) | `Concurrency` | Medium | |
|
||
| 1116 | [Print Zero Even Odd](/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README_EN.md) | `Concurrency` | Medium | |
|
||
| 1117 | [Building H2O](/solution/1100-1199/1117.Building%20H2O/README_EN.md) | `Concurrency` | Medium | |
|
||
| 1118 | [Number of Days in a Month](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README_EN.md) | `Math` | Easy | Biweekly Contest 4 |
|
||
| 1119 | [Remove Vowels from a String](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README_EN.md) | `String` | Easy | Biweekly Contest 4 |
|
||
| 1120 | [Maximum Average Subtree](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Biweekly Contest 4 |
|
||
| 1121 | [Divide Array Into Increasing Sequences](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README_EN.md) | `Array`,`Counting` | Hard | Biweekly Contest 4 |
|
||
| 1122 | [Relative Sort Array](/solution/1100-1199/1122.Relative%20Sort%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting Sort`,`Sorting` | Easy | Weekly Contest 145 |
|
||
| 1123 | [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 | Weekly Contest 145 |
|
||
| 1124 | [Longest Well-Performing Interval](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README_EN.md) | `Stack`,`Array`,`Hash Table`,`Prefix Sum`,`Monotonic Stack` | Medium | Weekly Contest 145 |
|
||
| 1125 | [Smallest Sufficient Team](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 145 |
|
||
| 1126 | [Active Businesses](/solution/1100-1199/1126.Active%20Businesses/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1127 | [User Purchase Platform](/solution/1100-1199/1127.User%20Purchase%20Platform/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1128 | [Number of Equivalent Domino Pairs](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 146 |
|
||
| 1129 | [Shortest Path with Alternating Colors](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README_EN.md) | `Breadth-First Search`,`Graph` | Medium | Weekly Contest 146 |
|
||
| 1130 | [Minimum Cost Tree From Leaf Values](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README_EN.md) | `Stack`,`Greedy`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Medium | Weekly Contest 146 |
|
||
| 1131 | [Maximum of Absolute Value Expression](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 146 |
|
||
| 1132 | [Reported Posts II](/solution/1100-1199/1132.Reported%20Posts%20II/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1133 | [Largest Unique Number](/solution/1100-1199/1133.Largest%20Unique%20Number/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 5 |
|
||
| 1134 | [Armstrong Number](/solution/1100-1199/1134.Armstrong%20Number/README_EN.md) | `Math` | Easy | Biweekly Contest 5 |
|
||
| 1135 | [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 | Biweekly Contest 5 |
|
||
| 1136 | [Parallel Courses](/solution/1100-1199/1136.Parallel%20Courses/README_EN.md) | `Graph`,`Topological Sort` | Medium | Biweekly Contest 5 |
|
||
| 1137 | [N-th Tribonacci Number](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Easy | Weekly Contest 147 |
|
||
| 1138 | [Alphabet Board Path](/solution/1100-1199/1138.Alphabet%20Board%20Path/README_EN.md) | `Hash Table`,`String` | Medium | Weekly Contest 147 |
|
||
| 1139 | [Largest 1-Bordered Square](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 147 |
|
||
| 1140 | [Stone Game II](/solution/1100-1199/1140.Stone%20Game%20II/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Prefix Sum` | Medium | Weekly Contest 147 |
|
||
| 1141 | [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 | [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 | [Longest Common Subsequence](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README_EN.md) | `String`,`Dynamic Programming` | Medium | |
|
||
| 1144 | [Decrease Elements To Make Array Zigzag](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 148 |
|
||
| 1145 | [Binary Tree Coloring Game](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 148 |
|
||
| 1146 | [Snapshot Array](/solution/1100-1199/1146.Snapshot%20Array/README_EN.md) | `Design`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 148 |
|
||
| 1147 | [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 | Weekly Contest 148 |
|
||
| 1148 | [Article Views I](/solution/1100-1199/1148.Article%20Views%20I/README_EN.md) | `Database` | Easy | |
|
||
| 1149 | [Article Views II](/solution/1100-1199/1149.Article%20Views%20II/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1150 | [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 | Biweekly Contest 6 |
|
||
| 1151 | [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 | Biweekly Contest 6 |
|
||
| 1152 | [Analyze User Website Visit Pattern](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Biweekly Contest 6 |
|
||
| 1153 | [String Transforms Into Another String](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README_EN.md) | `Graph`,`Hash Table`,`String` | Hard | Biweekly Contest 6 |
|
||
| 1154 | [Day of the Year](/solution/1100-1199/1154.Day%20of%20the%20Year/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 149 |
|
||
| 1155 | [Number of Dice Rolls With Target Sum](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README_EN.md) | `Dynamic Programming` | Medium | Weekly Contest 149 |
|
||
| 1156 | [Swap For Longest Repeated Character Substring](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 149 |
|
||
| 1157 | [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 | Weekly Contest 149 |
|
||
| 1158 | [Market Analysis I](/solution/1100-1199/1158.Market%20Analysis%20I/README_EN.md) | `Database` | Medium | |
|
||
| 1159 | [Market Analysis II](/solution/1100-1199/1159.Market%20Analysis%20II/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1160 | [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`,`Counting` | Easy | Weekly Contest 150 |
|
||
| 1161 | [Maximum Level Sum of a Binary Tree](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 150 |
|
||
| 1162 | [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 | Weekly Contest 150 |
|
||
| 1163 | [Last Substring in Lexicographical Order](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README_EN.md) | `Two Pointers`,`String` | Hard | Weekly Contest 150 |
|
||
| 1164 | [Product Price at a Given Date](/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README_EN.md) | `Database` | Medium | |
|
||
| 1165 | [Single-Row Keyboard](/solution/1100-1199/1165.Single-Row%20Keyboard/README_EN.md) | `Hash Table`,`String` | Easy | Biweekly Contest 7 |
|
||
| 1166 | [Design File System](/solution/1100-1199/1166.Design%20File%20System/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | Biweekly Contest 7 |
|
||
| 1167 | [Minimum Cost to Connect Sticks](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Biweekly Contest 7 |
|
||
| 1168 | [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`,`Heap (Priority Queue)` | Hard | Biweekly Contest 7 |
|
||
| 1169 | [Invalid Transactions](/solution/1100-1199/1169.Invalid%20Transactions/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 151 |
|
||
| 1170 | [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 | Weekly Contest 151 |
|
||
| 1171 | [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 | Weekly Contest 151 |
|
||
| 1172 | [Dinner Plate Stacks](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README_EN.md) | `Stack`,`Design`,`Hash Table`,`Heap (Priority Queue)` | Hard | Weekly Contest 151 |
|
||
| 1173 | [Immediate Food Delivery I](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1174 | [Immediate Food Delivery II](/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README_EN.md) | `Database` | Medium | |
|
||
| 1175 | [Prime Arrangements](/solution/1100-1199/1175.Prime%20Arrangements/README_EN.md) | `Math` | Easy | Weekly Contest 152 |
|
||
| 1176 | [Diet Plan Performance](/solution/1100-1199/1176.Diet%20Plan%20Performance/README_EN.md) | `Array`,`Sliding Window` | Easy | Weekly Contest 152 |
|
||
| 1177 | [Can Make Palindrome from Substring](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Prefix Sum` | Medium | Weekly Contest 152 |
|
||
| 1178 | [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 | Weekly Contest 152 |
|
||
| 1179 | [Reformat Department Table](/solution/1100-1199/1179.Reformat%20Department%20Table/README_EN.md) | `Database` | Easy | |
|
||
| 1180 | [Count Substrings with Only One Distinct Letter](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 8 |
|
||
| 1181 | [Before and After Puzzle](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Biweekly Contest 8 |
|
||
| 1182 | [Shortest Distance to Target Color](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Medium | Biweekly Contest 8 |
|
||
| 1183 | [Maximum Number of Ones](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README_EN.md) | `Greedy`,`Math`,`Sorting`,`Heap (Priority Queue)` | Hard | Biweekly Contest 8 |
|
||
| 1184 | [Distance Between Bus Stops](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README_EN.md) | `Array` | Easy | Weekly Contest 153 |
|
||
| 1185 | [Day of the Week](/solution/1100-1199/1185.Day%20of%20the%20Week/README_EN.md) | `Math` | Easy | Weekly Contest 153 |
|
||
| 1186 | [Maximum Subarray Sum with One Deletion](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 153 |
|
||
| 1187 | [Make Array Strictly Increasing](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 153 |
|
||
| 1188 | [Design Bounded Blocking Queue](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README_EN.md) | `Concurrency` | Medium | 🔒 |
|
||
| 1189 | [Maximum Number of Balloons](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 154 |
|
||
| 1190 | [Reverse Substrings Between Each Pair of Parentheses](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 154 |
|
||
| 1191 | [K-Concatenation Maximum Sum](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 154 |
|
||
| 1192 | [Critical Connections in a Network](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README_EN.md) | `Depth-First Search`,`Graph`,`Biconnected Component` | Hard | Weekly Contest 154 |
|
||
| 1193 | [Monthly Transactions I](/solution/1100-1199/1193.Monthly%20Transactions%20I/README_EN.md) | `Database` | Medium | |
|
||
| 1194 | [Tournament Winners](/solution/1100-1199/1194.Tournament%20Winners/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1195 | [Fizz Buzz Multithreaded](/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README_EN.md) | `Concurrency` | Medium | |
|
||
| 1196 | [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 | Biweekly Contest 9 |
|
||
| 1197 | [Minimum Knight Moves](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README_EN.md) | `Breadth-First Search` | Medium | Biweekly Contest 9 |
|
||
| 1198 | [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 | Biweekly Contest 9 |
|
||
| 1199 | [Minimum Time to Build Blocks](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README_EN.md) | `Greedy`,`Array`,`Math`,`Heap (Priority Queue)` | Hard | Biweekly Contest 9 |
|
||
| 1200 | [Minimum Absolute Difference](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 155 |
|
||
| 1201 | [Ugly Number III](/solution/1200-1299/1201.Ugly%20Number%20III/README_EN.md) | `Math`,`Binary Search`,`Combinatorics`,`Number Theory` | Medium | Weekly Contest 155 |
|
||
| 1202 | [Smallest String With Swaps](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 155 |
|
||
| 1203 | [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 | Weekly Contest 155 |
|
||
| 1204 | [Last Person to Fit in the Bus](/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Bus/README_EN.md) | `Database` | Medium | |
|
||
| 1205 | [Monthly Transactions II](/solution/1200-1299/1205.Monthly%20Transactions%20II/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1206 | [Design Skiplist](/solution/1200-1299/1206.Design%20Skiplist/README_EN.md) | `Design`,`Linked List` | Hard | |
|
||
| 1207 | [Unique Number of Occurrences](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 156 |
|
||
| 1208 | [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 | Weekly Contest 156 |
|
||
| 1209 | [Remove All Adjacent Duplicates in String II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 156 |
|
||
| 1210 | [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 | Weekly Contest 156 |
|
||
| 1211 | [Queries Quality and Percentage](/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README_EN.md) | `Database` | Easy | |
|
||
| 1212 | [Team Scores in Football Tournament](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1213 | [Intersection of Three Sorted Arrays](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Counting` | Easy | Biweekly Contest 10 |
|
||
| 1214 | [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 | Biweekly Contest 10 |
|
||
| 1215 | [Stepping Numbers](/solution/1200-1299/1215.Stepping%20Numbers/README_EN.md) | `Breadth-First Search`,`Math`,`Backtracking` | Medium | Biweekly Contest 10 |
|
||
| 1216 | [Valid Palindrome III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 10 |
|
||
| 1217 | [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 | Weekly Contest 157 |
|
||
| 1218 | [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 | Weekly Contest 157 |
|
||
| 1219 | [Path with Maximum Gold](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | Weekly Contest 157 |
|
||
| 1220 | [Count Vowels Permutation](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 157 |
|
||
| 1221 | [Split a String in Balanced Strings](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README_EN.md) | `Greedy`,`String`,`Counting` | Easy | Weekly Contest 158 |
|
||
| 1222 | [Queens That Can Attack the King](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 158 |
|
||
| 1223 | [Dice Roll Simulation](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 158 |
|
||
| 1224 | [Maximum Equal Frequency](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README_EN.md) | `Array`,`Hash Table` | Hard | Weekly Contest 158 |
|
||
| 1225 | [Report Contiguous Dates](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1226 | [The Dining Philosophers](/solution/1200-1299/1226.The%20Dining%20Philosophers/README_EN.md) | `Concurrency` | Medium | |
|
||
| 1227 | [Airplane Seat Assignment Probability](/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README_EN.md) | `Brainteaser`,`Math`,`Dynamic Programming`,`Probability and Statistics` | Medium | |
|
||
| 1228 | [Missing Number In Arithmetic Progression](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 11 |
|
||
| 1229 | [Meeting Scheduler](/solution/1200-1299/1229.Meeting%20Scheduler/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 11 |
|
||
| 1230 | [Toss Strange Coins](/solution/1200-1299/1230.Toss%20Strange%20Coins/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Probability and Statistics` | Medium | Biweekly Contest 11 |
|
||
| 1231 | [Divide Chocolate](/solution/1200-1299/1231.Divide%20Chocolate/README_EN.md) | `Array`,`Binary Search` | Hard | Biweekly Contest 11 |
|
||
| 1232 | [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 | Weekly Contest 159 |
|
||
| 1233 | [Remove Sub-Folders from the Filesystem](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README_EN.md) | `Depth-First Search`,`Trie`,`Array`,`String` | Medium | Weekly Contest 159 |
|
||
| 1234 | [Replace the Substring for Balanced String](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 159 |
|
||
| 1235 | [Maximum Profit in Job Scheduling](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 159 |
|
||
| 1236 | [Web Crawler](/solution/1200-1299/1236.Web%20Crawler/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`String`,`Interactive` | Medium | 🔒 |
|
||
| 1237 | [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 | Weekly Contest 160 |
|
||
| 1238 | [Circular Permutation in Binary Representation](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README_EN.md) | `Bit Manipulation`,`Math`,`Backtracking` | Medium | Weekly Contest 160 |
|
||
| 1239 | [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 | Weekly Contest 160 |
|
||
| 1240 | [Tiling a Rectangle with the Fewest Squares](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README_EN.md) | `Backtracking` | Hard | Weekly Contest 160 |
|
||
| 1241 | [Number of Comments per Post](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1242 | [Web Crawler Multithreaded](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Concurrency` | Medium | 🔒 |
|
||
| 1243 | [Array Transformation](/solution/1200-1299/1243.Array%20Transformation/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 12 |
|
||
| 1244 | [Design A Leaderboard](/solution/1200-1299/1244.Design%20A%20Leaderboard/README_EN.md) | `Design`,`Hash Table`,`Sorting` | Medium | Biweekly Contest 12 |
|
||
| 1245 | [Tree Diameter](/solution/1200-1299/1245.Tree%20Diameter/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | Biweekly Contest 12 |
|
||
| 1246 | [Palindrome Removal](/solution/1200-1299/1246.Palindrome%20Removal/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 12 |
|
||
| 1247 | [Minimum Swaps to Make Strings Equal](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README_EN.md) | `Greedy`,`Math`,`String` | Medium | Weekly Contest 161 |
|
||
| 1248 | [Count Number of Nice Subarrays](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Math`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 161 |
|
||
| 1249 | [Minimum Remove to Make Valid Parentheses](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 161 |
|
||
| 1250 | [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 | Weekly Contest 161 |
|
||
| 1251 | [Average Selling Price](/solution/1200-1299/1251.Average%20Selling%20Price/README_EN.md) | `Database` | Easy | |
|
||
| 1252 | [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 | Weekly Contest 162 |
|
||
| 1253 | [Reconstruct a 2-Row Binary Matrix](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Weekly Contest 162 |
|
||
| 1254 | [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 | Weekly Contest 162 |
|
||
| 1255 | [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 | Weekly Contest 162 |
|
||
| 1256 | [Encode Number](/solution/1200-1299/1256.Encode%20Number/README_EN.md) | `Bit Manipulation`,`Math`,`String` | Medium | Biweekly Contest 13 |
|
||
| 1257 | [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 | Biweekly Contest 13 |
|
||
| 1258 | [Synonymous Sentences](/solution/1200-1299/1258.Synonymous%20Sentences/README_EN.md) | `Union Find`,`Array`,`Hash Table`,`String`,`Backtracking` | Medium | Biweekly Contest 13 |
|
||
| 1259 | [Handshakes That Don't Cross](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Biweekly Contest 13 |
|
||
| 1260 | [Shift 2D Grid](/solution/1200-1299/1260.Shift%202D%20Grid/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 163 |
|
||
| 1261 | [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`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 163 |
|
||
| 1262 | [Greatest Sum Divisible by Three](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 163 |
|
||
| 1263 | [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 | Weekly Contest 163 |
|
||
| 1264 | [Page Recommendations](/solution/1200-1299/1264.Page%20Recommendations/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1265 | [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 | [Minimum Time Visiting All Points](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | Weekly Contest 164 |
|
||
| 1267 | [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 | Weekly Contest 164 |
|
||
| 1268 | [Search Suggestions System](/solution/1200-1299/1268.Search%20Suggestions%20System/README_EN.md) | `Trie`,`Array`,`String`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 164 |
|
||
| 1269 | [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 | Weekly Contest 164 |
|
||
| 1270 | [All People Report to the Given Manager](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1271 | [Hexspeak](/solution/1200-1299/1271.Hexspeak/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 14 |
|
||
| 1272 | [Remove Interval](/solution/1200-1299/1272.Remove%20Interval/README_EN.md) | `Array` | Medium | Biweekly Contest 14 |
|
||
| 1273 | [Delete Tree Nodes](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array` | Medium | Biweekly Contest 14 |
|
||
| 1274 | [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 | Biweekly Contest 14 |
|
||
| 1275 | [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 | Weekly Contest 165 |
|
||
| 1276 | [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 | Weekly Contest 165 |
|
||
| 1277 | [Count Square Submatrices with All Ones](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 165 |
|
||
| 1278 | [Palindrome Partitioning III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 165 |
|
||
| 1279 | [Traffic Light Controlled Intersection](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README_EN.md) | `Concurrency` | Easy | 🔒 |
|
||
| 1280 | [Students and Examinations](/solution/1200-1299/1280.Students%20and%20Examinations/README_EN.md) | `Database` | Easy | |
|
||
| 1281 | [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 | Weekly Contest 166 |
|
||
| 1282 | [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) | `Greedy`,`Array`,`Hash Table` | Medium | Weekly Contest 166 |
|
||
| 1283 | [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 | Weekly Contest 166 |
|
||
| 1284 | [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`,`Hash Table`,`Matrix` | Hard | Weekly Contest 166 |
|
||
| 1285 | [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 | [Iterator for Combination](/solution/1200-1299/1286.Iterator%20for%20Combination/README_EN.md) | `Design`,`String`,`Backtracking`,`Iterator` | Medium | Biweekly Contest 15 |
|
||
| 1287 | [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 | Biweekly Contest 15 |
|
||
| 1288 | [Remove Covered Intervals](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 15 |
|
||
| 1289 | [Minimum Falling Path Sum II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 15 |
|
||
| 1290 | [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 | Weekly Contest 167 |
|
||
| 1291 | [Sequential Digits](/solution/1200-1299/1291.Sequential%20Digits/README_EN.md) | `Enumeration` | Medium | Weekly Contest 167 |
|
||
| 1292 | [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 | Weekly Contest 167 |
|
||
| 1293 | [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 | Weekly Contest 167 |
|
||
| 1294 | [Weather Type in Each Country](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1295 | [Find Numbers with Even Number of Digits](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 168 |
|
||
| 1296 | [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 | Weekly Contest 168 |
|
||
| 1297 | [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 | Weekly Contest 168 |
|
||
| 1298 | [Maximum Candies You Can Get from Boxes](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README_EN.md) | `Breadth-First Search`,`Graph`,`Array` | Hard | Weekly Contest 168 |
|
||
| 1299 | [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 | Biweekly Contest 16 |
|
||
| 1300 | [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 | Biweekly Contest 16 |
|
||
| 1301 | [Number of Paths with Max Score](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 16 |
|
||
| 1302 | [Deepest Leaves Sum](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Biweekly Contest 16 |
|
||
| 1303 | [Find the Team Size](/solution/1300-1399/1303.Find%20the%20Team%20Size/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1304 | [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 | Weekly Contest 169 |
|
||
| 1305 | [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 | Weekly Contest 169 |
|
||
| 1306 | [Jump Game III](/solution/1300-1399/1306.Jump%20Game%20III/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array` | Medium | Weekly Contest 169 |
|
||
| 1307 | [Verbal Arithmetic Puzzle](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README_EN.md) | `Array`,`Math`,`String`,`Backtracking` | Hard | Weekly Contest 169 |
|
||
| 1308 | [Running Total for Different Genders](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1309 | [Decrypt String from Alphabet to Integer Mapping](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README_EN.md) | `String` | Easy | Weekly Contest 170 |
|
||
| 1310 | [XOR Queries of a Subarray](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README_EN.md) | `Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Weekly Contest 170 |
|
||
| 1311 | [Get Watched Videos by Your Friends](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 170 |
|
||
| 1312 | [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 | Weekly Contest 170 |
|
||
| 1313 | [Decompress Run-Length Encoded List](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README_EN.md) | `Array` | Easy | Biweekly Contest 17 |
|
||
| 1314 | [Matrix Block Sum](/solution/1300-1399/1314.Matrix%20Block%20Sum/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Biweekly Contest 17 |
|
||
| 1315 | [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 | Biweekly Contest 17 |
|
||
| 1316 | [Distinct Echo Substrings](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README_EN.md) | `Trie`,`String`,`Hash Function`,`Rolling Hash` | Hard | Biweekly Contest 17 |
|
||
| 1317 | [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 | Weekly Contest 171 |
|
||
| 1318 | [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 | Weekly Contest 171 |
|
||
| 1319 | [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 | Weekly Contest 171 |
|
||
| 1320 | [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 | Weekly Contest 171 |
|
||
| 1321 | [Restaurant Growth](/solution/1300-1399/1321.Restaurant%20Growth/README_EN.md) | `Database` | Medium | |
|
||
| 1322 | [Ads Performance](/solution/1300-1399/1322.Ads%20Performance/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1323 | [Maximum 69 Number](/solution/1300-1399/1323.Maximum%2069%20Number/README_EN.md) | `Greedy`,`Math` | Easy | Weekly Contest 172 |
|
||
| 1324 | [Print Words Vertically](/solution/1300-1399/1324.Print%20Words%20Vertically/README_EN.md) | `Array`,`String`,`Simulation` | Medium | Weekly Contest 172 |
|
||
| 1325 | [Delete Leaves With a Given Value](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 172 |
|
||
| 1326 | [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 | Weekly Contest 172 |
|
||
| 1327 | [List the Products Ordered in a Period](/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README_EN.md) | `Database` | Easy | |
|
||
| 1328 | [Break a Palindrome](/solution/1300-1399/1328.Break%20a%20Palindrome/README_EN.md) | `Greedy`,`String` | Medium | Biweekly Contest 18 |
|
||
| 1329 | [Sort the Matrix Diagonally](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README_EN.md) | `Array`,`Matrix`,`Sorting` | Medium | Biweekly Contest 18 |
|
||
| 1330 | [Reverse Subarray To Maximize Array Value](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README_EN.md) | `Greedy`,`Array`,`Math` | Hard | Biweekly Contest 18 |
|
||
| 1331 | [Rank Transform of an Array](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 18 |
|
||
| 1332 | [Remove Palindromic Subsequences](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 173 |
|
||
| 1333 | [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 | Weekly Contest 173 |
|
||
| 1334 | [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 | Weekly Contest 173 |
|
||
| 1335 | [Minimum Difficulty of a Job Schedule](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 173 |
|
||
| 1336 | [Number of Transactions per Visit](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1337 | [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 | Weekly Contest 174 |
|
||
| 1338 | [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 | Weekly Contest 174 |
|
||
| 1339 | [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 | Weekly Contest 174 |
|
||
| 1340 | [Jump Game V](/solution/1300-1399/1340.Jump%20Game%20V/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 174 |
|
||
| 1341 | [Movie Rating](/solution/1300-1399/1341.Movie%20Rating/README_EN.md) | `Database` | Medium | |
|
||
| 1342 | [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 | Biweekly Contest 19 |
|
||
| 1343 | [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 | Biweekly Contest 19 |
|
||
| 1344 | [Angle Between Hands of a Clock](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README_EN.md) | `Math` | Medium | Biweekly Contest 19 |
|
||
| 1345 | [Jump Game IV](/solution/1300-1399/1345.Jump%20Game%20IV/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table` | Hard | Biweekly Contest 19 |
|
||
| 1346 | [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 | Weekly Contest 175 |
|
||
| 1347 | [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`,`Counting` | Medium | Weekly Contest 175 |
|
||
| 1348 | [Tweet Counts Per Frequency](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README_EN.md) | `Design`,`Hash Table`,`Binary Search`,`Ordered Set`,`Sorting` | Medium | Weekly Contest 175 |
|
||
| 1349 | [Maximum Students Taking Exam](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix` | Hard | Weekly Contest 175 |
|
||
| 1350 | [Students With Invalid Departments](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1351 | [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 | Weekly Contest 176 |
|
||
| 1352 | [Product of the Last K Numbers](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README_EN.md) | `Design`,`Array`,`Math`,`Data Stream`,`Prefix Sum` | Medium | Weekly Contest 176 |
|
||
| 1353 | [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`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 176 |
|
||
| 1354 | [Construct Target Array With Multiple Sums](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README_EN.md) | `Array`,`Heap (Priority Queue)` | Hard | Weekly Contest 176 |
|
||
| 1355 | [Activity Participants](/solution/1300-1399/1355.Activity%20Participants/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1356 | [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 | Biweekly Contest 20 |
|
||
| 1357 | [Apply Discount Every n Orders](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README_EN.md) | `Design`,`Array`,`Hash Table` | Medium | Biweekly Contest 20 |
|
||
| 1358 | [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 | Biweekly Contest 20 |
|
||
| 1359 | [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 | Biweekly Contest 20 |
|
||
| 1360 | [Number of Days Between Two Dates](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 177 |
|
||
| 1361 | [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 | Weekly Contest 177 |
|
||
| 1362 | [Closest Divisors](/solution/1300-1399/1362.Closest%20Divisors/README_EN.md) | `Math` | Medium | Weekly Contest 177 |
|
||
| 1363 | [Largest Multiple of Three](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README_EN.md) | `Greedy`,`Array`,`Math`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 177 |
|
||
| 1364 | [Number of Trusted Contacts of a Customer](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1365 | [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 Sort`,`Sorting` | Easy | Weekly Contest 178 |
|
||
| 1366 | [Rank Teams by Votes](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 178 |
|
||
| 1367 | [Linked List in Binary Tree](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Linked List`,`Binary Tree` | Medium | Weekly Contest 178 |
|
||
| 1368 | [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 | Weekly Contest 178 |
|
||
| 1369 | [Get the Second Most Recent Activity](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1370 | [Increasing Decreasing String](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 21 |
|
||
| 1371 | [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 | Biweekly Contest 21 |
|
||
| 1372 | [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 | Biweekly Contest 21 |
|
||
| 1373 | [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 | Biweekly Contest 21 |
|
||
| 1374 | [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 | Weekly Contest 179 |
|
||
| 1375 | [Number of Times Binary String Is Prefix-Aligned](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README_EN.md) | `Array` | Medium | Weekly Contest 179 |
|
||
| 1376 | [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 | Weekly Contest 179 |
|
||
| 1377 | [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 | Weekly Contest 179 |
|
||
| 1378 | [Replace Employee ID With The Unique Identifier](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README_EN.md) | `Database` | Easy | |
|
||
| 1379 | [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` | Easy | |
|
||
| 1380 | [Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 180 |
|
||
| 1381 | [Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README_EN.md) | `Stack`,`Design`,`Array` | Medium | Weekly Contest 180 |
|
||
| 1382 | [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 | Weekly Contest 180 |
|
||
| 1383 | [Maximum Performance of a Team](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 180 |
|
||
| 1384 | [Total Sales Amount by Year](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1385 | [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 | Biweekly Contest 22 |
|
||
| 1386 | [Cinema Seat Allocation](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Hash Table` | Medium | Biweekly Contest 22 |
|
||
| 1387 | [Sort Integers by The Power Value](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README_EN.md) | `Memoization`,`Dynamic Programming`,`Sorting` | Medium | Biweekly Contest 22 |
|
||
| 1388 | [Pizza With 3n Slices](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Heap (Priority Queue)` | Hard | Biweekly Contest 22 |
|
||
| 1389 | [Create Target Array in the Given Order](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 181 |
|
||
| 1390 | [Four Divisors](/solution/1300-1399/1390.Four%20Divisors/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 181 |
|
||
| 1391 | [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 | Weekly Contest 181 |
|
||
| 1392 | [Longest Happy Prefix](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 181 |
|
||
| 1393 | [Capital GainLoss](/solution/1300-1399/1393.Capital%20GainLoss/README_EN.md) | `Database` | Medium | |
|
||
| 1394 | [Find Lucky Integer in an Array](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 182 |
|
||
| 1395 | [Count Number of Teams](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 182 |
|
||
| 1396 | [Design Underground System](/solution/1300-1399/1396.Design%20Underground%20System/README_EN.md) | `Design`,`Hash Table`,`String` | Medium | Weekly Contest 182 |
|
||
| 1397 | [Find All Good Strings](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README_EN.md) | `String`,`Dynamic Programming`,`String Matching` | Hard | Weekly Contest 182 |
|
||
| 1398 | [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 | [Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README_EN.md) | `Hash Table`,`Math` | Easy | Biweekly Contest 23 |
|
||
| 1400 | [Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 23 |
|
||
| 1401 | [Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README_EN.md) | `Geometry`,`Math` | Medium | Biweekly Contest 23 |
|
||
| 1402 | [Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 23 |
|
||
| 1403 | [Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 183 |
|
||
| 1404 | [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`,`Simulation` | Medium | Weekly Contest 183 |
|
||
| 1405 | [Longest Happy String](/solution/1400-1499/1405.Longest%20Happy%20String/README_EN.md) | `Greedy`,`String`,`Heap (Priority Queue)` | Medium | Weekly Contest 183 |
|
||
| 1406 | [Stone Game III](/solution/1400-1499/1406.Stone%20Game%20III/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | Weekly Contest 183 |
|
||
| 1407 | [Top Travellers](/solution/1400-1499/1407.Top%20Travellers/README_EN.md) | `Database` | Easy | |
|
||
| 1408 | [String Matching in an Array](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README_EN.md) | `Array`,`String`,`String Matching` | Easy | Weekly Contest 184 |
|
||
| 1409 | [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 | Weekly Contest 184 |
|
||
| 1410 | [HTML Entity Parser](/solution/1400-1499/1410.HTML%20Entity%20Parser/README_EN.md) | `Hash Table`,`String` | Medium | Weekly Contest 184 |
|
||
| 1411 | [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 | Weekly Contest 184 |
|
||
| 1412 | [Find the Quiet Students in All Exams](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1413 | [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 | Biweekly Contest 24 |
|
||
| 1414 | [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`,`Math` | Medium | Biweekly Contest 24 |
|
||
| 1415 | [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 | Biweekly Contest 24 |
|
||
| 1416 | [Restore The Array](/solution/1400-1499/1416.Restore%20The%20Array/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 24 |
|
||
| 1417 | [Reformat The String](/solution/1400-1499/1417.Reformat%20The%20String/README_EN.md) | `String` | Easy | Weekly Contest 185 |
|
||
| 1418 | [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 | Weekly Contest 185 |
|
||
| 1419 | [Minimum Number of Frogs Croaking](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README_EN.md) | `String`,`Counting` | Medium | Weekly Contest 185 |
|
||
| 1420 | [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`,`Prefix Sum` | Hard | Weekly Contest 185 |
|
||
| 1421 | [NPV Queries](/solution/1400-1499/1421.NPV%20Queries/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1422 | [Maximum Score After Splitting a String](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README_EN.md) | `String`,`Prefix Sum` | Easy | Weekly Contest 186 |
|
||
| 1423 | [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 | Weekly Contest 186 |
|
||
| 1424 | [Diagonal Traverse II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 186 |
|
||
| 1425 | [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 | Weekly Contest 186 |
|
||
| 1426 | [Counting Elements](/solution/1400-1499/1426.Counting%20Elements/README_EN.md) | `Array`,`Hash Table` | Easy | 🔒 |
|
||
| 1427 | [Perform String Shifts](/solution/1400-1499/1427.Perform%20String%20Shifts/README_EN.md) | `Array`,`Math`,`String` | Easy | 🔒 |
|
||
| 1428 | [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 | [First Unique Number](/solution/1400-1499/1429.First%20Unique%20Number/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Data Stream` | Medium | 🔒 |
|
||
| 1430 | [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 | [Kids With the Greatest Number of Candies](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README_EN.md) | `Array` | Easy | Biweekly Contest 25 |
|
||
| 1432 | [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 | Biweekly Contest 25 |
|
||
| 1433 | [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 | Biweekly Contest 25 |
|
||
| 1434 | [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 | Biweekly Contest 25 |
|
||
| 1435 | [Create a Session Bar Chart](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1436 | [Destination City](/solution/1400-1499/1436.Destination%20City/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 187 |
|
||
| 1437 | [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 | Weekly Contest 187 |
|
||
| 1438 | [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 | Weekly Contest 187 |
|
||
| 1439 | [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 | Weekly Contest 187 |
|
||
| 1440 | [Evaluate Boolean Expression](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1441 | [Build an Array With Stack Operations](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README_EN.md) | `Stack`,`Array`,`Simulation` | Medium | Weekly Contest 188 |
|
||
| 1442 | [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 | Weekly Contest 188 |
|
||
| 1443 | [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 | Weekly Contest 188 |
|
||
| 1444 | [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`,`Prefix Sum` | Hard | Weekly Contest 188 |
|
||
| 1445 | [Apples & Oranges](/solution/1400-1499/1445.Apples%20%26%20Oranges/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1446 | [Consecutive Characters](/solution/1400-1499/1446.Consecutive%20Characters/README_EN.md) | `String` | Easy | Biweekly Contest 26 |
|
||
| 1447 | [Simplified Fractions](/solution/1400-1499/1447.Simplified%20Fractions/README_EN.md) | `Math`,`String`,`Number Theory` | Medium | Biweekly Contest 26 |
|
||
| 1448 | [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 | Biweekly Contest 26 |
|
||
| 1449 | [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 | Biweekly Contest 26 |
|
||
| 1450 | [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 | Weekly Contest 189 |
|
||
| 1451 | [Rearrange Words in a Sentence](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README_EN.md) | `String`,`Sorting` | Medium | Weekly Contest 189 |
|
||
| 1452 | [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 | Weekly Contest 189 |
|
||
| 1453 | [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 | Weekly Contest 189 |
|
||
| 1454 | [Active Users](/solution/1400-1499/1454.Active%20Users/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1455 | [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) | `Two Pointers`,`String`,`String Matching` | Easy | Weekly Contest 190 |
|
||
| 1456 | [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 | Weekly Contest 190 |
|
||
| 1457 | [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 | Weekly Contest 190 |
|
||
| 1458 | [Max Dot Product of Two Subsequences](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 190 |
|
||
| 1459 | [Rectangles Area](/solution/1400-1499/1459.Rectangles%20Area/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1460 | [Make Two Arrays Equal by Reversing Subarrays](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 27 |
|
||
| 1461 | [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 | Biweekly Contest 27 |
|
||
| 1462 | [Course Schedule IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | Biweekly Contest 27 |
|
||
| 1463 | [Cherry Pickup II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 27 |
|
||
| 1464 | [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 | Weekly Contest 191 |
|
||
| 1465 | [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 | Weekly Contest 191 |
|
||
| 1466 | [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 | Weekly Contest 191 |
|
||
| 1467 | [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) | `Array`,`Math`,`Dynamic Programming`,`Backtracking`,`Combinatorics`,`Probability and Statistics` | Hard | Weekly Contest 191 |
|
||
| 1468 | [Calculate Salaries](/solution/1400-1499/1468.Calculate%20Salaries/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1469 | [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 | [Shuffle the Array](/solution/1400-1499/1470.Shuffle%20the%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 192 |
|
||
| 1471 | [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 | Weekly Contest 192 |
|
||
| 1472 | [Design Browser History](/solution/1400-1499/1472.Design%20Browser%20History/README_EN.md) | `Stack`,`Design`,`Array`,`Linked List`,`Data Stream`,`Doubly-Linked List` | Medium | Weekly Contest 192 |
|
||
| 1473 | [Paint House III](/solution/1400-1499/1473.Paint%20House%20III/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 192 |
|
||
| 1474 | [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 | [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 | Biweekly Contest 28 |
|
||
| 1476 | [Subrectangle Queries](/solution/1400-1499/1476.Subrectangle%20Queries/README_EN.md) | `Design`,`Array`,`Matrix` | Medium | Biweekly Contest 28 |
|
||
| 1477 | [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 | Biweekly Contest 28 |
|
||
| 1478 | [Allocate Mailboxes](/solution/1400-1499/1478.Allocate%20Mailboxes/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 28 |
|
||
| 1479 | [Sales by Day of the Week](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1480 | [Running Sum of 1d Array](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README_EN.md) | `Array`,`Prefix Sum` | Easy | Weekly Contest 193 |
|
||
| 1481 | [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 | Weekly Contest 193 |
|
||
| 1482 | [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 | Weekly Contest 193 |
|
||
| 1483 | [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 | Weekly Contest 193 |
|
||
| 1484 | [Group Sold Products By The Date](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README_EN.md) | `Database` | Easy | |
|
||
| 1485 | [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 | [XOR Operation in an Array](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README_EN.md) | `Bit Manipulation`,`Math` | Easy | Weekly Contest 194 |
|
||
| 1487 | [Making File Names Unique](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 194 |
|
||
| 1488 | [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 | Weekly Contest 194 |
|
||
| 1489 | [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 | Weekly Contest 194 |
|
||
| 1490 | [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 | [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 | Biweekly Contest 29 |
|
||
| 1492 | [The kth Factor of n](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README_EN.md) | `Math`,`Number Theory` | Medium | Biweekly Contest 29 |
|
||
| 1493 | [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) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | Biweekly Contest 29 |
|
||
| 1494 | [Parallel Courses II](/solution/1400-1499/1494.Parallel%20Courses%20II/README_EN.md) | `Bit Manipulation`,`Graph`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 29 |
|
||
| 1495 | [Friendly Movies Streamed Last Month](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1496 | [Path Crossing](/solution/1400-1499/1496.Path%20Crossing/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 195 |
|
||
| 1497 | [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 | Weekly Contest 195 |
|
||
| 1498 | [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 | Weekly Contest 195 |
|
||
| 1499 | [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 | Weekly Contest 195 |
|
||
| 1500 | [Design a File Sharing System](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README_EN.md) | `Design`,`Hash Table`,`Data Stream`,`Sorting`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 1501 | [Countries You Can Safely Invest In](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1502 | [Can Make Arithmetic Progression From Sequence](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 196 |
|
||
| 1503 | [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 | Weekly Contest 196 |
|
||
| 1504 | [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 | Weekly Contest 196 |
|
||
| 1505 | [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 | Weekly Contest 196 |
|
||
| 1506 | [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 | [Reformat Date](/solution/1500-1599/1507.Reformat%20Date/README_EN.md) | `String` | Easy | Biweekly Contest 30 |
|
||
| 1508 | [Range Sum of Sorted Subarray Sums](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 30 |
|
||
| 1509 | [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 | Biweekly Contest 30 |
|
||
| 1510 | [Stone Game IV](/solution/1500-1599/1510.Stone%20Game%20IV/README_EN.md) | `Math`,`Dynamic Programming`,`Game Theory` | Hard | Biweekly Contest 30 |
|
||
| 1511 | [Customer Order Frequency](/solution/1500-1599/1511.Customer%20Order%20Frequency/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1512 | [Number of Good Pairs](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Easy | Weekly Contest 197 |
|
||
| 1513 | [Number of Substrings With Only 1s](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README_EN.md) | `Math`,`String` | Medium | Weekly Contest 197 |
|
||
| 1514 | [Path with Maximum Probability](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 197 |
|
||
| 1515 | [Best Position for a Service Centre](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README_EN.md) | `Geometry`,`Array`,`Math`,`Randomized` | Hard | Weekly Contest 197 |
|
||
| 1516 | [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 | [Find Users With Valid E-Mails](/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README_EN.md) | `Database` | Easy | |
|
||
| 1518 | [Water Bottles](/solution/1500-1599/1518.Water%20Bottles/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 198 |
|
||
| 1519 | [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`,`Hash Table`,`Counting` | Medium | Weekly Contest 198 |
|
||
| 1520 | [Maximum Number of Non-Overlapping Substrings](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README_EN.md) | `Greedy`,`String` | Hard | Weekly Contest 198 |
|
||
| 1521 | [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 | Weekly Contest 198 |
|
||
| 1522 | [Diameter of N-Ary Tree](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search` | Medium | 🔒 |
|
||
| 1523 | [Count Odd Numbers in an Interval Range](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README_EN.md) | `Math` | Easy | Biweekly Contest 31 |
|
||
| 1524 | [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 | Biweekly Contest 31 |
|
||
| 1525 | [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`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 31 |
|
||
| 1526 | [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 | Biweekly Contest 31 |
|
||
| 1527 | [Patients With a Condition](/solution/1500-1599/1527.Patients%20With%20a%20Condition/README_EN.md) | `Database` | Easy | |
|
||
| 1528 | [Shuffle String](/solution/1500-1599/1528.Shuffle%20String/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 199 |
|
||
| 1529 | [Minimum Suffix Flips](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 199 |
|
||
| 1530 | [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 | Weekly Contest 199 |
|
||
| 1531 | [String Compression II](/solution/1500-1599/1531.String%20Compression%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 199 |
|
||
| 1532 | [The Most Recent Three Orders](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1533 | [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 | [Count Good Triplets](/solution/1500-1599/1534.Count%20Good%20Triplets/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 200 |
|
||
| 1535 | [Find the Winner of an Array Game](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 200 |
|
||
| 1536 | [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 | Weekly Contest 200 |
|
||
| 1537 | [Get the Maximum Score](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Dynamic Programming` | Hard | Weekly Contest 200 |
|
||
| 1538 | [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 | [Kth Missing Positive Number](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README_EN.md) | `Array`,`Binary Search` | Easy | Biweekly Contest 32 |
|
||
| 1540 | [Can Convert String in K Moves](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README_EN.md) | `Hash Table`,`String` | Medium | Biweekly Contest 32 |
|
||
| 1541 | [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 | Biweekly Contest 32 |
|
||
| 1542 | [Find Longest Awesome Substring](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String` | Hard | Biweekly Contest 32 |
|
||
| 1543 | [Fix Product Name Format](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1544 | [Make The String Great](/solution/1500-1599/1544.Make%20The%20String%20Great/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 201 |
|
||
| 1545 | [Find Kth Bit in Nth Binary String](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README_EN.md) | `Recursion`,`String`,`Simulation` | Medium | Weekly Contest 201 |
|
||
| 1546 | [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 | Weekly Contest 201 |
|
||
| 1547 | [Minimum Cost to Cut a Stick](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 201 |
|
||
| 1548 | [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 | [The Most Recent Orders for Each Product](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1550 | [Three Consecutive Odds](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README_EN.md) | `Array` | Easy | Weekly Contest 202 |
|
||
| 1551 | [Minimum Operations to Make Array Equal](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README_EN.md) | `Math` | Medium | Weekly Contest 202 |
|
||
| 1552 | [Magnetic Force Between Two Balls](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | Weekly Contest 202 |
|
||
| 1553 | [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 | Weekly Contest 202 |
|
||
| 1554 | [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 | [Bank Account Summary](/solution/1500-1599/1555.Bank%20Account%20Summary/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1556 | [Thousand Separator](/solution/1500-1599/1556.Thousand%20Separator/README_EN.md) | `String` | Easy | Biweekly Contest 33 |
|
||
| 1557 | [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 | Biweekly Contest 33 |
|
||
| 1558 | [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`,`Bit Manipulation`,`Array` | Medium | Biweekly Contest 33 |
|
||
| 1559 | [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` | Medium | Biweekly Contest 33 |
|
||
| 1560 | [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 | Weekly Contest 203 |
|
||
| 1561 | [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 | Weekly Contest 203 |
|
||
| 1562 | [Find Latest Group of Size M](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Simulation` | Medium | Weekly Contest 203 |
|
||
| 1563 | [Stone Game V](/solution/1500-1599/1563.Stone%20Game%20V/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | Weekly Contest 203 |
|
||
| 1564 | [Put Boxes Into the Warehouse I](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 |
|
||
| 1565 | [Unique Orders and Customers Per Month](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1566 | [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 | Weekly Contest 204 |
|
||
| 1567 | [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 | Weekly Contest 204 |
|
||
| 1568 | [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 | Weekly Contest 204 |
|
||
| 1569 | [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 | Weekly Contest 204 |
|
||
| 1570 | [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 | [Warehouse Manager](/solution/1500-1599/1571.Warehouse%20Manager/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1572 | [Matrix Diagonal Sum](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README_EN.md) | `Array`,`Matrix` | Easy | Biweekly Contest 34 |
|
||
| 1573 | [Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README_EN.md) | `Math`,`String` | Medium | Biweekly Contest 34 |
|
||
| 1574 | [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 | Biweekly Contest 34 |
|
||
| 1575 | [Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 34 |
|
||
| 1576 | [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 | Weekly Contest 205 |
|
||
| 1577 | [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 | Weekly Contest 205 |
|
||
| 1578 | [Minimum Time to Make Rope Colorful](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README_EN.md) | `Greedy`,`Array`,`String`,`Dynamic Programming` | Medium | Weekly Contest 205 |
|
||
| 1579 | [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 | Weekly Contest 205 |
|
||
| 1580 | [Put Boxes Into the Warehouse II](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 |
|
||
| 1581 | [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 | [Special Positions in a Binary Matrix](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 206 |
|
||
| 1583 | [Count Unhappy Friends](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 206 |
|
||
| 1584 | [Min Cost to Connect All Points](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README_EN.md) | `Union Find`,`Graph`,`Array`,`Minimum Spanning Tree` | Medium | Weekly Contest 206 |
|
||
| 1585 | [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 | Weekly Contest 206 |
|
||
| 1586 | [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 | [Bank Account Summary II](/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README_EN.md) | `Database` | Easy | |
|
||
| 1588 | [Sum of All Odd Length Subarrays](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README_EN.md) | `Array`,`Math`,`Prefix Sum` | Easy | Biweekly Contest 35 |
|
||
| 1589 | [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 | Biweekly Contest 35 |
|
||
| 1590 | [Make Sum Divisible by P](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Biweekly Contest 35 |
|
||
| 1591 | [Strange Printer II](/solution/1500-1599/1591.Strange%20Printer%20II/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Matrix` | Hard | Biweekly Contest 35 |
|
||
| 1592 | [Rearrange Spaces Between Words](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README_EN.md) | `String` | Easy | Weekly Contest 207 |
|
||
| 1593 | [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 | Weekly Contest 207 |
|
||
| 1594 | [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 | Weekly Contest 207 |
|
||
| 1595 | [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 | Weekly Contest 207 |
|
||
| 1596 | [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 | [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 | [Crawler Log Folder](/solution/1500-1599/1598.Crawler%20Log%20Folder/README_EN.md) | `Stack`,`Array`,`String` | Easy | Weekly Contest 208 |
|
||
| 1599 | [Maximum Profit of Operating a Centennial Wheel](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 208 |
|
||
| 1600 | [Throne Inheritance](/solution/1600-1699/1600.Throne%20Inheritance/README_EN.md) | `Tree`,`Depth-First Search`,`Design`,`Hash Table` | Medium | Weekly Contest 208 |
|
||
| 1601 | [Maximum Number of Achievable Transfer Requests](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Hard | Weekly Contest 208 |
|
||
| 1602 | [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 | [Design Parking System](/solution/1600-1699/1603.Design%20Parking%20System/README_EN.md) | `Design`,`Counting`,`Simulation` | Easy | Biweekly Contest 36 |
|
||
| 1604 | [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 | Biweekly Contest 36 |
|
||
| 1605 | [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 | Biweekly Contest 36 |
|
||
| 1606 | [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 | Biweekly Contest 36 |
|
||
| 1607 | [Sellers With No Sales](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1608 | [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 | Weekly Contest 209 |
|
||
| 1609 | [Even Odd Tree](/solution/1600-1699/1609.Even%20Odd%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 209 |
|
||
| 1610 | [Maximum Number of Visible Points](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README_EN.md) | `Geometry`,`Array`,`Math`,`Sorting`,`Sliding Window` | Hard | Weekly Contest 209 |
|
||
| 1611 | [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 | Weekly Contest 209 |
|
||
| 1612 | [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`,`Hash Table`,`Binary Tree`,`Counting` | Medium | 🔒 |
|
||
| 1613 | [Find the Missing IDs](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1614 | [Maximum Nesting Depth of the Parentheses](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 210 |
|
||
| 1615 | [Maximal Network Rank](/solution/1600-1699/1615.Maximal%20Network%20Rank/README_EN.md) | `Graph` | Medium | Weekly Contest 210 |
|
||
| 1616 | [Split Two Strings to Make Palindrome](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README_EN.md) | `Two Pointers`,`String` | Medium | Weekly Contest 210 |
|
||
| 1617 | [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 | Weekly Contest 210 |
|
||
| 1618 | [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 | [Mean of Array After Removing Some Elements](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README_EN.md) | `Array`,`Sorting` | Easy | Biweekly Contest 37 |
|
||
| 1620 | [Coordinate With Maximum Network Quality](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README_EN.md) | `Array`,`Enumeration` | Medium | Biweekly Contest 37 |
|
||
| 1621 | [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`,`Combinatorics` | Medium | Biweekly Contest 37 |
|
||
| 1622 | [Fancy Sequence](/solution/1600-1699/1622.Fancy%20Sequence/README_EN.md) | `Design`,`Segment Tree`,`Math` | Hard | Biweekly Contest 37 |
|
||
| 1623 | [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 | [Largest Substring Between Two Equal Characters](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 211 |
|
||
| 1625 | [Lexicographically Smallest String After Applying Operations](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`String`,`Enumeration` | Medium | Weekly Contest 211 |
|
||
| 1626 | [Best Team With No Conflicts](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 211 |
|
||
| 1627 | [Graph Connectivity With Threshold](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README_EN.md) | `Union Find`,`Array`,`Math`,`Number Theory` | Hard | Weekly Contest 211 |
|
||
| 1628 | [Design an Expression Tree With Evaluate Function](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README_EN.md) | `Stack`,`Tree`,`Design`,`Array`,`Math`,`Binary Tree` | Medium | 🔒 |
|
||
| 1629 | [Slowest Key](/solution/1600-1699/1629.Slowest%20Key/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 212 |
|
||
| 1630 | [Arithmetic Subarrays](/solution/1600-1699/1630.Arithmetic%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 212 |
|
||
| 1631 | [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 | Weekly Contest 212 |
|
||
| 1632 | [Rank Transform of a Matrix](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README_EN.md) | `Union Find`,`Graph`,`Topological Sort`,`Array`,`Matrix`,`Sorting` | Hard | Weekly Contest 212 |
|
||
| 1633 | [Percentage of Users Attended a Contest](/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README_EN.md) | `Database` | Easy | |
|
||
| 1634 | [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 | [Hopper Company Queries I](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1636 | [Sort Array by Increasing Frequency](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 38 |
|
||
| 1637 | [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` | Easy | Biweekly Contest 38 |
|
||
| 1638 | [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`,`Enumeration` | Medium | Biweekly Contest 38 |
|
||
| 1639 | [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 | Biweekly Contest 38 |
|
||
| 1640 | [Check Array Formation Through Concatenation](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 213 |
|
||
| 1641 | [Count Sorted Vowel Strings](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Weekly Contest 213 |
|
||
| 1642 | [Furthest Building You Can Reach](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 213 |
|
||
| 1643 | [Kth Smallest Instructions](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 213 |
|
||
| 1644 | [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 | [Hopper Company Queries II](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1646 | [Get Maximum in Generated Array](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 214 |
|
||
| 1647 | [Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 214 |
|
||
| 1648 | [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 | Weekly Contest 214 |
|
||
| 1649 | [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 | Weekly Contest 214 |
|
||
| 1650 | [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`,`Two Pointers`,`Binary Tree` | Medium | 🔒 |
|
||
| 1651 | [Hopper Company Queries III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1652 | [Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README_EN.md) | `Array`,`Sliding Window` | Easy | Biweekly Contest 39 |
|
||
| 1653 | [Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README_EN.md) | `Stack`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 39 |
|
||
| 1654 | [Minimum Jumps to Reach Home](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming` | Medium | Biweekly Contest 39 |
|
||
| 1655 | [Distribute Repeating Integers](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Biweekly Contest 39 |
|
||
| 1656 | [Design an Ordered Stream](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README_EN.md) | `Design`,`Array`,`Hash Table`,`Data Stream` | Easy | Weekly Contest 215 |
|
||
| 1657 | [Determine if Two Strings Are Close](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README_EN.md) | `Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 215 |
|
||
| 1658 | [Minimum Operations to Reduce X to Zero](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 215 |
|
||
| 1659 | [Maximize Grid Happiness](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README_EN.md) | `Bit Manipulation`,`Memoization`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 215 |
|
||
| 1660 | [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 | [Average Time of Process per Machine](/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README_EN.md) | `Database` | Easy | |
|
||
| 1662 | [Check If Two String Arrays are Equivalent](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 216 |
|
||
| 1663 | [Smallest String With A Given Numeric Value](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 216 |
|
||
| 1664 | [Ways to Make a Fair Array](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 216 |
|
||
| 1665 | [Minimum Initial Energy to Finish Tasks](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 216 |
|
||
| 1666 | [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 | [Fix Names in a Table](/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README_EN.md) | `Database` | Easy | |
|
||
| 1668 | [Maximum Repeating Substring](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README_EN.md) | `String`,`Dynamic Programming`,`String Matching` | Easy | Biweekly Contest 40 |
|
||
| 1669 | [Merge In Between Linked Lists](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README_EN.md) | `Linked List` | Medium | Biweekly Contest 40 |
|
||
| 1670 | [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 | Biweekly Contest 40 |
|
||
| 1671 | [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 | Biweekly Contest 40 |
|
||
| 1672 | [Richest Customer Wealth](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 217 |
|
||
| 1673 | [Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README_EN.md) | `Stack`,`Greedy`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 217 |
|
||
| 1674 | [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 | Weekly Contest 217 |
|
||
| 1675 | [Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README_EN.md) | `Greedy`,`Array`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Weekly Contest 217 |
|
||
| 1676 | [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`,`Hash Table`,`Binary Tree` | Medium | 🔒 |
|
||
| 1677 | [Product's Worth Over Invoices](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1678 | [Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README_EN.md) | `String` | Easy | Weekly Contest 218 |
|
||
| 1679 | [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 | Weekly Contest 218 |
|
||
| 1680 | [Concatenation of Consecutive Binary Numbers](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README_EN.md) | `Bit Manipulation`,`Math`,`Simulation` | Medium | Weekly Contest 218 |
|
||
| 1681 | [Minimum Incompatibility](/solution/1600-1699/1681.Minimum%20Incompatibility/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 218 |
|
||
| 1682 | [Longest Palindromic Subsequence II](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README_EN.md) | `String`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 1683 | [Invalid Tweets](/solution/1600-1699/1683.Invalid%20Tweets/README_EN.md) | `Database` | Easy | |
|
||
| 1684 | [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`,`Counting` | Easy | Biweekly Contest 41 |
|
||
| 1685 | [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 | Biweekly Contest 41 |
|
||
| 1686 | [Stone Game VI](/solution/1600-1699/1686.Stone%20Game%20VI/README_EN.md) | `Greedy`,`Array`,`Math`,`Game Theory`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 41 |
|
||
| 1687 | [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`,`Prefix Sum`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Biweekly Contest 41 |
|
||
| 1688 | [Count of Matches in Tournament](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 219 |
|
||
| 1689 | [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 | Weekly Contest 219 |
|
||
| 1690 | [Stone Game VII](/solution/1600-1699/1690.Stone%20Game%20VII/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | Weekly Contest 219 |
|
||
| 1691 | [Maximum Height by Stacking Cuboids](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 219 |
|
||
| 1692 | [Count Ways to Distribute Candies](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README_EN.md) | `Dynamic Programming` | Hard | 🔒 |
|
||
| 1693 | [Daily Leads and Partners](/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README_EN.md) | `Database` | Easy | |
|
||
| 1694 | [Reformat Phone Number](/solution/1600-1699/1694.Reformat%20Phone%20Number/README_EN.md) | `String` | Easy | Weekly Contest 220 |
|
||
| 1695 | [Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 220 |
|
||
| 1696 | [Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Weekly Contest 220 |
|
||
| 1697 | [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`,`Two Pointers`,`Sorting` | Hard | Weekly Contest 220 |
|
||
| 1698 | [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 | [Number of Calls Between Two Persons](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1700 | [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 | Biweekly Contest 42 |
|
||
| 1701 | [Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README_EN.md) | `Array`,`Simulation` | Medium | Biweekly Contest 42 |
|
||
| 1702 | [Maximum Binary String After Change](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README_EN.md) | `Greedy`,`String` | Medium | Biweekly Contest 42 |
|
||
| 1703 | [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 | Biweekly Contest 42 |
|
||
| 1704 | [Determine if String Halves Are Alike](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README_EN.md) | `String`,`Counting` | Easy | Weekly Contest 221 |
|
||
| 1705 | [Maximum Number of Eaten Apples](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 221 |
|
||
| 1706 | [Where Will the Ball Fall](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 221 |
|
||
| 1707 | [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 | Weekly Contest 221 |
|
||
| 1708 | [Largest Subarray Length K](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README_EN.md) | `Greedy`,`Array` | Easy | 🔒 |
|
||
| 1709 | [Biggest Window Between Visits](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1710 | [Maximum Units on a Truck](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 222 |
|
||
| 1711 | [Count Good Meals](/solution/1700-1799/1711.Count%20Good%20Meals/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 222 |
|
||
| 1712 | [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 | Weekly Contest 222 |
|
||
| 1713 | [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 | Weekly Contest 222 |
|
||
| 1714 | [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 | [Count Apples and Oranges](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1716 | [Calculate Money in Leetcode Bank](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README_EN.md) | `Math` | Easy | Biweekly Contest 43 |
|
||
| 1717 | [Maximum Score From Removing Substrings](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Biweekly Contest 43 |
|
||
| 1718 | [Construct the Lexicographically Largest Valid Sequence](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README_EN.md) | `Array`,`Backtracking` | Medium | Biweekly Contest 43 |
|
||
| 1719 | [Number Of Ways To Reconstruct A Tree](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README_EN.md) | `Tree`,`Graph` | Hard | Biweekly Contest 43 |
|
||
| 1720 | [Decode XORed Array](/solution/1700-1799/1720.Decode%20XORed%20Array/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 223 |
|
||
| 1721 | [Swapping Nodes in a Linked List](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | Weekly Contest 223 |
|
||
| 1722 | [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 | Weekly Contest 223 |
|
||
| 1723 | [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 | Weekly Contest 223 |
|
||
| 1724 | [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 | [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 | Weekly Contest 224 |
|
||
| 1726 | [Tuple with Same Product](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 224 |
|
||
| 1727 | [Largest Submatrix With Rearrangements](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Sorting` | Medium | Weekly Contest 224 |
|
||
| 1728 | [Cat and Mouse II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README_EN.md) | `Graph`,`Topological Sort`,`Memoization`,`Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Matrix` | Hard | Weekly Contest 224 |
|
||
| 1729 | [Find Followers Count](/solution/1700-1799/1729.Find%20Followers%20Count/README_EN.md) | `Database` | Easy | |
|
||
| 1730 | [Shortest Path to Get Food](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 |
|
||
| 1731 | [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 | [Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README_EN.md) | `Array`,`Prefix Sum` | Easy | Biweekly Contest 44 |
|
||
| 1733 | [Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Biweekly Contest 44 |
|
||
| 1734 | [Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Biweekly Contest 44 |
|
||
| 1735 | [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`,`Combinatorics`,`Number Theory` | Hard | Biweekly Contest 44 |
|
||
| 1736 | [Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 225 |
|
||
| 1737 | [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 | Weekly Contest 225 |
|
||
| 1738 | [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`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 225 |
|
||
| 1739 | [Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README_EN.md) | `Greedy`,`Math`,`Binary Search` | Hard | Weekly Contest 225 |
|
||
| 1740 | [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 | [Find Total Time Spent by Each Employee](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README_EN.md) | `Database` | Easy | |
|
||
| 1742 | [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 | Weekly Contest 226 |
|
||
| 1743 | [Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README_EN.md) | `Depth-First Search`,`Array`,`Hash Table` | Medium | Weekly Contest 226 |
|
||
| 1744 | [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 | Weekly Contest 226 |
|
||
| 1745 | [Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 226 |
|
||
| 1746 | [Maximum Subarray Sum After One Operation](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 1747 | [Leetflex Banned Accounts](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1748 | [Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 45 |
|
||
| 1749 | [Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 45 |
|
||
| 1750 | [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 | Biweekly Contest 45 |
|
||
| 1751 | [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`,`Sorting` | Hard | Biweekly Contest 45 |
|
||
| 1752 | [Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README_EN.md) | `Array` | Easy | Weekly Contest 227 |
|
||
| 1753 | [Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README_EN.md) | `Greedy`,`Math`,`Heap (Priority Queue)` | Medium | Weekly Contest 227 |
|
||
| 1754 | [Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 227 |
|
||
| 1755 | [Closest Subsequence Sum](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Dynamic Programming`,`Bitmask`,`Sorting` | Hard | Weekly Contest 227 |
|
||
| 1756 | [Design Most Recently Used Queue](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README_EN.md) | `Stack`,`Design`,`Binary Indexed Tree`,`Array`,`Hash Table`,`Ordered Set` | Medium | 🔒 |
|
||
| 1757 | [Recyclable and Low Fat Products](/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README_EN.md) | `Database` | Easy | |
|
||
| 1758 | [Minimum Changes To Make Alternating Binary String](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README_EN.md) | `String` | Easy | Weekly Contest 228 |
|
||
| 1759 | [Count Number of Homogenous Substrings](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README_EN.md) | `Math`,`String` | Medium | Weekly Contest 228 |
|
||
| 1760 | [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 | Weekly Contest 228 |
|
||
| 1761 | [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`,`Enumeration` | Hard | Weekly Contest 228 |
|
||
| 1762 | [Buildings With an Ocean View](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 1763 | [Longest Nice Substring](/solution/1700-1799/1763.Longest%20Nice%20Substring/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Divide and Conquer`,`Sliding Window` | Easy | Biweekly Contest 46 |
|
||
| 1764 | [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`,`Two Pointers`,`String Matching` | Medium | Biweekly Contest 46 |
|
||
| 1765 | [Map of Highest Peak](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Biweekly Contest 46 |
|
||
| 1766 | [Tree of Coprimes](/solution/1700-1799/1766.Tree%20of%20Coprimes/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Math`,`Number Theory` | Hard | Biweekly Contest 46 |
|
||
| 1767 | [Find the Subtasks That Did Not Execute](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1768 | [Merge Strings Alternately](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 229 |
|
||
| 1769 | [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`,`Prefix Sum` | Medium | Weekly Contest 229 |
|
||
| 1770 | [Maximum Score from Performing Multiplication Operations](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 229 |
|
||
| 1771 | [Maximize Palindrome Length From Subsequences](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 229 |
|
||
| 1772 | [Sort Features by Popularity](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | 🔒 |
|
||
| 1773 | [Count Items Matching a Rule](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 230 |
|
||
| 1774 | [Closest Dessert Cost](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README_EN.md) | `Array`,`Dynamic Programming`,`Backtracking` | Medium | Weekly Contest 230 |
|
||
| 1775 | [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 | Weekly Contest 230 |
|
||
| 1776 | [Car Fleet II](/solution/1700-1799/1776.Car%20Fleet%20II/README_EN.md) | `Stack`,`Array`,`Math`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 230 |
|
||
| 1777 | [Product's Price for Each Store](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1778 | [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`,`Array`,`Interactive`,`Matrix` | Medium | 🔒 |
|
||
| 1779 | [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 | Biweekly Contest 47 |
|
||
| 1780 | [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 | Biweekly Contest 47 |
|
||
| 1781 | [Sum of Beauty of All Substrings](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 47 |
|
||
| 1782 | [Count Pairs Of Nodes](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README_EN.md) | `Graph`,`Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Counting`,`Sorting` | Hard | Biweekly Contest 47 |
|
||
| 1783 | [Grand Slam Titles](/solution/1700-1799/1783.Grand%20Slam%20Titles/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1784 | [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 | Weekly Contest 231 |
|
||
| 1785 | [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 | Weekly Contest 231 |
|
||
| 1786 | [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 | Weekly Contest 231 |
|
||
| 1787 | [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 | Weekly Contest 231 |
|
||
| 1788 | [Maximize the Beauty of the Garden](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Prefix Sum` | Hard | 🔒 |
|
||
| 1789 | [Primary Department for Each Employee](/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README_EN.md) | `Database` | Easy | |
|
||
| 1790 | [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 | Weekly Contest 232 |
|
||
| 1791 | [Find Center of Star Graph](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README_EN.md) | `Graph` | Easy | Weekly Contest 232 |
|
||
| 1792 | [Maximum Average Pass Ratio](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 232 |
|
||
| 1793 | [Maximum Score of a Good Subarray](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README_EN.md) | `Stack`,`Array`,`Two Pointers`,`Binary Search`,`Monotonic Stack` | Hard | Weekly Contest 232 |
|
||
| 1794 | [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 | [Rearrange Products Table](/solution/1700-1799/1795.Rearrange%20Products%20Table/README_EN.md) | `Database` | Easy | |
|
||
| 1796 | [Second Largest Digit in a String](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README_EN.md) | `Hash Table`,`String` | Easy | Biweekly Contest 48 |
|
||
| 1797 | [Design Authentication Manager](/solution/1700-1799/1797.Design%20Authentication%20Manager/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List` | Medium | Biweekly Contest 48 |
|
||
| 1798 | [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`,`Sorting` | Medium | Biweekly Contest 48 |
|
||
| 1799 | [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 | Biweekly Contest 48 |
|
||
| 1800 | [Maximum Ascending Subarray Sum](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README_EN.md) | `Array` | Easy | Weekly Contest 233 |
|
||
| 1801 | [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 | Weekly Contest 233 |
|
||
| 1802 | [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`,`Math`,`Binary Search` | Medium | Weekly Contest 233 |
|
||
| 1803 | [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 | Weekly Contest 233 |
|
||
| 1804 | [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 | [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 | Weekly Contest 234 |
|
||
| 1806 | [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 | Weekly Contest 234 |
|
||
| 1807 | [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 | Weekly Contest 234 |
|
||
| 1808 | [Maximize Number of Nice Divisors](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README_EN.md) | `Recursion`,`Math`,`Number Theory` | Hard | Weekly Contest 234 |
|
||
| 1809 | [Ad-Free Sessions](/solution/1800-1899/1809.Ad-Free%20Sessions/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1810 | [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`,`Array`,`Interactive`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 1811 | [Find Interview Candidates](/solution/1800-1899/1811.Find%20Interview%20Candidates/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1812 | [Determine Color of a Chessboard Square](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 49 |
|
||
| 1813 | [Sentence Similarity III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README_EN.md) | `Array`,`Two Pointers`,`String` | Medium | Biweekly Contest 49 |
|
||
| 1814 | [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 | Biweekly Contest 49 |
|
||
| 1815 | [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 | Biweekly Contest 49 |
|
||
| 1816 | [Truncate Sentence](/solution/1800-1899/1816.Truncate%20Sentence/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 235 |
|
||
| 1817 | [Finding the Users Active Minutes](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 235 |
|
||
| 1818 | [Minimum Absolute Sum Difference](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README_EN.md) | `Array`,`Binary Search`,`Ordered Set`,`Sorting` | Medium | Weekly Contest 235 |
|
||
| 1819 | [Number of Different Subsequences GCDs](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README_EN.md) | `Array`,`Math`,`Counting`,`Number Theory` | Hard | Weekly Contest 235 |
|
||
| 1820 | [Maximum Number of Accepted Invitations](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README_EN.md) | `Depth-First Search`,`Graph`,`Array`,`Matrix` | Medium | 🔒 |
|
||
| 1821 | [Find Customers With Positive Revenue this Year](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1822 | [Sign of the Product of an Array](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 236 |
|
||
| 1823 | [Find the Winner of the Circular Game](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README_EN.md) | `Recursion`,`Queue`,`Array`,`Math`,`Simulation` | Medium | Weekly Contest 236 |
|
||
| 1824 | [Minimum Sideway Jumps](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 236 |
|
||
| 1825 | [Finding MK Average](/solution/1800-1899/1825.Finding%20MK%20Average/README_EN.md) | `Design`,`Queue`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Weekly Contest 236 |
|
||
| 1826 | [Faulty Sensor](/solution/1800-1899/1826.Faulty%20Sensor/README_EN.md) | `Array`,`Two Pointers` | Easy | 🔒 |
|
||
| 1827 | [Minimum Operations to Make the Array Increasing](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README_EN.md) | `Greedy`,`Array` | Easy | Biweekly Contest 50 |
|
||
| 1828 | [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 | Biweekly Contest 50 |
|
||
| 1829 | [Maximum XOR for Each Query](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README_EN.md) | `Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Biweekly Contest 50 |
|
||
| 1830 | [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 | Biweekly Contest 50 |
|
||
| 1831 | [Maximum Transaction Each Day](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1832 | [Check if the Sentence Is Pangram](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 237 |
|
||
| 1833 | [Maximum Ice Cream Bars](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README_EN.md) | `Greedy`,`Array`,`Counting Sort`,`Sorting` | Medium | Weekly Contest 237 |
|
||
| 1834 | [Single-Threaded CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 237 |
|
||
| 1835 | [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 | Weekly Contest 237 |
|
||
| 1836 | [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 | [Sum of Digits in Base K](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README_EN.md) | `Math` | Easy | Weekly Contest 238 |
|
||
| 1838 | [Frequency of the Most Frequent Element](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Medium | Weekly Contest 238 |
|
||
| 1839 | [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 | Weekly Contest 238 |
|
||
| 1840 | [Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md) | `Array`,`Math`,`Sorting` | Hard | Weekly Contest 238 |
|
||
| 1841 | [League Statistics](/solution/1800-1899/1841.League%20Statistics/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1842 | [Next Palindrome Using Same Digits](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README_EN.md) | `Two Pointers`,`String` | Hard | 🔒 |
|
||
| 1843 | [Suspicious Bank Accounts](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1844 | [Replace All Digits with Characters](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README_EN.md) | `String` | Easy | Biweekly Contest 51 |
|
||
| 1845 | [Seat Reservation Manager](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README_EN.md) | `Design`,`Heap (Priority Queue)` | Medium | Biweekly Contest 51 |
|
||
| 1846 | [Maximum Element After Decreasing and Rearranging](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 51 |
|
||
| 1847 | [Closest Room](/solution/1800-1899/1847.Closest%20Room/README_EN.md) | `Array`,`Binary Search`,`Ordered Set`,`Sorting` | Hard | Biweekly Contest 51 |
|
||
| 1848 | [Minimum Distance to the Target Element](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README_EN.md) | `Array` | Easy | Weekly Contest 239 |
|
||
| 1849 | [Splitting a String Into Descending Consecutive Values](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README_EN.md) | `String`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 239 |
|
||
| 1850 | [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 | Weekly Contest 239 |
|
||
| 1851 | [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 | Weekly Contest 239 |
|
||
| 1852 | [Distinct Numbers in Each Subarray](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | 🔒 |
|
||
| 1853 | [Convert Date Format](/solution/1800-1899/1853.Convert%20Date%20Format/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1854 | [Maximum Population Year](/solution/1800-1899/1854.Maximum%20Population%20Year/README_EN.md) | `Array`,`Counting`,`Prefix Sum` | Easy | Weekly Contest 240 |
|
||
| 1855 | [Maximum Distance Between a Pair of Values](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README_EN.md) | `Array`,`Two Pointers`,`Binary Search` | Medium | Weekly Contest 240 |
|
||
| 1856 | [Maximum Subarray Min-Product](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README_EN.md) | `Stack`,`Array`,`Prefix Sum`,`Monotonic Stack` | Medium | Weekly Contest 240 |
|
||
| 1857 | [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 | Weekly Contest 240 |
|
||
| 1858 | [Longest Word With All Prefixes](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README_EN.md) | `Depth-First Search`,`Trie`,`Array`,`String` | Medium | 🔒 |
|
||
| 1859 | [Sorting the Sentence](/solution/1800-1899/1859.Sorting%20the%20Sentence/README_EN.md) | `String`,`Sorting` | Easy | Biweekly Contest 52 |
|
||
| 1860 | [Incremental Memory Leak](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README_EN.md) | `Math`,`Simulation` | Medium | Biweekly Contest 52 |
|
||
| 1861 | [Rotating the Box](/solution/1800-1899/1861.Rotating%20the%20Box/README_EN.md) | `Array`,`Two Pointers`,`Matrix` | Medium | Biweekly Contest 52 |
|
||
| 1862 | [Sum of Floored Pairs](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README_EN.md) | `Array`,`Math`,`Binary Search`,`Prefix Sum` | Hard | Biweekly Contest 52 |
|
||
| 1863 | [Sum of All Subset XOR Totals](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Backtracking`,`Combinatorics`,`Enumeration` | Easy | Weekly Contest 241 |
|
||
| 1864 | [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 | Weekly Contest 241 |
|
||
| 1865 | [Finding Pairs With a Certain Sum](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README_EN.md) | `Design`,`Array`,`Hash Table` | Medium | Weekly Contest 241 |
|
||
| 1866 | [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 | Weekly Contest 241 |
|
||
| 1867 | [Orders With Maximum Quantity Above Average](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1868 | [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 | [Longer Contiguous Segments of Ones than Zeros](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README_EN.md) | `String` | Easy | Weekly Contest 242 |
|
||
| 1870 | [Minimum Speed to Arrive on Time](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 242 |
|
||
| 1871 | [Jump Game VII](/solution/1800-1899/1871.Jump%20Game%20VII/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 242 |
|
||
| 1872 | [Stone Game VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Prefix Sum` | Hard | Weekly Contest 242 |
|
||
| 1873 | [Calculate Special Bonus](/solution/1800-1899/1873.Calculate%20Special%20Bonus/README_EN.md) | `Database` | Easy | |
|
||
| 1874 | [Minimize Product Sum of Two Arrays](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 |
|
||
| 1875 | [Group Employees of the Same Salary](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1876 | [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 | Biweekly Contest 53 |
|
||
| 1877 | [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 | Biweekly Contest 53 |
|
||
| 1878 | [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 | Biweekly Contest 53 |
|
||
| 1879 | [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 | Biweekly Contest 53 |
|
||
| 1880 | [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 | Weekly Contest 243 |
|
||
| 1881 | [Maximum Value after Insertion](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 243 |
|
||
| 1882 | [Process Tasks Using Servers](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README_EN.md) | `Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 243 |
|
||
| 1883 | [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 | Weekly Contest 243 |
|
||
| 1884 | [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 | [Count Pairs in Two Arrays](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | 🔒 |
|
||
| 1886 | [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 | Weekly Contest 244 |
|
||
| 1887 | [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 | Weekly Contest 244 |
|
||
| 1888 | [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) | `String`,`Dynamic Programming`,`Sliding Window` | Medium | Weekly Contest 244 |
|
||
| 1889 | [Minimum Space Wasted From Packaging](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 244 |
|
||
| 1890 | [The Latest Login in 2020](/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README_EN.md) | `Database` | Easy | |
|
||
| 1891 | [Cutting Ribbons](/solution/1800-1899/1891.Cutting%20Ribbons/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 |
|
||
| 1892 | [Page Recommendations II](/solution/1800-1899/1892.Page%20Recommendations%20II/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1893 | [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 | Biweekly Contest 54 |
|
||
| 1894 | [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 | Biweekly Contest 54 |
|
||
| 1895 | [Largest Magic Square](/solution/1800-1899/1895.Largest%20Magic%20Square/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Biweekly Contest 54 |
|
||
| 1896 | [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 | Biweekly Contest 54 |
|
||
| 1897 | [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 | Weekly Contest 245 |
|
||
| 1898 | [Maximum Number of Removable Characters](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README_EN.md) | `Array`,`Two Pointers`,`String`,`Binary Search` | Medium | Weekly Contest 245 |
|
||
| 1899 | [Merge Triplets to Form Target Triplet](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 245 |
|
||
| 1900 | [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 | Weekly Contest 245 |
|
||
| 1901 | [Find a Peak Element II](/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | |
|
||
| 1902 | [Depth of BST Given Insertion Order](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README_EN.md) | `Tree`,`Binary Search Tree`,`Array`,`Binary Tree`,`Ordered Set` | Medium | 🔒 |
|
||
| 1903 | [Largest Odd Number in String](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README_EN.md) | `Greedy`,`Math`,`String` | Easy | Weekly Contest 246 |
|
||
| 1904 | [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 | Weekly Contest 246 |
|
||
| 1905 | [Count Sub Islands](/solution/1900-1999/1905.Count%20Sub%20Islands/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 246 |
|
||
| 1906 | [Minimum Absolute Difference Queries](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 246 |
|
||
| 1907 | [Count Salary Categories](/solution/1900-1999/1907.Count%20Salary%20Categories/README_EN.md) | `Database` | Medium | |
|
||
| 1908 | [Game of Nim](/solution/1900-1999/1908.Game%20of%20Nim/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | 🔒 |
|
||
| 1909 | [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 | Biweekly Contest 55 |
|
||
| 1910 | [Remove All Occurrences of a Substring](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README_EN.md) | `Stack`,`String`,`Simulation` | Medium | Biweekly Contest 55 |
|
||
| 1911 | [Maximum Alternating Subsequence Sum](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 55 |
|
||
| 1912 | [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 | Biweekly Contest 55 |
|
||
| 1913 | [Maximum Product Difference Between Two Pairs](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 247 |
|
||
| 1914 | [Cyclically Rotating a Grid](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 247 |
|
||
| 1915 | [Number of Wonderful Substrings](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum` | Medium | Weekly Contest 247 |
|
||
| 1916 | [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 | Weekly Contest 247 |
|
||
| 1917 | [Leetcodify Friends Recommendations](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1918 | [Kth Smallest Subarray Sum](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README_EN.md) | `Array`,`Binary Search`,`Sliding Window` | Medium | 🔒 |
|
||
| 1919 | [Leetcodify Similar Friends](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1920 | [Build Array from Permutation](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 248 |
|
||
| 1921 | [Eliminate Maximum Number of Monsters](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 248 |
|
||
| 1922 | [Count Good Numbers](/solution/1900-1999/1922.Count%20Good%20Numbers/README_EN.md) | `Recursion`,`Math` | Medium | Weekly Contest 248 |
|
||
| 1923 | [Longest Common Subpath](/solution/1900-1999/1923.Longest%20Common%20Subpath/README_EN.md) | `Array`,`Binary Search`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 248 |
|
||
| 1924 | [Erect the Fence II](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | 🔒 |
|
||
| 1925 | [Count Square Sum Triples](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README_EN.md) | `Math`,`Enumeration` | Easy | Biweekly Contest 56 |
|
||
| 1926 | [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 | Biweekly Contest 56 |
|
||
| 1927 | [Sum Game](/solution/1900-1999/1927.Sum%20Game/README_EN.md) | `Greedy`,`Math`,`String`,`Game Theory` | Medium | Biweekly Contest 56 |
|
||
| 1928 | [Minimum Cost to Reach Destination in Time](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README_EN.md) | `Graph`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 56 |
|
||
| 1929 | [Concatenation of Array](/solution/1900-1999/1929.Concatenation%20of%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 249 |
|
||
| 1930 | [Unique Length-3 Palindromic Subsequences](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum` | Medium | Weekly Contest 249 |
|
||
| 1931 | [Painting a Grid With Three Different Colors](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 249 |
|
||
| 1932 | [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 | Weekly Contest 249 |
|
||
| 1933 | [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) | `String` | Easy | 🔒 |
|
||
| 1934 | [Confirmation Rate](/solution/1900-1999/1934.Confirmation%20Rate/README_EN.md) | `Database` | Medium | |
|
||
| 1935 | [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 | Weekly Contest 250 |
|
||
| 1936 | [Add Minimum Number of Rungs](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 250 |
|
||
| 1937 | [Maximum Number of Points with Cost](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 250 |
|
||
| 1938 | [Maximum Genetic Difference Query](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README_EN.md) | `Bit Manipulation`,`Depth-First Search`,`Trie`,`Array`,`Hash Table` | Hard | Weekly Contest 250 |
|
||
| 1939 | [Users That Actively Request Confirmation Messages](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 1940 | [Longest Common Subsequence Between Sorted Arrays](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | 🔒 |
|
||
| 1941 | [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 | Biweekly Contest 57 |
|
||
| 1942 | [The Number of the Smallest Unoccupied Chair](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README_EN.md) | `Array`,`Hash Table`,`Heap (Priority Queue)` | Medium | Biweekly Contest 57 |
|
||
| 1943 | [Describe the Painting](/solution/1900-1999/1943.Describe%20the%20Painting/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 57 |
|
||
| 1944 | [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 | Biweekly Contest 57 |
|
||
| 1945 | [Sum of Digits of String After Convert](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 251 |
|
||
| 1946 | [Largest Number After Mutating Substring](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README_EN.md) | `Greedy`,`Array`,`String` | Medium | Weekly Contest 251 |
|
||
| 1947 | [Maximum Compatibility Score Sum](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 251 |
|
||
| 1948 | [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 | Weekly Contest 251 |
|
||
| 1949 | [Strong Friendship](/solution/1900-1999/1949.Strong%20Friendship/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1950 | [Maximum of Minimum Values in All Subarrays](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 1951 | [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) | `Database` | Medium | 🔒 |
|
||
| 1952 | [Three Divisors](/solution/1900-1999/1952.Three%20Divisors/README_EN.md) | `Math`,`Enumeration`,`Number Theory` | Easy | Weekly Contest 252 |
|
||
| 1953 | [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 | Weekly Contest 252 |
|
||
| 1954 | [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 | Weekly Contest 252 |
|
||
| 1955 | [Count Number of Special Subsequences](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 252 |
|
||
| 1956 | [Minimum Time For K Virus Variants to Spread](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README_EN.md) | `Geometry`,`Array`,`Math`,`Binary Search`,`Enumeration` | Hard | 🔒 |
|
||
| 1957 | [Delete Characters to Make Fancy String](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README_EN.md) | `String` | Easy | Biweekly Contest 58 |
|
||
| 1958 | [Check if Move is Legal](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Medium | Biweekly Contest 58 |
|
||
| 1959 | [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 | Biweekly Contest 58 |
|
||
| 1960 | [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 | Biweekly Contest 58 |
|
||
| 1961 | [Check If String Is a Prefix of Array](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README_EN.md) | `Array`,`Two Pointers`,`String` | Easy | Weekly Contest 253 |
|
||
| 1962 | [Remove Stones to Minimize the Total](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 253 |
|
||
| 1963 | [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 | Weekly Contest 253 |
|
||
| 1964 | [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 | Weekly Contest 253 |
|
||
| 1965 | [Employees With Missing Information](/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README_EN.md) | `Database` | Easy | |
|
||
| 1966 | [Binary Searchable Numbers in an Unsorted Array](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 |
|
||
| 1967 | [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) | `Array`,`String` | Easy | Weekly Contest 254 |
|
||
| 1968 | [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 | Weekly Contest 254 |
|
||
| 1969 | [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 | Weekly Contest 254 |
|
||
| 1970 | [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 | Weekly Contest 254 |
|
||
| 1971 | [Find if Path Exists in Graph](/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Easy | |
|
||
| 1972 | [First and Last Call On the Same Day](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 1973 | [Count Nodes Equal to Sum of Descendants](/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 |
|
||
| 1974 | [Minimum Time to Type Word Using Special Typewriter](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README_EN.md) | `Greedy`,`String` | Easy | Biweekly Contest 59 |
|
||
| 1975 | [Maximum Matrix Sum](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Biweekly Contest 59 |
|
||
| 1976 | [Number of Ways to Arrive at Destination](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README_EN.md) | `Graph`,`Topological Sort`,`Dynamic Programming`,`Shortest Path` | Medium | Biweekly Contest 59 |
|
||
| 1977 | [Number of Ways to Separate Numbers](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README_EN.md) | `String`,`Dynamic Programming`,`Suffix Array` | Hard | Biweekly Contest 59 |
|
||
| 1978 | [Employees Whose Manager Left the Company](/solution/1900-1999/1978.Employees%20Whose%20Manager%20Left%20the%20Company/README_EN.md) | `Database` | Easy | |
|
||
| 1979 | [Find Greatest Common Divisor of Array](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README_EN.md) | `Array`,`Math`,`Number Theory` | Easy | Weekly Contest 255 |
|
||
| 1980 | [Find Unique Binary String](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README_EN.md) | `Array`,`Hash Table`,`String`,`Backtracking` | Medium | Weekly Contest 255 |
|
||
| 1981 | [Minimize the Difference Between Target and Chosen Elements](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 255 |
|
||
| 1982 | [Find Array Given Subset Sums](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README_EN.md) | `Array`,`Divide and Conquer` | Hard | Weekly Contest 255 |
|
||
| 1983 | [Widest Pair of Indices With Equal Range Sum](/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | 🔒 |
|
||
| 1984 | [Minimum Difference Between Highest and Lowest of K Scores](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README_EN.md) | `Array`,`Sorting`,`Sliding Window` | Easy | Weekly Contest 256 |
|
||
| 1985 | [Find the Kth Largest Integer in the Array](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README_EN.md) | `Array`,`String`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 256 |
|
||
| 1986 | [Minimum Number of Work Sessions to Finish the Tasks](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 256 |
|
||
| 1987 | [Number of Unique Good Subsequences](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 256 |
|
||
| 1988 | [Find Cutoff Score for Each School](/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1989 | [Maximum Number of People That Can Be Caught in Tag](/solution/1900-1999/1989.Maximum%20Number%20of%20People%20That%20Can%20Be%20Caught%20in%20Tag/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 |
|
||
| 1990 | [Count the Number of Experiments](/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 1991 | [Find the Middle Index in Array](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README_EN.md) | `Array`,`Prefix Sum` | Easy | Biweekly Contest 60 |
|
||
| 1992 | [Find All Groups of Farmland](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | Biweekly Contest 60 |
|
||
| 1993 | [Operations on Tree](/solution/1900-1999/1993.Operations%20on%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Array`,`Hash Table` | Medium | Biweekly Contest 60 |
|
||
| 1994 | [The Number of Good Subsets](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 60 |
|
||
| 1995 | [Count Special Quadruplets](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Easy | Weekly Contest 257 |
|
||
| 1996 | [The Number of Weak Characters in the Game](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README_EN.md) | `Stack`,`Greedy`,`Array`,`Sorting`,`Monotonic Stack` | Medium | Weekly Contest 257 |
|
||
| 1997 | [First Day Where You Have Been in All the Rooms](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 257 |
|
||
| 1998 | [GCD Sort of an Array](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README_EN.md) | `Union Find`,`Array`,`Math`,`Number Theory`,`Sorting` | Hard | Weekly Contest 257 |
|
||
| 1999 | [Smallest Greater Multiple Made of Two Digits](/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README_EN.md) | `Math`,`Enumeration` | Medium | 🔒 |
|
||
| 2000 | [Reverse Prefix of Word](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README_EN.md) | `Stack`,`Two Pointers`,`String` | Easy | Weekly Contest 258 |
|
||
| 2001 | [Number of Pairs of Interchangeable Rectangles](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Medium | Weekly Contest 258 |
|
||
| 2002 | [Maximum Product of the Length of Two Palindromic Subsequences](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README_EN.md) | `Bit Manipulation`,`String`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 258 |
|
||
| 2003 | [Smallest Missing Genetic Value in Each Subtree](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Union Find`,`Dynamic Programming` | Hard | Weekly Contest 258 |
|
||
| 2004 | [The Number of Seniors and Juniors to Join the Company](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2005 | [Subtree Removal Game with Fibonacci Tree](/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README_EN.md) | `Tree`,`Math`,`Dynamic Programming`,`Binary Tree`,`Game Theory` | Hard | 🔒 |
|
||
| 2006 | [Count Number of Pairs With Absolute Difference K](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 61 |
|
||
| 2007 | [Find Original Array From Doubled Array](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Biweekly Contest 61 |
|
||
| 2008 | [Maximum Earnings From Taxi](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Biweekly Contest 61 |
|
||
| 2009 | [Minimum Number of Operations to Make Array Continuous](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sliding Window` | Hard | Biweekly Contest 61 |
|
||
| 2010 | [The Number of Seniors and Juniors to Join the Company II](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2011 | [Final Value of Variable After Performing Operations](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README_EN.md) | `Array`,`String`,`Simulation` | Easy | Weekly Contest 259 |
|
||
| 2012 | [Sum of Beauty in the Array](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README_EN.md) | `Array` | Medium | Weekly Contest 259 |
|
||
| 2013 | [Detect Squares](/solution/2000-2099/2013.Detect%20Squares/README_EN.md) | `Design`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 259 |
|
||
| 2014 | [Longest Subsequence Repeated k Times](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README_EN.md) | `Greedy`,`String`,`Backtracking`,`Counting`,`Enumeration` | Hard | Weekly Contest 259 |
|
||
| 2015 | [Average Height of Buildings in Each Segment](/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 2016 | [Maximum Difference Between Increasing Elements](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README_EN.md) | `Array` | Easy | Weekly Contest 260 |
|
||
| 2017 | [Grid Game](/solution/2000-2099/2017.Grid%20Game/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 260 |
|
||
| 2018 | [Check if Word Can Be Placed In Crossword](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Medium | Weekly Contest 260 |
|
||
| 2019 | [The Score of Students Solving Math Expression](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README_EN.md) | `Stack`,`Memoization`,`Array`,`Math`,`String`,`Dynamic Programming` | Hard | Weekly Contest 260 |
|
||
| 2020 | [Number of Accounts That Did Not Stream](/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2021 | [Brightest Position on Street](/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README_EN.md) | `Array`,`Ordered Set`,`Prefix Sum`,`Sorting` | Medium | 🔒 |
|
||
| 2022 | [Convert 1D Array Into 2D Array](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Biweekly Contest 62 |
|
||
| 2023 | [Number of Pairs of Strings With Concatenation Equal to Target](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 62 |
|
||
| 2024 | [Maximize the Confusion of an Exam](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README_EN.md) | `String`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Biweekly Contest 62 |
|
||
| 2025 | [Maximum Number of Ways to Partition an Array](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Enumeration`,`Prefix Sum` | Hard | Biweekly Contest 62 |
|
||
| 2026 | [Low-Quality Problems](/solution/2000-2099/2026.Low-Quality%20Problems/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2027 | [Minimum Moves to Convert String](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 261 |
|
||
| 2028 | [Find Missing Observations](/solution/2000-2099/2028.Find%20Missing%20Observations/README_EN.md) | `Array`,`Math`,`Simulation` | Medium | Weekly Contest 261 |
|
||
| 2029 | [Stone Game IX](/solution/2000-2099/2029.Stone%20Game%20IX/README_EN.md) | `Greedy`,`Array`,`Math`,`Counting`,`Game Theory` | Medium | Weekly Contest 261 |
|
||
| 2030 | [Smallest K-Length Subsequence With Occurrences of a Letter](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Hard | Weekly Contest 261 |
|
||
| 2031 | [Count Subarrays With More Ones Than Zeros](/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Medium | 🔒 |
|
||
| 2032 | [Two Out of Three](/solution/2000-2099/2032.Two%20Out%20of%20Three/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Easy | Weekly Contest 262 |
|
||
| 2033 | [Minimum Operations to Make a Uni-Value Grid](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README_EN.md) | `Array`,`Math`,`Matrix`,`Sorting` | Medium | Weekly Contest 262 |
|
||
| 2034 | [Stock Price Fluctuation](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README_EN.md) | `Design`,`Hash Table`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 262 |
|
||
| 2035 | [Partition Array Into Two Arrays to Minimize Sum Difference](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Binary Search`,`Dynamic Programming`,`Bitmask`,`Ordered Set` | Hard | Weekly Contest 262 |
|
||
| 2036 | [Maximum Alternating Subarray Sum](/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 2037 | [Minimum Number of Moves to Seat Everyone](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README_EN.md) | `Greedy`,`Array`,`Counting Sort`,`Sorting` | Easy | Biweekly Contest 63 |
|
||
| 2038 | [Remove Colored Pieces if Both Neighbors are the Same Color](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README_EN.md) | `Greedy`,`Math`,`String`,`Game Theory` | Medium | Biweekly Contest 63 |
|
||
| 2039 | [The Time When the Network Becomes Idle](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README_EN.md) | `Breadth-First Search`,`Graph`,`Array` | Medium | Biweekly Contest 63 |
|
||
| 2040 | [Kth Smallest Product of Two Sorted Arrays](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README_EN.md) | `Array`,`Binary Search` | Hard | Biweekly Contest 63 |
|
||
| 2041 | [Accepted Candidates From the Interviews](/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2042 | [Check if Numbers Are Ascending in a Sentence](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README_EN.md) | `String` | Easy | Weekly Contest 263 |
|
||
| 2043 | [Simple Bank System](/solution/2000-2099/2043.Simple%20Bank%20System/README_EN.md) | `Design`,`Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 263 |
|
||
| 2044 | [Count Number of Maximum Bitwise-OR Subsets](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 263 |
|
||
| 2045 | [Second Minimum Time to Reach Destination](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README_EN.md) | `Breadth-First Search`,`Graph`,`Shortest Path` | Hard | Weekly Contest 263 |
|
||
| 2046 | [Sort Linked List Already Sorted Using Absolute Values](/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README_EN.md) | `Linked List`,`Two Pointers`,`Sorting` | Medium | 🔒 |
|
||
| 2047 | [Number of Valid Words in a Sentence](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README_EN.md) | `String` | Easy | Weekly Contest 264 |
|
||
| 2048 | [Next Greater Numerically Balanced Number](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README_EN.md) | `Hash Table`,`Math`,`Backtracking`,`Counting`,`Enumeration` | Medium | Weekly Contest 264 |
|
||
| 2049 | [Count Nodes With the Highest Score](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Binary Tree` | Medium | Weekly Contest 264 |
|
||
| 2050 | [Parallel Courses III](/solution/2000-2099/2050.Parallel%20Courses%20III/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 264 |
|
||
| 2051 | [The Category of Each Member in the Store](/solution/2000-2099/2051.The%20Category%20of%20Each%20Member%20in%20the%20Store/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2052 | [Minimum Cost to Separate Sentence Into Rows](/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 2053 | [Kth Distinct String in an Array](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 64 |
|
||
| 2054 | [Two Best Non-Overlapping Events](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 64 |
|
||
| 2055 | [Plates Between Candles](/solution/2000-2099/2055.Plates%20Between%20Candles/README_EN.md) | `Array`,`String`,`Binary Search`,`Prefix Sum` | Medium | Biweekly Contest 64 |
|
||
| 2056 | [Number of Valid Move Combinations On Chessboard](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README_EN.md) | `Array`,`String`,`Backtracking`,`Simulation` | Hard | Biweekly Contest 64 |
|
||
| 2057 | [Smallest Index With Equal Value](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README_EN.md) | `Array` | Easy | Weekly Contest 265 |
|
||
| 2058 | [Find the Minimum and Maximum Number of Nodes Between Critical Points](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README_EN.md) | `Linked List` | Medium | Weekly Contest 265 |
|
||
| 2059 | [Minimum Operations to Convert Number](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README_EN.md) | `Breadth-First Search`,`Array` | Medium | Weekly Contest 265 |
|
||
| 2060 | [Check if an Original String Exists Given Two Encoded Strings](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 265 |
|
||
| 2061 | [Number of Spaces Cleaning Robot Cleaned](/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | 🔒 |
|
||
| 2062 | [Count Vowel Substrings of a String](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 266 |
|
||
| 2063 | [Vowels of All Substrings](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README_EN.md) | `Math`,`String`,`Dynamic Programming`,`Combinatorics` | Medium | Weekly Contest 266 |
|
||
| 2064 | [Minimized Maximum of Products Distributed to Any Store](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README_EN.md) | `Greedy`,`Array`,`Binary Search` | Medium | Weekly Contest 266 |
|
||
| 2065 | [Maximum Path Quality of a Graph](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README_EN.md) | `Graph`,`Array`,`Backtracking` | Hard | Weekly Contest 266 |
|
||
| 2066 | [Account Balance](/solution/2000-2099/2066.Account%20Balance/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2067 | [Number of Equal Count Substrings](/solution/2000-2099/2067.Number%20of%20Equal%20Count%20Substrings/README_EN.md) | `Hash Table`,`String`,`Counting`,`Sliding Window` | Medium | 🔒 |
|
||
| 2068 | [Check Whether Two Strings are Almost Equivalent](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 65 |
|
||
| 2069 | [Walking Robot Simulation II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README_EN.md) | `Design`,`Simulation` | Medium | Biweekly Contest 65 |
|
||
| 2070 | [Most Beautiful Item for Each Query](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 65 |
|
||
| 2071 | [Maximum Number of Tasks You Can Assign](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README_EN.md) | `Greedy`,`Queue`,`Array`,`Two Pointers`,`Binary Search`,`Sorting`,`Monotonic Queue` | Hard | Biweekly Contest 65 |
|
||
| 2072 | [The Winner University](/solution/2000-2099/2072.The%20Winner%20University/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2073 | [Time Needed to Buy Tickets](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README_EN.md) | `Queue`,`Array`,`Simulation` | Easy | Weekly Contest 267 |
|
||
| 2074 | [Reverse Nodes in Even Length Groups](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README_EN.md) | `Linked List` | Medium | Weekly Contest 267 |
|
||
| 2075 | [Decode the Slanted Ciphertext](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README_EN.md) | `String`,`Simulation` | Medium | Weekly Contest 267 |
|
||
| 2076 | [Process Restricted Friend Requests](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README_EN.md) | `Union Find`,`Graph` | Hard | Weekly Contest 267 |
|
||
| 2077 | [Paths in Maze That Lead to Same Room](/solution/2000-2099/2077.Paths%20in%20Maze%20That%20Lead%20to%20Same%20Room/README_EN.md) | `Graph` | Medium | 🔒 |
|
||
| 2078 | [Two Furthest Houses With Different Colors](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 268 |
|
||
| 2079 | [Watering Plants](/solution/2000-2099/2079.Watering%20Plants/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 268 |
|
||
| 2080 | [Range Frequency Queries](/solution/2000-2099/2080.Range%20Frequency%20Queries/README_EN.md) | `Design`,`Segment Tree`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 268 |
|
||
| 2081 | [Sum of k-Mirror Numbers](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README_EN.md) | `Math`,`Enumeration` | Hard | Weekly Contest 268 |
|
||
| 2082 | [The Number of Rich Customers](/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2083 | [Substrings That Begin and End With the Same Letter](/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README_EN.md) | `Hash Table`,`Math`,`String`,`Counting`,`Prefix Sum` | Medium | 🔒 |
|
||
| 2084 | [Drop Type 1 Orders for Customers With Type 0 Orders](/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2085 | [Count Common Words With One Occurrence](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 66 |
|
||
| 2086 | [Minimum Number of Food Buckets to Feed the Hamsters](/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 66 |
|
||
| 2087 | [Minimum Cost Homecoming of a Robot in a Grid](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README_EN.md) | `Greedy`,`Array` | Medium | Biweekly Contest 66 |
|
||
| 2088 | [Count Fertile Pyramids in a Land](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 66 |
|
||
| 2089 | [Find Target Indices After Sorting Array](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Easy | Weekly Contest 269 |
|
||
| 2090 | [K Radius Subarray Averages](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 269 |
|
||
| 2091 | [Removing Minimum and Maximum From Array](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 269 |
|
||
| 2092 | [Find All People With Secret](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Sorting` | Hard | Weekly Contest 269 |
|
||
| 2093 | [Minimum Cost to Reach City With Discounts](/solution/2000-2099/2093.Minimum%20Cost%20to%20Reach%20City%20With%20Discounts/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 2094 | [Finding 3-Digit Even Numbers](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README_EN.md) | `Array`,`Hash Table`,`Enumeration`,`Sorting` | Easy | Weekly Contest 270 |
|
||
| 2095 | [Delete the Middle Node of a Linked List](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | Weekly Contest 270 |
|
||
| 2096 | [Step-By-Step Directions From a Binary Tree Node to Another](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | Weekly Contest 270 |
|
||
| 2097 | [Valid Arrangement of Pairs](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README_EN.md) | `Depth-First Search`,`Graph`,`Eulerian Circuit` | Hard | Weekly Contest 270 |
|
||
| 2098 | [Subsequence of Size K With the Largest Even Sum](/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 |
|
||
| 2099 | [Find Subsequence of Length K With the Largest Sum](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Easy | Biweekly Contest 67 |
|
||
| 2100 | [Find Good Days to Rob the Bank](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 67 |
|
||
| 2101 | [Detonate the Maximum Bombs](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Geometry`,`Array`,`Math` | Medium | Biweekly Contest 67 |
|
||
| 2102 | [Sequentially Ordinal Rank Tracker](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README_EN.md) | `Design`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Biweekly Contest 67 |
|
||
| 2103 | [Rings and Rods](/solution/2100-2199/2103.Rings%20and%20Rods/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 271 |
|
||
| 2104 | [Sum of Subarray Ranges](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 271 |
|
||
| 2105 | [Watering Plants II](/solution/2100-2199/2105.Watering%20Plants%20II/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | Weekly Contest 271 |
|
||
| 2106 | [Maximum Fruits Harvested After at Most K Steps](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 271 |
|
||
| 2107 | [Number of Unique Flavors After Sharing K Candies](/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | 🔒 |
|
||
| 2108 | [Find First Palindromic String in the Array](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README_EN.md) | `Array`,`Two Pointers`,`String` | Easy | Weekly Contest 272 |
|
||
| 2109 | [Adding Spaces to a String](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README_EN.md) | `Array`,`Two Pointers`,`String`,`Simulation` | Medium | Weekly Contest 272 |
|
||
| 2110 | [Number of Smooth Descent Periods of a Stock](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | Weekly Contest 272 |
|
||
| 2111 | [Minimum Operations to Make the Array K-Increasing](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README_EN.md) | `Array`,`Binary Search` | Hard | Weekly Contest 272 |
|
||
| 2112 | [The Airport With the Most Traffic](/solution/2100-2199/2112.The%20Airport%20With%20the%20Most%20Traffic/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2113 | [Elements in Array After Removing and Replacing Elements](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README_EN.md) | `Array` | Medium | 🔒 |
|
||
| 2114 | [Maximum Number of Words Found in Sentences](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 68 |
|
||
| 2115 | [Find All Possible Recipes from Given Supplies](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Hash Table`,`String` | Medium | Biweekly Contest 68 |
|
||
| 2116 | [Check if a Parentheses String Can Be Valid](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Biweekly Contest 68 |
|
||
| 2117 | [Abbreviating the Product of a Range](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README_EN.md) | `Math` | Hard | Biweekly Contest 68 |
|
||
| 2118 | [Build the Equation](/solution/2100-2199/2118.Build%20the%20Equation/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2119 | [A Number After a Double Reversal](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README_EN.md) | `Math` | Easy | Weekly Contest 273 |
|
||
| 2120 | [Execution of All Suffix Instructions Staying in a Grid](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README_EN.md) | `String`,`Simulation` | Medium | Weekly Contest 273 |
|
||
| 2121 | [Intervals Between Identical Elements](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 273 |
|
||
| 2122 | [Recover the Original Array](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Enumeration`,`Sorting` | Hard | Weekly Contest 273 |
|
||
| 2123 | [Minimum Operations to Remove Adjacent Ones in Matrix](/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README_EN.md) | `Graph`,`Array`,`Matrix` | Hard | 🔒 |
|
||
| 2124 | [Check if All A's Appears Before All B's](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README_EN.md) | `String` | Easy | Weekly Contest 274 |
|
||
| 2125 | [Number of Laser Beams in a Bank](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README_EN.md) | `Array`,`Math`,`String`,`Matrix` | Medium | Weekly Contest 274 |
|
||
| 2126 | [Destroying Asteroids](/solution/2100-2199/2126.Destroying%20Asteroids/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 274 |
|
||
| 2127 | [Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort` | Hard | Weekly Contest 274 |
|
||
| 2128 | [Remove All Ones With Row and Column Flips](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Matrix` | Medium | 🔒 |
|
||
| 2129 | [Capitalize the Title](/solution/2100-2199/2129.Capitalize%20the%20Title/README_EN.md) | `String` | Easy | Biweekly Contest 69 |
|
||
| 2130 | [Maximum Twin Sum of a Linked List](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README_EN.md) | `Stack`,`Linked List`,`Two Pointers` | Medium | Biweekly Contest 69 |
|
||
| 2131 | [Longest Palindrome by Concatenating Two Letter Words](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 69 |
|
||
| 2132 | [Stamping the Grid](/solution/2100-2199/2132.Stamping%20the%20Grid/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Prefix Sum` | Hard | Biweekly Contest 69 |
|
||
| 2133 | [Check if Every Row and Column Contains All Numbers](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Easy | Weekly Contest 275 |
|
||
| 2134 | [Minimum Swaps to Group All 1's Together II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 275 |
|
||
| 2135 | [Count Words Obtained After Adding a Letter](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 275 |
|
||
| 2136 | [Earliest Possible Day of Full Bloom](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 275 |
|
||
| 2137 | [Pour Water Between Buckets to Make Water Levels Equal](/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 |
|
||
| 2138 | [Divide a String Into Groups of Size k](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 276 |
|
||
| 2139 | [Minimum Moves to Reach Target Score](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 276 |
|
||
| 2140 | [Solving Questions With Brainpower](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 276 |
|
||
| 2141 | [Maximum Running Time of N Computers](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Hard | Weekly Contest 276 |
|
||
| 2142 | [The Number of Passengers in Each Bus I](/solution/2100-2199/2142.The%20Number%20of%20Passengers%20in%20Each%20Bus%20I/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2143 | [Choose Numbers From Two Arrays in Range](/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 |
|
||
| 2144 | [Minimum Cost of Buying Candies With Discount](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Biweekly Contest 70 |
|
||
| 2145 | [Count the Hidden Sequences](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 70 |
|
||
| 2146 | [K Highest Ranked Items Within a Price Range](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 70 |
|
||
| 2147 | [Number of Ways to Divide a Long Corridor](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 70 |
|
||
| 2148 | [Count Elements With Strictly Smaller and Greater Elements](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README_EN.md) | `Array`,`Counting`,`Sorting` | Easy | Weekly Contest 277 |
|
||
| 2149 | [Rearrange Array Elements by Sign](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | Weekly Contest 277 |
|
||
| 2150 | [Find All Lonely Numbers in the Array](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 277 |
|
||
| 2151 | [Maximum Good People Based on Statements](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Hard | Weekly Contest 277 |
|
||
| 2152 | [Minimum Number of Lines to Cover Points](/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README_EN.md) | `Bit Manipulation`,`Geometry`,`Array`,`Hash Table`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | 🔒 |
|
||
| 2153 | [The Number of Passengers in Each Bus II](/solution/2100-2199/2153.The%20Number%20of%20Passengers%20in%20Each%20Bus%20II/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2154 | [Keep Multiplying Found Values by Two](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation` | Easy | Weekly Contest 278 |
|
||
| 2155 | [All Divisions With the Highest Score of a Binary Array](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README_EN.md) | `Array` | Medium | Weekly Contest 278 |
|
||
| 2156 | [Find Substring With Given Hash Value](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README_EN.md) | `String`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 278 |
|
||
| 2157 | [Groups of Strings](/solution/2100-2199/2157.Groups%20of%20Strings/README_EN.md) | `Bit Manipulation`,`Union Find`,`String` | Hard | Weekly Contest 278 |
|
||
| 2158 | [Amount of New Area Painted Each Day](/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README_EN.md) | `Segment Tree`,`Array`,`Ordered Set` | Hard | 🔒 |
|
||
| 2159 | [Order Two Columns Independently](/solution/2100-2199/2159.Order%20Two%20Columns%20Independently/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2160 | [Minimum Sum of Four Digit Number After Splitting Digits](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README_EN.md) | `Greedy`,`Math`,`Sorting` | Easy | Biweekly Contest 71 |
|
||
| 2161 | [Partition Array According to Given Pivot](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | Biweekly Contest 71 |
|
||
| 2162 | [Minimum Cost to Set Cooking Time](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README_EN.md) | `Math`,`Enumeration` | Medium | Biweekly Contest 71 |
|
||
| 2163 | [Minimum Difference in Sums After Removal of Elements](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README_EN.md) | `Array`,`Dynamic Programming`,`Heap (Priority Queue)` | Hard | Biweekly Contest 71 |
|
||
| 2164 | [Sort Even and Odd Indices Independently](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 279 |
|
||
| 2165 | [Smallest Value of the Rearranged Number](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README_EN.md) | `Math`,`Sorting` | Medium | Weekly Contest 279 |
|
||
| 2166 | [Design Bitset](/solution/2100-2199/2166.Design%20Bitset/README_EN.md) | `Design`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 279 |
|
||
| 2167 | [Minimum Time to Remove All Cars Containing Illegal Goods](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 279 |
|
||
| 2168 | [Unique Substrings With Equal Digit Frequency](/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README_EN.md) | `Hash Table`,`String`,`Counting`,`Hash Function`,`Rolling Hash` | Medium | 🔒 |
|
||
| 2169 | [Count Operations to Obtain Zero](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 280 |
|
||
| 2170 | [Minimum Operations to Make the Array Alternating](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 280 |
|
||
| 2171 | [Removing Minimum Number of Magic Beans](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README_EN.md) | `Greedy`,`Array`,`Enumeration`,`Prefix Sum`,`Sorting` | Medium | Weekly Contest 280 |
|
||
| 2172 | [Maximum AND Sum of Array](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 280 |
|
||
| 2173 | [Longest Winning Streak](/solution/2100-2199/2173.Longest%20Winning%20Streak/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2174 | [Remove All Ones With Row and Column Flips II](/solution/2100-2199/2174.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips%20II/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 |
|
||
| 2175 | [The Change in Global Rankings](/solution/2100-2199/2175.The%20Change%20in%20Global%20Rankings/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2176 | [Count Equal and Divisible Pairs in an Array](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README_EN.md) | `Array` | Easy | Biweekly Contest 72 |
|
||
| 2177 | [Find Three Consecutive Integers That Sum to a Given Number](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README_EN.md) | `Math`,`Simulation` | Medium | Biweekly Contest 72 |
|
||
| 2178 | [Maximum Split of Positive Even Integers](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README_EN.md) | `Greedy`,`Math`,`Backtracking` | Medium | Biweekly Contest 72 |
|
||
| 2179 | [Count Good Triplets in an Array](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | Biweekly Contest 72 |
|
||
| 2180 | [Count Integers With Even Digit Sum](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 281 |
|
||
| 2181 | [Merge Nodes in Between Zeros](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README_EN.md) | `Linked List`,`Simulation` | Medium | Weekly Contest 281 |
|
||
| 2182 | [Construct String With Repeat Limit](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Heap (Priority Queue)` | Medium | Weekly Contest 281 |
|
||
| 2183 | [Count Array Pairs Divisible by K](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README_EN.md) | `Array`,`Math`,`Number Theory` | Hard | Weekly Contest 281 |
|
||
| 2184 | [Number of Ways to Build Sturdy Brick Wall](/solution/2100-2199/2184.Number%20of%20Ways%20to%20Build%20Sturdy%20Brick%20Wall/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Medium | 🔒 |
|
||
| 2185 | [Counting Words With a Given Prefix](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README_EN.md) | `Array`,`String`,`String Matching` | Easy | Weekly Contest 282 |
|
||
| 2186 | [Minimum Number of Steps to Make Two Strings Anagram II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 282 |
|
||
| 2187 | [Minimum Time to Complete Trips](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 282 |
|
||
| 2188 | [Minimum Time to Finish the Race](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 282 |
|
||
| 2189 | [Number of Ways to Build House of Cards](/solution/2100-2199/2189.Number%20of%20Ways%20to%20Build%20House%20of%20Cards/README_EN.md) | `Math`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 2190 | [Most Frequent Number Following Key In an Array](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 73 |
|
||
| 2191 | [Sort the Jumbled Numbers](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 73 |
|
||
| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | Biweekly Contest 73 |
|
||
| 2193 | [Minimum Number of Moves to Make Palindrome](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README_EN.md) | `Greedy`,`Binary Indexed Tree`,`Two Pointers`,`String` | Hard | Biweekly Contest 73 |
|
||
| 2194 | [Cells in a Range on an Excel Sheet](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README_EN.md) | `String` | Easy | Weekly Contest 283 |
|
||
| 2195 | [Append K Integers With Minimal Sum](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | Weekly Contest 283 |
|
||
| 2196 | [Create Binary Tree From Descriptions](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README_EN.md) | `Tree`,`Array`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 283 |
|
||
| 2197 | [Replace Non-Coprime Numbers in Array](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README_EN.md) | `Stack`,`Array`,`Math`,`Number Theory` | Hard | Weekly Contest 283 |
|
||
| 2198 | [Number of Single Divisor Triplets](/solution/2100-2199/2198.Number%20of%20Single%20Divisor%20Triplets/README_EN.md) | `Math` | Medium | 🔒 |
|
||
| 2199 | [Finding the Topic of Each Post](/solution/2100-2199/2199.Finding%20the%20Topic%20of%20Each%20Post/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2200 | [Find All K-Distant Indices in an Array](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README_EN.md) | `Array`,`Two Pointers` | Easy | Weekly Contest 284 |
|
||
| 2201 | [Count Artifacts That Can Be Extracted](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 284 |
|
||
| 2202 | [Maximize the Topmost Element After K Moves](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 284 |
|
||
| 2203 | [Minimum Weighted Subgraph With the Required Paths](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README_EN.md) | `Graph`,`Shortest Path` | Hard | Weekly Contest 284 |
|
||
| 2204 | [Distance to a Cycle in Undirected Graph](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Hard | 🔒 |
|
||
| 2205 | [The Number of Users That Are Eligible for Discount](/solution/2200-2299/2205.The%20Number%20of%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2206 | [Divide Array Into Equal Pairs](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 74 |
|
||
| 2207 | [Maximize Number of Subsequences in a String](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README_EN.md) | `Greedy`,`String`,`Prefix Sum` | Medium | Biweekly Contest 74 |
|
||
| 2208 | [Minimum Operations to Halve Array Sum](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Biweekly Contest 74 |
|
||
| 2209 | [Minimum White Tiles After Covering With Carpets](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Hard | Biweekly Contest 74 |
|
||
| 2210 | [Count Hills and Valleys in an Array](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 285 |
|
||
| 2211 | [Count Collisions on a Road](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README_EN.md) | `Stack`,`String`,`Simulation` | Medium | Weekly Contest 285 |
|
||
| 2212 | [Maximum Points in an Archery Competition](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 285 |
|
||
| 2213 | [Longest Substring of One Repeating Character](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README_EN.md) | `Segment Tree`,`Array`,`String`,`Ordered Set` | Hard | Weekly Contest 285 |
|
||
| 2214 | [Minimum Health to Beat Game](/solution/2200-2299/2214.Minimum%20Health%20to%20Beat%20Game/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 |
|
||
| 2215 | [Find the Difference of Two Arrays](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 286 |
|
||
| 2216 | [Minimum Deletions to Make Array Beautiful](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README_EN.md) | `Stack`,`Greedy`,`Array` | Medium | Weekly Contest 286 |
|
||
| 2217 | [Find Palindrome With Fixed Length](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 286 |
|
||
| 2218 | [Maximum Value of K Coins From Piles](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 286 |
|
||
| 2219 | [Maximum Sum Score of Array](/solution/2200-2299/2219.Maximum%20Sum%20Score%20of%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 |
|
||
| 2220 | [Minimum Bit Flips to Convert Number](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README_EN.md) | `Bit Manipulation` | Easy | Biweekly Contest 75 |
|
||
| 2221 | [Find Triangular Sum of an Array](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README_EN.md) | `Array`,`Math`,`Combinatorics`,`Simulation` | Medium | Biweekly Contest 75 |
|
||
| 2222 | [Number of Ways to Select Buildings](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 75 |
|
||
| 2223 | [Sum of Scores of Built Strings](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README_EN.md) | `String`,`Binary Search`,`String Matching`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Hard | Biweekly Contest 75 |
|
||
| 2224 | [Minimum Number of Operations to Convert Time](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 287 |
|
||
| 2225 | [Find Players With Zero or One Losses](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Weekly Contest 287 |
|
||
| 2226 | [Maximum Candies Allocated to K Children](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 287 |
|
||
| 2227 | [Encrypt and Decrypt Strings](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README_EN.md) | `Design`,`Trie`,`Array`,`Hash Table`,`String` | Hard | Weekly Contest 287 |
|
||
| 2228 | [Users With Two Purchases Within Seven Days](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2229 | [Check if an Array Is Consecutive](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | 🔒 |
|
||
| 2230 | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2231 | [Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) | `Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 288 |
|
||
| 2232 | [Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) | `String`,`Enumeration` | Medium | Weekly Contest 288 |
|
||
| 2233 | [Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 288 |
|
||
| 2234 | [Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Enumeration`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 288 |
|
||
| 2235 | [Add Two Integers](/solution/2200-2299/2235.Add%20Two%20Integers/README_EN.md) | `Math` | Easy | |
|
||
| 2236 | [Root Equals Sum of Children](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README_EN.md) | `Tree`,`Binary Tree` | Easy | |
|
||
| 2237 | [Count Positions on Street With Required Brightness](/solution/2200-2299/2237.Count%20Positions%20on%20Street%20With%20Required%20Brightness/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 |
|
||
| 2238 | [Number of Times a Driver Was a Passenger](/solution/2200-2299/2238.Number%20of%20Times%20a%20Driver%20Was%20a%20Passenger/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2239 | [Find Closest Number to Zero](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README_EN.md) | `Array` | Easy | Biweekly Contest 76 |
|
||
| 2240 | [Number of Ways to Buy Pens and Pencils](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README_EN.md) | `Math`,`Enumeration` | Medium | Biweekly Contest 76 |
|
||
| 2241 | [Design an ATM Machine](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README_EN.md) | `Greedy`,`Design`,`Array` | Medium | Biweekly Contest 76 |
|
||
| 2242 | [Maximum Score of a Node Sequence](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README_EN.md) | `Graph`,`Array`,`Enumeration`,`Sorting` | Hard | Biweekly Contest 76 |
|
||
| 2243 | [Calculate Digit Sum of a String](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 289 |
|
||
| 2244 | [Minimum Rounds to Complete All Tasks](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 289 |
|
||
| 2245 | [Maximum Trailing Zeros in a Cornered Path](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 289 |
|
||
| 2246 | [Longest Path With Different Adjacent Characters](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Topological Sort`,`Array`,`String` | Hard | Weekly Contest 289 |
|
||
| 2247 | [Maximum Cost of Trip With K Highways](/solution/2200-2299/2247.Maximum%20Cost%20of%20Trip%20With%20K%20Highways/README_EN.md) | `Bit Manipulation`,`Graph`,`Dynamic Programming`,`Bitmask` | Hard | 🔒 |
|
||
| 2248 | [Intersection of Multiple Arrays](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Easy | Weekly Contest 290 |
|
||
| 2249 | [Count Lattice Points Inside a Circle](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README_EN.md) | `Geometry`,`Array`,`Hash Table`,`Math`,`Enumeration` | Medium | Weekly Contest 290 |
|
||
| 2250 | [Count Number of Rectangles Containing Each Point](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README_EN.md) | `Binary Indexed Tree`,`Array`,`Hash Table`,`Binary Search`,`Sorting` | Medium | Weekly Contest 290 |
|
||
| 2251 | [Number of Flowers in Full Bloom](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Ordered Set`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 290 |
|
||
| 2252 | [Dynamic Pivoting of a Table](/solution/2200-2299/2252.Dynamic%20Pivoting%20of%20a%20Table/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2253 | [Dynamic Unpivoting of a Table](/solution/2200-2299/2253.Dynamic%20Unpivoting%20of%20a%20Table/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2254 | [Design Video Sharing Platform](/solution/2200-2299/2254.Design%20Video%20Sharing%20Platform/README_EN.md) | `Stack`,`Design`,`Hash Table`,`Ordered Set` | Hard | 🔒 |
|
||
| 2255 | [Count Prefixes of a Given String](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 77 |
|
||
| 2256 | [Minimum Average Difference](/solution/2200-2299/2256.Minimum%20Average%20Difference/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 77 |
|
||
| 2257 | [Count Unguarded Cells in the Grid](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Biweekly Contest 77 |
|
||
| 2258 | [Escape the Spreading Fire](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README_EN.md) | `Breadth-First Search`,`Array`,`Binary Search`,`Matrix` | Hard | Biweekly Contest 77 |
|
||
| 2259 | [Remove Digit From Number to Maximize Result](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README_EN.md) | `Greedy`,`String`,`Enumeration` | Easy | Weekly Contest 291 |
|
||
| 2260 | [Minimum Consecutive Cards to Pick Up](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 291 |
|
||
| 2261 | [K Divisible Elements Subarrays](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README_EN.md) | `Trie`,`Array`,`Hash Table`,`Enumeration`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 291 |
|
||
| 2262 | [Total Appeal of A String](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming` | Hard | Weekly Contest 291 |
|
||
| 2263 | [Make Array Non-decreasing or Non-increasing](/solution/2200-2299/2263.Make%20Array%20Non-decreasing%20or%20Non-increasing/README_EN.md) | `Greedy`,`Dynamic Programming` | Hard | 🔒 |
|
||
| 2264 | [Largest 3-Same-Digit Number in String](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README_EN.md) | `String` | Easy | Weekly Contest 292 |
|
||
| 2265 | [Count Nodes Equal to Average of Subtree](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 292 |
|
||
| 2266 | [Count Number of Texts](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README_EN.md) | `Hash Table`,`Math`,`String`,`Dynamic Programming` | Medium | Weekly Contest 292 |
|
||
| 2267 | [Check if There Is a Valid Parentheses String Path](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 292 |
|
||
| 2268 | [Minimum Number of Keypresses](/solution/2200-2299/2268.Minimum%20Number%20of%20Keypresses/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | 🔒 |
|
||
| 2269 | [Find the K-Beauty of a Number](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README_EN.md) | `Math`,`String`,`Sliding Window` | Easy | Biweekly Contest 78 |
|
||
| 2270 | [Number of Ways to Split Array](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 78 |
|
||
| 2271 | [Maximum White Tiles Covered by a Carpet](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Medium | Biweekly Contest 78 |
|
||
| 2272 | [Substring With Largest Variance](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 78 |
|
||
| 2273 | [Find Resultant Array After Removing Anagrams](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Easy | Weekly Contest 293 |
|
||
| 2274 | [Maximum Consecutive Floors Without Special Floors](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 293 |
|
||
| 2275 | [Largest Combination With Bitwise AND Greater Than Zero](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 293 |
|
||
| 2276 | [Count Integers in Intervals](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README_EN.md) | `Design`,`Segment Tree`,`Ordered Set` | Hard | Weekly Contest 293 |
|
||
| 2277 | [Closest Node to Path in Tree](/solution/2200-2299/2277.Closest%20Node%20to%20Path%20in%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array` | Hard | 🔒 |
|
||
| 2278 | [Percentage of Letter in String](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README_EN.md) | `String` | Easy | Weekly Contest 294 |
|
||
| 2279 | [Maximum Bags With Full Capacity of Rocks](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 294 |
|
||
| 2280 | [Minimum Lines to Represent a Line Chart](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README_EN.md) | `Geometry`,`Array`,`Math`,`Number Theory`,`Sorting` | Medium | Weekly Contest 294 |
|
||
| 2281 | [Sum of Total Strength of Wizards](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README_EN.md) | `Stack`,`Array`,`Prefix Sum`,`Monotonic Stack` | Hard | Weekly Contest 294 |
|
||
| 2282 | [Number of People That Can Be Seen in a Grid](/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README_EN.md) | `Stack`,`Array`,`Matrix`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 2283 | [Check if Number Has Equal Digit Count and Digit Value](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 79 |
|
||
| 2284 | [Sender With Largest Word Count](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 79 |
|
||
| 2285 | [Maximum Total Importance of Roads](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README_EN.md) | `Greedy`,`Graph`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 79 |
|
||
| 2286 | [Booking Concert Tickets in Groups](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README_EN.md) | `Design`,`Binary Indexed Tree`,`Segment Tree`,`Binary Search` | Hard | Biweekly Contest 79 |
|
||
| 2287 | [Rearrange Characters to Make Target String](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 295 |
|
||
| 2288 | [Apply Discount to Prices](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README_EN.md) | `String` | Medium | Weekly Contest 295 |
|
||
| 2289 | [Steps to Make Array Non-decreasing](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README_EN.md) | `Stack`,`Array`,`Linked List`,`Monotonic Stack` | Medium | Weekly Contest 295 |
|
||
| 2290 | [Minimum Obstacle Removal to Reach Corner](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 295 |
|
||
| 2291 | [Maximum Profit From Trading Stocks](/solution/2200-2299/2291.Maximum%20Profit%20From%20Trading%20Stocks/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 2292 | [Products With Three or More Orders in Two Consecutive Years](/solution/2200-2299/2292.Products%20With%20Three%20or%20More%20Orders%20in%20Two%20Consecutive%20Years/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2293 | [Min Max Game](/solution/2200-2299/2293.Min%20Max%20Game/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 296 |
|
||
| 2294 | [Partition Array Such That Maximum Difference Is K](/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 296 |
|
||
| 2295 | [Replace Elements in an Array](/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 296 |
|
||
| 2296 | [Design a Text Editor](/solution/2200-2299/2296.Design%20a%20Text%20Editor/README_EN.md) | `Stack`,`Design`,`Linked List`,`String`,`Doubly-Linked List`,`Simulation` | Hard | Weekly Contest 296 |
|
||
| 2297 | [Jump Game VIII](/solution/2200-2299/2297.Jump%20Game%20VIII/README_EN.md) | `Stack`,`Graph`,`Array`,`Dynamic Programming`,`Shortest Path`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 2298 | [Tasks Count in the Weekend](/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2299 | [Strong Password Checker II](/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README_EN.md) | `String` | Easy | Biweekly Contest 80 |
|
||
| 2300 | [Successful Pairs of Spells and Potions](/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 80 |
|
||
| 2301 | [Match Substring After Replacement](/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README_EN.md) | `Array`,`Hash Table`,`String`,`String Matching` | Hard | Biweekly Contest 80 |
|
||
| 2302 | [Count Subarrays With Score Less Than K](/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Biweekly Contest 80 |
|
||
| 2303 | [Calculate Amount Paid in Taxes](/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 297 |
|
||
| 2304 | [Minimum Path Cost in a Grid](/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 297 |
|
||
| 2305 | [Fair Distribution of Cookies](/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 297 |
|
||
| 2306 | [Naming a Company](/solution/2300-2399/2306.Naming%20a%20Company/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Enumeration` | Hard | Weekly Contest 297 |
|
||
| 2307 | [Check for Contradictions in Equations](/solution/2300-2399/2307.Check%20for%20Contradictions%20in%20Equations/README_EN.md) | `Depth-First Search`,`Union Find`,`Graph`,`Array` | Hard | 🔒 |
|
||
| 2308 | [Arrange Table by Gender](/solution/2300-2399/2308.Arrange%20Table%20by%20Gender/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2309 | [Greatest English Letter in Upper and Lower Case](/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README_EN.md) | `Hash Table`,`String`,`Enumeration` | Easy | Weekly Contest 298 |
|
||
| 2310 | [Sum of Numbers With Units Digit K](/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README_EN.md) | `Greedy`,`Math`,`Dynamic Programming`,`Enumeration` | Medium | Weekly Contest 298 |
|
||
| 2311 | [Longest Binary Subsequence Less Than or Equal to K](/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) | `Greedy`,`Memoization`,`String`,`Dynamic Programming` | Medium | Weekly Contest 298 |
|
||
| 2312 | [Selling Pieces of Wood](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 298 |
|
||
| 2313 | [Minimum Flips in Binary Tree to Get Result](/solution/2300-2399/2313.Minimum%20Flips%20in%20Binary%20Tree%20to%20Get%20Result/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Hard | 🔒 |
|
||
| 2314 | [The First Day of the Maximum Recorded Degree in Each City](/solution/2300-2399/2314.The%20First%20Day%20of%20the%20Maximum%20Recorded%20Degree%20in%20Each%20City/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2315 | [Count Asterisks](/solution/2300-2399/2315.Count%20Asterisks/README_EN.md) | `String` | Easy | Biweekly Contest 81 |
|
||
| 2316 | [Count Unreachable Pairs of Nodes in an Undirected Graph](/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Biweekly Contest 81 |
|
||
| 2317 | [Maximum XOR After Operations](/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | Biweekly Contest 81 |
|
||
| 2318 | [Number of Distinct Roll Sequences](/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README_EN.md) | `Memoization`,`Dynamic Programming` | Hard | Biweekly Contest 81 |
|
||
| 2319 | [Check if Matrix Is X-Matrix](/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 299 |
|
||
| 2320 | [Count Number of Ways to Place Houses](/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README_EN.md) | `Dynamic Programming` | Medium | Weekly Contest 299 |
|
||
| 2321 | [Maximum Score Of Spliced Array](/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 299 |
|
||
| 2322 | [Minimum Score After Removals on a Tree](/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Array` | Hard | Weekly Contest 299 |
|
||
| 2323 | [Find Minimum Time to Finish All Jobs II](/solution/2300-2399/2323.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs%20II/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 |
|
||
| 2324 | [Product Sales Analysis IV](/solution/2300-2399/2324.Product%20Sales%20Analysis%20IV/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2325 | [Decode the Message](/solution/2300-2399/2325.Decode%20the%20Message/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 300 |
|
||
| 2326 | [Spiral Matrix IV](/solution/2300-2399/2326.Spiral%20Matrix%20IV/README_EN.md) | `Array`,`Linked List`,`Matrix`,`Simulation` | Medium | Weekly Contest 300 |
|
||
| 2327 | [Number of People Aware of a Secret](/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README_EN.md) | `Queue`,`Dynamic Programming`,`Simulation` | Medium | Weekly Contest 300 |
|
||
| 2328 | [Number of Increasing Paths in a Grid](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Memoization`,`Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 300 |
|
||
| 2329 | [Product Sales Analysis V](/solution/2300-2399/2329.Product%20Sales%20Analysis%20V/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2330 | [Valid Palindrome IV](/solution/2300-2399/2330.Valid%20Palindrome%20IV/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 |
|
||
| 2331 | [Evaluate Boolean Binary Tree](/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | Biweekly Contest 82 |
|
||
| 2332 | [The Latest Time to Catch a Bus](/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 82 |
|
||
| 2333 | [Minimum Sum of Squared Difference](/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 82 |
|
||
| 2334 | [Subarray With Elements Greater Than Varying Threshold](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README_EN.md) | `Stack`,`Union Find`,`Array`,`Monotonic Stack` | Hard | Biweekly Contest 82 |
|
||
| 2335 | [Minimum Amount of Time to Fill Cups](/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 301 |
|
||
| 2336 | [Smallest Number in Infinite Set](/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README_EN.md) | `Design`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 301 |
|
||
| 2337 | [Move Pieces to Obtain a String](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README_EN.md) | `Two Pointers`,`String` | Medium | Weekly Contest 301 |
|
||
| 2338 | [Count the Number of Ideal Arrays](/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics`,`Number Theory` | Hard | Weekly Contest 301 |
|
||
| 2339 | [All the Matches of the League](/solution/2300-2399/2339.All%20the%20Matches%20of%20the%20League/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2340 | [Minimum Adjacent Swaps to Make a Valid Array](/solution/2300-2399/2340.Minimum%20Adjacent%20Swaps%20to%20Make%20a%20Valid%20Array/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 |
|
||
| 2341 | [Maximum Number of Pairs in Array](/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 302 |
|
||
| 2342 | [Max Sum of a Pair With Equal Sum of Digits](/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 302 |
|
||
| 2343 | [Query Kth Smallest Trimmed Number](/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README_EN.md) | `Array`,`String`,`Divide and Conquer`,`Quickselect`,`Radix Sort`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 302 |
|
||
| 2344 | [Minimum Deletions to Make Array Divisible](/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README_EN.md) | `Array`,`Math`,`Number Theory`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 302 |
|
||
| 2345 | [Finding the Number of Visible Mountains](/solution/2300-2399/2345.Finding%20the%20Number%20of%20Visible%20Mountains/README_EN.md) | `Stack`,`Array`,`Sorting`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 2346 | [Compute the Rank as a Percentage](/solution/2300-2399/2346.Compute%20the%20Rank%20as%20a%20Percentage/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2347 | [Best Poker Hand](/solution/2300-2399/2347.Best%20Poker%20Hand/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 83 |
|
||
| 2348 | [Number of Zero-Filled Subarrays](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README_EN.md) | `Array`,`Math` | Medium | Biweekly Contest 83 |
|
||
| 2349 | [Design a Number Container System](/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README_EN.md) | `Design`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Biweekly Contest 83 |
|
||
| 2350 | [Shortest Impossible Sequence of Rolls](/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Hard | Biweekly Contest 83 |
|
||
| 2351 | [First Letter to Appear Twice](/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Counting` | Easy | Weekly Contest 303 |
|
||
| 2352 | [Equal Row and Column Pairs](/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Matrix`,`Simulation` | Medium | Weekly Contest 303 |
|
||
| 2353 | [Design a Food Rating System](/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README_EN.md) | `Design`,`Array`,`Hash Table`,`String`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 303 |
|
||
| 2354 | [Number of Excellent Pairs](/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Binary Search` | Hard | Weekly Contest 303 |
|
||
| 2355 | [Maximum Number of Books You Can Take](/solution/2300-2399/2355.Maximum%20Number%20of%20Books%20You%20Can%20Take/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Hard | 🔒 |
|
||
| 2356 | [Number of Unique Subjects Taught by Each Teacher](/solution/2300-2399/2356.Number%20of%20Unique%20Subjects%20Taught%20by%20Each%20Teacher/README_EN.md) | `Database` | Easy | |
|
||
| 2357 | [Make Array Zero by Subtracting Equal Amounts](/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 304 |
|
||
| 2358 | [Maximum Number of Groups Entering a Competition](/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search` | Medium | Weekly Contest 304 |
|
||
| 2359 | [Find Closest Node to Given Two Nodes](/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README_EN.md) | `Depth-First Search`,`Graph` | Medium | Weekly Contest 304 |
|
||
| 2360 | [Longest Cycle in a Graph](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Hard | Weekly Contest 304 |
|
||
| 2361 | [Minimum Costs Using the Train Line](/solution/2300-2399/2361.Minimum%20Costs%20Using%20the%20Train%20Line/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 |
|
||
| 2362 | [Generate the Invoice](/solution/2300-2399/2362.Generate%20the%20Invoice/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2363 | [Merge Similar Items](/solution/2300-2399/2363.Merge%20Similar%20Items/README_EN.md) | `Array`,`Hash Table`,`Ordered Set`,`Sorting` | Easy | Biweekly Contest 84 |
|
||
| 2364 | [Count Number of Bad Pairs](/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Medium | Biweekly Contest 84 |
|
||
| 2365 | [Task Scheduler II](/solution/2300-2399/2365.Task%20Scheduler%20II/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Biweekly Contest 84 |
|
||
| 2366 | [Minimum Replacements to Sort the Array](/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README_EN.md) | `Greedy`,`Array`,`Math` | Hard | Biweekly Contest 84 |
|
||
| 2367 | [Number of Arithmetic Triplets](/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Enumeration` | Easy | Weekly Contest 305 |
|
||
| 2368 | [Reachable Nodes With Restrictions](/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Medium | Weekly Contest 305 |
|
||
| 2369 | [Check if There is a Valid Partition For The Array](/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 305 |
|
||
| 2370 | [Longest Ideal Subsequence](/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming` | Medium | Weekly Contest 305 |
|
||
| 2371 | [Minimize Maximum Value in a Grid](/solution/2300-2399/2371.Minimize%20Maximum%20Value%20in%20a%20Grid/README_EN.md) | `Union Find`,`Graph`,`Topological Sort`,`Array`,`Matrix`,`Sorting` | Hard | 🔒 |
|
||
| 2372 | [Calculate the Influence of Each Salesperson](/solution/2300-2399/2372.Calculate%20the%20Influence%20of%20Each%20Salesperson/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2373 | [Largest Local Values in a Matrix](/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 306 |
|
||
| 2374 | [Node With Highest Edge Score](/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README_EN.md) | `Graph`,`Hash Table` | Medium | Weekly Contest 306 |
|
||
| 2375 | [Construct Smallest Number From DI String](/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Backtracking` | Medium | Weekly Contest 306 |
|
||
| 2376 | [Count Special Integers](/solution/2300-2399/2376.Count%20Special%20Integers/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Weekly Contest 306 |
|
||
| 2377 | [Sort the Olympic Table](/solution/2300-2399/2377.Sort%20the%20Olympic%20Table/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2378 | [Choose Edges to Maximize Score in a Tree](/solution/2300-2399/2378.Choose%20Edges%20to%20Maximize%20Score%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 2379 | [Minimum Recolors to Get K Consecutive Black Blocks](/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README_EN.md) | `String`,`Sliding Window` | Easy | Biweekly Contest 85 |
|
||
| 2380 | [Time Needed to Rearrange a Binary String](/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README_EN.md) | `String`,`Dynamic Programming`,`Simulation` | Medium | Biweekly Contest 85 |
|
||
| 2381 | [Shifting Letters II](/solution/2300-2399/2381.Shifting%20Letters%20II/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Biweekly Contest 85 |
|
||
| 2382 | [Maximum Segment Sum After Removals](/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README_EN.md) | `Union Find`,`Array`,`Ordered Set`,`Prefix Sum` | Hard | Biweekly Contest 85 |
|
||
| 2383 | [Minimum Hours of Training to Win a Competition](/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 307 |
|
||
| 2384 | [Largest Palindromic Number](/solution/2300-2399/2384.Largest%20Palindromic%20Number/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting` | Medium | Weekly Contest 307 |
|
||
| 2385 | [Amount of Time for Binary Tree to Be Infected](/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 307 |
|
||
| 2386 | [Find the K-Sum of an Array](/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 307 |
|
||
| 2387 | [Median of a Row Wise Sorted Matrix](/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | 🔒 |
|
||
| 2388 | [Change Null Values in a Table to the Previous Value](/solution/2300-2399/2388.Change%20Null%20Values%20in%20a%20Table%20to%20the%20Previous%20Value/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2389 | [Longest Subsequence With Limited Sum](/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Easy | Weekly Contest 308 |
|
||
| 2390 | [Removing Stars From a String](/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README_EN.md) | `Stack`,`String`,`Simulation` | Medium | Weekly Contest 308 |
|
||
| 2391 | [Minimum Amount of Time to Collect Garbage](/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Weekly Contest 308 |
|
||
| 2392 | [Build a Matrix With Conditions](/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Matrix` | Hard | Weekly Contest 308 |
|
||
| 2393 | [Count Strictly Increasing Subarrays](/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 2394 | [Employees With Deductions](/solution/2300-2399/2394.Employees%20With%20Deductions/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2395 | [Find Subarrays With Equal Sum](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 86 |
|
||
| 2396 | [Strictly Palindromic Number](/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README_EN.md) | `Brainteaser`,`Math`,`Two Pointers` | Medium | Biweekly Contest 86 |
|
||
| 2397 | [Maximum Rows Covered by Columns](/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration`,`Matrix` | Medium | Biweekly Contest 86 |
|
||
| 2398 | [Maximum Number of Robots Within Budget](/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README_EN.md) | `Queue`,`Array`,`Binary Search`,`Prefix Sum`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Biweekly Contest 86 |
|
||
| 2399 | [Check Distances Between Same Letters](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 309 |
|
||
| 2400 | [Number of Ways to Reach a Position After Exactly k Steps](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Weekly Contest 309 |
|
||
| 2401 | [Longest Nice Subarray](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README_EN.md) | `Bit Manipulation`,`Array`,`Sliding Window` | Medium | Weekly Contest 309 |
|
||
| 2402 | [Meeting Rooms III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Hard | Weekly Contest 309 |
|
||
| 2403 | [Minimum Time to Kill All Monsters](/solution/2400-2499/2403.Minimum%20Time%20to%20Kill%20All%20Monsters/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | 🔒 |
|
||
| 2404 | [Most Frequent Even Element](/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 310 |
|
||
| 2405 | [Optimal Partition of String](/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README_EN.md) | `Greedy`,`Hash Table`,`String` | Medium | Weekly Contest 310 |
|
||
| 2406 | [Divide Intervals Into Minimum Number of Groups](/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 310 |
|
||
| 2407 | [Longest Increasing Subsequence II](/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Queue`,`Array`,`Divide and Conquer`,`Dynamic Programming`,`Monotonic Queue` | Hard | Weekly Contest 310 |
|
||
| 2408 | [Design SQL](/solution/2400-2499/2408.Design%20SQL/README_EN.md) | `Design`,`Array`,`Hash Table`,`String` | Medium | 🔒 |
|
||
| 2409 | [Count Days Spent Together](/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 87 |
|
||
| 2410 | [Maximum Matching of Players With Trainers](/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 87 |
|
||
| 2411 | [Smallest Subarrays With Maximum Bitwise OR](/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README_EN.md) | `Bit Manipulation`,`Array`,`Binary Search`,`Sliding Window` | Medium | Biweekly Contest 87 |
|
||
| 2412 | [Minimum Money Required Before Transactions](/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Biweekly Contest 87 |
|
||
| 2413 | [Smallest Even Multiple](/solution/2400-2499/2413.Smallest%20Even%20Multiple/README_EN.md) | `Math`,`Number Theory` | Easy | Weekly Contest 311 |
|
||
| 2414 | [Length of the Longest Alphabetical Continuous Substring](/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README_EN.md) | `String` | Medium | Weekly Contest 311 |
|
||
| 2415 | [Reverse Odd Levels of Binary Tree](/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 311 |
|
||
| 2416 | [Sum of Prefix Scores of Strings](/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README_EN.md) | `Trie`,`Array`,`String`,`Counting` | Hard | Weekly Contest 311 |
|
||
| 2417 | [Closest Fair Integer](/solution/2400-2499/2417.Closest%20Fair%20Integer/README_EN.md) | `Math`,`Enumeration` | Medium | 🔒 |
|
||
| 2418 | [Sort the People](/solution/2400-2499/2418.Sort%20the%20People/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Easy | Weekly Contest 312 |
|
||
| 2419 | [Longest Subarray With Maximum Bitwise AND](/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array` | Medium | Weekly Contest 312 |
|
||
| 2420 | [Find All Good Indices](/solution/2400-2499/2420.Find%20All%20Good%20Indices/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | Weekly Contest 312 |
|
||
| 2421 | [Number of Good Paths](/solution/2400-2499/2421.Number%20of%20Good%20Paths/README_EN.md) | `Tree`,`Union Find`,`Graph`,`Array`,`Hash Table`,`Sorting` | Hard | Weekly Contest 312 |
|
||
| 2422 | [Merge Operations to Turn Array Into a Palindrome](/solution/2400-2499/2422.Merge%20Operations%20to%20Turn%20Array%20Into%20a%20Palindrome/README_EN.md) | `Greedy`,`Array`,`Two Pointers` | Medium | 🔒 |
|
||
| 2423 | [Remove Letter To Equalize Frequency](/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 88 |
|
||
| 2424 | [Longest Uploaded Prefix](/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README_EN.md) | `Union Find`,`Design`,`Binary Indexed Tree`,`Segment Tree`,`Hash Table`,`Binary Search`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Biweekly Contest 88 |
|
||
| 2425 | [Bitwise XOR of All Pairings](/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array` | Medium | Biweekly Contest 88 |
|
||
| 2426 | [Number of Pairs Satisfying Inequality](/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | Biweekly Contest 88 |
|
||
| 2427 | [Number of Common Factors](/solution/2400-2499/2427.Number%20of%20Common%20Factors/README_EN.md) | `Math`,`Enumeration`,`Number Theory` | Easy | Weekly Contest 313 |
|
||
| 2428 | [Maximum Sum of an Hourglass](/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 313 |
|
||
| 2429 | [Minimize XOR](/solution/2400-2499/2429.Minimize%20XOR/README_EN.md) | `Greedy`,`Bit Manipulation` | Medium | Weekly Contest 313 |
|
||
| 2430 | [Maximum Deletions on a String](/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README_EN.md) | `String`,`Dynamic Programming`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 313 |
|
||
| 2431 | [Maximize Total Tastiness of Purchased Fruits](/solution/2400-2499/2431.Maximize%20Total%20Tastiness%20of%20Purchased%20Fruits/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 2432 | [The Employee That Worked on the Longest Task](/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README_EN.md) | `Array` | Easy | Weekly Contest 314 |
|
||
| 2433 | [Find The Original Array of Prefix Xor](/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Weekly Contest 314 |
|
||
| 2434 | [Using a Robot to Print the Lexicographically Smallest String](/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README_EN.md) | `Stack`,`Greedy`,`Hash Table`,`String` | Medium | Weekly Contest 314 |
|
||
| 2435 | [Paths in Matrix Whose Sum Is Divisible by K](/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 314 |
|
||
| 2436 | [Minimum Split Into Subarrays With GCD Greater Than One](/solution/2400-2499/2436.Minimum%20Split%20Into%20Subarrays%20With%20GCD%20Greater%20Than%20One/README_EN.md) | `Greedy`,`Array`,`Math`,`Dynamic Programming`,`Number Theory` | Medium | 🔒 |
|
||
| 2437 | [Number of Valid Clock Times](/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README_EN.md) | `String`,`Enumeration` | Easy | Biweekly Contest 89 |
|
||
| 2438 | [Range Product Queries of Powers](/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README_EN.md) | `Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Biweekly Contest 89 |
|
||
| 2439 | [Minimize Maximum of Array](/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 89 |
|
||
| 2440 | [Create Components With Same Value](/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Math`,`Enumeration` | Hard | Biweekly Contest 89 |
|
||
| 2441 | [Largest Positive Integer That Exists With Its Negative](/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 315 |
|
||
| 2442 | [Count Number of Distinct Integers After Reverse Operations](/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Medium | Weekly Contest 315 |
|
||
| 2443 | [Sum of Number and Its Reverse](/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README_EN.md) | `Math`,`Enumeration` | Medium | Weekly Contest 315 |
|
||
| 2444 | [Count Subarrays With Fixed Bounds](/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README_EN.md) | `Queue`,`Array`,`Sliding Window`,`Monotonic Queue` | Hard | Weekly Contest 315 |
|
||
| 2445 | [Number of Nodes With Value One](/solution/2400-2499/2445.Number%20of%20Nodes%20With%20Value%20One/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Binary Tree` | Medium | 🔒 |
|
||
| 2446 | [Determine if Two Events Have Conflict](/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 316 |
|
||
| 2447 | [Number of Subarrays With GCD Equal to K](/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 316 |
|
||
| 2448 | [Minimum Cost to Make Array Equal](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 316 |
|
||
| 2449 | [Minimum Number of Operations to Make Arrays Similar](/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 316 |
|
||
| 2450 | [Number of Distinct Binary Strings After Applying Operations](/solution/2400-2499/2450.Number%20of%20Distinct%20Binary%20Strings%20After%20Applying%20Operations/README_EN.md) | `Math`,`String` | Medium | 🔒 |
|
||
| 2451 | [Odd String Difference](/solution/2400-2499/2451.Odd%20String%20Difference/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Biweekly Contest 90 |
|
||
| 2452 | [Words Within Two Edits of Dictionary](/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README_EN.md) | `Trie`,`Array`,`String` | Medium | Biweekly Contest 90 |
|
||
| 2453 | [Destroy Sequential Targets](/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Biweekly Contest 90 |
|
||
| 2454 | [Next Greater Element IV](/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README_EN.md) | `Stack`,`Array`,`Binary Search`,`Sorting`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Biweekly Contest 90 |
|
||
| 2455 | [Average Value of Even Numbers That Are Divisible by Three](/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 317 |
|
||
| 2456 | [Most Popular Video Creator](/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 317 |
|
||
| 2457 | [Minimum Addition to Make Integer Beautiful](/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 317 |
|
||
| 2458 | [Height of Binary Tree After Subtree Removal Queries](/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Binary Tree` | Hard | Weekly Contest 317 |
|
||
| 2459 | [Sort Array by Moving Items to Empty Space](/solution/2400-2499/2459.Sort%20Array%20by%20Moving%20Items%20to%20Empty%20Space/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | 🔒 |
|
||
| 2460 | [Apply Operations to an Array](/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Easy | Weekly Contest 318 |
|
||
| 2461 | [Maximum Sum of Distinct Subarrays With Length K](/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 318 |
|
||
| 2462 | [Total Cost to Hire K Workers](/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README_EN.md) | `Array`,`Two Pointers`,`Simulation`,`Heap (Priority Queue)` | Medium | Weekly Contest 318 |
|
||
| 2463 | [Minimum Total Distance Traveled](/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 318 |
|
||
| 2464 | [Minimum Subarrays in a Valid Split](/solution/2400-2499/2464.Minimum%20Subarrays%20in%20a%20Valid%20Split/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Number Theory` | Medium | 🔒 |
|
||
| 2465 | [Number of Distinct Averages](/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Easy | Biweekly Contest 91 |
|
||
| 2466 | [Count Ways To Build Good Strings](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README_EN.md) | `Dynamic Programming` | Medium | Biweekly Contest 91 |
|
||
| 2467 | [Most Profitable Path in a Tree](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph`,`Array` | Medium | Biweekly Contest 91 |
|
||
| 2468 | [Split Message Based on Limit](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README_EN.md) | `String`,`Binary Search`,`Enumeration` | Hard | Biweekly Contest 91 |
|
||
| 2469 | [Convert the Temperature](/solution/2400-2499/2469.Convert%20the%20Temperature/README_EN.md) | `Math` | Easy | Weekly Contest 319 |
|
||
| 2470 | [Number of Subarrays With LCM Equal to K](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 319 |
|
||
| 2471 | [Minimum Number of Operations to Sort a Binary Tree by Level](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 319 |
|
||
| 2472 | [Maximum Number of Non-overlapping Palindrome Substrings](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README_EN.md) | `Greedy`,`Two Pointers`,`String`,`Dynamic Programming` | Hard | Weekly Contest 319 |
|
||
| 2473 | [Minimum Cost to Buy Apples](/solution/2400-2499/2473.Minimum%20Cost%20to%20Buy%20Apples/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 2474 | [Customers With Strictly Increasing Purchases](/solution/2400-2499/2474.Customers%20With%20Strictly%20Increasing%20Purchases/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2475 | [Number of Unequal Triplets in Array](/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Weekly Contest 320 |
|
||
| 2476 | [Closest Nodes Queries in a Binary Search Tree](/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Array`,`Binary Search`,`Binary Tree` | Medium | Weekly Contest 320 |
|
||
| 2477 | [Minimum Fuel Cost to Report to the Capital](/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 320 |
|
||
| 2478 | [Number of Beautiful Partitions](/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 320 |
|
||
| 2479 | [Maximum XOR of Two Non-Overlapping Subtrees](/solution/2400-2499/2479.Maximum%20XOR%20of%20Two%20Non-Overlapping%20Subtrees/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Trie` | Hard | 🔒 |
|
||
| 2480 | [Form a Chemical Bond](/solution/2400-2499/2480.Form%20a%20Chemical%20Bond/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2481 | [Minimum Cuts to Divide a Circle](/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README_EN.md) | `Geometry`,`Math` | Easy | Biweekly Contest 92 |
|
||
| 2482 | [Difference Between Ones and Zeros in Row and Column](/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Biweekly Contest 92 |
|
||
| 2483 | [Minimum Penalty for a Shop](/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README_EN.md) | `String`,`Prefix Sum` | Medium | Biweekly Contest 92 |
|
||
| 2484 | [Count Palindromic Subsequences](/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 92 |
|
||
| 2485 | [Find the Pivot Integer](/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README_EN.md) | `Math`,`Prefix Sum` | Easy | Weekly Contest 321 |
|
||
| 2486 | [Append Characters to String to Make Subsequence](/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 321 |
|
||
| 2487 | [Remove Nodes From Linked List](/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Monotonic Stack` | Medium | Weekly Contest 321 |
|
||
| 2488 | [Count Subarrays With Median K](/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Hard | Weekly Contest 321 |
|
||
| 2489 | [Number of Substrings With Fixed Ratio](/solution/2400-2499/2489.Number%20of%20Substrings%20With%20Fixed%20Ratio/README_EN.md) | `Hash Table`,`Math`,`String`,`Prefix Sum` | Medium | 🔒 |
|
||
| 2490 | [Circular Sentence](/solution/2400-2499/2490.Circular%20Sentence/README_EN.md) | `String` | Easy | Weekly Contest 322 |
|
||
| 2491 | [Divide Players Into Teams of Equal Skill](/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 322 |
|
||
| 2492 | [Minimum Score of a Path Between Two Cities](/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Weekly Contest 322 |
|
||
| 2493 | [Divide Nodes Into the Maximum Number of Groups](/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Hard | Weekly Contest 322 |
|
||
| 2494 | [Merge Overlapping Events in the Same Hall](/solution/2400-2499/2494.Merge%20Overlapping%20Events%20in%20the%20Same%20Hall/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2495 | [Number of Subarrays Having Even Product](/solution/2400-2499/2495.Number%20of%20Subarrays%20Having%20Even%20Product/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 2496 | [Maximum Value of a String in an Array](/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 93 |
|
||
| 2497 | [Maximum Star Sum of a Graph](/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README_EN.md) | `Greedy`,`Graph`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 93 |
|
||
| 2498 | [Frog Jump II](/solution/2400-2499/2498.Frog%20Jump%20II/README_EN.md) | `Greedy`,`Array`,`Binary Search` | Medium | Biweekly Contest 93 |
|
||
| 2499 | [Minimum Total Cost to Make Arrays Unequal](/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Hard | Biweekly Contest 93 |
|
||
| 2500 | [Delete Greatest Value in Each Row](/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README_EN.md) | `Array`,`Matrix`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 323 |
|
||
| 2501 | [Longest Square Streak in an Array](/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 323 |
|
||
| 2502 | [Design Memory Allocator](/solution/2500-2599/2502.Design%20Memory%20Allocator/README_EN.md) | `Design`,`Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 323 |
|
||
| 2503 | [Maximum Number of Points From Grid Queries](/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README_EN.md) | `Breadth-First Search`,`Union Find`,`Array`,`Two Pointers`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 323 |
|
||
| 2504 | [Concatenate the Name and the Profession](/solution/2500-2599/2504.Concatenate%20the%20Name%20and%20the%20Profession/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2505 | [Bitwise OR of All Subsequence Sums](/solution/2500-2599/2505.Bitwise%20OR%20of%20All%20Subsequence%20Sums/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array`,`Math`,`Prefix Sum` | Medium | 🔒 |
|
||
| 2506 | [Count Pairs Of Similar Strings](/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Counting` | Easy | Weekly Contest 324 |
|
||
| 2507 | [Smallest Value After Replacing With Sum of Prime Factors](/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README_EN.md) | `Math`,`Number Theory`,`Simulation` | Medium | Weekly Contest 324 |
|
||
| 2508 | [Add Edges to Make Degrees of All Nodes Even](/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README_EN.md) | `Graph`,`Hash Table` | Hard | Weekly Contest 324 |
|
||
| 2509 | [Cycle Length Queries in a Tree](/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README_EN.md) | `Tree`,`Array`,`Binary Tree` | Hard | Weekly Contest 324 |
|
||
| 2510 | [Check if There is a Path With Equal Number of 0's And 1's](/solution/2500-2599/2510.Check%20if%20There%20is%20a%20Path%20With%20Equal%20Number%20of%200%27s%20And%201%27s/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | 🔒 |
|
||
| 2511 | [Maximum Enemy Forts That Can Be Captured](/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README_EN.md) | `Array`,`Two Pointers` | Easy | Biweekly Contest 94 |
|
||
| 2512 | [Reward Top K Students](/solution/2500-2599/2512.Reward%20Top%20K%20Students/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 94 |
|
||
| 2513 | [Minimize the Maximum of Two Arrays](/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README_EN.md) | `Math`,`Binary Search`,`Number Theory` | Medium | Biweekly Contest 94 |
|
||
| 2514 | [Count Anagrams](/solution/2500-2599/2514.Count%20Anagrams/README_EN.md) | `Hash Table`,`Math`,`String`,`Combinatorics`,`Counting` | Hard | Biweekly Contest 94 |
|
||
| 2515 | [Shortest Distance to Target String in a Circular Array](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 325 |
|
||
| 2516 | [Take K of Each Character From Left and Right](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 325 |
|
||
| 2517 | [Maximum Tastiness of Candy Basket](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Medium | Weekly Contest 325 |
|
||
| 2518 | [Number of Great Partitions](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 325 |
|
||
| 2519 | [Count the Number of K-Big Indices](/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | 🔒 |
|
||
| 2520 | [Count the Digits That Divide a Number](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README_EN.md) | `Math` | Easy | Weekly Contest 326 |
|
||
| 2521 | [Distinct Prime Factors of Product of Array](/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README_EN.md) | `Array`,`Hash Table`,`Math`,`Number Theory` | Medium | Weekly Contest 326 |
|
||
| 2522 | [Partition String Into Substrings With Values at Most K](/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Weekly Contest 326 |
|
||
| 2523 | [Closest Prime Numbers in Range](/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README_EN.md) | `Math`,`Number Theory` | Medium | Weekly Contest 326 |
|
||
| 2524 | [Maximum Frequency Score of a Subarray](/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README_EN.md) | `Stack`,`Array`,`Hash Table`,`Math`,`Sliding Window` | Hard | 🔒 |
|
||
| 2525 | [Categorize Box According to Criteria](/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README_EN.md) | `Math` | Easy | Biweekly Contest 95 |
|
||
| 2526 | [Find Consecutive Integers from a Data Stream](/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README_EN.md) | `Design`,`Queue`,`Hash Table`,`Counting`,`Data Stream` | Medium | Biweekly Contest 95 |
|
||
| 2527 | [Find Xor-Beauty of Array](/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | Biweekly Contest 95 |
|
||
| 2528 | [Maximize the Minimum Powered City](/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README_EN.md) | `Greedy`,`Queue`,`Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Biweekly Contest 95 |
|
||
| 2529 | [Maximum Count of Positive Integer and Negative Integer](/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README_EN.md) | `Array`,`Binary Search`,`Counting` | Easy | Weekly Contest 327 |
|
||
| 2530 | [Maximal Score After Applying K Operations](/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 327 |
|
||
| 2531 | [Make Number of Distinct Characters Equal](/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 327 |
|
||
| 2532 | [Time to Cross a Bridge](/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Hard | Weekly Contest 327 |
|
||
| 2533 | [Number of Good Binary Strings](/solution/2500-2599/2533.Number%20of%20Good%20Binary%20Strings/README_EN.md) | `Dynamic Programming` | Medium | 🔒 |
|
||
| 2534 | [Time Taken to Cross the Door](/solution/2500-2599/2534.Time%20Taken%20to%20Cross%20the%20Door/README_EN.md) | `Queue`,`Array`,`Simulation` | Hard | 🔒 |
|
||
| 2535 | [Difference Between Element Sum and Digit Sum of an Array](/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 328 |
|
||
| 2536 | [Increment Submatrices by One](/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 328 |
|
||
| 2537 | [Count the Number of Good Subarrays](/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 328 |
|
||
| 2538 | [Difference Between Maximum and Minimum Price Sum](/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 328 |
|
||
| 2539 | [Count the Number of Good Subsequences](/solution/2500-2599/2539.Count%20the%20Number%20of%20Good%20Subsequences/README_EN.md) | `Hash Table`,`Math`,`String`,`Combinatorics`,`Counting` | Medium | 🔒 |
|
||
| 2540 | [Minimum Common Value](/solution/2500-2599/2540.Minimum%20Common%20Value/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search` | Easy | Biweekly Contest 96 |
|
||
| 2541 | [Minimum Operations to Make Array Equal II](/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README_EN.md) | `Greedy`,`Array`,`Math` | Medium | Biweekly Contest 96 |
|
||
| 2542 | [Maximum Subsequence Score](/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 96 |
|
||
| 2543 | [Check if Point Is Reachable](/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README_EN.md) | `Math`,`Number Theory` | Hard | Biweekly Contest 96 |
|
||
| 2544 | [Alternating Digit Sum](/solution/2500-2599/2544.Alternating%20Digit%20Sum/README_EN.md) | `Math` | Easy | Weekly Contest 329 |
|
||
| 2545 | [Sort the Students by Their Kth Score](/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README_EN.md) | `Array`,`Matrix`,`Sorting` | Medium | Weekly Contest 329 |
|
||
| 2546 | [Apply Bitwise Operations to Make Strings Equal](/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README_EN.md) | `Bit Manipulation`,`String` | Medium | Weekly Contest 329 |
|
||
| 2547 | [Minimum Cost to Split an Array](/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Counting` | Hard | Weekly Contest 329 |
|
||
| 2548 | [Maximum Price to Fill a Bag](/solution/2500-2599/2548.Maximum%20Price%20to%20Fill%20a%20Bag/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 |
|
||
| 2549 | [Count Distinct Numbers on Board](/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README_EN.md) | `Array`,`Hash Table`,`Math`,`Simulation` | Easy | Weekly Contest 330 |
|
||
| 2550 | [Count Collisions of Monkeys on a Polygon](/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README_EN.md) | `Recursion`,`Math` | Medium | Weekly Contest 330 |
|
||
| 2551 | [Put Marbles in Bags](/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 330 |
|
||
| 2552 | [Count Increasing Quadruplets](/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README_EN.md) | `Binary Indexed Tree`,`Array`,`Dynamic Programming`,`Enumeration`,`Prefix Sum` | Hard | Weekly Contest 330 |
|
||
| 2553 | [Separate the Digits in an Array](/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 97 |
|
||
| 2554 | [Maximum Number of Integers to Choose From a Range I](/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 97 |
|
||
| 2555 | [Maximize Win From Two Segments](/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README_EN.md) | `Array`,`Binary Search`,`Sliding Window` | Medium | Biweekly Contest 97 |
|
||
| 2556 | [Disconnect Path in a Binary Matrix by at Most One Flip](/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | Biweekly Contest 97 |
|
||
| 2557 | [Maximum Number of Integers to Choose From a Range II](/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Medium | 🔒 |
|
||
| 2558 | [Take Gifts From the Richest Pile](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 331 |
|
||
| 2559 | [Count Vowel Strings in Ranges](/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Weekly Contest 331 |
|
||
| 2560 | [House Robber IV](/solution/2500-2599/2560.House%20Robber%20IV/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming` | Medium | Weekly Contest 331 |
|
||
| 2561 | [Rearranging Fruits](/solution/2500-2599/2561.Rearranging%20Fruits/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Hard | Weekly Contest 331 |
|
||
| 2562 | [Find the Array Concatenation Value](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Easy | Weekly Contest 332 |
|
||
| 2563 | [Count the Number of Fair Pairs](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Weekly Contest 332 |
|
||
| 2564 | [Substring XOR Queries](/solution/2500-2599/2564.Substring%20XOR%20Queries/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 332 |
|
||
| 2565 | [Subsequence With the Minimum Score](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README_EN.md) | `Two Pointers`,`String`,`Binary Search` | Hard | Weekly Contest 332 |
|
||
| 2566 | [Maximum Difference by Remapping a Digit](/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README_EN.md) | `Greedy`,`Math` | Easy | Biweekly Contest 98 |
|
||
| 2567 | [Minimum Score by Changing Two Elements](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 98 |
|
||
| 2568 | [Minimum Impossible OR](/solution/2500-2599/2568.Minimum%20Impossible%20OR/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array` | Medium | Biweekly Contest 98 |
|
||
| 2569 | [Handling Sum Queries After Update](/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README_EN.md) | `Segment Tree`,`Array` | Hard | Biweekly Contest 98 |
|
||
| 2570 | [Merge Two 2D Arrays by Summing Values](/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README_EN.md) | `Array`,`Hash Table`,`Two Pointers` | Easy | Weekly Contest 333 |
|
||
| 2571 | [Minimum Operations to Reduce an Integer to 0](/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README_EN.md) | `Greedy`,`Bit Manipulation`,`Dynamic Programming` | Medium | Weekly Contest 333 |
|
||
| 2572 | [Count the Number of Square-Free Subsets](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask` | Medium | Weekly Contest 333 |
|
||
| 2573 | [Find the String with LCP](/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README_EN.md) | `Greedy`,`Union Find`,`Array`,`String`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 333 |
|
||
| 2574 | [Left and Right Sum Differences](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README_EN.md) | `Array`,`Prefix Sum` | Easy | Weekly Contest 334 |
|
||
| 2575 | [Find the Divisibility Array of a String](/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README_EN.md) | `Array`,`Math`,`String` | Medium | Weekly Contest 334 |
|
||
| 2576 | [Find the Maximum Number of Marked Indices](/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Weekly Contest 334 |
|
||
| 2577 | [Minimum Time to Visit a Cell In a Grid](/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 334 |
|
||
| 2578 | [Split With Minimum Sum](/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README_EN.md) | `Greedy`,`Math`,`Sorting` | Easy | Biweekly Contest 99 |
|
||
| 2579 | [Count Total Number of Colored Cells](/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README_EN.md) | `Math` | Medium | Biweekly Contest 99 |
|
||
| 2580 | [Count Ways to Group Overlapping Ranges](/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 99 |
|
||
| 2581 | [Count Number of Possible Root Nodes](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Dynamic Programming` | Hard | Biweekly Contest 99 |
|
||
| 2582 | [Pass the Pillow](/solution/2500-2599/2582.Pass%20the%20Pillow/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 335 |
|
||
| 2583 | [Kth Largest Sum in a Binary Tree](/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree`,`Sorting` | Medium | Weekly Contest 335 |
|
||
| 2584 | [Split the Array to Make Coprime Products](/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README_EN.md) | `Array`,`Hash Table`,`Math`,`Number Theory` | Hard | Weekly Contest 335 |
|
||
| 2585 | [Number of Ways to Earn Points](/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 335 |
|
||
| 2586 | [Count the Number of Vowel Strings in Range](/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README_EN.md) | `Array`,`String`,`Counting` | Easy | Weekly Contest 336 |
|
||
| 2587 | [Rearrange Array to Maximize Prefix Score](/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sorting` | Medium | Weekly Contest 336 |
|
||
| 2588 | [Count the Number of Beautiful Subarrays](/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 336 |
|
||
| 2589 | [Minimum Time to Complete All Tasks](/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README_EN.md) | `Stack`,`Greedy`,`Array`,`Binary Search`,`Sorting` | Hard | Weekly Contest 336 |
|
||
| 2590 | [Design a Todo List](/solution/2500-2599/2590.Design%20a%20Todo%20List/README_EN.md) | `Design`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | 🔒 |
|
||
| 2591 | [Distribute Money to Maximum Children](/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README_EN.md) | `Greedy`,`Math` | Easy | Biweekly Contest 100 |
|
||
| 2592 | [Maximize Greatness of an Array](/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 100 |
|
||
| 2593 | [Find Score of an Array After Marking All Elements](/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 100 |
|
||
| 2594 | [Minimum Time to Repair Cars](/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README_EN.md) | `Array`,`Binary Search` | Medium | Biweekly Contest 100 |
|
||
| 2595 | [Number of Even and Odd Bits](/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 337 |
|
||
| 2596 | [Check Knight Tour Configuration](/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 337 |
|
||
| 2597 | [The Number of Beautiful Subsets](/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README_EN.md) | `Array`,`Hash Table`,`Math`,`Dynamic Programming`,`Backtracking`,`Combinatorics`,`Sorting` | Medium | Weekly Contest 337 |
|
||
| 2598 | [Smallest Missing Non-negative Integer After Operations](/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Math` | Medium | Weekly Contest 337 |
|
||
| 2599 | [Make the Prefix Sum Non-negative](/solution/2500-2599/2599.Make%20the%20Prefix%20Sum%20Non-negative/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 2600 | [K Items With the Maximum Sum](/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README_EN.md) | `Greedy`,`Math` | Easy | Weekly Contest 338 |
|
||
| 2601 | [Prime Subtraction Operation](/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Number Theory` | Medium | Weekly Contest 338 |
|
||
| 2602 | [Minimum Operations to Make All Array Elements Equal](/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Medium | Weekly Contest 338 |
|
||
| 2603 | [Collect Coins in a Tree](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README_EN.md) | `Tree`,`Graph`,`Topological Sort`,`Array` | Hard | Weekly Contest 338 |
|
||
| 2604 | [Minimum Time to Eat All Grains](/solution/2600-2699/2604.Minimum%20Time%20to%20Eat%20All%20Grains/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | 🔒 |
|
||
| 2605 | [Form Smallest Number From Two Digit Arrays](/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Easy | Biweekly Contest 101 |
|
||
| 2606 | [Find the Substring With Maximum Cost](/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README_EN.md) | `Array`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 101 |
|
||
| 2607 | [Make K-Subarray Sums Equal](/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README_EN.md) | `Greedy`,`Array`,`Math`,`Number Theory`,`Sorting` | Medium | Biweekly Contest 101 |
|
||
| 2608 | [Shortest Cycle in a Graph](/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README_EN.md) | `Breadth-First Search`,`Graph` | Hard | Biweekly Contest 101 |
|
||
| 2609 | [Find the Longest Balanced Substring of a Binary String](/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README_EN.md) | `String` | Easy | Weekly Contest 339 |
|
||
| 2610 | [Convert an Array Into a 2D Array With Conditions](/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 339 |
|
||
| 2611 | [Mice and Cheese](/solution/2600-2699/2611.Mice%20and%20Cheese/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 339 |
|
||
| 2612 | [Minimum Reverse Operations](/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README_EN.md) | `Breadth-First Search`,`Array`,`Ordered Set` | Hard | Weekly Contest 339 |
|
||
| 2613 | [Beautiful Pairs](/solution/2600-2699/2613.Beautiful%20Pairs/README_EN.md) | `Geometry`,`Array`,`Math`,`Divide and Conquer`,`Ordered Set`,`Sorting` | Hard | 🔒 |
|
||
| 2614 | [Prime In Diagonal](/solution/2600-2699/2614.Prime%20In%20Diagonal/README_EN.md) | `Array`,`Math`,`Matrix`,`Number Theory` | Easy | Weekly Contest 340 |
|
||
| 2615 | [Sum of Distances](/solution/2600-2699/2615.Sum%20of%20Distances/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 340 |
|
||
| 2616 | [Minimize the Maximum Difference of Pairs](/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 340 |
|
||
| 2617 | [Minimum Number of Visited Cells in a Grid](/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README_EN.md) | `Stack`,`Breadth-First Search`,`Union Find`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 340 |
|
||
| 2618 | [Check if Object Instance of Class](/solution/2600-2699/2618.Check%20if%20Object%20Instance%20of%20Class/README_EN.md) | | Medium | |
|
||
| 2619 | [Array Prototype Last](/solution/2600-2699/2619.Array%20Prototype%20Last/README_EN.md) | | Easy | |
|
||
| 2620 | [Counter](/solution/2600-2699/2620.Counter/README_EN.md) | | Easy | |
|
||
| 2621 | [Sleep](/solution/2600-2699/2621.Sleep/README_EN.md) | | Easy | |
|
||
| 2622 | [Cache With Time Limit](/solution/2600-2699/2622.Cache%20With%20Time%20Limit/README_EN.md) | | Medium | |
|
||
| 2623 | [Memoize](/solution/2600-2699/2623.Memoize/README_EN.md) | | Medium | |
|
||
| 2624 | [Snail Traversal](/solution/2600-2699/2624.Snail%20Traversal/README_EN.md) | | Medium | |
|
||
| 2625 | [Flatten Deeply Nested Array](/solution/2600-2699/2625.Flatten%20Deeply%20Nested%20Array/README_EN.md) | | Medium | |
|
||
| 2626 | [Array Reduce Transformation](/solution/2600-2699/2626.Array%20Reduce%20Transformation/README_EN.md) | | Easy | |
|
||
| 2627 | [Debounce](/solution/2600-2699/2627.Debounce/README_EN.md) | | Medium | |
|
||
| 2628 | [JSON Deep Equal](/solution/2600-2699/2628.JSON%20Deep%20Equal/README_EN.md) | | Medium | 🔒 |
|
||
| 2629 | [Function Composition](/solution/2600-2699/2629.Function%20Composition/README_EN.md) | | Easy | |
|
||
| 2630 | [Memoize II](/solution/2600-2699/2630.Memoize%20II/README_EN.md) | | Hard | |
|
||
| 2631 | [Group By](/solution/2600-2699/2631.Group%20By/README_EN.md) | | Medium | |
|
||
| 2632 | [Curry](/solution/2600-2699/2632.Curry/README_EN.md) | | Medium | 🔒 |
|
||
| 2633 | [Convert Object to JSON String](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README_EN.md) | | Medium | 🔒 |
|
||
| 2634 | [Filter Elements from Array](/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README_EN.md) | | Easy | |
|
||
| 2635 | [Apply Transform Over Each Element in Array](/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README_EN.md) | | Easy | |
|
||
| 2636 | [Promise Pool](/solution/2600-2699/2636.Promise%20Pool/README_EN.md) | | Medium | 🔒 |
|
||
| 2637 | [Promise Time Limit](/solution/2600-2699/2637.Promise%20Time%20Limit/README_EN.md) | | Medium | |
|
||
| 2638 | [Count the Number of K-Free Subsets](/solution/2600-2699/2638.Count%20the%20Number%20of%20K-Free%20Subsets/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics`,`Sorting` | Medium | 🔒 |
|
||
| 2639 | [Find the Width of Columns of a Grid](/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README_EN.md) | `Array`,`Matrix` | Easy | Biweekly Contest 102 |
|
||
| 2640 | [Find the Score of All Prefixes of an Array](/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 102 |
|
||
| 2641 | [Cousins in Binary Tree II](/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Biweekly Contest 102 |
|
||
| 2642 | [Design Graph With Shortest Path Calculator](/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README_EN.md) | `Graph`,`Design`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Biweekly Contest 102 |
|
||
| 2643 | [Row With Maximum Ones](/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 341 |
|
||
| 2644 | [Find the Maximum Divisibility Score](/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README_EN.md) | `Array` | Easy | Weekly Contest 341 |
|
||
| 2645 | [Minimum Additions to Make Valid String](/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Dynamic Programming` | Medium | Weekly Contest 341 |
|
||
| 2646 | [Minimize the Total Price of the Trips](/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 341 |
|
||
| 2647 | [Color the Triangle Red](/solution/2600-2699/2647.Color%20the%20Triangle%20Red/README_EN.md) | `Array`,`Math` | Hard | 🔒 |
|
||
| 2648 | [Generate Fibonacci Sequence](/solution/2600-2699/2648.Generate%20Fibonacci%20Sequence/README_EN.md) | | Easy | |
|
||
| 2649 | [Nested Array Generator](/solution/2600-2699/2649.Nested%20Array%20Generator/README_EN.md) | | Medium | |
|
||
| 2650 | [Design Cancellable Function](/solution/2600-2699/2650.Design%20Cancellable%20Function/README_EN.md) | | Hard | |
|
||
| 2651 | [Calculate Delayed Arrival Time](/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README_EN.md) | `Math` | Easy | Weekly Contest 342 |
|
||
| 2652 | [Sum Multiples](/solution/2600-2699/2652.Sum%20Multiples/README_EN.md) | `Math` | Easy | Weekly Contest 342 |
|
||
| 2653 | [Sliding Subarray Beauty](/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 342 |
|
||
| 2654 | [Minimum Number of Operations to Make All Array Elements Equal to 1](/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 342 |
|
||
| 2655 | [Find Maximal Uncovered Ranges](/solution/2600-2699/2655.Find%20Maximal%20Uncovered%20Ranges/README_EN.md) | `Array`,`Sorting` | Medium | 🔒 |
|
||
| 2656 | [Maximum Sum With Exactly K Elements](/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README_EN.md) | `Greedy`,`Array` | Easy | Biweekly Contest 103 |
|
||
| 2657 | [Find the Prefix Common Array of Two Arrays](/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Medium | Biweekly Contest 103 |
|
||
| 2658 | [Maximum Number of Fish in a Grid](/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Biweekly Contest 103 |
|
||
| 2659 | [Make Array Empty](/solution/2600-2699/2659.Make%20Array%20Empty/README_EN.md) | `Greedy`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Ordered Set`,`Sorting` | Hard | Biweekly Contest 103 |
|
||
| 2660 | [Determine the Winner of a Bowling Game](/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 343 |
|
||
| 2661 | [First Completely Painted Row or Column](/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 343 |
|
||
| 2662 | [Minimum Cost of a Path With Special Roads](/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 343 |
|
||
| 2663 | [Lexicographically Smallest Beautiful String](/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) | `Greedy`,`String` | Hard | Weekly Contest 343 |
|
||
| 2664 | [The Knight’s Tour](/solution/2600-2699/2664.The%20Knight%E2%80%99s%20Tour/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | 🔒 |
|
||
| 2665 | [Counter II](/solution/2600-2699/2665.Counter%20II/README_EN.md) | | Easy | |
|
||
| 2666 | [Allow One Function Call](/solution/2600-2699/2666.Allow%20One%20Function%20Call/README_EN.md) | | Easy | |
|
||
| 2667 | [Create Hello World Function](/solution/2600-2699/2667.Create%20Hello%20World%20Function/README_EN.md) | | Easy | |
|
||
| 2668 | [Find Latest Salaries](/solution/2600-2699/2668.Find%20Latest%20Salaries/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2669 | [Count Artist Occurrences On Spotify Ranking List](/solution/2600-2699/2669.Count%20Artist%20Occurrences%20On%20Spotify%20Ranking%20List/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2670 | [Find the Distinct Difference Array](/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 344 |
|
||
| 2671 | [Frequency Tracker](/solution/2600-2699/2671.Frequency%20Tracker/README_EN.md) | `Design`,`Hash Table` | Medium | Weekly Contest 344 |
|
||
| 2672 | [Number of Adjacent Elements With the Same Color](/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README_EN.md) | `Array` | Medium | Weekly Contest 344 |
|
||
| 2673 | [Make Costs of Paths Equal in a Binary Tree](/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README_EN.md) | `Greedy`,`Tree`,`Array`,`Dynamic Programming`,`Binary Tree` | Medium | Weekly Contest 344 |
|
||
| 2674 | [Split a Circular Linked List](/solution/2600-2699/2674.Split%20a%20Circular%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | 🔒 |
|
||
| 2675 | [Array of Objects to Matrix](/solution/2600-2699/2675.Array%20of%20Objects%20to%20Matrix/README_EN.md) | | Hard | 🔒 |
|
||
| 2676 | [Throttle](/solution/2600-2699/2676.Throttle/README_EN.md) | | Medium | 🔒 |
|
||
| 2677 | [Chunk Array](/solution/2600-2699/2677.Chunk%20Array/README_EN.md) | | Easy | |
|
||
| 2678 | [Number of Senior Citizens](/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 104 |
|
||
| 2679 | [Sum in a Matrix](/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 104 |
|
||
| 2680 | [Maximum OR](/solution/2600-2699/2680.Maximum%20OR/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Biweekly Contest 104 |
|
||
| 2681 | [Power of Heroes](/solution/2600-2699/2681.Power%20of%20Heroes/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Prefix Sum`,`Sorting` | Hard | Biweekly Contest 104 |
|
||
| 2682 | [Find the Losers of the Circular Game](/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Easy | Weekly Contest 345 |
|
||
| 2683 | [Neighboring Bitwise XOR](/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Weekly Contest 345 |
|
||
| 2684 | [Maximum Number of Moves in a Grid](/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 345 |
|
||
| 2685 | [Count the Number of Complete Components](/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Weekly Contest 345 |
|
||
| 2686 | [Immediate Food Delivery III](/solution/2600-2699/2686.Immediate%20Food%20Delivery%20III/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2687 | [Bikes Last Time Used](/solution/2600-2699/2687.Bikes%20Last%20Time%20Used/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2688 | [Find Active Users](/solution/2600-2699/2688.Find%20Active%20Users/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2689 | [Extract Kth Character From The Rope Tree](/solution/2600-2699/2689.Extract%20Kth%20Character%20From%20The%20Rope%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | 🔒 |
|
||
| 2690 | [Infinite Method Object](/solution/2600-2699/2690.Infinite%20Method%20Object/README_EN.md) | | Easy | 🔒 |
|
||
| 2691 | [Immutability Helper](/solution/2600-2699/2691.Immutability%20Helper/README_EN.md) | | Hard | 🔒 |
|
||
| 2692 | [Make Object Immutable](/solution/2600-2699/2692.Make%20Object%20Immutable/README_EN.md) | | Medium | 🔒 |
|
||
| 2693 | [Call Function with Custom Context](/solution/2600-2699/2693.Call%20Function%20with%20Custom%20Context/README_EN.md) | | Medium | |
|
||
| 2694 | [Event Emitter](/solution/2600-2699/2694.Event%20Emitter/README_EN.md) | | Medium | |
|
||
| 2695 | [Array Wrapper](/solution/2600-2699/2695.Array%20Wrapper/README_EN.md) | | Easy | |
|
||
| 2696 | [Minimum String Length After Removing Substrings](/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README_EN.md) | `Stack`,`String`,`Simulation` | Easy | Weekly Contest 346 |
|
||
| 2697 | [Lexicographically Smallest Palindrome](/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Easy | Weekly Contest 346 |
|
||
| 2698 | [Find the Punishment Number of an Integer](/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README_EN.md) | `Math`,`Backtracking` | Medium | Weekly Contest 346 |
|
||
| 2699 | [Modify Graph Edge Weights](/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 346 |
|
||
| 2700 | [Differences Between Two Objects](/solution/2700-2799/2700.Differences%20Between%20Two%20Objects/README_EN.md) | | Medium | 🔒 |
|
||
| 2701 | [Consecutive Transactions with Increasing Amounts](/solution/2700-2799/2701.Consecutive%20Transactions%20with%20Increasing%20Amounts/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2702 | [Minimum Operations to Make Numbers Non-positive](/solution/2700-2799/2702.Minimum%20Operations%20to%20Make%20Numbers%20Non-positive/README_EN.md) | `Array`,`Binary Search` | Hard | 🔒 |
|
||
| 2703 | [Return Length of Arguments Passed](/solution/2700-2799/2703.Return%20Length%20of%20Arguments%20Passed/README_EN.md) | | Easy | |
|
||
| 2704 | [To Be Or Not To Be](/solution/2700-2799/2704.To%20Be%20Or%20Not%20To%20Be/README_EN.md) | | Easy | |
|
||
| 2705 | [Compact Object](/solution/2700-2799/2705.Compact%20Object/README_EN.md) | | Medium | |
|
||
| 2706 | [Buy Two Chocolates](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Biweekly Contest 105 |
|
||
| 2707 | [Extra Characters in a String](/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 105 |
|
||
| 2708 | [Maximum Strength of a Group](/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Enumeration`,`Sorting` | Medium | Biweekly Contest 105 |
|
||
| 2709 | [Greatest Common Divisor Traversal](/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README_EN.md) | `Union Find`,`Array`,`Math`,`Number Theory` | Hard | Biweekly Contest 105 |
|
||
| 2710 | [Remove Trailing Zeros From a String](/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README_EN.md) | `String` | Easy | Weekly Contest 347 |
|
||
| 2711 | [Difference of Number of Distinct Values on Diagonals](/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 347 |
|
||
| 2712 | [Minimum Cost to Make All Characters Equal](/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Weekly Contest 347 |
|
||
| 2713 | [Maximum Strictly Increasing Cells in a Matrix](/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README_EN.md) | `Memoization`,`Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Matrix`,`Ordered Set`,`Sorting` | Hard | Weekly Contest 347 |
|
||
| 2714 | [Find Shortest Path with K Hops](/solution/2700-2799/2714.Find%20Shortest%20Path%20with%20K%20Hops/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | 🔒 |
|
||
| 2715 | [Timeout Cancellation](/solution/2700-2799/2715.Timeout%20Cancellation/README_EN.md) | | Easy | |
|
||
| 2716 | [Minimize String Length](/solution/2700-2799/2716.Minimize%20String%20Length/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 348 |
|
||
| 2717 | [Semi-Ordered Permutation](/solution/2700-2799/2717.Semi-Ordered%20Permutation/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 348 |
|
||
| 2718 | [Sum of Matrix After Queries](/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 348 |
|
||
| 2719 | [Count of Integers](/solution/2700-2799/2719.Count%20of%20Integers/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Weekly Contest 348 |
|
||
| 2720 | [Popularity Percentage](/solution/2700-2799/2720.Popularity%20Percentage/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2721 | [Execute Asynchronous Functions in Parallel](/solution/2700-2799/2721.Execute%20Asynchronous%20Functions%20in%20Parallel/README_EN.md) | | Medium | |
|
||
| 2722 | [Join Two Arrays by ID](/solution/2700-2799/2722.Join%20Two%20Arrays%20by%20ID/README_EN.md) | | Medium | |
|
||
| 2723 | [Add Two Promises](/solution/2700-2799/2723.Add%20Two%20Promises/README_EN.md) | | Easy | |
|
||
| 2724 | [Sort By](/solution/2700-2799/2724.Sort%20By/README_EN.md) | | Easy | |
|
||
| 2725 | [Interval Cancellation](/solution/2700-2799/2725.Interval%20Cancellation/README_EN.md) | | Easy | |
|
||
| 2726 | [Calculator with Method Chaining](/solution/2700-2799/2726.Calculator%20with%20Method%20Chaining/README_EN.md) | | Easy | |
|
||
| 2727 | [Is Object Empty](/solution/2700-2799/2727.Is%20Object%20Empty/README_EN.md) | | Easy | |
|
||
| 2728 | [Count Houses in a Circular Street](/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README_EN.md) | `Array`,`Interactive` | Easy | 🔒 |
|
||
| 2729 | [Check if The Number is Fascinating](/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README_EN.md) | `Hash Table`,`Math` | Easy | Biweekly Contest 106 |
|
||
| 2730 | [Find the Longest Semi-Repetitive Substring](/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README_EN.md) | `String`,`Sliding Window` | Medium | Biweekly Contest 106 |
|
||
| 2731 | [Movement of Robots](/solution/2700-2799/2731.Movement%20of%20Robots/README_EN.md) | `Brainteaser`,`Array`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 106 |
|
||
| 2732 | [Find a Good Subset of the Matrix](/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Matrix` | Hard | Biweekly Contest 106 |
|
||
| 2733 | [Neither Minimum nor Maximum](/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 349 |
|
||
| 2734 | [Lexicographically Smallest String After Substring Operation](/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 349 |
|
||
| 2735 | [Collecting Chocolates](/solution/2700-2799/2735.Collecting%20Chocolates/README_EN.md) | `Array`,`Enumeration` | Medium | Weekly Contest 349 |
|
||
| 2736 | [Maximum Sum Queries](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README_EN.md) | `Stack`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Sorting`,`Monotonic Stack` | Hard | Weekly Contest 349 |
|
||
| 2737 | [Find the Closest Marked Node](/solution/2700-2799/2737.Find%20the%20Closest%20Marked%20Node/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 2738 | [Count Occurrences in Text](/solution/2700-2799/2738.Count%20Occurrences%20in%20Text/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2739 | [Total Distance Traveled](/solution/2700-2799/2739.Total%20Distance%20Traveled/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 350 |
|
||
| 2740 | [Find the Value of the Partition](/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 350 |
|
||
| 2741 | [Special Permutations](/solution/2700-2799/2741.Special%20Permutations/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Medium | Weekly Contest 350 |
|
||
| 2742 | [Painting the Walls](/solution/2700-2799/2742.Painting%20the%20Walls/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 350 |
|
||
| 2743 | [Count Substrings Without Repeating Character](/solution/2700-2799/2743.Count%20Substrings%20Without%20Repeating%20Character/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | 🔒 |
|
||
| 2744 | [Find Maximum Number of String Pairs](/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README_EN.md) | `Array`,`Hash Table`,`String`,`Simulation` | Easy | Biweekly Contest 107 |
|
||
| 2745 | [Construct the Longest New String](/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README_EN.md) | `Greedy`,`Brainteaser`,`Math`,`Dynamic Programming` | Medium | Biweekly Contest 107 |
|
||
| 2746 | [Decremental String Concatenation](/solution/2700-2799/2746.Decremental%20String%20Concatenation/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 107 |
|
||
| 2747 | [Count Zero Request Servers](/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Sliding Window` | Medium | Biweekly Contest 107 |
|
||
| 2748 | [Number of Beautiful Pairs](/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Easy | Weekly Contest 351 |
|
||
| 2749 | [Minimum Operations to Make the Integer Zero](/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Enumeration` | Medium | Weekly Contest 351 |
|
||
| 2750 | [Ways to Split Array Into Good Subarrays](/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | Weekly Contest 351 |
|
||
| 2751 | [Robot Collisions](/solution/2700-2799/2751.Robot%20Collisions/README_EN.md) | `Stack`,`Array`,`Sorting`,`Simulation` | Hard | Weekly Contest 351 |
|
||
| 2752 | [Customers with Maximum Number of Transactions on Consecutive Days](/solution/2700-2799/2752.Customers%20with%20Maximum%20Number%20of%20Transactions%20on%20Consecutive%20Days/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2753 | [Count Houses in a Circular Street II](/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README_EN.md) | | Hard | 🔒 |
|
||
| 2754 | [Bind Function to Context](/solution/2700-2799/2754.Bind%20Function%20to%20Context/README_EN.md) | | Medium | 🔒 |
|
||
| 2755 | [Deep Merge of Two Objects](/solution/2700-2799/2755.Deep%20Merge%20of%20Two%20Objects/README_EN.md) | | Medium | 🔒 |
|
||
| 2756 | [Query Batching](/solution/2700-2799/2756.Query%20Batching/README_EN.md) | | Hard | 🔒 |
|
||
| 2757 | [Generate Circular Array Values](/solution/2700-2799/2757.Generate%20Circular%20Array%20Values/README_EN.md) | | Medium | 🔒 |
|
||
| 2758 | [Next Day](/solution/2700-2799/2758.Next%20Day/README_EN.md) | | Easy | 🔒 |
|
||
| 2759 | [Convert JSON String to Object](/solution/2700-2799/2759.Convert%20JSON%20String%20to%20Object/README_EN.md) | | Hard | 🔒 |
|
||
| 2760 | [Longest Even Odd Subarray With Threshold](/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README_EN.md) | `Array`,`Sliding Window` | Easy | Weekly Contest 352 |
|
||
| 2761 | [Prime Pairs With Target Sum](/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README_EN.md) | `Array`,`Math`,`Enumeration`,`Number Theory` | Medium | Weekly Contest 352 |
|
||
| 2762 | [Continuous Subarrays](/solution/2700-2799/2762.Continuous%20Subarrays/README_EN.md) | `Queue`,`Array`,`Ordered Set`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Weekly Contest 352 |
|
||
| 2763 | [Sum of Imbalance Numbers of All Subarrays](/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Ordered Set` | Hard | Weekly Contest 352 |
|
||
| 2764 | [Is Array a Preorder of Some Binary Tree](/solution/2700-2799/2764.Is%20Array%20a%20Preorder%20of%20Some%20%E2%80%8CBinary%20Tree/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 |
|
||
| 2765 | [Longest Alternating Subarray](/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README_EN.md) | `Array`,`Enumeration` | Easy | Biweekly Contest 108 |
|
||
| 2766 | [Relocate Marbles](/solution/2700-2799/2766.Relocate%20Marbles/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation` | Medium | Biweekly Contest 108 |
|
||
| 2767 | [Partition String Into Minimum Beautiful Substrings](/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming`,`Backtracking` | Medium | Biweekly Contest 108 |
|
||
| 2768 | [Number of Black Blocks](/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Medium | Biweekly Contest 108 |
|
||
| 2769 | [Find the Maximum Achievable Number](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README_EN.md) | `Math` | Easy | Weekly Contest 353 |
|
||
| 2770 | [Maximum Number of Jumps to Reach the Last Index](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 353 |
|
||
| 2771 | [Longest Non-decreasing Subarray From Two Arrays](/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 353 |
|
||
| 2772 | [Apply Operations to Make All Array Elements Equal to Zero](/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 353 |
|
||
| 2773 | [Height of Special Binary Tree](/solution/2700-2799/2773.Height%20of%20Special%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 |
|
||
| 2774 | [Array Upper Bound](/solution/2700-2799/2774.Array%20Upper%20Bound/README_EN.md) | | Easy | 🔒 |
|
||
| 2775 | [Undefined to Null](/solution/2700-2799/2775.Undefined%20to%20Null/README_EN.md) | | Medium | 🔒 |
|
||
| 2776 | [Convert Callback Based Function to Promise Based Function](/solution/2700-2799/2776.Convert%20Callback%20Based%20Function%20to%20Promise%20Based%20Function/README_EN.md) | | Medium | 🔒 |
|
||
| 2777 | [Date Range Generator](/solution/2700-2799/2777.Date%20Range%20Generator/README_EN.md) | | Medium | 🔒 |
|
||
| 2778 | [Sum of Squares of Special Elements](/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 354 |
|
||
| 2779 | [Maximum Beauty of an Array After Applying Operation](/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README_EN.md) | `Array`,`Binary Search`,`Sorting`,`Sliding Window` | Medium | Weekly Contest 354 |
|
||
| 2780 | [Minimum Index of a Valid Split](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 354 |
|
||
| 2781 | [Length of the Longest Valid Substring](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README_EN.md) | `Array`,`Hash Table`,`String`,`Sliding Window` | Hard | Weekly Contest 354 |
|
||
| 2782 | [Number of Unique Categories](/solution/2700-2799/2782.Number%20of%20Unique%20Categories/README_EN.md) | `Union Find`,`Counting`,`Interactive` | Medium | 🔒 |
|
||
| 2783 | [Flight Occupancy and Waitlist Analysis](/solution/2700-2799/2783.Flight%20Occupancy%20and%20Waitlist%20Analysis/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2784 | [Check if Array is Good](/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 109 |
|
||
| 2785 | [Sort Vowels in a String](/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README_EN.md) | `String`,`Sorting` | Medium | Biweekly Contest 109 |
|
||
| 2786 | [Visit Array Positions to Maximize Score](/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 109 |
|
||
| 2787 | [Ways to Express an Integer as Sum of Powers](/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README_EN.md) | `Dynamic Programming` | Medium | Biweekly Contest 109 |
|
||
| 2788 | [Split Strings by Separator](/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 355 |
|
||
| 2789 | [Largest Element in an Array after Merge Operations](/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 355 |
|
||
| 2790 | [Maximum Number of Groups With Increasing Length](/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Sorting` | Hard | Weekly Contest 355 |
|
||
| 2791 | [Count Paths That Can Form a Palindrome in a Tree](/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 355 |
|
||
| 2792 | [Count Nodes That Are Great Enough](/solution/2700-2799/2792.Count%20Nodes%20That%20Are%20Great%20Enough/README_EN.md) | `Tree`,`Depth-First Search`,`Divide and Conquer`,`Binary Tree` | Hard | 🔒 |
|
||
| 2793 | [Status of Flight Tickets](/solution/2700-2799/2793.Status%20of%20Flight%20Tickets/README_EN.md) | | Hard | 🔒 |
|
||
| 2794 | [Create Object from Two Arrays](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README_EN.md) | | Easy | 🔒 |
|
||
| 2795 | [Parallel Execution of Promises for Individual Results Retrieval](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README_EN.md) | | Medium | 🔒 |
|
||
| 2796 | [Repeat String](/solution/2700-2799/2796.Repeat%20String/README_EN.md) | | Easy | 🔒 |
|
||
| 2797 | [Partial Function with Placeholders](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README_EN.md) | | Easy | 🔒 |
|
||
| 2798 | [Number of Employees Who Met the Target](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README_EN.md) | `Array` | Easy | Weekly Contest 356 |
|
||
| 2799 | [Count Complete Subarrays in an Array](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 356 |
|
||
| 2800 | [Shortest String That Contains Three Strings](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README_EN.md) | `Greedy`,`String`,`Enumeration` | Medium | Weekly Contest 356 |
|
||
| 2801 | [Count Stepping Numbers in Range](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 356 |
|
||
| 2802 | [Find The K-th Lucky Number](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README_EN.md) | `Bit Manipulation`,`Math`,`String` | Medium | 🔒 |
|
||
| 2803 | [Factorial Generator](/solution/2800-2899/2803.Factorial%20Generator/README_EN.md) | | Easy | 🔒 |
|
||
| 2804 | [Array Prototype ForEach](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README_EN.md) | | Easy | 🔒 |
|
||
| 2805 | [Custom Interval](/solution/2800-2899/2805.Custom%20Interval/README_EN.md) | | Medium | 🔒 |
|
||
| 2806 | [Account Balance After Rounded Purchase](/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README_EN.md) | `Math` | Easy | Biweekly Contest 110 |
|
||
| 2807 | [Insert Greatest Common Divisors in Linked List](/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README_EN.md) | `Linked List`,`Math`,`Number Theory` | Medium | Biweekly Contest 110 |
|
||
| 2808 | [Minimum Seconds to Equalize a Circular Array](/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README_EN.md) | `Array`,`Hash Table` | Medium | Biweekly Contest 110 |
|
||
| 2809 | [Minimum Time to Make Array Sum At Most x](/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 110 |
|
||
| 2810 | [Faulty Keyboard](/solution/2800-2899/2810.Faulty%20Keyboard/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 357 |
|
||
| 2811 | [Check if it is Possible to Split Array](/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 357 |
|
||
| 2812 | [Find the Safest Path in a Grid](/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README_EN.md) | `Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Medium | Weekly Contest 357 |
|
||
| 2813 | [Maximum Elegance of a K-Length Subsequence](/solution/2800-2899/2813.Maximum%20Elegance%20of%20a%20K-Length%20Subsequence/README_EN.md) | `Stack`,`Greedy`,`Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 357 |
|
||
| 2814 | [Minimum Time Takes to Reach Destination Without Drowning](/solution/2800-2899/2814.Minimum%20Time%20Takes%20to%20Reach%20Destination%20Without%20Drowning/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | 🔒 |
|
||
| 2815 | [Max Pair Sum in an Array](/solution/2800-2899/2815.Max%20Pair%20Sum%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 358 |
|
||
| 2816 | [Double a Number Represented as a Linked List](/solution/2800-2899/2816.Double%20a%20Number%20Represented%20as%20a%20Linked%20List/README_EN.md) | `Stack`,`Linked List`,`Math` | Medium | Weekly Contest 358 |
|
||
| 2817 | [Minimum Absolute Difference Between Elements With Constraint](/solution/2800-2899/2817.Minimum%20Absolute%20Difference%20Between%20Elements%20With%20Constraint/README_EN.md) | `Array`,`Binary Search`,`Ordered Set` | Medium | Weekly Contest 358 |
|
||
| 2818 | [Apply Operations to Maximize Score](/solution/2800-2899/2818.Apply%20Operations%20to%20Maximize%20Score/README_EN.md) | `Stack`,`Greedy`,`Array`,`Math`,`Number Theory`,`Sorting`,`Monotonic Stack` | Hard | Weekly Contest 358 |
|
||
| 2819 | [Minimum Relative Loss After Buying Chocolates](/solution/2800-2899/2819.Minimum%20Relative%20Loss%20After%20Buying%20Chocolates/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Hard | 🔒 |
|
||
| 2820 | [Election Results](/solution/2800-2899/2820.Election%20Results/README_EN.md) | | Medium | 🔒 |
|
||
| 2821 | [Delay the Resolution of Each Promise](/solution/2800-2899/2821.Delay%20the%20Resolution%20of%20Each%20Promise/README_EN.md) | | Medium | 🔒 |
|
||
| 2822 | [Inversion of Object](/solution/2800-2899/2822.Inversion%20of%20Object/README_EN.md) | | Easy | 🔒 |
|
||
| 2823 | [Deep Object Filter](/solution/2800-2899/2823.Deep%20Object%20Filter/README_EN.md) | | Medium | 🔒 |
|
||
| 2824 | [Count Pairs Whose Sum is Less than Target](/solution/2800-2899/2824.Count%20Pairs%20Whose%20Sum%20is%20Less%20than%20Target/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Biweekly Contest 111 |
|
||
| 2825 | [Make String a Subsequence Using Cyclic Increments](/solution/2800-2899/2825.Make%20String%20a%20Subsequence%20Using%20Cyclic%20Increments/README_EN.md) | `Two Pointers`,`String` | Medium | Biweekly Contest 111 |
|
||
| 2826 | [Sorting Three Groups](/solution/2800-2899/2826.Sorting%20Three%20Groups/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Medium | Biweekly Contest 111 |
|
||
| 2827 | [Number of Beautiful Integers in the Range](/solution/2800-2899/2827.Number%20of%20Beautiful%20Integers%20in%20the%20Range/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Biweekly Contest 111 |
|
||
| 2828 | [Check if a String Is an Acronym of Words](/solution/2800-2899/2828.Check%20if%20a%20String%20Is%20an%20Acronym%20of%20Words/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 359 |
|
||
| 2829 | [Determine the Minimum Sum of a k-avoiding Array](/solution/2800-2899/2829.Determine%20the%20Minimum%20Sum%20of%20a%20k-avoiding%20Array/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 359 |
|
||
| 2830 | [Maximize the Profit as the Salesman](/solution/2800-2899/2830.Maximize%20the%20Profit%20as%20the%20Salesman/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 359 |
|
||
| 2831 | [Find the Longest Equal Subarray](/solution/2800-2899/2831.Find%20the%20Longest%20Equal%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sliding Window` | Medium | Weekly Contest 359 |
|
||
| 2832 | [Maximal Range That Each Element Is Maximum in It](/solution/2800-2899/2832.Maximal%20Range%20That%20Each%20Element%20Is%20Maximum%20in%20It/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 2833 | [Furthest Point From Origin](/solution/2800-2899/2833.Furthest%20Point%20From%20Origin/README_EN.md) | `String`,`Counting` | Easy | Weekly Contest 360 |
|
||
| 2834 | [Find the Minimum Possible Sum of a Beautiful Array](/solution/2800-2899/2834.Find%20the%20Minimum%20Possible%20Sum%20of%20a%20Beautiful%20Array/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 360 |
|
||
| 2835 | [Minimum Operations to Form Subsequence With Target Sum](/solution/2800-2899/2835.Minimum%20Operations%20to%20Form%20Subsequence%20With%20Target%20Sum/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Hard | Weekly Contest 360 |
|
||
| 2836 | [Maximize Value of Function in a Ball Passing Game](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 360 |
|
||
| 2837 | [Total Traveled Distance](/solution/2800-2899/2837.Total%20Traveled%20Distance/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2838 | [Maximum Coins Heroes Can Collect](/solution/2800-2899/2838.Maximum%20Coins%20Heroes%20Can%20Collect/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Prefix Sum`,`Sorting` | Medium | 🔒 |
|
||
| 2839 | [Check if Strings Can be Made Equal With Operations I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README_EN.md) | `String` | Easy | Biweekly Contest 112 |
|
||
| 2840 | [Check if Strings Can be Made Equal With Operations II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README_EN.md) | `Hash Table`,`String`,`Sorting` | Medium | Biweekly Contest 112 |
|
||
| 2841 | [Maximum Sum of Almost Unique Subarray](/solution/2800-2899/2841.Maximum%20Sum%20of%20Almost%20Unique%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Biweekly Contest 112 |
|
||
| 2842 | [Count K-Subsequences of a String With Maximum Beauty](/solution/2800-2899/2842.Count%20K-Subsequences%20of%20a%20String%20With%20Maximum%20Beauty/README_EN.md) | `Greedy`,`Hash Table`,`Math`,`String`,`Combinatorics` | Hard | Biweekly Contest 112 |
|
||
| 2843 | [Count Symmetric Integers](/solution/2800-2899/2843.Count%20Symmetric%20Integers/README_EN.md) | `Math`,`Enumeration` | Easy | Weekly Contest 361 |
|
||
| 2844 | [Minimum Operations to Make a Special Number](/solution/2800-2899/2844.Minimum%20Operations%20to%20Make%20a%20Special%20Number/README_EN.md) | `Greedy`,`Math`,`String`,`Enumeration` | Medium | Weekly Contest 361 |
|
||
| 2845 | [Count of Interesting Subarrays](/solution/2800-2899/2845.Count%20of%20Interesting%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 361 |
|
||
| 2846 | [Minimum Edge Weight Equilibrium Queries in a Tree](/solution/2800-2899/2846.Minimum%20Edge%20Weight%20Equilibrium%20Queries%20in%20a%20Tree/README_EN.md) | `Tree`,`Graph`,`Array`,`Strongly Connected Component` | Hard | Weekly Contest 361 |
|
||
| 2847 | [Smallest Number With Given Digit Product](/solution/2800-2899/2847.Smallest%20Number%20With%20Given%20Digit%20Product/README_EN.md) | `Greedy`,`Math` | Medium | 🔒 |
|
||
| 2848 | [Points That Intersect With Cars](/solution/2800-2899/2848.Points%20That%20Intersect%20With%20Cars/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Easy | Weekly Contest 362 |
|
||
| 2849 | [Determine if a Cell Is Reachable at a Given Time](/solution/2800-2899/2849.Determine%20if%20a%20Cell%20Is%20Reachable%20at%20a%20Given%20Time/README_EN.md) | `Math` | Medium | Weekly Contest 362 |
|
||
| 2850 | [Minimum Moves to Spread Stones Over Grid](/solution/2800-2899/2850.Minimum%20Moves%20to%20Spread%20Stones%20Over%20Grid/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 362 |
|
||
| 2851 | [String Transformation](/solution/2800-2899/2851.String%20Transformation/README_EN.md) | `Math`,`String`,`Dynamic Programming`,`String Matching` | Hard | Weekly Contest 362 |
|
||
| 2852 | [Sum of Remoteness of All Cells](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`Matrix` | Medium | 🔒 |
|
||
| 2853 | [Highest Salaries Difference](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2854 | [Rolling Average Steps](/solution/2800-2899/2854.Rolling%20Average%20Steps/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2855 | [Minimum Right Shifts to Sort the Array](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README_EN.md) | `Array` | Easy | Biweekly Contest 113 |
|
||
| 2856 | [Minimum Array Length After Pair Removals](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Counting` | Medium | Biweekly Contest 113 |
|
||
| 2857 | [Count Pairs of Points With Distance k](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Medium | Biweekly Contest 113 |
|
||
| 2858 | [Minimum Edge Reversals So Every Node Is Reachable](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Dynamic Programming` | Hard | Biweekly Contest 113 |
|
||
| 2859 | [Sum of Values at Indices With K Set Bits](/solution/2800-2899/2859.Sum%20of%20Values%20at%20Indices%20With%20K%20Set%20Bits/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 363 |
|
||
| 2860 | [Happy Students](/solution/2800-2899/2860.Happy%20Students/README_EN.md) | `Array`,`Enumeration`,`Sorting` | Medium | Weekly Contest 363 |
|
||
| 2861 | [Maximum Number of Alloys](/solution/2800-2899/2861.Maximum%20Number%20of%20Alloys/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 363 |
|
||
| 2862 | [Maximum Element-Sum of a Complete Subset of Indices](/solution/2800-2899/2862.Maximum%20Element-Sum%20of%20a%20Complete%20Subset%20of%20Indices/README_EN.md) | `Array`,`Math`,`Number Theory` | Hard | Weekly Contest 363 |
|
||
| 2863 | [Maximum Length of Semi-Decreasing Subarrays](/solution/2800-2899/2863.Maximum%20Length%20of%20Semi-Decreasing%20Subarrays/README_EN.md) | `Stack`,`Array`,`Sorting`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 2864 | [Maximum Odd Binary Number](/solution/2800-2899/2864.Maximum%20Odd%20Binary%20Number/README_EN.md) | `Greedy`,`Math`,`String` | Easy | Weekly Contest 364 |
|
||
| 2865 | [Beautiful Towers I](/solution/2800-2899/2865.Beautiful%20Towers%20I/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 364 |
|
||
| 2866 | [Beautiful Towers II](/solution/2800-2899/2866.Beautiful%20Towers%20II/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 364 |
|
||
| 2867 | [Count Valid Paths in a Tree](/solution/2800-2899/2867.Count%20Valid%20Paths%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Math`,`Dynamic Programming`,`Number Theory` | Hard | Weekly Contest 364 |
|
||
| 2868 | [The Wording Game](/solution/2800-2899/2868.The%20Wording%20Game/README_EN.md) | `Greedy`,`Array`,`Math`,`Two Pointers`,`String`,`Game Theory` | Hard | 🔒 |
|
||
| 2869 | [Minimum Operations to Collect Elements](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Easy | Biweekly Contest 114 |
|
||
| 2870 | [Minimum Number of Operations to Make Array Empty](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Biweekly Contest 114 |
|
||
| 2871 | [Split Array Into Maximum Number of Subarrays](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Medium | Biweekly Contest 114 |
|
||
| 2872 | [Maximum Number of K-Divisible Components](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README_EN.md) | `Tree`,`Depth-First Search` | Hard | Biweekly Contest 114 |
|
||
| 2873 | [Maximum Value of an Ordered Triplet I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README_EN.md) | `Array` | Easy | Weekly Contest 365 |
|
||
| 2874 | [Maximum Value of an Ordered Triplet II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README_EN.md) | `Array` | Medium | Weekly Contest 365 |
|
||
| 2875 | [Minimum Size Subarray in Infinite Array](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 365 |
|
||
| 2876 | [Count Visited Nodes in a Directed Graph](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README_EN.md) | `Graph`,`Memoization`,`Dynamic Programming` | Hard | Weekly Contest 365 |
|
||
| 2877 | [Create a DataFrame from List](/solution/2800-2899/2877.Create%20a%20DataFrame%20from%20List/README_EN.md) | | Easy | |
|
||
| 2878 | [Get the Size of a DataFrame](/solution/2800-2899/2878.Get%20the%20Size%20of%20a%20DataFrame/README_EN.md) | | Easy | |
|
||
| 2879 | [Display the First Three Rows](/solution/2800-2899/2879.Display%20the%20First%20Three%20Rows/README_EN.md) | | Easy | |
|
||
| 2880 | [Select Data](/solution/2800-2899/2880.Select%20Data/README_EN.md) | | Easy | |
|
||
| 2881 | [Create a New Column](/solution/2800-2899/2881.Create%20a%20New%20Column/README_EN.md) | | Easy | |
|
||
| 2882 | [Drop Duplicate Rows](/solution/2800-2899/2882.Drop%20Duplicate%20Rows/README_EN.md) | | Easy | |
|
||
| 2883 | [Drop Missing Data](/solution/2800-2899/2883.Drop%20Missing%20Data/README_EN.md) | | Easy | |
|
||
| 2884 | [Modify Columns](/solution/2800-2899/2884.Modify%20Columns/README_EN.md) | | Easy | |
|
||
| 2885 | [Rename Columns](/solution/2800-2899/2885.Rename%20Columns/README_EN.md) | | Easy | |
|
||
| 2886 | [Change Data Type](/solution/2800-2899/2886.Change%20Data%20Type/README_EN.md) | | Easy | |
|
||
| 2887 | [Fill Missing Data](/solution/2800-2899/2887.Fill%20Missing%20Data/README_EN.md) | | Easy | |
|
||
| 2888 | [Reshape Data Concatenate](/solution/2800-2899/2888.Reshape%20Data%20Concatenate/README_EN.md) | | Easy | |
|
||
| 2889 | [Reshape Data Pivot](/solution/2800-2899/2889.Reshape%20Data%20Pivot/README_EN.md) | | Easy | |
|
||
| 2890 | [Reshape Data Melt](/solution/2800-2899/2890.Reshape%20Data%20Melt/README_EN.md) | | Easy | |
|
||
| 2891 | [Method Chaining](/solution/2800-2899/2891.Method%20Chaining/README_EN.md) | | Easy | |
|
||
| 2892 | [Minimizing Array After Replacing Pairs With Their Product](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 2893 | [Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2894 | [Divisible and Non-divisible Sums Difference](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README_EN.md) | `Math` | Easy | Weekly Contest 366 |
|
||
| 2895 | [Minimum Processing Time](/solution/2800-2899/2895.Minimum%20Processing%20Time/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 366 |
|
||
| 2896 | [Apply Operations to Make Two Strings Equal](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README_EN.md) | `String`,`Dynamic Programming` | Medium | Weekly Contest 366 |
|
||
| 2897 | [Apply Operations on Array to Maximize Sum of Squares](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Hash Table` | Hard | Weekly Contest 366 |
|
||
| 2898 | [Maximum Linear Stock Score](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README_EN.md) | `Array`,`Hash Table` | Medium | 🔒 |
|
||
| 2899 | [Last Visited Integers](/solution/2800-2899/2899.Last%20Visited%20Integers/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 115 |
|
||
| 2900 | [Longest Unequal Adjacent Groups Subsequence I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README_EN.md) | `Greedy`,`Array`,`String`,`Dynamic Programming` | Easy | Biweekly Contest 115 |
|
||
| 2901 | [Longest Unequal Adjacent Groups Subsequence II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 115 |
|
||
| 2902 | [Count of Sub-Multisets With Bounded Sum](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Sliding Window` | Hard | Biweekly Contest 115 |
|
||
| 2903 | [Find Indices With Index and Value Difference I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README_EN.md) | `Array`,`Two Pointers` | Easy | Weekly Contest 367 |
|
||
| 2904 | [Shortest and Lexicographically Smallest Beautiful String](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 367 |
|
||
| 2905 | [Find Indices With Index and Value Difference II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README_EN.md) | `Array`,`Two Pointers` | Medium | Weekly Contest 367 |
|
||
| 2906 | [Construct Product Matrix](/solution/2900-2999/2906.Construct%20Product%20Matrix/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 367 |
|
||
| 2907 | [Maximum Profitable Triplets With Increasing Prices I](/solution/2900-2999/2907.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20I/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array` | Medium | 🔒 |
|
||
| 2908 | [Minimum Sum of Mountain Triplets I](/solution/2900-2999/2908.Minimum%20Sum%20of%20Mountain%20Triplets%20I/README_EN.md) | `Array` | Easy | Weekly Contest 368 |
|
||
| 2909 | [Minimum Sum of Mountain Triplets II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README_EN.md) | `Array` | Medium | Weekly Contest 368 |
|
||
| 2910 | [Minimum Number of Groups to Create a Valid Assignment](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Weekly Contest 368 |
|
||
| 2911 | [Minimum Changes to Make K Semi-palindromes](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Hard | Weekly Contest 368 |
|
||
| 2912 | [Number of Ways to Reach Destination in the Grid](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | 🔒 |
|
||
| 2913 | [Subarrays Distinct Element Sum of Squares I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 116 |
|
||
| 2914 | [Minimum Number of Changes to Make Binary String Beautiful](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README_EN.md) | `String` | Medium | Biweekly Contest 116 |
|
||
| 2915 | [Length of the Longest Subsequence That Sums to Target](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 116 |
|
||
| 2916 | [Subarrays Distinct Element Sum of Squares II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 116 |
|
||
| 2917 | [Find the K-or of an Array](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 369 |
|
||
| 2918 | [Minimum Equal Sum of Two Arrays After Replacing Zeros](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 369 |
|
||
| 2919 | [Minimum Increment Operations to Make Array Beautiful](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 369 |
|
||
| 2920 | [Maximum Points After Collecting Coins From All Nodes](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Memoization`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 369 |
|
||
| 2921 | [Maximum Profitable Triplets With Increasing Prices II](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array` | Hard | 🔒 |
|
||
| 2922 | [Market Analysis III](/solution/2900-2999/2922.Market%20Analysis%20III/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2923 | [Find Champion I](/solution/2900-2999/2923.Find%20Champion%20I/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 370 |
|
||
| 2924 | [Find Champion II](/solution/2900-2999/2924.Find%20Champion%20II/README_EN.md) | `Graph` | Medium | Weekly Contest 370 |
|
||
| 2925 | [Maximum Score After Applying Operations on a Tree](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming` | Medium | Weekly Contest 370 |
|
||
| 2926 | [Maximum Balanced Subsequence Sum](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 370 |
|
||
| 2927 | [Distribute Candies Among Children III](/solution/2900-2999/2927.Distribute%20Candies%20Among%20Children%20III/README_EN.md) | `Math`,`Combinatorics` | Hard | 🔒 |
|
||
| 2928 | [Distribute Candies Among Children I](/solution/2900-2999/2928.Distribute%20Candies%20Among%20Children%20I/README_EN.md) | `Math`,`Combinatorics`,`Enumeration` | Easy | Biweekly Contest 117 |
|
||
| 2929 | [Distribute Candies Among Children II](/solution/2900-2999/2929.Distribute%20Candies%20Among%20Children%20II/README_EN.md) | `Math`,`Combinatorics`,`Enumeration` | Medium | Biweekly Contest 117 |
|
||
| 2930 | [Number of Strings Which Can Be Rearranged to Contain Substring](/solution/2900-2999/2930.Number%20of%20Strings%20Which%20Can%20Be%20Rearranged%20to%20Contain%20Substring/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Biweekly Contest 117 |
|
||
| 2931 | [Maximum Spending After Buying Items](/solution/2900-2999/2931.Maximum%20Spending%20After%20Buying%20Items/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Hard | Biweekly Contest 117 |
|
||
| 2932 | [Maximum Strong Pair XOR I](/solution/2900-2999/2932.Maximum%20Strong%20Pair%20XOR%20I/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`Sliding Window` | Easy | Weekly Contest 371 |
|
||
| 2933 | [High-Access Employees](/solution/2900-2999/2933.High-Access%20Employees/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 371 |
|
||
| 2934 | [Minimum Operations to Maximize Last Elements in Arrays](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README_EN.md) | `Array`,`Enumeration` | Medium | Weekly Contest 371 |
|
||
| 2935 | [Maximum Strong Pair XOR II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`Sliding Window` | Hard | Weekly Contest 371 |
|
||
| 2936 | [Number of Equal Numbers Blocks](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Medium | 🔒 |
|
||
| 2937 | [Make Three Strings Equal](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README_EN.md) | `String` | Easy | Weekly Contest 372 |
|
||
| 2938 | [Separate Black and White Balls](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 372 |
|
||
| 2939 | [Maximum Xor Product](/solution/2900-2999/2939.Maximum%20Xor%20Product/README_EN.md) | `Greedy`,`Bit Manipulation`,`Math` | Medium | Weekly Contest 372 |
|
||
| 2940 | [Find Building Where Alice and Bob Can Meet](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README_EN.md) | `Stack`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 372 |
|
||
| 2941 | [Maximum GCD-Sum of a Subarray](/solution/2900-2999/2941.Maximum%20GCD-Sum%20of%20a%20Subarray/README_EN.md) | `Array`,`Math`,`Binary Search`,`Number Theory` | Hard | 🔒 |
|
||
| 2942 | [Find Words Containing Character](/solution/2900-2999/2942.Find%20Words%20Containing%20Character/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 118 |
|
||
| 2943 | [Maximize Area of Square Hole in Grid](/solution/2900-2999/2943.Maximize%20Area%20of%20Square%20Hole%20in%20Grid/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 118 |
|
||
| 2944 | [Minimum Number of Coins for Fruits](/solution/2900-2999/2944.Minimum%20Number%20of%20Coins%20for%20Fruits/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Biweekly Contest 118 |
|
||
| 2945 | [Find Maximum Non-decreasing Array Length](/solution/2900-2999/2945.Find%20Maximum%20Non-decreasing%20Array%20Length/README_EN.md) | `Stack`,`Queue`,`Array`,`Binary Search`,`Dynamic Programming`,`Monotonic Queue`,`Monotonic Stack` | Hard | Biweekly Contest 118 |
|
||
| 2946 | [Matrix Similarity After Cyclic Shifts](/solution/2900-2999/2946.Matrix%20Similarity%20After%20Cyclic%20Shifts/README_EN.md) | `Array`,`Math`,`Matrix`,`Simulation` | Easy | Weekly Contest 373 |
|
||
| 2947 | [Count Beautiful Substrings I](/solution/2900-2999/2947.Count%20Beautiful%20Substrings%20I/README_EN.md) | `Hash Table`,`Math`,`String`,`Enumeration`,`Number Theory`,`Prefix Sum` | Medium | Weekly Contest 373 |
|
||
| 2948 | [Make Lexicographically Smallest Array by Swapping Elements](/solution/2900-2999/2948.Make%20Lexicographically%20Smallest%20Array%20by%20Swapping%20Elements/README_EN.md) | `Union Find`,`Array`,`Sorting` | Medium | Weekly Contest 373 |
|
||
| 2949 | [Count Beautiful Substrings II](/solution/2900-2999/2949.Count%20Beautiful%20Substrings%20II/README_EN.md) | `Hash Table`,`Math`,`String`,`Number Theory`,`Prefix Sum` | Hard | Weekly Contest 373 |
|
||
| 2950 | [Number of Divisible Substrings](/solution/2900-2999/2950.Number%20of%20Divisible%20Substrings/README_EN.md) | `Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | 🔒 |
|
||
| 2951 | [Find the Peaks](/solution/2900-2999/2951.Find%20the%20Peaks/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 374 |
|
||
| 2952 | [Minimum Number of Coins to be Added](/solution/2900-2999/2952.Minimum%20Number%20of%20Coins%20to%20be%20Added/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 374 |
|
||
| 2953 | [Count Complete Substrings](/solution/2900-2999/2953.Count%20Complete%20Substrings/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | Weekly Contest 374 |
|
||
| 2954 | [Count the Number of Infection Sequences](/solution/2900-2999/2954.Count%20the%20Number%20of%20Infection%20Sequences/README_EN.md) | `Array`,`Math`,`Combinatorics` | Hard | Weekly Contest 374 |
|
||
| 2955 | [Number of Same-End Substrings](/solution/2900-2999/2955.Number%20of%20Same-End%20Substrings/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | 🔒 |
|
||
| 2956 | [Find Common Elements Between Two Arrays](/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 119 |
|
||
| 2957 | [Remove Adjacent Almost-Equal Characters](/solution/2900-2999/2957.Remove%20Adjacent%20Almost-Equal%20Characters/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 119 |
|
||
| 2958 | [Length of Longest Subarray With at Most K Frequency](/solution/2900-2999/2958.Length%20of%20Longest%20Subarray%20With%20at%20Most%20K%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Biweekly Contest 119 |
|
||
| 2959 | [Number of Possible Sets of Closing Branches](/solution/2900-2999/2959.Number%20of%20Possible%20Sets%20of%20Closing%20Branches/README_EN.md) | `Bit Manipulation`,`Graph`,`Enumeration`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Biweekly Contest 119 |
|
||
| 2960 | [Count Tested Devices After Test Operations](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README_EN.md) | `Array`,`Counting`,`Simulation` | Easy | Weekly Contest 375 |
|
||
| 2961 | [Double Modular Exponentiation](/solution/2900-2999/2961.Double%20Modular%20Exponentiation/README_EN.md) | `Array`,`Math`,`Simulation` | Medium | Weekly Contest 375 |
|
||
| 2962 | [Count Subarrays Where Max Element Appears at Least K Times](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 375 |
|
||
| 2963 | [Count the Number of Good Partitions](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README_EN.md) | `Array`,`Hash Table`,`Math`,`Combinatorics` | Hard | Weekly Contest 375 |
|
||
| 2964 | [Number of Divisible Triplet Sums](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README_EN.md) | `Array`,`Hash Table` | Medium | 🔒 |
|
||
| 2965 | [Find Missing and Repeated Values](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README_EN.md) | `Array`,`Hash Table`,`Math`,`Matrix` | Easy | Weekly Contest 376 |
|
||
| 2966 | [Divide Array Into Arrays With Max Difference](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 376 |
|
||
| 2967 | [Minimum Cost to Make Array Equalindromic](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Sorting` | Medium | Weekly Contest 376 |
|
||
| 2968 | [Apply Operations to Maximize Frequency Score](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Hard | Weekly Contest 376 |
|
||
| 2969 | [Minimum Number of Coins for Fruits II](/solution/2900-2999/2969.Minimum%20Number%20of%20Coins%20for%20Fruits%20II/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | 🔒 |
|
||
| 2970 | [Count the Number of Incremovable Subarrays I](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Enumeration` | Easy | Biweekly Contest 120 |
|
||
| 2971 | [Find Polygon With the Largest Perimeter](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 120 |
|
||
| 2972 | [Count the Number of Incremovable Subarrays II](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README_EN.md) | `Array`,`Two Pointers`,`Binary Search` | Hard | Biweekly Contest 120 |
|
||
| 2973 | [Find Number of Coins to Place in Tree Nodes](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Sorting`,`Heap (Priority Queue)` | Hard | Biweekly Contest 120 |
|
||
| 2974 | [Minimum Number Game](/solution/2900-2999/2974.Minimum%20Number%20Game/README_EN.md) | `Array`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 377 |
|
||
| 2975 | [Maximum Square Area by Removing Fences From a Field](/solution/2900-2999/2975.Maximum%20Square%20Area%20by%20Removing%20Fences%20From%20a%20Field/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Medium | Weekly Contest 377 |
|
||
| 2976 | [Minimum Cost to Convert String I](/solution/2900-2999/2976.Minimum%20Cost%20to%20Convert%20String%20I/README_EN.md) | `Graph`,`Array`,`String`,`Shortest Path` | Medium | Weekly Contest 377 |
|
||
| 2977 | [Minimum Cost to Convert String II](/solution/2900-2999/2977.Minimum%20Cost%20to%20Convert%20String%20II/README_EN.md) | `Graph`,`Trie`,`Array`,`String`,`Dynamic Programming`,`Shortest Path` | Hard | Weekly Contest 377 |
|
||
| 2978 | [Symmetric Coordinates](/solution/2900-2999/2978.Symmetric%20Coordinates/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2979 | [Most Expensive Item That Can Not Be Bought](/solution/2900-2999/2979.Most%20Expensive%20Item%20That%20Can%20Not%20Be%20Bought/README_EN.md) | `Math`,`Dynamic Programming`,`Number Theory` | Medium | 🔒 |
|
||
| 2980 | [Check if Bitwise OR Has Trailing Zeros](/solution/2900-2999/2980.Check%20if%20Bitwise%20OR%20Has%20Trailing%20Zeros/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 378 |
|
||
| 2981 | [Find Longest Special Substring That Occurs Thrice I](/solution/2900-2999/2981.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20I/README_EN.md) | `Hash Table`,`String`,`Binary Search`,`Counting`,`Sliding Window` | Medium | Weekly Contest 378 |
|
||
| 2982 | [Find Longest Special Substring That Occurs Thrice II](/solution/2900-2999/2982.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20II/README_EN.md) | `Hash Table`,`String`,`Binary Search`,`Counting`,`Sliding Window` | Medium | Weekly Contest 378 |
|
||
| 2983 | [Palindrome Rearrangement Queries](/solution/2900-2999/2983.Palindrome%20Rearrangement%20Queries/README_EN.md) | `Hash Table`,`String`,`Prefix Sum` | Hard | Weekly Contest 378 |
|
||
| 2984 | [Find Peak Calling Hours for Each City](/solution/2900-2999/2984.Find%20Peak%20Calling%20Hours%20for%20Each%20City/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2985 | [Calculate Compressed Mean](/solution/2900-2999/2985.Calculate%20Compressed%20Mean/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2986 | [Find Third Transaction](/solution/2900-2999/2986.Find%20Third%20Transaction/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2987 | [Find Expensive Cities](/solution/2900-2999/2987.Find%20Expensive%20Cities/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2988 | [Manager of the Largest Department](/solution/2900-2999/2988.Manager%20of%20the%20Largest%20Department/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2989 | [Class Performance](/solution/2900-2999/2989.Class%20Performance/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2990 | [Loan Types](/solution/2900-2999/2990.Loan%20Types/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 2991 | [Top Three Wineries](/solution/2900-2999/2991.Top%20Three%20Wineries/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2992 | [Number of Self-Divisible Permutations](/solution/2900-2999/2992.Number%20of%20Self-Divisible%20Permutations/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | 🔒 |
|
||
| 2993 | [Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 2994 | [Friday Purchases II](/solution/2900-2999/2994.Friday%20Purchases%20II/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2995 | [Viewers Turned Streamers](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 2996 | [Smallest Missing Integer Greater Than Sequential Prefix Sum](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 121 |
|
||
| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Biweekly Contest 121 |
|
||
| 2998 | [Minimum Number of Operations to Make X and Y Equal](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md) | `Breadth-First Search`,`Memoization`,`Dynamic Programming` | Medium | Biweekly Contest 121 |
|
||
| 2999 | [Count the Number of Powerful Integers](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 121 |
|
||
| 3000 | [Maximum Area of Longest Diagonal Rectangle](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md) | `Array` | Easy | Weekly Contest 379 |
|
||
| 3001 | [Minimum Moves to Capture The Queen](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md) | `Math`,`Enumeration` | Medium | Weekly Contest 379 |
|
||
| 3002 | [Maximum Size of a Set After Removals](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Weekly Contest 379 |
|
||
| 3003 | [Maximize the Number of Partitions After Operations](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md) | `Bit Manipulation`,`String`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 379 |
|
||
| 3004 | [Maximum Subtree of the Same Color](/solution/3000-3099/3004.Maximum%20Subtree%20of%20the%20Same%20Color/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 3005 | [Count Elements With Maximum Frequency](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 380 |
|
||
| 3006 | [Find Beautiful Indices in the Given Array I](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README_EN.md) | `Two Pointers`,`String`,`Binary Search`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 380 |
|
||
| 3007 | [Maximum Number That Sum of the Prices Is Less Than or Equal to K](/solution/3000-3099/3007.Maximum%20Number%20That%20Sum%20of%20the%20Prices%20Is%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) | `Bit Manipulation`,`Binary Search`,`Dynamic Programming` | Medium | Weekly Contest 380 |
|
||
| 3008 | [Find Beautiful Indices in the Given Array II](/solution/3000-3099/3008.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II/README_EN.md) | `Two Pointers`,`String`,`Binary Search`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 380 |
|
||
| 3009 | [Maximum Number of Intersections on the Chart](/solution/3000-3099/3009.Maximum%20Number%20of%20Intersections%20on%20the%20Chart/README_EN.md) | `Binary Indexed Tree`,`Geometry`,`Array`,`Math` | Hard | 🔒 |
|
||
| 3010 | [Divide an Array Into Subarrays With Minimum Cost I](/solution/3000-3099/3010.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20I/README_EN.md) | `Array`,`Enumeration`,`Sorting` | Easy | Biweekly Contest 122 |
|
||
| 3011 | [Find if Array Can Be Sorted](/solution/3000-3099/3011.Find%20if%20Array%20Can%20Be%20Sorted/README_EN.md) | `Bit Manipulation`,`Array`,`Sorting` | Medium | Biweekly Contest 122 |
|
||
| 3012 | [Minimize Length of Array Using Operations](/solution/3000-3099/3012.Minimize%20Length%20of%20Array%20Using%20Operations/README_EN.md) | `Greedy`,`Array`,`Math`,`Number Theory` | Medium | Biweekly Contest 122 |
|
||
| 3013 | [Divide an Array Into Subarrays With Minimum Cost II](/solution/3000-3099/3013.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20II/README_EN.md) | `Array`,`Hash Table`,`Sliding Window`,`Heap (Priority Queue)` | Hard | Biweekly Contest 122 |
|
||
| 3014 | [Minimum Number of Pushes to Type Word I](/solution/3000-3099/3014.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20I/README_EN.md) | `Greedy`,`Math`,`String` | Easy | Weekly Contest 381 |
|
||
| 3015 | [Count the Number of Houses at a Certain Distance I](/solution/3000-3099/3015.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20I/README_EN.md) | `Breadth-First Search`,`Graph`,`Prefix Sum` | Medium | Weekly Contest 381 |
|
||
| 3016 | [Minimum Number of Pushes to Type Word II](/solution/3000-3099/3016.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20II/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 381 |
|
||
| 3017 | [Count the Number of Houses at a Certain Distance II](/solution/3000-3099/3017.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20II/README_EN.md) | `Graph`,`Prefix Sum` | Hard | Weekly Contest 381 |
|
||
| 3018 | [Maximum Number of Removal Queries That Can Be Processed I](/solution/3000-3099/3018.Maximum%20Number%20of%20Removal%20Queries%20That%20Can%20Be%20Processed%20I/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 |
|
||
| 3019 | [Number of Changing Keys](/solution/3000-3099/3019.Number%20of%20Changing%20Keys/README_EN.md) | `String` | Easy | Weekly Contest 382 |
|
||
| 3020 | [Find the Maximum Number of Elements in Subset](/solution/3000-3099/3020.Find%20the%20Maximum%20Number%20of%20Elements%20in%20Subset/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Medium | Weekly Contest 382 |
|
||
| 3021 | [Alice and Bob Playing Flower Game](/solution/3000-3099/3021.Alice%20and%20Bob%20Playing%20Flower%20Game/README_EN.md) | `Math` | Medium | Weekly Contest 382 |
|
||
| 3022 | [Minimize OR of Remaining Elements Using Operations](/solution/3000-3099/3022.Minimize%20OR%20of%20Remaining%20Elements%20Using%20Operations/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Hard | Weekly Contest 382 |
|
||
| 3023 | [Find Pattern in Infinite Stream I](/solution/3000-3099/3023.Find%20Pattern%20in%20Infinite%20Stream%20I/README_EN.md) | `Array`,`String Matching`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Medium | 🔒 |
|
||
| 3024 | [Type of Triangle](/solution/3000-3099/3024.Type%20of%20Triangle/README_EN.md) | `Array`,`Math`,`Sorting` | Easy | Biweekly Contest 123 |
|
||
| 3025 | [Find the Number of Ways to Place People I](/solution/3000-3099/3025.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20I/README_EN.md) | `Geometry`,`Array`,`Math`,`Enumeration`,`Sorting` | Medium | Biweekly Contest 123 |
|
||
| 3026 | [Maximum Good Subarray Sum](/solution/3000-3099/3026.Maximum%20Good%20Subarray%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Biweekly Contest 123 |
|
||
| 3027 | [Find the Number of Ways to Place People II](/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/README_EN.md) | `Geometry`,`Array`,`Math`,`Enumeration`,`Sorting` | Hard | Biweekly Contest 123 |
|
||
| 3028 | [Ant on the Boundary](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README_EN.md) | `Array`,`Prefix Sum`,`Simulation` | Easy | Weekly Contest 383 |
|
||
| 3029 | [Minimum Time to Revert Word to Initial State I](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 383 |
|
||
| 3030 | [Find the Grid of Region Average](/solution/3000-3099/3030.Find%20the%20Grid%20of%20Region%20Average/README_EN.md) | `Array`,`Matrix` | Medium | Weekly Contest 383 |
|
||
| 3031 | [Minimum Time to Revert Word to Initial State II](/solution/3000-3099/3031.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20II/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 383 |
|
||
| 3032 | [Count Numbers With Unique Digits II](/solution/3000-3099/3032.Count%20Numbers%20With%20Unique%20Digits%20II/README_EN.md) | `Hash Table`,`Math`,`Dynamic Programming` | Easy | 🔒 |
|
||
| 3033 | [Modify the Matrix](/solution/3000-3099/3033.Modify%20the%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 384 |
|
||
| 3034 | [Number of Subarrays That Match a Pattern I](/solution/3000-3099/3034.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20I/README_EN.md) | `Array`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 384 |
|
||
| 3035 | [Maximum Palindromes After Operations](/solution/3000-3099/3035.Maximum%20Palindromes%20After%20Operations/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 384 |
|
||
| 3036 | [Number of Subarrays That Match a Pattern II](/solution/3000-3099/3036.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20II/README_EN.md) | `Array`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 384 |
|
||
| 3037 | [Find Pattern in Infinite Stream II](/solution/3000-3099/3037.Find%20Pattern%20in%20Infinite%20Stream%20II/README_EN.md) | `Array`,`String Matching`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Hard | 🔒 |
|
||
| 3038 | [Maximum Number of Operations With the Same Score I](/solution/3000-3099/3038.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20I/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 124 |
|
||
| 3039 | [Apply Operations to Make String Empty](/solution/3000-3099/3039.Apply%20Operations%20to%20Make%20String%20Empty/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Biweekly Contest 124 |
|
||
| 3040 | [Maximum Number of Operations With the Same Score II](/solution/3000-3099/3040.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20II/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Medium | Biweekly Contest 124 |
|
||
| 3041 | [Maximize Consecutive Elements in an Array After Modification](/solution/3000-3099/3041.Maximize%20Consecutive%20Elements%20in%20an%20Array%20After%20Modification/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 124 |
|
||
| 3042 | [Count Prefix and Suffix Pairs I](/solution/3000-3099/3042.Count%20Prefix%20and%20Suffix%20Pairs%20I/README_EN.md) | `Trie`,`Array`,`String`,`String Matching`,`Hash Function`,`Rolling Hash` | Easy | Weekly Contest 385 |
|
||
| 3043 | [Find the Length of the Longest Common Prefix](/solution/3000-3099/3043.Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 385 |
|
||
| 3044 | [Most Frequent Prime](/solution/3000-3099/3044.Most%20Frequent%20Prime/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Enumeration`,`Matrix`,`Number Theory` | Medium | Weekly Contest 385 |
|
||
| 3045 | [Count Prefix and Suffix Pairs II](/solution/3000-3099/3045.Count%20Prefix%20and%20Suffix%20Pairs%20II/README_EN.md) | `Trie`,`Array`,`String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 385 |
|
||
| 3046 | [Split the Array](/solution/3000-3099/3046.Split%20the%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 386 |
|
||
| 3047 | [Find the Largest Area of Square Inside Two Rectangles](/solution/3000-3099/3047.Find%20the%20Largest%20Area%20of%20Square%20Inside%20Two%20Rectangles/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | Weekly Contest 386 |
|
||
| 3048 | [Earliest Second to Mark Indices I](/solution/3000-3099/3048.Earliest%20Second%20to%20Mark%20Indices%20I/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 386 |
|
||
| 3049 | [Earliest Second to Mark Indices II](/solution/3000-3099/3049.Earliest%20Second%20to%20Mark%20Indices%20II/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Heap (Priority Queue)` | Hard | Weekly Contest 386 |
|
||
| 3050 | [Pizza Toppings Cost Analysis](/solution/3000-3099/3050.Pizza%20Toppings%20Cost%20Analysis/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3051 | [Find Candidates for Data Scientist Position](/solution/3000-3099/3051.Find%20Candidates%20for%20Data%20Scientist%20Position/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 3052 | [Maximize Items](/solution/3000-3099/3052.Maximize%20Items/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3053 | [Classifying Triangles by Lengths](/solution/3000-3099/3053.Classifying%20Triangles%20by%20Lengths/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 3054 | [Binary Tree Nodes](/solution/3000-3099/3054.Binary%20Tree%20Nodes/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3055 | [Top Percentile Fraud](/solution/3000-3099/3055.Top%20Percentile%20Fraud/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3056 | [Snaps Analysis](/solution/3000-3099/3056.Snaps%20Analysis/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3057 | [Employees Project Allocation](/solution/3000-3099/3057.Employees%20Project%20Allocation/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3058 | [Friends With No Mutual Friends](/solution/3000-3099/3058.Friends%20With%20No%20Mutual%20Friends/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3059 | [Find All Unique Email Domains](/solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 3060 | [User Activities within Time Bounds](/solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3061 | [Calculate Trapping Rain Water](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3062 | [Winner of the Linked List Game](/solution/3000-3099/3062.Winner%20of%20the%20Linked%20List%20Game/README_EN.md) | `Linked List` | Easy | 🔒 |
|
||
| 3063 | [Linked List Frequency](/solution/3000-3099/3063.Linked%20List%20Frequency/README_EN.md) | `Hash Table`,`Linked List`,`Counting` | Easy | 🔒 |
|
||
| 3064 | [Guess the Number Using Bitwise Questions I](/solution/3000-3099/3064.Guess%20the%20Number%20Using%20Bitwise%20Questions%20I/README_EN.md) | `Bit Manipulation`,`Interactive` | Medium | 🔒 |
|
||
| 3065 | [Minimum Operations to Exceed Threshold Value I](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README_EN.md) | `Array` | Easy | Biweekly Contest 125 |
|
||
| 3066 | [Minimum Operations to Exceed Threshold Value II](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 125 |
|
||
| 3067 | [Count Pairs of Connectable Servers in a Weighted Tree Network](/solution/3000-3099/3067.Count%20Pairs%20of%20Connectable%20Servers%20in%20a%20Weighted%20Tree%20Network/README_EN.md) | `Tree`,`Depth-First Search`,`Array` | Medium | Biweekly Contest 125 |
|
||
| 3068 | [Find the Maximum Sum of Node Values](/solution/3000-3099/3068.Find%20the%20Maximum%20Sum%20of%20Node%20Values/README_EN.md) | `Greedy`,`Bit Manipulation`,`Tree`,`Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 125 |
|
||
| 3069 | [Distribute Elements Into Two Arrays I](/solution/3000-3099/3069.Distribute%20Elements%20Into%20Two%20Arrays%20I/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 387 |
|
||
| 3070 | [Count Submatrices with Top-Left Element and Sum Less Than k](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 387 |
|
||
| 3071 | [Minimum Operations to Write the Letter Y on a Grid](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Matrix` | Medium | Weekly Contest 387 |
|
||
| 3072 | [Distribute Elements Into Two Arrays II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Simulation` | Hard | Weekly Contest 387 |
|
||
| 3073 | [Maximum Increasing Triplet Value](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README_EN.md) | `Array`,`Ordered Set` | Medium | 🔒 |
|
||
| 3074 | [Apple Redistribution into Boxes](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 388 |
|
||
| 3075 | [Maximize Happiness of Selected Children](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 388 |
|
||
| 3076 | [Shortest Uncommon Substring in an Array](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 388 |
|
||
| 3077 | [Maximum Strength of K Disjoint Subarrays](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 388 |
|
||
| 3078 | [Match Alphanumerical Pattern in Matrix I](/solution/3000-3099/3078.Match%20Alphanumerical%20Pattern%20in%20Matrix%20I/README_EN.md) | `Array`,`Hash Table`,`String`,`Matrix` | Medium | 🔒 |
|
||
| 3079 | [Find the Sum of Encrypted Integers](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 126 |
|
||
| 3080 | [Mark Elements on Array by Performing Queries](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 126 |
|
||
| 3081 | [Replace Question Marks in String to Minimize Its Value](/solution/3000-3099/3081.Replace%20Question%20Marks%20in%20String%20to%20Minimize%20Its%20Value/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 126 |
|
||
| 3082 | [Find the Sum of the Power of All Subsequences](/solution/3000-3099/3082.Find%20the%20Sum%20of%20the%20Power%20of%20All%20Subsequences/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 126 |
|
||
| 3083 | [Existence of a Substring in a String and Its Reverse](/solution/3000-3099/3083.Existence%20of%20a%20Substring%20in%20a%20String%20and%20Its%20Reverse/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 389 |
|
||
| 3084 | [Count Substrings Starting and Ending with Given Character](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README_EN.md) | `Math`,`String`,`Counting` | Medium | Weekly Contest 389 |
|
||
| 3085 | [Minimum Deletions to Make String K-Special](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 389 |
|
||
| 3086 | [Minimum Moves to Pick K Ones](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 389 |
|
||
| 3087 | [Find Trending Hashtags](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3088 | [Make String Anti-palindrome](/solution/3000-3099/3088.Make%20String%20Anti-palindrome/README_EN.md) | `Greedy`,`String`,`Counting Sort`,`Sorting` | Hard | 🔒 |
|
||
| 3089 | [Find Bursty Behavior](/solution/3000-3099/3089.Find%20Bursty%20Behavior/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3090 | [Maximum Length Substring With Two Occurrences](/solution/3000-3099/3090.Maximum%20Length%20Substring%20With%20Two%20Occurrences/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Easy | Weekly Contest 390 |
|
||
| 3091 | [Apply Operations to Make Sum of Array Greater Than or Equal to k](/solution/3000-3099/3091.Apply%20Operations%20to%20Make%20Sum%20of%20Array%20Greater%20Than%20or%20Equal%20to%20k/README_EN.md) | `Greedy`,`Math`,`Enumeration` | Medium | Weekly Contest 390 |
|
||
| 3092 | [Most Frequent IDs](/solution/3000-3099/3092.Most%20Frequent%20IDs/README_EN.md) | `Array`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 390 |
|
||
| 3093 | [Longest Common Suffix Queries](/solution/3000-3099/3093.Longest%20Common%20Suffix%20Queries/README_EN.md) | `Trie`,`Array`,`String` | Hard | Weekly Contest 390 |
|
||
| 3094 | [Guess the Number Using Bitwise Questions II](/solution/3000-3099/3094.Guess%20the%20Number%20Using%20Bitwise%20Questions%20II/README_EN.md) | `Bit Manipulation`,`Interactive` | Medium | 🔒 |
|
||
| 3095 | [Shortest Subarray With OR at Least K I](/solution/3000-3099/3095.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20I/README_EN.md) | `Bit Manipulation`,`Array`,`Sliding Window` | Easy | Biweekly Contest 127 |
|
||
| 3096 | [Minimum Levels to Gain More Points](/solution/3000-3099/3096.Minimum%20Levels%20to%20Gain%20More%20Points/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 127 |
|
||
| 3097 | [Shortest Subarray With OR at Least K II](/solution/3000-3099/3097.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Sliding Window` | Medium | Biweekly Contest 127 |
|
||
| 3098 | [Find the Sum of Subsequence Powers](/solution/3000-3099/3098.Find%20the%20Sum%20of%20Subsequence%20Powers/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 127 |
|
||
| 3099 | [Harshad Number](/solution/3000-3099/3099.Harshad%20Number/README_EN.md) | `Math` | Easy | Weekly Contest 391 |
|
||
| 3100 | [Water Bottles II](/solution/3100-3199/3100.Water%20Bottles%20II/README_EN.md) | `Math`,`Simulation` | Medium | Weekly Contest 391 |
|
||
| 3101 | [Count Alternating Subarrays](/solution/3100-3199/3101.Count%20Alternating%20Subarrays/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 391 |
|
||
| 3102 | [Minimize Manhattan Distances](/solution/3100-3199/3102.Minimize%20Manhattan%20Distances/README_EN.md) | `Geometry`,`Array`,`Math`,`Ordered Set`,`Sorting` | Hard | Weekly Contest 391 |
|
||
| 3103 | [Find Trending Hashtags II](/solution/3100-3199/3103.Find%20Trending%20Hashtags%20II/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3104 | [Find Longest Self-Contained Substring](/solution/3100-3199/3104.Find%20Longest%20Self-Contained%20Substring/README_EN.md) | `Hash Table`,`String`,`Binary Search`,`Prefix Sum` | Hard | 🔒 |
|
||
| 3105 | [Longest Strictly Increasing or Strictly Decreasing Subarray](/solution/3100-3199/3105.Longest%20Strictly%20Increasing%20or%20Strictly%20Decreasing%20Subarray/README_EN.md) | `Array` | Easy | Weekly Contest 392 |
|
||
| 3106 | [Lexicographically Smallest String After Operations With Constraint](/solution/3100-3199/3106.Lexicographically%20Smallest%20String%20After%20Operations%20With%20Constraint/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 392 |
|
||
| 3107 | [Minimum Operations to Make Median of Array Equal to K](/solution/3100-3199/3107.Minimum%20Operations%20to%20Make%20Median%20of%20Array%20Equal%20to%20K/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 392 |
|
||
| 3108 | [Minimum Cost Walk in Weighted Graph](/solution/3100-3199/3108.Minimum%20Cost%20Walk%20in%20Weighted%20Graph/README_EN.md) | `Bit Manipulation`,`Union Find`,`Graph`,`Array` | Hard | Weekly Contest 392 |
|
||
| 3109 | [Find the Index of Permutation](/solution/3100-3199/3109.Find%20the%20Index%20of%20Permutation/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Medium | 🔒 |
|
||
| 3110 | [Score of a String](/solution/3100-3199/3110.Score%20of%20a%20String/README_EN.md) | `String` | Easy | Biweekly Contest 128 |
|
||
| 3111 | [Minimum Rectangles to Cover Points](/solution/3100-3199/3111.Minimum%20Rectangles%20to%20Cover%20Points/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 128 |
|
||
| 3112 | [Minimum Time to Visit Disappearing Nodes](/solution/3100-3199/3112.Minimum%20Time%20to%20Visit%20Disappearing%20Nodes/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Biweekly Contest 128 |
|
||
| 3113 | [Find the Number of Subarrays Where Boundary Elements Are Maximum](/solution/3100-3199/3113.Find%20the%20Number%20of%20Subarrays%20Where%20Boundary%20Elements%20Are%20Maximum/README_EN.md) | `Stack`,`Array`,`Binary Search`,`Monotonic Stack` | Hard | Biweekly Contest 128 |
|
||
| 3114 | [Latest Time You Can Obtain After Replacing Characters](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README_EN.md) | `String`,`Enumeration` | Easy | Weekly Contest 393 |
|
||
| 3115 | [Maximum Prime Difference](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 393 |
|
||
| 3116 | [Kth Smallest Amount With Single Denomination Combination](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Binary Search`,`Combinatorics`,`Number Theory` | Hard | Weekly Contest 393 |
|
||
| 3117 | [Minimum Sum of Values by Dividing Array](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README_EN.md) | `Bit Manipulation`,`Segment Tree`,`Queue`,`Array`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 393 |
|
||
| 3118 | [Friday Purchase III](/solution/3100-3199/3118.Friday%20Purchase%20III/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3119 | [Maximum Number of Potholes That Can Be Fixed](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README_EN.md) | `Greedy`,`String`,`Sorting` | Medium | 🔒 |
|
||
| 3120 | [Count the Number of Special Characters I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 394 |
|
||
| 3121 | [Count the Number of Special Characters II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README_EN.md) | `Hash Table`,`String` | Medium | Weekly Contest 394 |
|
||
| 3122 | [Minimum Number of Operations to Satisfy Conditions](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 394 |
|
||
| 3123 | [Find Edges in Shortest Paths](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 394 |
|
||
| 3124 | [Find Longest Calls](/solution/3100-3199/3124.Find%20Longest%20Calls/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3125 | [Maximum Number That Makes Result of Bitwise AND Zero](/solution/3100-3199/3125.Maximum%20Number%20That%20Makes%20Result%20of%20Bitwise%20AND%20Zero/README_EN.md) | `Greedy`,`String`,`Sorting` | Medium | 🔒 |
|
||
| 3126 | [Server Utilization Time](/solution/3100-3199/3126.Server%20Utilization%20Time/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3127 | [Make a Square with the Same Color](/solution/3100-3199/3127.Make%20a%20Square%20with%20the%20Same%20Color/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Easy | Biweekly Contest 129 |
|
||
| 3128 | [Right Triangles](/solution/3100-3199/3128.Right%20Triangles/README_EN.md) | `Array`,`Hash Table`,`Math`,`Combinatorics`,`Counting` | Medium | Biweekly Contest 129 |
|
||
| 3129 | [Find All Possible Stable Binary Arrays I](/solution/3100-3199/3129.Find%20All%20Possible%20Stable%20Binary%20Arrays%20I/README_EN.md) | `Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 129 |
|
||
| 3130 | [Find All Possible Stable Binary Arrays II](/solution/3100-3199/3130.Find%20All%20Possible%20Stable%20Binary%20Arrays%20II/README_EN.md) | `Dynamic Programming`,`Prefix Sum` | Hard | Biweekly Contest 129 |
|
||
| 3131 | [Find the Integer Added to Array I](/solution/3100-3199/3131.Find%20the%20Integer%20Added%20to%20Array%20I/README_EN.md) | `Array` | Easy | Weekly Contest 395 |
|
||
| 3132 | [Find the Integer Added to Array II](/solution/3100-3199/3132.Find%20the%20Integer%20Added%20to%20Array%20II/README_EN.md) | `Array`,`Two Pointers`,`Enumeration`,`Sorting` | Medium | Weekly Contest 395 |
|
||
| 3133 | [Minimum Array End](/solution/3100-3199/3133.Minimum%20Array%20End/README_EN.md) | `Bit Manipulation` | Medium | Weekly Contest 395 |
|
||
| 3134 | [Find the Median of the Uniqueness Array](/solution/3100-3199/3134.Find%20the%20Median%20of%20the%20Uniqueness%20Array/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sliding Window` | Hard | Weekly Contest 395 |
|
||
| 3135 | [Equalize Strings by Adding or Removing Characters at Ends](/solution/3100-3199/3135.Equalize%20Strings%20by%20Adding%20or%20Removing%20Characters%20at%20Ends/README_EN.md) | `String`,`Binary Search`,`Dynamic Programming`,`Sliding Window`,`Hash Function` | Medium | 🔒 |
|
||
| 3136 | [Valid Word](/solution/3100-3199/3136.Valid%20Word/README_EN.md) | `String` | Easy | Weekly Contest 396 |
|
||
| 3137 | [Minimum Number of Operations to Make Word K-Periodic](/solution/3100-3199/3137.Minimum%20Number%20of%20Operations%20to%20Make%20Word%20K-Periodic/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 396 |
|
||
| 3138 | [Minimum Length of Anagram Concatenation](/solution/3100-3199/3138.Minimum%20Length%20of%20Anagram%20Concatenation/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 396 |
|
||
| 3139 | [Minimum Cost to Equalize Array](/solution/3100-3199/3139.Minimum%20Cost%20to%20Equalize%20Array/README_EN.md) | `Greedy`,`Array`,`Enumeration` | Hard | Weekly Contest 396 |
|
||
| 3140 | [Consecutive Available Seats II](/solution/3100-3199/3140.Consecutive%20Available%20Seats%20II/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3141 | [Maximum Hamming Distances](/solution/3100-3199/3141.Maximum%20Hamming%20Distances/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array` | Hard | 🔒 |
|
||
| 3142 | [Check if Grid Satisfies Conditions](/solution/3100-3199/3142.Check%20if%20Grid%20Satisfies%20Conditions/README_EN.md) | `Array`,`Matrix` | Easy | Biweekly Contest 130 |
|
||
| 3143 | [Maximum Points Inside the Square](/solution/3100-3199/3143.Maximum%20Points%20Inside%20the%20Square/README_EN.md) | `Array`,`Hash Table`,`String`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 130 |
|
||
| 3144 | [Minimum Substring Partition of Equal Character Frequency](/solution/3100-3199/3144.Minimum%20Substring%20Partition%20of%20Equal%20Character%20Frequency/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming`,`Counting` | Medium | Biweekly Contest 130 |
|
||
| 3145 | [Find Products of Elements of Big Array](/solution/3100-3199/3145.Find%20Products%20of%20Elements%20of%20Big%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Binary Search` | Hard | Biweekly Contest 130 |
|
||
| 3146 | [Permutation Difference between Two Strings](/solution/3100-3199/3146.Permutation%20Difference%20between%20Two%20Strings/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 397 |
|
||
| 3147 | [Taking Maximum Energy From the Mystic Dungeon](/solution/3100-3199/3147.Taking%20Maximum%20Energy%20From%20the%20Mystic%20Dungeon/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 397 |
|
||
| 3148 | [Maximum Difference Score in a Grid](/solution/3100-3199/3148.Maximum%20Difference%20Score%20in%20a%20Grid/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 397 |
|
||
| 3149 | [Find the Minimum Cost Array Permutation](/solution/3100-3199/3149.Find%20the%20Minimum%20Cost%20Array%20Permutation/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 397 |
|
||
| 3150 | [Invalid Tweets II](/solution/3100-3199/3150.Invalid%20Tweets%20II/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 3151 | [Special Array I](/solution/3100-3199/3151.Special%20Array%20I/README_EN.md) | `Array` | Easy | Weekly Contest 398 |
|
||
| 3152 | [Special Array II](/solution/3100-3199/3152.Special%20Array%20II/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum` | Medium | Weekly Contest 398 |
|
||
| 3153 | [Sum of Digit Differences of All Pairs](/solution/3100-3199/3153.Sum%20of%20Digit%20Differences%20of%20All%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Medium | Weekly Contest 398 |
|
||
| 3154 | [Find Number of Ways to Reach the K-th Stair](/solution/3100-3199/3154.Find%20Number%20of%20Ways%20to%20Reach%20the%20K-th%20Stair/README_EN.md) | `Bit Manipulation`,`Memoization`,`Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 398 |
|
||
| 3155 | [Maximum Number of Upgradable Servers](/solution/3100-3199/3155.Maximum%20Number%20of%20Upgradable%20Servers/README_EN.md) | `Array`,`Math`,`Binary Search` | Medium | 🔒 |
|
||
| 3156 | [Employee Task Duration and Concurrent Tasks](/solution/3100-3199/3156.Employee%20Task%20Duration%20and%20Concurrent%20Tasks/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3157 | [Find the Level of Tree with Minimum Sum](/solution/3100-3199/3157.Find%20the%20Level%20of%20Tree%20with%20Minimum%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 |
|
||
| 3158 | [Find the XOR of Numbers Which Appear Twice](/solution/3100-3199/3158.Find%20the%20XOR%20of%20Numbers%20Which%20Appear%20Twice/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Easy | Biweekly Contest 131 |
|
||
| 3159 | [Find Occurrences of an Element in an Array](/solution/3100-3199/3159.Find%20Occurrences%20of%20an%20Element%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Medium | Biweekly Contest 131 |
|
||
| 3160 | [Find the Number of Distinct Colors Among the Balls](/solution/3100-3199/3160.Find%20the%20Number%20of%20Distinct%20Colors%20Among%20the%20Balls/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Biweekly Contest 131 |
|
||
| 3161 | [Block Placement Queries](/solution/3100-3199/3161.Block%20Placement%20Queries/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search` | Hard | Biweekly Contest 131 |
|
||
| 3162 | [Find the Number of Good Pairs I](/solution/3100-3199/3162.Find%20the%20Number%20of%20Good%20Pairs%20I/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 399 |
|
||
| 3163 | [String Compression III](/solution/3100-3199/3163.String%20Compression%20III/README_EN.md) | `String` | Medium | Weekly Contest 399 |
|
||
| 3164 | [Find the Number of Good Pairs II](/solution/3100-3199/3164.Find%20the%20Number%20of%20Good%20Pairs%20II/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 399 |
|
||
| 3165 | [Maximum Sum of Subsequence With Non-adjacent Elements](/solution/3100-3199/3165.Maximum%20Sum%20of%20Subsequence%20With%20Non-adjacent%20Elements/README_EN.md) | `Segment Tree`,`Array`,`Divide and Conquer`,`Dynamic Programming` | Hard | Weekly Contest 399 |
|
||
| 3166 | [Calculate Parking Fees and Duration](/solution/3100-3199/3166.Calculate%20Parking%20Fees%20and%20Duration/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3167 | [Better Compression of String](/solution/3100-3199/3167.Better%20Compression%20of%20String/README_EN.md) | `Hash Table`,`String`,`Counting`,`Sorting` | Medium | 🔒 |
|
||
| 3168 | [Minimum Number of Chairs in a Waiting Room](/solution/3100-3199/3168.Minimum%20Number%20of%20Chairs%20in%20a%20Waiting%20Room/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 400 |
|
||
| 3169 | [Count Days Without Meetings](/solution/3100-3199/3169.Count%20Days%20Without%20Meetings/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 400 |
|
||
| 3170 | [Lexicographically Minimum String After Removing Stars](/solution/3100-3199/3170.Lexicographically%20Minimum%20String%20After%20Removing%20Stars/README_EN.md) | `Stack`,`Greedy`,`Hash Table`,`String`,`Heap (Priority Queue)` | Medium | Weekly Contest 400 |
|
||
| 3171 | [Find Subarray With Bitwise OR Closest to K](/solution/3100-3199/3171.Find%20Subarray%20With%20Bitwise%20OR%20Closest%20to%20K/README_EN.md) | `Bit Manipulation`,`Segment Tree`,`Array`,`Binary Search` | Hard | Weekly Contest 400 |
|
||
| 3172 | [Second Day Verification](/solution/3100-3199/3172.Second%20Day%20Verification/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 3173 | [Bitwise OR of Adjacent Elements](/solution/3100-3199/3173.Bitwise%20OR%20of%20Adjacent%20Elements/README_EN.md) | `Bit Manipulation`,`Array` | Easy | 🔒 |
|
||
| 3174 | [Clear Digits](/solution/3100-3199/3174.Clear%20Digits/README_EN.md) | `Stack`,`String`,`Simulation` | Easy | Biweekly Contest 132 |
|
||
| 3175 | [Find The First Player to win K Games in a Row](/solution/3100-3199/3175.Find%20The%20First%20Player%20to%20win%20K%20Games%20in%20a%20Row/README_EN.md) | `Array`,`Simulation` | Medium | Biweekly Contest 132 |
|
||
| 3176 | [Find the Maximum Length of a Good Subsequence I](/solution/3100-3199/3176.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20I/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | Biweekly Contest 132 |
|
||
| 3177 | [Find the Maximum Length of a Good Subsequence II](/solution/3100-3199/3177.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20II/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Hard | Biweekly Contest 132 |
|
||
| 3178 | [Find the Child Who Has the Ball After K Seconds](/solution/3100-3199/3178.Find%20the%20Child%20Who%20Has%20the%20Ball%20After%20K%20Seconds/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 401 |
|
||
| 3179 | [Find the N-th Value After K Seconds](/solution/3100-3199/3179.Find%20the%20N-th%20Value%20After%20K%20Seconds/README_EN.md) | `Array`,`Math`,`Combinatorics`,`Prefix Sum`,`Simulation` | Medium | Weekly Contest 401 |
|
||
| 3180 | [Maximum Total Reward Using Operations I](/solution/3100-3199/3180.Maximum%20Total%20Reward%20Using%20Operations%20I/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 401 |
|
||
| 3181 | [Maximum Total Reward Using Operations II](/solution/3100-3199/3181.Maximum%20Total%20Reward%20Using%20Operations%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 401 |
|
||
| 3182 | [Find Top Scoring Students](/solution/3100-3199/3182.Find%20Top%20Scoring%20Students/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3183 | [The Number of Ways to Make the Sum](/solution/3100-3199/3183.The%20Number%20of%20Ways%20to%20Make%20the%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 3184 | [Count Pairs That Form a Complete Day I](/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 402 |
|
||
| 3185 | [Count Pairs That Form a Complete Day II](/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 402 |
|
||
| 3186 | [Maximum Total Damage With Spell Casting](/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Dynamic Programming`,`Counting`,`Sorting` | Medium | Weekly Contest 402 |
|
||
| 3187 | [Peaks in Array](/solution/3100-3199/3187.Peaks%20in%20Array/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array` | Hard | Weekly Contest 402 |
|
||
| 3188 | [Find Top Scoring Students II](/solution/3100-3199/3188.Find%20Top%20Scoring%20Students%20II/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3189 | [Minimum Moves to Get a Peaceful Board](/solution/3100-3199/3189.Minimum%20Moves%20to%20Get%20a%20Peaceful%20Board/README_EN.md) | `Greedy`,`Array`,`Counting Sort`,`Sorting` | Medium | 🔒 |
|
||
| 3190 | [Find Minimum Operations to Make All Elements Divisible by Three](/solution/3100-3199/3190.Find%20Minimum%20Operations%20to%20Make%20All%20Elements%20Divisible%20by%20Three/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 133 |
|
||
| 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](/solution/3100-3199/3191.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20I/README_EN.md) | `Bit Manipulation`,`Queue`,`Array`,`Prefix Sum`,`Sliding Window` | Medium | Biweekly Contest 133 |
|
||
| 3192 | [Minimum Operations to Make Binary Array Elements Equal to One II](/solution/3100-3199/3192.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20II/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Biweekly Contest 133 |
|
||
| 3193 | [Count the Number of Inversions](/solution/3100-3199/3193.Count%20the%20Number%20of%20Inversions/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 133 |
|
||
| 3194 | [Minimum Average of Smallest and Largest Elements](/solution/3100-3199/3194.Minimum%20Average%20of%20Smallest%20and%20Largest%20Elements/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 403 |
|
||
| 3195 | [Find the Minimum Area to Cover All Ones I](/solution/3100-3199/3195.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20I/README_EN.md) | `Array`,`Matrix` | Medium | Weekly Contest 403 |
|
||
| 3196 | [Maximize Total Cost of Alternating Subarrays](/solution/3100-3199/3196.Maximize%20Total%20Cost%20of%20Alternating%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 403 |
|
||
| 3197 | [Find the Minimum Area to Cover All Ones II](/solution/3100-3199/3197.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20II/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Hard | Weekly Contest 403 |
|
||
| 3198 | [Find Cities in Each State](/solution/3100-3199/3198.Find%20Cities%20in%20Each%20State/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 3199 | [Count Triplets with Even XOR Set Bits I](/solution/3100-3199/3199.Count%20Triplets%20with%20Even%20XOR%20Set%20Bits%20I/README_EN.md) | `Bit Manipulation`,`Array` | Easy | 🔒 |
|
||
| 3200 | [Maximum Height of a Triangle](/solution/3200-3299/3200.Maximum%20Height%20of%20a%20Triangle/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 404 |
|
||
| 3201 | [Find the Maximum Length of Valid Subsequence I](/solution/3200-3299/3201.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20I/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 404 |
|
||
| 3202 | [Find the Maximum Length of Valid Subsequence II](/solution/3200-3299/3202.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 404 |
|
||
| 3203 | [Find Minimum Diameter After Merging Two Trees](/solution/3200-3299/3203.Find%20Minimum%20Diameter%20After%20Merging%20Two%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph` | Hard | Weekly Contest 404 |
|
||
| 3204 | [Bitwise User Permissions Analysis](/solution/3200-3299/3204.Bitwise%20User%20Permissions%20Analysis/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3205 | [Maximum Array Hopping Score I](/solution/3200-3299/3205.Maximum%20Array%20Hopping%20Score%20I/README_EN.md) | `Stack`,`Greedy`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 3206 | [Alternating Groups I](/solution/3200-3299/3206.Alternating%20Groups%20I/README_EN.md) | `Array`,`Sliding Window` | Easy | Biweekly Contest 134 |
|
||
| 3207 | [Maximum Points After Enemy Battles](/solution/3200-3299/3207.Maximum%20Points%20After%20Enemy%20Battles/README_EN.md) | `Greedy`,`Array` | Medium | Biweekly Contest 134 |
|
||
| 3208 | [Alternating Groups II](/solution/3200-3299/3208.Alternating%20Groups%20II/README_EN.md) | `Array`,`Sliding Window` | Medium | Biweekly Contest 134 |
|
||
| 3209 | [Number of Subarrays With AND Value of K](/solution/3200-3299/3209.Number%20of%20Subarrays%20With%20AND%20Value%20of%20K/README_EN.md) | `Bit Manipulation`,`Segment Tree`,`Array`,`Binary Search` | Hard | Biweekly Contest 134 |
|
||
| 3210 | [Find the Encrypted String](/solution/3200-3299/3210.Find%20the%20Encrypted%20String/README_EN.md) | `String` | Easy | Weekly Contest 405 |
|
||
| 3211 | [Generate Binary Strings Without Adjacent Zeros](/solution/3200-3299/3211.Generate%20Binary%20Strings%20Without%20Adjacent%20Zeros/README_EN.md) | `Bit Manipulation`,`String`,`Backtracking` | Medium | Weekly Contest 405 |
|
||
| 3212 | [Count Submatrices With Equal Frequency of X and Y](/solution/3200-3299/3212.Count%20Submatrices%20With%20Equal%20Frequency%20of%20X%20and%20Y/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 405 |
|
||
| 3213 | [Construct String with Minimum Cost](/solution/3200-3299/3213.Construct%20String%20with%20Minimum%20Cost/README_EN.md) | `Array`,`String`,`Dynamic Programming`,`Suffix Array` | Hard | Weekly Contest 405 |
|
||
| 3214 | [Year on Year Growth Rate](/solution/3200-3299/3214.Year%20on%20Year%20Growth%20Rate/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3215 | [Count Triplets with Even XOR Set Bits II](/solution/3200-3299/3215.Count%20Triplets%20with%20Even%20XOR%20Set%20Bits%20II/README_EN.md) | `Bit Manipulation`,`Array` | Medium | 🔒 |
|
||
| 3216 | [Lexicographically Smallest String After a Swap](/solution/3200-3299/3216.Lexicographically%20Smallest%20String%20After%20a%20Swap/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 406 |
|
||
| 3217 | [Delete Nodes From Linked List Present in Array](/solution/3200-3299/3217.Delete%20Nodes%20From%20Linked%20List%20Present%20in%20Array/README_EN.md) | `Array`,`Hash Table`,`Linked List` | Medium | Weekly Contest 406 |
|
||
| 3218 | [Minimum Cost for Cutting Cake I](/solution/3200-3299/3218.Minimum%20Cost%20for%20Cutting%20Cake%20I/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 406 |
|
||
| 3219 | [Minimum Cost for Cutting Cake II](/solution/3200-3299/3219.Minimum%20Cost%20for%20Cutting%20Cake%20II/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 406 |
|
||
| 3220 | [Odd and Even Transactions](/solution/3200-3299/3220.Odd%20and%20Even%20Transactions/README_EN.md) | `Database` | Medium | |
|
||
| 3221 | [Maximum Array Hopping Score II](/solution/3200-3299/3221.Maximum%20Array%20Hopping%20Score%20II/README_EN.md) | `Stack`,`Greedy`,`Array`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 3222 | [Find the Winning Player in Coin Game](/solution/3200-3299/3222.Find%20the%20Winning%20Player%20in%20Coin%20Game/README_EN.md) | `Math`,`Game Theory`,`Simulation` | Easy | Biweekly Contest 135 |
|
||
| 3223 | [Minimum Length of String After Operations](/solution/3200-3299/3223.Minimum%20Length%20of%20String%20After%20Operations/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 135 |
|
||
| 3224 | [Minimum Array Changes to Make Differences Equal](/solution/3200-3299/3224.Minimum%20Array%20Changes%20to%20Make%20Differences%20Equal/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Biweekly Contest 135 |
|
||
| 3225 | [Maximum Score From Grid Operations](/solution/3200-3299/3225.Maximum%20Score%20From%20Grid%20Operations/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix`,`Prefix Sum` | Hard | Biweekly Contest 135 |
|
||
| 3226 | [Number of Bit Changes to Make Two Integers Equal](/solution/3200-3299/3226.Number%20of%20Bit%20Changes%20to%20Make%20Two%20Integers%20Equal/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 407 |
|
||
| 3227 | [Vowels Game in a String](/solution/3200-3299/3227.Vowels%20Game%20in%20a%20String/README_EN.md) | `Brainteaser`,`Math`,`String`,`Game Theory` | Medium | Weekly Contest 407 |
|
||
| 3228 | [Maximum Number of Operations to Move Ones to the End](/solution/3200-3299/3228.Maximum%20Number%20of%20Operations%20to%20Move%20Ones%20to%20the%20End/README_EN.md) | `Greedy`,`String`,`Counting` | Medium | Weekly Contest 407 |
|
||
| 3229 | [Minimum Operations to Make Array Equal to Target](/solution/3200-3299/3229.Minimum%20Operations%20to%20Make%20Array%20Equal%20to%20Target/README_EN.md) | `Stack`,`Greedy`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Hard | Weekly Contest 407 |
|
||
| 3230 | [Customer Purchasing Behavior Analysis](/solution/3200-3299/3230.Customer%20Purchasing%20Behavior%20Analysis/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3231 | [Minimum Number of Increasing Subsequence to Be Removed](/solution/3200-3299/3231.Minimum%20Number%20of%20Increasing%20Subsequence%20to%20Be%20Removed/README_EN.md) | `Array`,`Binary Search` | Hard | 🔒 |
|
||
| 3232 | [Find if Digit Game Can Be Won](/solution/3200-3299/3232.Find%20if%20Digit%20Game%20Can%20Be%20Won/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 408 |
|
||
| 3233 | [Find the Count of Numbers Which Are Not Special](/solution/3200-3299/3233.Find%20the%20Count%20of%20Numbers%20Which%20Are%20Not%20Special/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 408 |
|
||
| 3234 | [Count the Number of Substrings With Dominant Ones](/solution/3200-3299/3234.Count%20the%20Number%20of%20Substrings%20With%20Dominant%20Ones/README_EN.md) | `String`,`Enumeration`,`Sliding Window` | Medium | Weekly Contest 408 |
|
||
| 3235 | [Check if the Rectangle Corner Is Reachable](/solution/3200-3299/3235.Check%20if%20the%20Rectangle%20Corner%20Is%20Reachable/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Geometry`,`Array`,`Math` | Hard | Weekly Contest 408 |
|
||
| 3236 | [CEO Subordinate Hierarchy](/solution/3200-3299/3236.CEO%20Subordinate%20Hierarchy/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3237 | [Alt and Tab Simulation](/solution/3200-3299/3237.Alt%20and%20Tab%20Simulation/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | 🔒 |
|
||
| 3238 | [Find the Number of Winning Players](/solution/3200-3299/3238.Find%20the%20Number%20of%20Winning%20Players/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 136 |
|
||
| 3239 | [Minimum Number of Flips to Make Binary Grid Palindromic I](/solution/3200-3299/3239.Minimum%20Number%20of%20Flips%20to%20Make%20Binary%20Grid%20Palindromic%20I/README_EN.md) | `Array`,`Two Pointers`,`Matrix` | Medium | Biweekly Contest 136 |
|
||
| 3240 | [Minimum Number of Flips to Make Binary Grid Palindromic II](/solution/3200-3299/3240.Minimum%20Number%20of%20Flips%20to%20Make%20Binary%20Grid%20Palindromic%20II/README_EN.md) | `Array`,`Two Pointers`,`Matrix` | Medium | Biweekly Contest 136 |
|
||
| 3241 | [Time Taken to Mark All Nodes](/solution/3200-3299/3241.Time%20Taken%20to%20Mark%20All%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Dynamic Programming` | Hard | Biweekly Contest 136 |
|
||
| 3242 | [Design Neighbor Sum Service](/solution/3200-3299/3242.Design%20Neighbor%20Sum%20Service/README_EN.md) | `Design`,`Array`,`Hash Table`,`Matrix`,`Simulation` | Easy | Weekly Contest 409 |
|
||
| 3243 | [Shortest Distance After Road Addition Queries I](/solution/3200-3299/3243.Shortest%20Distance%20After%20Road%20Addition%20Queries%20I/README_EN.md) | `Breadth-First Search`,`Graph`,`Array` | Medium | Weekly Contest 409 |
|
||
| 3244 | [Shortest Distance After Road Addition Queries II](/solution/3200-3299/3244.Shortest%20Distance%20After%20Road%20Addition%20Queries%20II/README_EN.md) | `Greedy`,`Graph`,`Array`,`Ordered Set` | Hard | Weekly Contest 409 |
|
||
| 3245 | [Alternating Groups III](/solution/3200-3299/3245.Alternating%20Groups%20III/README_EN.md) | `Binary Indexed Tree`,`Array` | Hard | Weekly Contest 409 |
|
||
| 3246 | [Premier League Table Ranking](/solution/3200-3299/3246.Premier%20League%20Table%20Ranking/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 3247 | [Number of Subsequences with Odd Sum](/solution/3200-3299/3247.Number%20of%20Subsequences%20with%20Odd%20Sum/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics` | Medium | 🔒 |
|
||
| 3248 | [Snake in Matrix](/solution/3200-3299/3248.Snake%20in%20Matrix/README_EN.md) | `Array`,`String`,`Simulation` | Easy | Weekly Contest 410 |
|
||
| 3249 | [Count the Number of Good Nodes](/solution/3200-3299/3249.Count%20the%20Number%20of%20Good%20Nodes/README_EN.md) | `Tree`,`Depth-First Search` | Medium | Weekly Contest 410 |
|
||
| 3250 | [Find the Count of Monotonic Pairs I](/solution/3200-3299/3250.Find%20the%20Count%20of%20Monotonic%20Pairs%20I/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics`,`Prefix Sum` | Hard | Weekly Contest 410 |
|
||
| 3251 | [Find the Count of Monotonic Pairs II](/solution/3200-3299/3251.Find%20the%20Count%20of%20Monotonic%20Pairs%20II/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics`,`Prefix Sum` | Hard | Weekly Contest 410 |
|
||
| 3252 | [Premier League Table Ranking II](/solution/3200-3299/3252.Premier%20League%20Table%20Ranking%20II/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3253 | [Construct String with Minimum Cost (Easy)](/solution/3200-3299/3253.Construct%20String%20with%20Minimum%20Cost%20%28Easy%29/README_EN.md) | | Medium | 🔒 |
|
||
| 3254 | [Find the Power of K-Size Subarrays I](/solution/3200-3299/3254.Find%20the%20Power%20of%20K-Size%20Subarrays%20I/README_EN.md) | `Array`,`Sliding Window` | Medium | Biweekly Contest 137 |
|
||
| 3255 | [Find the Power of K-Size Subarrays II](/solution/3200-3299/3255.Find%20the%20Power%20of%20K-Size%20Subarrays%20II/README_EN.md) | `Array`,`Sliding Window` | Medium | Biweekly Contest 137 |
|
||
| 3256 | [Maximum Value Sum by Placing Three Rooks I](/solution/3200-3299/3256.Maximum%20Value%20Sum%20by%20Placing%20Three%20Rooks%20I/README_EN.md) | `Array`,`Dynamic Programming`,`Enumeration`,`Matrix` | Hard | Biweekly Contest 137 |
|
||
| 3257 | [Maximum Value Sum by Placing Three Rooks II](/solution/3200-3299/3257.Maximum%20Value%20Sum%20by%20Placing%20Three%20Rooks%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Enumeration`,`Matrix` | Hard | Biweekly Contest 137 |
|
||
| 3258 | [Count Substrings That Satisfy K-Constraint I](/solution/3200-3299/3258.Count%20Substrings%20That%20Satisfy%20K-Constraint%20I/README_EN.md) | `String`,`Sliding Window` | Easy | Weekly Contest 411 |
|
||
| 3259 | [Maximum Energy Boost From Two Drinks](/solution/3200-3299/3259.Maximum%20Energy%20Boost%20From%20Two%20Drinks/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 411 |
|
||
| 3260 | [Find the Largest Palindrome Divisible by K](/solution/3200-3299/3260.Find%20the%20Largest%20Palindrome%20Divisible%20by%20K/README_EN.md) | `Greedy`,`Math`,`String`,`Dynamic Programming`,`Number Theory` | Hard | Weekly Contest 411 |
|
||
| 3261 | [Count Substrings That Satisfy K-Constraint II](/solution/3200-3299/3261.Count%20Substrings%20That%20Satisfy%20K-Constraint%20II/README_EN.md) | `Array`,`String`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 411 |
|
||
| 3262 | [Find Overlapping Shifts](/solution/3200-3299/3262.Find%20Overlapping%20Shifts/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3263 | [Convert Doubly Linked List to Array I](/solution/3200-3299/3263.Convert%20Doubly%20Linked%20List%20to%20Array%20I/README_EN.md) | `Array`,`Linked List`,`Doubly-Linked List` | Easy | 🔒 |
|
||
| 3264 | [Final Array State After K Multiplication Operations I](/solution/3200-3299/3264.Final%20Array%20State%20After%20K%20Multiplication%20Operations%20I/README_EN.md) | `Array`,`Math`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 412 |
|
||
| 3265 | [Count Almost Equal Pairs I](/solution/3200-3299/3265.Count%20Almost%20Equal%20Pairs%20I/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Enumeration`,`Sorting` | Medium | Weekly Contest 412 |
|
||
| 3266 | [Final Array State After K Multiplication Operations II](/solution/3200-3299/3266.Final%20Array%20State%20After%20K%20Multiplication%20Operations%20II/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Hard | Weekly Contest 412 |
|
||
| 3267 | [Count Almost Equal Pairs II](/solution/3200-3299/3267.Count%20Almost%20Equal%20Pairs%20II/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Enumeration`,`Sorting` | Hard | Weekly Contest 412 |
|
||
| 3268 | [Find Overlapping Shifts II](/solution/3200-3299/3268.Find%20Overlapping%20Shifts%20II/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3269 | [Constructing Two Increasing Arrays](/solution/3200-3299/3269.Constructing%20Two%20Increasing%20Arrays/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 |
|
||
| 3270 | [Find the Key of the Numbers](/solution/3200-3299/3270.Find%20the%20Key%20of%20the%20Numbers/README_EN.md) | `Math` | Easy | Biweekly Contest 138 |
|
||
| 3271 | [Hash Divided String](/solution/3200-3299/3271.Hash%20Divided%20String/README_EN.md) | `String`,`Simulation` | Medium | Biweekly Contest 138 |
|
||
| 3272 | [Find the Count of Good Integers](/solution/3200-3299/3272.Find%20the%20Count%20of%20Good%20Integers/README_EN.md) | `Hash Table`,`Math`,`Combinatorics`,`Enumeration` | Hard | Biweekly Contest 138 |
|
||
| 3273 | [Minimum Amount of Damage Dealt to Bob](/solution/3200-3299/3273.Minimum%20Amount%20of%20Damage%20Dealt%20to%20Bob/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Biweekly Contest 138 |
|
||
| 3274 | [Check if Two Chessboard Squares Have the Same Color](/solution/3200-3299/3274.Check%20if%20Two%20Chessboard%20Squares%20Have%20the%20Same%20Color/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 413 |
|
||
| 3275 | [K-th Nearest Obstacle Queries](/solution/3200-3299/3275.K-th%20Nearest%20Obstacle%20Queries/README_EN.md) | `Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 413 |
|
||
| 3276 | [Select Cells in Grid With Maximum Score](/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix` | Hard | Weekly Contest 413 |
|
||
| 3277 | [Maximum XOR Score Subarray Queries](/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 413 |
|
||
| 3278 | [Find Candidates for Data Scientist Position II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3279 | [Maximum Total Area Occupied by Pistons](/solution/3200-3299/3279.Maximum%20Total%20Area%20Occupied%20by%20Pistons/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting`,`Prefix Sum`,`Simulation` | Hard | 🔒 |
|
||
| 3280 | [Convert Date to Binary](/solution/3200-3299/3280.Convert%20Date%20to%20Binary/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 414 |
|
||
| 3281 | [Maximize Score of Numbers in Ranges](/solution/3200-3299/3281.Maximize%20Score%20of%20Numbers%20in%20Ranges/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Medium | Weekly Contest 414 |
|
||
| 3282 | [Reach End of Array With Max Score](/solution/3200-3299/3282.Reach%20End%20of%20Array%20With%20Max%20Score/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 414 |
|
||
| 3283 | [Maximum Number of Moves to Kill All Pawns](/solution/3200-3299/3283.Maximum%20Number%20of%20Moves%20to%20Kill%20All%20Pawns/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Math`,`Bitmask`,`Game Theory` | Hard | Weekly Contest 414 |
|
||
| 3284 | [Sum of Consecutive Subarrays](/solution/3200-3299/3284.Sum%20of%20Consecutive%20Subarrays/README_EN.md) | `Array`,`Two Pointers`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 3285 | [Find Indices of Stable Mountains](/solution/3200-3299/3285.Find%20Indices%20of%20Stable%20Mountains/README_EN.md) | `Array` | Easy | Biweekly Contest 139 |
|
||
| 3286 | [Find a Safe Walk Through a Grid](/solution/3200-3299/3286.Find%20a%20Safe%20Walk%20Through%20a%20Grid/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Biweekly Contest 139 |
|
||
| 3287 | [Find the Maximum Sequence Value of Array](/solution/3200-3299/3287.Find%20the%20Maximum%20Sequence%20Value%20of%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 139 |
|
||
| 3288 | [Length of the Longest Increasing Path](/solution/3200-3299/3288.Length%20of%20the%20Longest%20Increasing%20Path/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Hard | Biweekly Contest 139 |
|
||
| 3289 | [The Two Sneaky Numbers of Digitville](/solution/3200-3299/3289.The%20Two%20Sneaky%20Numbers%20of%20Digitville/README_EN.md) | `Array`,`Hash Table`,`Math` | Easy | Weekly Contest 415 |
|
||
| 3290 | [Maximum Multiplication Score](/solution/3200-3299/3290.Maximum%20Multiplication%20Score/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 415 |
|
||
| 3291 | [Minimum Number of Valid Strings to Form Target I](/solution/3200-3299/3291.Minimum%20Number%20of%20Valid%20Strings%20to%20Form%20Target%20I/README_EN.md) | `Trie`,`Segment Tree`,`Array`,`String`,`Binary Search`,`Dynamic Programming`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 415 |
|
||
| 3292 | [Minimum Number of Valid Strings to Form Target II](/solution/3200-3299/3292.Minimum%20Number%20of%20Valid%20Strings%20to%20Form%20Target%20II/README_EN.md) | `Segment Tree`,`Array`,`String`,`Binary Search`,`Dynamic Programming`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 415 |
|
||
| 3293 | [Calculate Product Final Price](/solution/3200-3299/3293.Calculate%20Product%20Final%20Price/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3294 | [Convert Doubly Linked List to Array II](/solution/3200-3299/3294.Convert%20Doubly%20Linked%20List%20to%20Array%20II/README_EN.md) | `Array`,`Linked List`,`Doubly-Linked List` | Medium | 🔒 |
|
||
| 3295 | [Report Spam Message](/solution/3200-3299/3295.Report%20Spam%20Message/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 416 |
|
||
| 3296 | [Minimum Number of Seconds to Make Mountain Height Zero](/solution/3200-3299/3296.Minimum%20Number%20of%20Seconds%20to%20Make%20Mountain%20Height%20Zero/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Heap (Priority Queue)` | Medium | Weekly Contest 416 |
|
||
| 3297 | [Count Substrings That Can Be Rearranged to Contain a String I](/solution/3200-3299/3297.Count%20Substrings%20That%20Can%20Be%20Rearranged%20to%20Contain%20a%20String%20I/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 416 |
|
||
| 3298 | [Count Substrings That Can Be Rearranged to Contain a String II](/solution/3200-3299/3298.Count%20Substrings%20That%20Can%20Be%20Rearranged%20to%20Contain%20a%20String%20II/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | Weekly Contest 416 |
|
||
| 3299 | [Sum of Consecutive Subsequences](/solution/3200-3299/3299.Sum%20of%20Consecutive%20Subsequences/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Hard | 🔒 |
|
||
| 3300 | [Minimum Element After Replacement With Digit Sum](/solution/3300-3399/3300.Minimum%20Element%20After%20Replacement%20With%20Digit%20Sum/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 140 |
|
||
| 3301 | [Maximize the Total Height of Unique Towers](/solution/3300-3399/3301.Maximize%20the%20Total%20Height%20of%20Unique%20Towers/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 140 |
|
||
| 3302 | [Find the Lexicographically Smallest Valid Sequence](/solution/3300-3399/3302.Find%20the%20Lexicographically%20Smallest%20Valid%20Sequence/README_EN.md) | `Greedy`,`Two Pointers`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 140 |
|
||
| 3303 | [Find the Occurrence of First Almost Equal Substring](/solution/3300-3399/3303.Find%20the%20Occurrence%20of%20First%20Almost%20Equal%20Substring/README_EN.md) | `String`,`String Matching` | Hard | Biweekly Contest 140 |
|
||
| 3304 | [Find the K-th Character in String Game I](/solution/3300-3399/3304.Find%20the%20K-th%20Character%20in%20String%20Game%20I/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math`,`Simulation` | Easy | Weekly Contest 417 |
|
||
| 3305 | [Count of Substrings Containing Every Vowel and K Consonants I](/solution/3300-3399/3305.Count%20of%20Substrings%20Containing%20Every%20Vowel%20and%20K%20Consonants%20I/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 417 |
|
||
| 3306 | [Count of Substrings Containing Every Vowel and K Consonants II](/solution/3300-3399/3306.Count%20of%20Substrings%20Containing%20Every%20Vowel%20and%20K%20Consonants%20II/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 417 |
|
||
| 3307 | [Find the K-th Character in String Game II](/solution/3300-3399/3307.Find%20the%20K-th%20Character%20in%20String%20Game%20II/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Hard | Weekly Contest 417 |
|
||
| 3308 | [Find Top Performing Driver](/solution/3300-3399/3308.Find%20Top%20Performing%20Driver/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3309 | [Maximum Possible Number by Binary Concatenation](/solution/3300-3399/3309.Maximum%20Possible%20Number%20by%20Binary%20Concatenation/README_EN.md) | `Bit Manipulation`,`Array`,`Enumeration` | Medium | Weekly Contest 418 |
|
||
| 3310 | [Remove Methods From Project](/solution/3300-3399/3310.Remove%20Methods%20From%20Project/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 418 |
|
||
| 3311 | [Construct 2D Grid Matching Graph Layout](/solution/3300-3399/3311.Construct%202D%20Grid%20Matching%20Graph%20Layout/README_EN.md) | `Graph`,`Array`,`Hash Table`,`Matrix` | Hard | Weekly Contest 418 |
|
||
| 3312 | [Sorted GCD Pair Queries](/solution/3300-3399/3312.Sorted%20GCD%20Pair%20Queries/README_EN.md) | `Array`,`Hash Table`,`Math`,`Binary Search`,`Combinatorics`,`Counting`,`Number Theory`,`Prefix Sum` | Hard | Weekly Contest 418 |
|
||
| 3313 | [Find the Last Marked Nodes in Tree](/solution/3300-3399/3313.Find%20the%20Last%20Marked%20Nodes%20in%20Tree/README_EN.md) | `Tree`,`Depth-First Search` | Hard | 🔒 |
|
||
| 3314 | [Construct the Minimum Bitwise Array I](/solution/3300-3399/3314.Construct%20the%20Minimum%20Bitwise%20Array%20I/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Biweekly Contest 141 |
|
||
| 3315 | [Construct the Minimum Bitwise Array II](/solution/3300-3399/3315.Construct%20the%20Minimum%20Bitwise%20Array%20II/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Biweekly Contest 141 |
|
||
| 3316 | [Find Maximum Removals From Source String](/solution/3300-3399/3316.Find%20Maximum%20Removals%20From%20Source%20String/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 141 |
|
||
| 3317 | [Find the Number of Possible Ways for an Event](/solution/3300-3399/3317.Find%20the%20Number%20of%20Possible%20Ways%20for%20an%20Event/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | Biweekly Contest 141 |
|
||
| 3318 | [Find X-Sum of All K-Long Subarrays I](/solution/3300-3399/3318.Find%20X-Sum%20of%20All%20K-Long%20Subarrays%20I/README_EN.md) | `Array`,`Hash Table`,`Sliding Window`,`Heap (Priority Queue)` | Easy | Weekly Contest 419 |
|
||
| 3319 | [K-th Largest Perfect Subtree Size in Binary Tree](/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree`,`Sorting` | Medium | Weekly Contest 419 |
|
||
| 3320 | [Count The Number of Winning Sequences](/solution/3300-3399/3320.Count%20The%20Number%20of%20Winning%20Sequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 419 |
|
||
| 3321 | [Find X-Sum of All K-Long Subarrays II](/solution/3300-3399/3321.Find%20X-Sum%20of%20All%20K-Long%20Subarrays%20II/README_EN.md) | `Array`,`Hash Table`,`Sliding Window`,`Heap (Priority Queue)` | Hard | Weekly Contest 419 |
|
||
| 3322 | [Premier League Table Ranking III](/solution/3300-3399/3322.Premier%20League%20Table%20Ranking%20III/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3323 | [Minimize Connected Groups by Inserting Interval](/solution/3300-3399/3323.Minimize%20Connected%20Groups%20by%20Inserting%20Interval/README_EN.md) | `Array`,`Binary Search`,`Sorting`,`Sliding Window` | Medium | 🔒 |
|
||
| 3324 | [Find the Sequence of Strings Appeared on the Screen](/solution/3300-3399/3324.Find%20the%20Sequence%20of%20Strings%20Appeared%20on%20the%20Screen/README_EN.md) | `String`,`Simulation` | Medium | Weekly Contest 420 |
|
||
| 3325 | [Count Substrings With K-Frequency Characters I](/solution/3300-3399/3325.Count%20Substrings%20With%20K-Frequency%20Characters%20I/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 420 |
|
||
| 3326 | [Minimum Division Operations to Make Array Non Decreasing](/solution/3300-3399/3326.Minimum%20Division%20Operations%20to%20Make%20Array%20Non%20Decreasing/README_EN.md) | `Greedy`,`Array`,`Math`,`Number Theory` | Medium | Weekly Contest 420 |
|
||
| 3327 | [Check if DFS Strings Are Palindromes](/solution/3300-3399/3327.Check%20if%20DFS%20Strings%20Are%20Palindromes/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`String`,`Hash Function` | Hard | Weekly Contest 420 |
|
||
| 3328 | [Find Cities in Each State II](/solution/3300-3399/3328.Find%20Cities%20in%20Each%20State%20II/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3329 | [Count Substrings With K-Frequency Characters II](/solution/3300-3399/3329.Count%20Substrings%20With%20K-Frequency%20Characters%20II/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | 🔒 |
|
||
| 3330 | [Find the Original Typed String I](/solution/3300-3399/3330.Find%20the%20Original%20Typed%20String%20I/README_EN.md) | `String` | Easy | Biweekly Contest 142 |
|
||
| 3331 | [Find Subtree Sizes After Changes](/solution/3300-3399/3331.Find%20Subtree%20Sizes%20After%20Changes/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`String` | Medium | Biweekly Contest 142 |
|
||
| 3332 | [Maximum Points Tourist Can Earn](/solution/3300-3399/3332.Maximum%20Points%20Tourist%20Can%20Earn/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Biweekly Contest 142 |
|
||
| 3333 | [Find the Original Typed String II](/solution/3300-3399/3333.Find%20the%20Original%20Typed%20String%20II/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Hard | Biweekly Contest 142 |
|
||
| 3334 | [Find the Maximum Factor Score of Array](/solution/3300-3399/3334.Find%20the%20Maximum%20Factor%20Score%20of%20Array/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 421 |
|
||
| 3335 | [Total Characters in String After Transformations I](/solution/3300-3399/3335.Total%20Characters%20in%20String%20After%20Transformations%20I/README_EN.md) | `Hash Table`,`Math`,`String`,`Dynamic Programming`,`Counting` | Medium | Weekly Contest 421 |
|
||
| 3336 | [Find the Number of Subsequences With Equal GCD](/solution/3300-3399/3336.Find%20the%20Number%20of%20Subsequences%20With%20Equal%20GCD/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Number Theory` | Hard | Weekly Contest 421 |
|
||
| 3337 | [Total Characters in String After Transformations II](/solution/3300-3399/3337.Total%20Characters%20in%20String%20After%20Transformations%20II/README_EN.md) | `Hash Table`,`Math`,`String`,`Dynamic Programming`,`Counting` | Hard | Weekly Contest 421 |
|
||
| 3338 | [Second Highest Salary II](/solution/3300-3399/3338.Second%20Highest%20Salary%20II/README_EN.md) | `Database` | Medium | 🔒 |
|
||
| 3339 | [Find the Number of K-Even Arrays](/solution/3300-3399/3339.Find%20the%20Number%20of%20K-Even%20Arrays/README_EN.md) | `Dynamic Programming` | Medium | 🔒 |
|
||
| 3340 | [Check Balanced String](/solution/3300-3399/3340.Check%20Balanced%20String/README_EN.md) | `String` | Easy | Weekly Contest 422 |
|
||
| 3341 | [Find Minimum Time to Reach Last Room I](/solution/3300-3399/3341.Find%20Minimum%20Time%20to%20Reach%20Last%20Room%20I/README_EN.md) | `Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 422 |
|
||
| 3342 | [Find Minimum Time to Reach Last Room II](/solution/3300-3399/3342.Find%20Minimum%20Time%20to%20Reach%20Last%20Room%20II/README_EN.md) | `Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 422 |
|
||
| 3343 | [Count Number of Balanced Permutations](/solution/3300-3399/3343.Count%20Number%20of%20Balanced%20Permutations/README_EN.md) | `Math`,`String`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 422 |
|
||
| 3344 | [Maximum Sized Array](/solution/3300-3399/3344.Maximum%20Sized%20Array/README_EN.md) | `Bit Manipulation`,`Binary Search` | Medium | 🔒 |
|
||
| 3345 | [Smallest Divisible Digit Product I](/solution/3300-3399/3345.Smallest%20Divisible%20Digit%20Product%20I/README_EN.md) | `Math`,`Enumeration` | Easy | Biweekly Contest 143 |
|
||
| 3346 | [Maximum Frequency of an Element After Performing Operations I](/solution/3300-3399/3346.Maximum%20Frequency%20of%20an%20Element%20After%20Performing%20Operations%20I/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Medium | Biweekly Contest 143 |
|
||
| 3347 | [Maximum Frequency of an Element After Performing Operations II](/solution/3300-3399/3347.Maximum%20Frequency%20of%20an%20Element%20After%20Performing%20Operations%20II/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Hard | Biweekly Contest 143 |
|
||
| 3348 | [Smallest Divisible Digit Product II](/solution/3300-3399/3348.Smallest%20Divisible%20Digit%20Product%20II/README_EN.md) | `Greedy`,`Math`,`String`,`Backtracking`,`Number Theory` | Hard | Biweekly Contest 143 |
|
||
| 3349 | [Adjacent Increasing Subarrays Detection I](/solution/3300-3399/3349.Adjacent%20Increasing%20Subarrays%20Detection%20I/README_EN.md) | `Array` | Easy | Weekly Contest 423 |
|
||
| 3350 | [Adjacent Increasing Subarrays Detection II](/solution/3300-3399/3350.Adjacent%20Increasing%20Subarrays%20Detection%20II/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 423 |
|
||
| 3351 | [Sum of Good Subsequences](/solution/3300-3399/3351.Sum%20of%20Good%20Subsequences/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Hard | Weekly Contest 423 |
|
||
| 3352 | [Count K-Reducible Numbers Less Than N](/solution/3300-3399/3352.Count%20K-Reducible%20Numbers%20Less%20Than%20N/README_EN.md) | `Math`,`String`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 423 |
|
||
| 3353 | [Minimum Total Operations](/solution/3300-3399/3353.Minimum%20Total%20Operations/README_EN.md) | `Array` | Easy | 🔒 |
|
||
| 3354 | [Make Array Elements Equal to Zero](/solution/3300-3399/3354.Make%20Array%20Elements%20Equal%20to%20Zero/README_EN.md) | `Array`,`Prefix Sum`,`Simulation` | Easy | Weekly Contest 424 |
|
||
| 3355 | [Zero Array Transformation I](/solution/3300-3399/3355.Zero%20Array%20Transformation%20I/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 424 |
|
||
| 3356 | [Zero Array Transformation II](/solution/3300-3399/3356.Zero%20Array%20Transformation%20II/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum` | Medium | Weekly Contest 424 |
|
||
| 3357 | [Minimize the Maximum Adjacent Element Difference](/solution/3300-3399/3357.Minimize%20the%20Maximum%20Adjacent%20Element%20Difference/README_EN.md) | `Greedy`,`Array`,`Binary Search` | Hard | Weekly Contest 424 |
|
||
| 3358 | [Books with NULL Ratings](/solution/3300-3399/3358.Books%20with%20NULL%20Ratings/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 3359 | [Find Sorted Submatrices With Maximum Element at Most K](/solution/3300-3399/3359.Find%20Sorted%20Submatrices%20With%20Maximum%20Element%20at%20Most%20K/README_EN.md) | `Stack`,`Array`,`Matrix`,`Monotonic Stack` | Hard | 🔒 |
|
||
| 3360 | [Stone Removal Game](/solution/3300-3399/3360.Stone%20Removal%20Game/README_EN.md) | `Math`,`Simulation` | Easy | Biweekly Contest 144 |
|
||
| 3361 | [Shift Distance Between Two Strings](/solution/3300-3399/3361.Shift%20Distance%20Between%20Two%20Strings/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Biweekly Contest 144 |
|
||
| 3362 | [Zero Array Transformation III](/solution/3300-3399/3362.Zero%20Array%20Transformation%20III/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 144 |
|
||
| 3363 | [Find the Maximum Number of Fruits Collected](/solution/3300-3399/3363.Find%20the%20Maximum%20Number%20of%20Fruits%20Collected/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 144 |
|
||
| 3364 | [Minimum Positive Sum Subarray](/solution/3300-3399/3364.Minimum%20Positive%20Sum%20Subarray/README_EN.md) | `Array`,`Prefix Sum`,`Sliding Window` | Easy | Weekly Contest 425 |
|
||
| 3365 | [Rearrange K Substrings to Form Target String](/solution/3300-3399/3365.Rearrange%20K%20Substrings%20to%20Form%20Target%20String/README_EN.md) | `Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 425 |
|
||
| 3366 | [Minimum Array Sum](/solution/3300-3399/3366.Minimum%20Array%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 425 |
|
||
| 3367 | [Maximize Sum of Weights after Edge Removals](/solution/3300-3399/3367.Maximize%20Sum%20of%20Weights%20after%20Edge%20Removals/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming` | Hard | Weekly Contest 425 |
|
||
| 3368 | [First Letter Capitalization](/solution/3300-3399/3368.First%20Letter%20Capitalization/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3369 | [Design an Array Statistics Tracker](/solution/3300-3399/3369.Design%20an%20Array%20Statistics%20Tracker/README_EN.md) | `Design`,`Queue`,`Hash Table`,`Binary Search`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Hard | 🔒 |
|
||
| 3370 | [Smallest Number With All Set Bits](/solution/3300-3399/3370.Smallest%20Number%20With%20All%20Set%20Bits/README_EN.md) | `Bit Manipulation`,`Math` | Easy | Weekly Contest 426 |
|
||
| 3371 | [Identify the Largest Outlier in an Array](/solution/3300-3399/3371.Identify%20the%20Largest%20Outlier%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Enumeration` | Medium | Weekly Contest 426 |
|
||
| 3372 | [Maximize the Number of Target Nodes After Connecting Trees I](/solution/3300-3399/3372.Maximize%20the%20Number%20of%20Target%20Nodes%20After%20Connecting%20Trees%20I/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search` | Medium | Weekly Contest 426 |
|
||
| 3373 | [Maximize the Number of Target Nodes After Connecting Trees II](/solution/3300-3399/3373.Maximize%20the%20Number%20of%20Target%20Nodes%20After%20Connecting%20Trees%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search` | Hard | Weekly Contest 426 |
|
||
| 3374 | [First Letter Capitalization II](/solution/3300-3399/3374.First%20Letter%20Capitalization%20II/README_EN.md) | `Database` | Hard | |
|
||
| 3375 | [Minimum Operations to Make Array Values Equal to K](/solution/3300-3399/3375.Minimum%20Operations%20to%20Make%20Array%20Values%20Equal%20to%20K/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 145 |
|
||
| 3376 | [Minimum Time to Break Locks I](/solution/3300-3399/3376.Minimum%20Time%20to%20Break%20Locks%20I/README_EN.md) | `Bit Manipulation`,`Depth-First Search`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Biweekly Contest 145 |
|
||
| 3377 | [Digit Operations to Make Two Integers Equal](/solution/3300-3399/3377.Digit%20Operations%20to%20Make%20Two%20Integers%20Equal/README_EN.md) | `Graph`,`Math`,`Number Theory`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Biweekly Contest 145 |
|
||
| 3378 | [Count Connected Components in LCM Graph](/solution/3300-3399/3378.Count%20Connected%20Components%20in%20LCM%20Graph/README_EN.md) | `Union Find`,`Array`,`Hash Table`,`Math`,`Number Theory` | Hard | Biweekly Contest 145 |
|
||
| 3379 | [Transformed Array](/solution/3300-3399/3379.Transformed%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 427 |
|
||
| 3380 | [Maximum Area Rectangle With Point Constraints I](/solution/3300-3399/3380.Maximum%20Area%20Rectangle%20With%20Point%20Constraints%20I/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Geometry`,`Array`,`Math`,`Enumeration`,`Sorting` | Medium | Weekly Contest 427 |
|
||
| 3381 | [Maximum Subarray Sum With Length Divisible by K](/solution/3300-3399/3381.Maximum%20Subarray%20Sum%20With%20Length%20Divisible%20by%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 427 |
|
||
| 3382 | [Maximum Area Rectangle With Point Constraints II](/solution/3300-3399/3382.Maximum%20Area%20Rectangle%20With%20Point%20Constraints%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Geometry`,`Array`,`Math`,`Sorting` | Hard | Weekly Contest 427 |
|
||
| 3383 | [Minimum Runes to Add to Cast Spell](/solution/3300-3399/3383.Minimum%20Runes%20to%20Add%20to%20Cast%20Spell/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Topological Sort`,`Array` | Hard | 🔒 |
|
||
| 3384 | [Team Dominance by Pass Success](/solution/3300-3399/3384.Team%20Dominance%20by%20Pass%20Success/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3385 | [Minimum Time to Break Locks II](/solution/3300-3399/3385.Minimum%20Time%20to%20Break%20Locks%20II/README_EN.md) | `Depth-First Search`,`Graph`,`Array` | Hard | 🔒 |
|
||
| 3386 | [Button with Longest Push Time](/solution/3300-3399/3386.Button%20with%20Longest%20Push%20Time/README_EN.md) | `Array` | Easy | Weekly Contest 428 |
|
||
| 3387 | [Maximize Amount After Two Days of Conversions](/solution/3300-3399/3387.Maximize%20Amount%20After%20Two%20Days%20of%20Conversions/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`String` | Medium | Weekly Contest 428 |
|
||
| 3388 | [Count Beautiful Splits in an Array](/solution/3300-3399/3388.Count%20Beautiful%20Splits%20in%20an%20Array/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 428 |
|
||
| 3389 | [Minimum Operations to Make Character Frequencies Equal](/solution/3300-3399/3389.Minimum%20Operations%20to%20Make%20Character%20Frequencies%20Equal/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming`,`Counting`,`Enumeration` | Hard | Weekly Contest 428 |
|
||
| 3390 | [Longest Team Pass Streak](/solution/3300-3399/3390.Longest%20Team%20Pass%20Streak/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3391 | [Design a 3D Binary Matrix with Efficient Layer Tracking](/solution/3300-3399/3391.Design%20a%203D%20Binary%20Matrix%20with%20Efficient%20Layer%20Tracking/README_EN.md) | `Design`,`Array`,`Hash Table`,`Matrix`,`Ordered Set`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 3392 | [Count Subarrays of Length Three With a Condition](/solution/3300-3399/3392.Count%20Subarrays%20of%20Length%20Three%20With%20a%20Condition/README_EN.md) | `Array` | Easy | Biweekly Contest 146 |
|
||
| 3393 | [Count Paths With the Given XOR Value](/solution/3300-3399/3393.Count%20Paths%20With%20the%20Given%20XOR%20Value/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Matrix` | Medium | Biweekly Contest 146 |
|
||
| 3394 | [Check if Grid can be Cut into Sections](/solution/3300-3399/3394.Check%20if%20Grid%20can%20be%20Cut%20into%20Sections/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 146 |
|
||
| 3395 | [Subsequences with a Unique Middle Mode I](/solution/3300-3399/3395.Subsequences%20with%20a%20Unique%20Middle%20Mode%20I/README_EN.md) | `Array`,`Hash Table`,`Math`,`Combinatorics` | Hard | Biweekly Contest 146 |
|
||
| 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](/solution/3300-3399/3396.Minimum%20Number%20of%20Operations%20to%20Make%20Elements%20in%20Array%20Distinct/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 429 |
|
||
| 3397 | [Maximum Number of Distinct Elements After Operations](/solution/3300-3399/3397.Maximum%20Number%20of%20Distinct%20Elements%20After%20Operations/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 429 |
|
||
| 3398 | [Smallest Substring With Identical Characters I](/solution/3300-3399/3398.Smallest%20Substring%20With%20Identical%20Characters%20I/README_EN.md) | `Array`,`Binary Search`,`Enumeration` | Hard | Weekly Contest 429 |
|
||
| 3399 | [Smallest Substring With Identical Characters II](/solution/3300-3399/3399.Smallest%20Substring%20With%20Identical%20Characters%20II/README_EN.md) | `String`,`Binary Search` | Hard | Weekly Contest 429 |
|
||
| 3400 | [Maximum Number of Matching Indices After Right Shifts](/solution/3400-3499/3400.Maximum%20Number%20of%20Matching%20Indices%20After%20Right%20Shifts/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | 🔒 |
|
||
| 3401 | [Find Circular Gift Exchange Chains](/solution/3400-3499/3401.Find%20Circular%20Gift%20Exchange%20Chains/README_EN.md) | `Database` | Hard | 🔒 |
|
||
| 3402 | [Minimum Operations to Make Columns Strictly Increasing](/solution/3400-3499/3402.Minimum%20Operations%20to%20Make%20Columns%20Strictly%20Increasing/README_EN.md) | `Greedy`,`Array`,`Matrix` | Easy | Weekly Contest 430 |
|
||
| 3403 | [Find the Lexicographically Largest String From the Box I](/solution/3400-3499/3403.Find%20the%20Lexicographically%20Largest%20String%20From%20the%20Box%20I/README_EN.md) | `Two Pointers`,`String`,`Enumeration` | Medium | Weekly Contest 430 |
|
||
| 3404 | [Count Special Subsequences](/solution/3400-3499/3404.Count%20Special%20Subsequences/README_EN.md) | `Array`,`Hash Table`,`Math`,`Enumeration` | Medium | Weekly Contest 430 |
|
||
| 3405 | [Count the Number of Arrays with K Matching Adjacent Elements](/solution/3400-3499/3405.Count%20the%20Number%20of%20Arrays%20with%20K%20Matching%20Adjacent%20Elements/README_EN.md) | `Math`,`Combinatorics` | Hard | Weekly Contest 430 |
|
||
| 3406 | [Find the Lexicographically Largest String From the Box II](/solution/3400-3499/3406.Find%20the%20Lexicographically%20Largest%20String%20From%20the%20Box%20II/README_EN.md) | `Two Pointers`,`String` | Hard | 🔒 |
|
||
| 3407 | [Substring Matching Pattern](/solution/3400-3499/3407.Substring%20Matching%20Pattern/README_EN.md) | `String`,`String Matching` | Easy | Biweekly Contest 147 |
|
||
| 3408 | [Design Task Manager](/solution/3400-3499/3408.Design%20Task%20Manager/README_EN.md) | `Design`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Biweekly Contest 147 |
|
||
| 3409 | [Longest Subsequence With Decreasing Adjacent Difference](/solution/3400-3499/3409.Longest%20Subsequence%20With%20Decreasing%20Adjacent%20Difference/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 147 |
|
||
| 3410 | [Maximize Subarray Sum After Removing All Occurrences of One Element](/solution/3400-3499/3410.Maximize%20Subarray%20Sum%20After%20Removing%20All%20Occurrences%20of%20One%20Element/README_EN.md) | `Segment Tree`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 147 |
|
||
| 3411 | [Maximum Subarray With Equal Products](/solution/3400-3499/3411.Maximum%20Subarray%20With%20Equal%20Products/README_EN.md) | `Array`,`Math`,`Enumeration`,`Number Theory`,`Sliding Window` | Easy | Weekly Contest 431 |
|
||
| 3412 | [Find Mirror Score of a String](/solution/3400-3499/3412.Find%20Mirror%20Score%20of%20a%20String/README_EN.md) | `Stack`,`Hash Table`,`String`,`Simulation` | Medium | Weekly Contest 431 |
|
||
| 3413 | [Maximum Coins From K Consecutive Bags](/solution/3400-3499/3413.Maximum%20Coins%20From%20K%20Consecutive%20Bags/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Medium | Weekly Contest 431 |
|
||
| 3414 | [Maximum Score of Non-overlapping Intervals](/solution/3400-3499/3414.Maximum%20Score%20of%20Non-overlapping%20Intervals/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 431 |
|
||
| 3415 | [Find Products with Three Consecutive Digits](/solution/3400-3499/3415.Find%20Products%20with%20Three%20Consecutive%20Digits/README_EN.md) | `Database` | Easy | 🔒 |
|
||
| 3416 | [Subsequences with a Unique Middle Mode II](/solution/3400-3499/3416.Subsequences%20with%20a%20Unique%20Middle%20Mode%20II/README_EN.md) | `Array`,`Hash Table`,`Math`,`Combinatorics` | Hard | 🔒 |
|
||
| 3417 | [Zigzag Grid Traversal With Skip](/solution/3400-3499/3417.Zigzag%20Grid%20Traversal%20With%20Skip/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 432 |
|
||
| 3418 | [Maximum Amount of Money Robot Can Earn](/solution/3400-3499/3418.Maximum%20Amount%20of%20Money%20Robot%20Can%20Earn/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 432 |
|
||
| 3419 | [Minimize the Maximum Edge Weight of Graph](/solution/3400-3499/3419.Minimize%20the%20Maximum%20Edge%20Weight%20of%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Binary Search`,`Shortest Path` | Medium | Weekly Contest 432 |
|
||
| 3420 | [Count Non-Decreasing Subarrays After K Operations](/solution/3400-3499/3420.Count%20Non-Decreasing%20Subarrays%20After%20K%20Operations/README_EN.md) | `Stack`,`Segment Tree`,`Queue`,`Array`,`Sliding Window`,`Monotonic Queue`,`Monotonic Stack` | Hard | Weekly Contest 432 |
|
||
| 3421 | [Find Students Who Improved](/solution/3400-3499/3421.Find%20Students%20Who%20Improved/README_EN.md) | `Database` | Medium | |
|
||
| 3422 | [Minimum Operations to Make Subarray Elements Equal](/solution/3400-3499/3422.Minimum%20Operations%20to%20Make%20Subarray%20Elements%20Equal/README_EN.md) | `Array`,`Hash Table`,`Math`,`Sliding Window`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 3423 | [Maximum Difference Between Adjacent Elements in a Circular Array](/solution/3400-3499/3423.Maximum%20Difference%20Between%20Adjacent%20Elements%20in%20a%20Circular%20Array/README_EN.md) | `Array` | Easy | Biweekly Contest 148 |
|
||
| 3424 | [Minimum Cost to Make Arrays Identical](/solution/3400-3499/3424.Minimum%20Cost%20to%20Make%20Arrays%20Identical/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 148 |
|
||
| 3425 | [Longest Special Path](/solution/3400-3499/3425.Longest%20Special%20Path/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Prefix Sum` | Hard | Biweekly Contest 148 |
|
||
| 3426 | [Manhattan Distances of All Arrangements of Pieces](/solution/3400-3499/3426.Manhattan%20Distances%20of%20All%20Arrangements%20of%20Pieces/README_EN.md) | `Math`,`Combinatorics` | Hard | Biweekly Contest 148 |
|
||
| 3427 | [Sum of Variable Length Subarrays](/solution/3400-3499/3427.Sum%20of%20Variable%20Length%20Subarrays/README_EN.md) | `Array`,`Prefix Sum` | Easy | Weekly Contest 433 |
|
||
| 3428 | [Maximum and Minimum Sums of at Most Size K Subsequences](/solution/3400-3499/3428.Maximum%20and%20Minimum%20Sums%20of%20at%20Most%20Size%20K%20Subsequences/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics`,`Sorting` | Medium | Weekly Contest 433 |
|
||
| 3429 | [Paint House IV](/solution/3400-3499/3429.Paint%20House%20IV/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 433 |
|
||
| 3430 | [Maximum and Minimum Sums of at Most Size K Subarrays](/solution/3400-3499/3430.Maximum%20and%20Minimum%20Sums%20of%20at%20Most%20Size%20K%20Subarrays/README_EN.md) | `Stack`,`Array`,`Math`,`Monotonic Stack` | Hard | Weekly Contest 433 |
|
||
| 3431 | [Minimum Unlocked Indices to Sort Nums](/solution/3400-3499/3431.Minimum%20Unlocked%20Indices%20to%20Sort%20Nums/README_EN.md) | `Array`,`Hash Table` | Medium | 🔒 |
|
||
| 3432 | [Count Partitions with Even Sum Difference](/solution/3400-3499/3432.Count%20Partitions%20with%20Even%20Sum%20Difference/README_EN.md) | `Array`,`Math`,`Prefix Sum` | Easy | Weekly Contest 434 |
|
||
| 3433 | [Count Mentions Per User](/solution/3400-3499/3433.Count%20Mentions%20Per%20User/README_EN.md) | `Array`,`Math`,`Sorting`,`Simulation` | Medium | Weekly Contest 434 |
|
||
| 3434 | [Maximum Frequency After Subarray Operation](/solution/3400-3499/3434.Maximum%20Frequency%20After%20Subarray%20Operation/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Dynamic Programming`,`Enumeration`,`Prefix Sum` | Medium | Weekly Contest 434 |
|
||
| 3435 | [Frequencies of Shortest Supersequences](/solution/3400-3499/3435.Frequencies%20of%20Shortest%20Supersequences/README_EN.md) | `Bit Manipulation`,`Graph`,`Topological Sort`,`Array`,`String`,`Enumeration` | Hard | Weekly Contest 434 |
|
||
| 3436 | [Find Valid Emails](/solution/3400-3499/3436.Find%20Valid%20Emails/README_EN.md) | `Database` | Easy | |
|
||
| 3437 | [Permutations III](/solution/3400-3499/3437.Permutations%20III/README_EN.md) | `Array`,`Backtracking` | Medium | 🔒 |
|
||
| 3438 | [Find Valid Pair of Adjacent Digits in String](/solution/3400-3499/3438.Find%20Valid%20Pair%20of%20Adjacent%20Digits%20in%20String/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 149 |
|
||
| 3439 | [Reschedule Meetings for Maximum Free Time I](/solution/3400-3499/3439.Reschedule%20Meetings%20for%20Maximum%20Free%20Time%20I/README_EN.md) | `Greedy`,`Array`,`Sliding Window` | Medium | Biweekly Contest 149 |
|
||
| 3440 | [Reschedule Meetings for Maximum Free Time II](/solution/3400-3499/3440.Reschedule%20Meetings%20for%20Maximum%20Free%20Time%20II/README_EN.md) | `Greedy`,`Array`,`Enumeration` | Medium | Biweekly Contest 149 |
|
||
| 3441 | [Minimum Cost Good Caption](/solution/3400-3499/3441.Minimum%20Cost%20Good%20Caption/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 149 |
|
||
| 3442 | [Maximum Difference Between Even and Odd Frequency I](/solution/3400-3499/3442.Maximum%20Difference%20Between%20Even%20and%20Odd%20Frequency%20I/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 435 |
|
||
| 3443 | [Maximum Manhattan Distance After K Changes](/solution/3400-3499/3443.Maximum%20Manhattan%20Distance%20After%20K%20Changes/README_EN.md) | `Hash Table`,`Math`,`String`,`Counting` | Medium | Weekly Contest 435 |
|
||
| 3444 | [Minimum Increments for Target Multiples in an Array](/solution/3400-3499/3444.Minimum%20Increments%20for%20Target%20Multiples%20in%20an%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask`,`Number Theory` | Hard | Weekly Contest 435 |
|
||
| 3445 | [Maximum Difference Between Even and Odd Frequency II](/solution/3400-3499/3445.Maximum%20Difference%20Between%20Even%20and%20Odd%20Frequency%20II/README_EN.md) | `String`,`Enumeration`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 435 |
|
||
| 3446 | [Sort Matrix by Diagonals](/solution/3400-3499/3446.Sort%20Matrix%20by%20Diagonals/README_EN.md) | `Array`,`Matrix`,`Sorting` | Medium | Weekly Contest 436 |
|
||
| 3447 | [Assign Elements to Groups with Constraints](/solution/3400-3499/3447.Assign%20Elements%20to%20Groups%20with%20Constraints/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 436 |
|
||
| 3448 | [Count Substrings Divisible By Last Digit](/solution/3400-3499/3448.Count%20Substrings%20Divisible%20By%20Last%20Digit/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 436 |
|
||
| 3449 | [Maximize the Minimum Game Score](/solution/3400-3499/3449.Maximize%20the%20Minimum%20Game%20Score/README_EN.md) | `Greedy`,`Array`,`Binary Search` | Hard | Weekly Contest 436 |
|
||
| 3450 | [Maximum Students on a Single Bench](/solution/3400-3499/3450.Maximum%20Students%20on%20a%20Single%20Bench/README_EN.md) | `Array`,`Hash Table` | Easy | 🔒 |
|
||
| 3451 | [Find Invalid IP Addresses](/solution/3400-3499/3451.Find%20Invalid%20IP%20Addresses/README_EN.md) | `Database` | Hard | |
|
||
| 3452 | [Sum of Good Numbers](/solution/3400-3499/3452.Sum%20of%20Good%20Numbers/README_EN.md) | `Array` | Easy | Biweekly Contest 150 |
|
||
| 3453 | [Separate Squares I](/solution/3400-3499/3453.Separate%20Squares%20I/README_EN.md) | `Array`,`Binary Search` | Medium | Biweekly Contest 150 |
|
||
| 3454 | [Separate Squares II](/solution/3400-3499/3454.Separate%20Squares%20II/README_EN.md) | `Segment Tree`,`Array`,`Binary Search`,`Line Sweep` | Hard | Biweekly Contest 150 |
|
||
| 3455 | [Shortest Matching Substring](/solution/3400-3499/3455.Shortest%20Matching%20Substring/README_EN.md) | `Two Pointers`,`String`,`Binary Search`,`String Matching` | Hard | Biweekly Contest 150 |
|
||
| 3456 | [Find Special Substring of Length K](/solution/3400-3499/3456.Find%20Special%20Substring%20of%20Length%20K/README_EN.md) | `String` | Easy | Weekly Contest 437 |
|
||
| 3457 | [Eat Pizzas!](/solution/3400-3499/3457.Eat%20Pizzas%21/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 437 |
|
||
| 3458 | [Select K Disjoint Special Substrings](/solution/3400-3499/3458.Select%20K%20Disjoint%20Special%20Substrings/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 437 |
|
||
| 3459 | [Length of Longest V-Shaped Diagonal Segment](/solution/3400-3499/3459.Length%20of%20Longest%20V-Shaped%20Diagonal%20Segment/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 437 |
|
||
| 3460 | [Longest Common Prefix After at Most One Removal](/solution/3400-3499/3460.Longest%20Common%20Prefix%20After%20at%20Most%20One%20Removal/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 |
|
||
| 3461 | [Check If Digits Are Equal in String After Operations I](/solution/3400-3499/3461.Check%20If%20Digits%20Are%20Equal%20in%20String%20After%20Operations%20I/README_EN.md) | `Math`,`String`,`Combinatorics`,`Number Theory`,`Simulation` | Easy | Weekly Contest 438 |
|
||
| 3462 | [Maximum Sum With at Most K Elements](/solution/3400-3499/3462.Maximum%20Sum%20With%20at%20Most%20K%20Elements/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 438 |
|
||
| 3463 | [Check If Digits Are Equal in String After Operations II](/solution/3400-3499/3463.Check%20If%20Digits%20Are%20Equal%20in%20String%20After%20Operations%20II/README_EN.md) | `Math`,`String`,`Combinatorics`,`Number Theory` | Hard | Weekly Contest 438 |
|
||
| 3464 | [Maximize the Distance Between Points on a Square](/solution/3400-3499/3464.Maximize%20the%20Distance%20Between%20Points%20on%20a%20Square/README_EN.md) | `Greedy`,`Array`,`Binary Search` | Hard | Weekly Contest 438 |
|
||
| 3465 | [Find Products with Valid Serial Numbers](/solution/3400-3499/3465.Find%20Products%20with%20Valid%20Serial%20Numbers/README_EN.md) | `Database` | Easy | |
|
||
| 3466 | [Maximum Coin Collection](/solution/3400-3499/3466.Maximum%20Coin%20Collection/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 |
|
||
| 3467 | [Transform Array by Parity](/solution/3400-3499/3467.Transform%20Array%20by%20Parity/README_EN.md) | `Array`,`Counting`,`Sorting` | Easy | Biweekly Contest 151 |
|
||
| 3468 | [Find the Number of Copy Arrays](/solution/3400-3499/3468.Find%20the%20Number%20of%20Copy%20Arrays/README_EN.md) | `Array`,`Math` | Medium | Biweekly Contest 151 |
|
||
| 3469 | [Find Minimum Cost to Remove Array Elements](/solution/3400-3499/3469.Find%20Minimum%20Cost%20to%20Remove%20Array%20Elements/README_EN.md) | | Medium | Biweekly Contest 151 |
|
||
| 3470 | [Permutations IV](/solution/3400-3499/3470.Permutations%20IV/README_EN.md) | `Array`,`Math`,`Combinatorics`,`Enumeration` | Hard | Biweekly Contest 151 |
|
||
| 3471 | [Find the Largest Almost Missing Integer](/solution/3400-3499/3471.Find%20the%20Largest%20Almost%20Missing%20Integer/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 439 |
|
||
| 3472 | [Longest Palindromic Subsequence After at Most K Operations](/solution/3400-3499/3472.Longest%20Palindromic%20Subsequence%20After%20at%20Most%20K%20Operations/README_EN.md) | `String`,`Dynamic Programming` | Medium | Weekly Contest 439 |
|
||
| 3473 | [Sum of K Subarrays With Length at Least M](/solution/3400-3499/3473.Sum%20of%20K%20Subarrays%20With%20Length%20at%20Least%20M/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | Weekly Contest 439 |
|
||
| 3474 | [Lexicographically Smallest Generated String](/solution/3400-3499/3474.Lexicographically%20Smallest%20Generated%20String/README_EN.md) | `Greedy`,`String`,`String Matching` | Hard | Weekly Contest 439 |
|
||
| 3475 | [DNA Pattern Recognition](/solution/3400-3499/3475.DNA%20Pattern%20Recognition/README_EN.md) | | Medium | |
|
||
| 3476 | [Maximize Profit from Task Assignment](/solution/3400-3499/3476.Maximize%20Profit%20from%20Task%20Assignment/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | 🔒 |
|
||
| 3477 | [Fruits Into Baskets II](/solution/3400-3499/3477.Fruits%20Into%20Baskets%20II/README_EN.md) | `Segment Tree`,`Array`,`Binary Search`,`Simulation` | Easy | Weekly Contest 440 |
|
||
| 3478 | [Choose K Elements With Maximum Sum](/solution/3400-3499/3478.Choose%20K%20Elements%20With%20Maximum%20Sum/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 440 |
|
||
| 3479 | [Fruits Into Baskets III](/solution/3400-3499/3479.Fruits%20Into%20Baskets%20III/README_EN.md) | `Segment Tree`,`Array`,`Binary Search`,`Ordered Set` | Medium | Weekly Contest 440 |
|
||
| 3480 | [Maximize Subarrays After Removing One Conflicting Pair](/solution/3400-3499/3480.Maximize%20Subarrays%20After%20Removing%20One%20Conflicting%20Pair/README_EN.md) | `Segment Tree`,`Array`,`Enumeration`,`Prefix Sum` | Hard | Weekly Contest 440 |
|
||
| 3481 | [Apply Substitutions](/solution/3400-3499/3481.Apply%20Substitutions/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Array`,`Hash Table`,`String` | Medium | 🔒 |
|
||
| 3482 | [Analyze Organization Hierarchy](/solution/3400-3499/3482.Analyze%20Organization%20Hierarchy/README_EN.md) | `Database` | Hard | |
|
||
| 3483 | [Unique 3-Digit Even Numbers](/solution/3400-3499/3483.Unique%203-Digit%20Even%20Numbers/README_EN.md) | `Recursion`,`Array`,`Hash Table`,`Enumeration` | Easy | Biweekly Contest 152 |
|
||
| 3484 | [Design Spreadsheet](/solution/3400-3499/3484.Design%20Spreadsheet/README_EN.md) | `Design`,`Array`,`Hash Table`,`String`,`Matrix` | Medium | Biweekly Contest 152 |
|
||
| 3485 | [Longest Common Prefix of K Strings After Removal](/solution/3400-3499/3485.Longest%20Common%20Prefix%20of%20K%20Strings%20After%20Removal/README_EN.md) | `Trie`,`Array`,`String` | Hard | Biweekly Contest 152 |
|
||
| 3486 | [Longest Special Path II](/solution/3400-3499/3486.Longest%20Special%20Path%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Prefix Sum` | Hard | Biweekly Contest 152 |
|
||
| 3487 | [Maximum Unique Subarray Sum After Deletion](/solution/3400-3499/3487.Maximum%20Unique%20Subarray%20Sum%20After%20Deletion/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Easy | Weekly Contest 441 |
|
||
| 3488 | [Closest Equal Element Queries](/solution/3400-3499/3488.Closest%20Equal%20Element%20Queries/README_EN.md) | `Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 441 |
|
||
| 3489 | [Zero Array Transformation IV](/solution/3400-3499/3489.Zero%20Array%20Transformation%20IV/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 441 |
|
||
| 3490 | [Count Beautiful Numbers](/solution/3400-3499/3490.Count%20Beautiful%20Numbers/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 441 |
|
||
| 3491 | [Phone Number Prefix](/solution/3400-3499/3491.Phone%20Number%20Prefix/README_EN.md) | `Trie`,`Array`,`String`,`Sorting` | Easy | 🔒 |
|
||
| 3492 | [Maximum Containers on a Ship](/solution/3400-3499/3492.Maximum%20Containers%20on%20a%20Ship/README_EN.md) | `Math` | Easy | Weekly Contest 442 |
|
||
| 3493 | [Properties Graph](/solution/3400-3499/3493.Properties%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Medium | Weekly Contest 442 |
|
||
| 3494 | [Find the Minimum Amount of Time to Brew Potions](/solution/3400-3499/3494.Find%20the%20Minimum%20Amount%20of%20Time%20to%20Brew%20Potions/README_EN.md) | `Array`,`Prefix Sum`,`Simulation` | Medium | Weekly Contest 442 |
|
||
| 3495 | [Minimum Operations to Make Array Elements Zero](/solution/3400-3499/3495.Minimum%20Operations%20to%20Make%20Array%20Elements%20Zero/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Hard | Weekly Contest 442 |
|
||
| 3496 | [Maximize Score After Pair Deletions](/solution/3400-3499/3496.Maximize%20Score%20After%20Pair%20Deletions/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 |
|
||
| 3497 | [Analyze Subscription Conversion](/solution/3400-3499/3497.Analyze%20Subscription%20Conversion/README_EN.md) | `Database` | Medium | |
|
||
| 3498 | [Reverse Degree of a String](/solution/3400-3499/3498.Reverse%20Degree%20of%20a%20String/README_EN.md) | `String`,`Simulation` | Easy | Biweekly Contest 153 |
|
||
| 3499 | [Maximize Active Section with Trade I](/solution/3400-3499/3499.Maximize%20Active%20Section%20with%20Trade%20I/README_EN.md) | `String`,`Enumeration` | Medium | Biweekly Contest 153 |
|
||
| 3500 | [Minimum Cost to Divide Array Into Subarrays](/solution/3500-3599/3500.Minimum%20Cost%20to%20Divide%20Array%20Into%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Biweekly Contest 153 |
|
||
| 3501 | [Maximize Active Section with Trade II](/solution/3500-3599/3501.Maximize%20Active%20Section%20with%20Trade%20II/README_EN.md) | `Segment Tree`,`Array`,`String`,`Binary Search` | Hard | Biweekly Contest 153 |
|
||
| 3502 | [Minimum Cost to Reach Every Position](/solution/3500-3599/3502.Minimum%20Cost%20to%20Reach%20Every%20Position/README_EN.md) | `Array` | Easy | Weekly Contest 443 |
|
||
| 3503 | [Longest Palindrome After Substring Concatenation I](/solution/3500-3599/3503.Longest%20Palindrome%20After%20Substring%20Concatenation%20I/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming`,`Enumeration` | Medium | Weekly Contest 443 |
|
||
| 3504 | [Longest Palindrome After Substring Concatenation II](/solution/3500-3599/3504.Longest%20Palindrome%20After%20Substring%20Concatenation%20II/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Hard | Weekly Contest 443 |
|
||
| 3505 | [Minimum Operations to Make Elements Within K Subarrays Equal](/solution/3500-3599/3505.Minimum%20Operations%20to%20Make%20Elements%20Within%20K%20Subarrays%20Equal/README_EN.md) | `Array`,`Hash Table`,`Math`,`Dynamic Programming`,`Sliding Window`,`Heap (Priority Queue)` | Hard | Weekly Contest 443 |
|
||
| 3506 | [Find Time Required to Eliminate Bacterial Strains](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README_EN.md) | `Greedy`,`Array`,`Math`,`Heap (Priority Queue)` | Hard | 🔒 |
|
||
| 3507 | [Minimum Pair Removal to Sort Array I](/solution/3500-3599/3507.Minimum%20Pair%20Removal%20to%20Sort%20Array%20I/README_EN.md) | `Array`,`Hash Table`,`Linked List`,`Doubly-Linked List`,`Ordered Set`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 444 |
|
||
| 3508 | [Implement Router](/solution/3500-3599/3508.Implement%20Router/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Binary Search`,`Ordered Set` | Medium | Weekly Contest 444 |
|
||
| 3509 | [Maximum Product of Subsequences With an Alternating Sum Equal to K](/solution/3500-3599/3509.Maximum%20Product%20of%20Subsequences%20With%20an%20Alternating%20Sum%20Equal%20to%20K/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Hard | Weekly Contest 444 |
|
||
| 3510 | [Minimum Pair Removal to Sort Array II](/solution/3500-3599/3510.Minimum%20Pair%20Removal%20to%20Sort%20Array%20II/README_EN.md) | `Array`,`Hash Table`,`Linked List`,`Doubly-Linked List`,`Ordered Set`,`Simulation`,`Heap (Priority Queue)` | Hard | Weekly Contest 444 |
|
||
| 3511 | [Make a Positive Array](/solution/3500-3599/3511.Make%20a%20Positive%20Array/README_EN.md) | `Greedy`,`Array`,`Prefix Sum` | Medium | 🔒 |
|
||
| 3512 | [Minimum Operations to Make Array Sum Divisible by K](/solution/3500-3599/3512.Minimum%20Operations%20to%20Make%20Array%20Sum%20Divisible%20by%20K/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 154 |
|
||
| 3513 | [Number of Unique XOR Triplets I](/solution/3500-3599/3513.Number%20of%20Unique%20XOR%20Triplets%20I/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | Biweekly Contest 154 |
|
||
| 3514 | [Number of Unique XOR Triplets II](/solution/3500-3599/3514.Number%20of%20Unique%20XOR%20Triplets%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Enumeration` | Medium | Biweekly Contest 154 |
|
||
| 3515 | [Shortest Path in a Weighted Tree](/solution/3500-3599/3515.Shortest%20Path%20in%20a%20Weighted%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Indexed Tree`,`Segment Tree`,`Array` | Hard | Biweekly Contest 154 |
|
||
| 3516 | [Find Closest Person](/solution/3500-3599/3516.Find%20Closest%20Person/README_EN.md) | `Math` | Easy | Weekly Contest 445 |
|
||
| 3517 | [Smallest Palindromic Rearrangement I](/solution/3500-3599/3517.Smallest%20Palindromic%20Rearrangement%20I/README_EN.md) | `String`,`Counting Sort`,`Sorting` | Medium | Weekly Contest 445 |
|
||
| 3518 | [Smallest Palindromic Rearrangement II](/solution/3500-3599/3518.Smallest%20Palindromic%20Rearrangement%20II/README_EN.md) | `Hash Table`,`Math`,`String`,`Combinatorics`,`Counting` | Hard | Weekly Contest 445 |
|
||
| 3519 | [Count Numbers with Non-Decreasing Digits](/solution/3500-3599/3519.Count%20Numbers%20with%20Non-Decreasing%20Digits/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Weekly Contest 445 |
|
||
| 3520 | [Minimum Threshold for Inversion Pairs Count](/solution/3500-3599/3520.Minimum%20Threshold%20for%20Inversion%20Pairs%20Count/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search` | Medium | 🔒 |
|
||
| 3521 | [Find Product Recommendation Pairs](/solution/3500-3599/3521.Find%20Product%20Recommendation%20Pairs/README_EN.md) | `Database` | Medium | |
|
||
| 3522 | [Calculate Score After Performing Instructions](/solution/3500-3599/3522.Calculate%20Score%20After%20Performing%20Instructions/README_EN.md) | `Array`,`Hash Table`,`String`,`Simulation` | Medium | Weekly Contest 446 |
|
||
| 3523 | [Make Array Non-decreasing](/solution/3500-3599/3523.Make%20Array%20Non-decreasing/README_EN.md) | `Stack`,`Greedy`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 446 |
|
||
| 3524 | [Find X Value of Array I](/solution/3500-3599/3524.Find%20X%20Value%20of%20Array%20I/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | Weekly Contest 446 |
|
||
| 3525 | [Find X Value of Array II](/solution/3500-3599/3525.Find%20X%20Value%20of%20Array%20II/README_EN.md) | `Segment Tree`,`Array`,`Math` | Hard | Weekly Contest 446 |
|
||
| 3526 | [Range XOR Queries with Subarray Reversals](/solution/3500-3599/3526.Range%20XOR%20Queries%20with%20Subarray%20Reversals/README_EN.md) | `Tree`,`Array`,`Binary Tree` | Hard | 🔒 |
|
||
| 3527 | [Find the Most Common Response](/solution/3500-3599/3527.Find%20the%20Most%20Common%20Response/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 155 |
|
||
| 3528 | [Unit Conversion I](/solution/3500-3599/3528.Unit%20Conversion%20I/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Biweekly Contest 155 |
|
||
| 3529 | [Count Cells in Overlapping Horizontal and Vertical Substrings](/solution/3500-3599/3529.Count%20Cells%20in%20Overlapping%20Horizontal%20and%20Vertical%20Substrings/README_EN.md) | `Array`,`String`,`Matrix`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Biweekly Contest 155 |
|
||
| 3530 | [Maximum Profit from Valid Topological Order in DAG](/solution/3500-3599/3530.Maximum%20Profit%20from%20Valid%20Topological%20Order%20in%20DAG/README_EN.md) | `Bit Manipulation`,`Graph`,`Topological Sort`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 155 |
|
||
| 3531 | [Count Covered Buildings](/solution/3500-3599/3531.Count%20Covered%20Buildings/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 447 |
|
||
| 3532 | [Path Existence Queries in a Graph I](/solution/3500-3599/3532.Path%20Existence%20Queries%20in%20a%20Graph%20I/README_EN.md) | `Union Find`,`Graph`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 447 |
|
||
| 3533 | [Concatenated Divisibility](/solution/3500-3599/3533.Concatenated%20Divisibility/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 447 |
|
||
| 3534 | [Path Existence Queries in a Graph II](/solution/3500-3599/3534.Path%20Existence%20Queries%20in%20a%20Graph%20II/README_EN.md) | `Greedy`,`Graph`,`Array`,`Binary Search`,`Sorting` | Hard | Weekly Contest 447 |
|
||
| 3535 | [Unit Conversion II](/solution/3500-3599/3535.Unit%20Conversion%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`Math` | Medium | 🔒 |
|
||
| 3536 | [Maximum Product of Two Digits](/solution/3500-3599/3536.Maximum%20Product%20of%20Two%20Digits/README_EN.md) | `Math`,`Sorting` | Easy | Weekly Contest 448 |
|
||
| 3537 | [Fill a Special Grid](/solution/3500-3599/3537.Fill%20a%20Special%20Grid/README_EN.md) | `Array`,`Divide and Conquer`,`Matrix` | Medium | Weekly Contest 448 |
|
||
| 3538 | [Merge Operations for Minimum Travel Time](/solution/3500-3599/3538.Merge%20Operations%20for%20Minimum%20Travel%20Time/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 448 |
|
||
| 3539 | [Find Sum of Array Product of Magical Sequences](/solution/3500-3599/3539.Find%20Sum%20of%20Array%20Product%20of%20Magical%20Sequences/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask`,`Combinatorics` | Hard | Weekly Contest 448 |
|
||
| 3540 | [Minimum Time to Visit All Houses](/solution/3500-3599/3540.Minimum%20Time%20to%20Visit%20All%20Houses/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 |
|
||
| 3541 | [Find Most Frequent Vowel and Consonant](/solution/3500-3599/3541.Find%20Most%20Frequent%20Vowel%20and%20Consonant/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 156 |
|
||
| 3542 | [Minimum Operations to Convert All Elements to Zero](/solution/3500-3599/3542.Minimum%20Operations%20to%20Convert%20All%20Elements%20to%20Zero/README_EN.md) | `Stack`,`Greedy`,`Array`,`Hash Table`,`Monotonic Stack` | Medium | Biweekly Contest 156 |
|
||
| 3543 | [Maximum Weighted K-Edge Path](/solution/3500-3599/3543.Maximum%20Weighted%20K-Edge%20Path/README_EN.md) | `Graph`,`Hash Table`,`Dynamic Programming` | Medium | Biweekly Contest 156 |
|
||
| 3544 | [Subtree Inversion Sum](/solution/3500-3599/3544.Subtree%20Inversion%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 156 |
|
||
| 3545 | [Minimum Deletions for At Most K Distinct Characters](/solution/3500-3599/3545.Minimum%20Deletions%20for%20At%20Most%20K%20Distinct%20Characters/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Easy | Weekly Contest 449 |
|
||
| 3546 | [Equal Sum Grid Partition I](/solution/3500-3599/3546.Equal%20Sum%20Grid%20Partition%20I/README_EN.md) | `Array`,`Enumeration`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 449 |
|
||
| 3547 | [Maximum Sum of Edge Values in a Graph](/solution/3500-3599/3547.Maximum%20Sum%20of%20Edge%20Values%20in%20a%20Graph/README_EN.md) | `Greedy`,`Depth-First Search`,`Graph`,`Sorting` | Hard | Weekly Contest 449 |
|
||
| 3548 | [Equal Sum Grid Partition II](/solution/3500-3599/3548.Equal%20Sum%20Grid%20Partition%20II/README_EN.md) | `Array`,`Hash Table`,`Enumeration`,`Matrix`,`Prefix Sum` | Hard | Weekly Contest 449 |
|
||
| 3549 | [Multiply Two Polynomials](/solution/3500-3599/3549.Multiply%20Two%20Polynomials/README_EN.md) | `Array`,`Math` | Hard | 🔒 |
|
||
| 3550 | [Smallest Index With Digit Sum Equal to Index](/solution/3500-3599/3550.Smallest%20Index%20With%20Digit%20Sum%20Equal%20to%20Index/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 450 |
|
||
| 3551 | [Minimum Swaps to Sort by Digit Sum](/solution/3500-3599/3551.Minimum%20Swaps%20to%20Sort%20by%20Digit%20Sum/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 450 |
|
||
| 3552 | [Grid Teleportation Traversal](/solution/3500-3599/3552.Grid%20Teleportation%20Traversal/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 450 |
|
||
| 3553 | [Minimum Weighted Subgraph With the Required Paths II](/solution/3500-3599/3553.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Array` | Hard | Weekly Contest 450 |
|
||
| 3554 | [Find Category Recommendation Pairs](/solution/3500-3599/3554.Find%20Category%20Recommendation%20Pairs/README_EN.md) | `Database` | Hard | |
|
||
| 3555 | [Smallest Subarray to Sort in Every Sliding Window](/solution/3500-3599/3555.Smallest%20Subarray%20to%20Sort%20in%20Every%20Sliding%20Window/README_EN.md) | `Stack`,`Greedy`,`Array`,`Two Pointers`,`Sorting`,`Monotonic Stack` | Medium | 🔒 |
|
||
| 3556 | [Sum of Largest Prime Substrings](/solution/3500-3599/3556.Sum%20of%20Largest%20Prime%20Substrings/README_EN.md) | `Hash Table`,`Math`,`String`,`Number Theory`,`Sorting` | Medium | Biweekly Contest 157 |
|
||
| 3557 | [Find Maximum Number of Non Intersecting Substrings](/solution/3500-3599/3557.Find%20Maximum%20Number%20of%20Non%20Intersecting%20Substrings/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 157 |
|
||
| 3558 | [Number of Ways to Assign Edge Weights I](/solution/3500-3599/3558.Number%20of%20Ways%20to%20Assign%20Edge%20Weights%20I/README_EN.md) | `Tree`,`Depth-First Search`,`Math` | Medium | Biweekly Contest 157 |
|
||
| 3559 | [Number of Ways to Assign Edge Weights II](/solution/3500-3599/3559.Number%20of%20Ways%20to%20Assign%20Edge%20Weights%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Math`,`Dynamic Programming` | Hard | Biweekly Contest 157 |
|
||
| 3560 | [Find Minimum Log Transportation Cost](/solution/3500-3599/3560.Find%20Minimum%20Log%20Transportation%20Cost/README_EN.md) | `Math` | Easy | Weekly Contest 451 |
|
||
| 3561 | [Resulting String After Adjacent Removals](/solution/3500-3599/3561.Resulting%20String%20After%20Adjacent%20Removals/README_EN.md) | `Stack`,`String`,`Simulation` | Medium | Weekly Contest 451 |
|
||
| 3562 | [Maximum Profit from Trading Stocks with Discounts](/solution/3500-3599/3562.Maximum%20Profit%20from%20Trading%20Stocks%20with%20Discounts/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 451 |
|
||
| 3563 | [Lexicographically Smallest String After Adjacent Removals](/solution/3500-3599/3563.Lexicographically%20Smallest%20String%20After%20Adjacent%20Removals/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 451 |
|
||
| 3564 | [Seasonal Sales Analysis](/solution/3500-3599/3564.Seasonal%20Sales%20Analysis/README_EN.md) | `Database` | Medium | |
|
||
| 3565 | [Sequential Grid Path Cover](/solution/3500-3599/3565.Sequential%20Grid%20Path%20Cover/README_EN.md) | `Recursion`,`Array`,`Matrix` | Medium | 🔒 |
|
||
| 3566 | [Partition Array into Two Equal Product Subsets](/solution/3500-3599/3566.Partition%20Array%20into%20Two%20Equal%20Product%20Subsets/README_EN.md) | `Bit Manipulation`,`Recursion`,`Array`,`Enumeration` | Medium | Weekly Contest 452 |
|
||
| 3567 | [Minimum Absolute Difference in Sliding Submatrix](/solution/3500-3599/3567.Minimum%20Absolute%20Difference%20in%20Sliding%20Submatrix/README_EN.md) | `Array`,`Matrix`,`Sorting` | Medium | Weekly Contest 452 |
|
||
| 3568 | [Minimum Moves to Clean the Classroom](/solution/3500-3599/3568.Minimum%20Moves%20to%20Clean%20the%20Classroom/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 452 |
|
||
| 3569 | [Maximize Count of Distinct Primes After Split](/solution/3500-3599/3569.Maximize%20Count%20of%20Distinct%20Primes%20After%20Split/README_EN.md) | `Segment Tree`,`Array`,`Math`,`Number Theory` | Hard | Weekly Contest 452 |
|
||
| 3570 | [Find Books with No Available Copies](/solution/3500-3599/3570.Find%20Books%20with%20No%20Available%20Copies/README_EN.md) | `Database` | Easy | |
|
||
| 3571 | [Find the Shortest Superstring II](/solution/3500-3599/3571.Find%20the%20Shortest%20Superstring%20II/README_EN.md) | `String` | Easy | 🔒 |
|
||
| 3572 | [Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values](/solution/3500-3599/3572.Maximize%20Y%E2%80%91Sum%20by%20Picking%20a%20Triplet%20of%20Distinct%20X%E2%80%91Values/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 158 |
|
||
| 3573 | [Best Time to Buy and Sell Stock V](/solution/3500-3599/3573.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20V/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 158 |
|
||
| 3574 | [Maximize Subarray GCD Score](/solution/3500-3599/3574.Maximize%20Subarray%20GCD%20Score/README_EN.md) | `Array`,`Math`,`Enumeration`,`Number Theory` | Hard | Biweekly Contest 158 |
|
||
| 3575 | [Maximum Good Subtree Score](/solution/3500-3599/3575.Maximum%20Good%20Subtree%20Score/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 158 |
|
||
| 3576 | [Transform Array to All Equal Elements](/solution/3500-3599/3576.Transform%20Array%20to%20All%20Equal%20Elements/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 453 |
|
||
| 3577 | [Count the Number of Computer Unlocking Permutations](/solution/3500-3599/3577.Count%20the%20Number%20of%20Computer%20Unlocking%20Permutations/README_EN.md) | `Brainteaser`,`Array`,`Math`,`Combinatorics` | Medium | Weekly Contest 453 |
|
||
| 3578 | [Count Partitions With Max-Min Difference at Most K](/solution/3500-3599/3578.Count%20Partitions%20With%20Max-Min%20Difference%20at%20Most%20K/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Prefix Sum`,`Sliding Window`,`Monotonic Queue` | Medium | Weekly Contest 453 |
|
||
| 3579 | [Minimum Steps to Convert String with Operations](/solution/3500-3599/3579.Minimum%20Steps%20to%20Convert%20String%20with%20Operations/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Hard | Weekly Contest 453 |
|
||
| 3580 | [Find Consistently Improving Employees](/solution/3500-3599/3580.Find%20Consistently%20Improving%20Employees/README_EN.md) | `Database` | Medium | |
|
||
| 3581 | [Count Odd Letters from Number](/solution/3500-3599/3581.Count%20Odd%20Letters%20from%20Number/README_EN.md) | `Hash Table`,`String`,`Counting`,`Simulation` | Easy | 🔒 |
|
||
| 3582 | [Generate Tag for Video Caption](/solution/3500-3599/3582.Generate%20Tag%20for%20Video%20Caption/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 454 |
|
||
| 3583 | [Count Special Triplets](/solution/3500-3599/3583.Count%20Special%20Triplets/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 454 |
|
||
| 3584 | [Maximum Product of First and Last Elements of a Subsequence](/solution/3500-3599/3584.Maximum%20Product%20of%20First%20and%20Last%20Elements%20of%20a%20Subsequence/README_EN.md) | `Array`,`Two Pointers` | Medium | Weekly Contest 454 |
|
||
| 3585 | [Find Weighted Median Node in Tree](/solution/3500-3599/3585.Find%20Weighted%20Median%20Node%20in%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 454 |
|
||
| 3586 | [Find COVID Recovery Patients](/solution/3500-3599/3586.Find%20COVID%20Recovery%20Patients/README_EN.md) | `Database` | Medium | |
|
||
| 3587 | [Minimum Adjacent Swaps to Alternate Parity](/solution/3500-3599/3587.Minimum%20Adjacent%20Swaps%20to%20Alternate%20Parity/README_EN.md) | `Greedy`,`Array` | Medium | Biweekly Contest 159 |
|
||
| 3588 | [Find Maximum Area of a Triangle](/solution/3500-3599/3588.Find%20Maximum%20Area%20of%20a%20Triangle/README_EN.md) | `Greedy`,`Geometry`,`Array`,`Hash Table`,`Math`,`Enumeration` | Medium | Biweekly Contest 159 |
|
||
| 3589 | [Count Prime-Gap Balanced Subarrays](/solution/3500-3599/3589.Count%20Prime-Gap%20Balanced%20Subarrays/README_EN.md) | `Queue`,`Array`,`Math`,`Number Theory`,`Sliding Window`,`Monotonic Queue` | Medium | Biweekly Contest 159 |
|
||
| 3590 | [Kth Smallest Path XOR Sum](/solution/3500-3599/3590.Kth%20Smallest%20Path%20XOR%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Ordered Set` | Hard | Biweekly Contest 159 |
|
||
| 3591 | [Check if Any Element Has Prime Frequency](/solution/3500-3599/3591.Check%20if%20Any%20Element%20Has%20Prime%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Easy | Weekly Contest 455 |
|
||
| 3592 | [Inverse Coin Change](/solution/3500-3599/3592.Inverse%20Coin%20Change/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 455 |
|
||
| 3593 | [Minimum Increments to Equalize Leaf Paths](/solution/3500-3599/3593.Minimum%20Increments%20to%20Equalize%20Leaf%20Paths/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 455 |
|
||
| 3594 | [Minimum Time to Transport All Individuals](/solution/3500-3599/3594.Minimum%20Time%20to%20Transport%20All%20Individuals/README_EN.md) | `Bit Manipulation`,`Graph`,`Array`,`Dynamic Programming`,`Bitmask`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 455 |
|
||
| 3595 | [Once Twice](/solution/3500-3599/3595.Once%20Twice/README_EN.md) | `Bit Manipulation`,`Array` | Medium | 🔒 |
|
||
| 3596 | [Minimum Cost Path with Alternating Directions I](/solution/3500-3599/3596.Minimum%20Cost%20Path%20with%20Alternating%20Directions%20I/README_EN.md) | `Brainteaser`,`Math` | Medium | 🔒 |
|
||
| 3597 | [Partition String](/solution/3500-3599/3597.Partition%20String/README_EN.md) | `Trie`,`Hash Table`,`String`,`Simulation` | Medium | Weekly Contest 456 |
|
||
| 3598 | [Longest Common Prefix Between Adjacent Strings After Removals](/solution/3500-3599/3598.Longest%20Common%20Prefix%20Between%20Adjacent%20Strings%20After%20Removals/README_EN.md) | `Array`,`String` | Medium | Weekly Contest 456 |
|
||
| 3599 | [Partition Array to Minimize XOR](/solution/3500-3599/3599.Partition%20Array%20to%20Minimize%20XOR/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Prefix Sum` | Medium | Weekly Contest 456 |
|
||
| 3600 | [Maximize Spanning Tree Stability with Upgrades](/solution/3600-3699/3600.Maximize%20Spanning%20Tree%20Stability%20with%20Upgrades/README_EN.md) | `Greedy`,`Union Find`,`Graph`,`Binary Search`,`Minimum Spanning Tree` | Hard | Weekly Contest 456 |
|
||
| 3601 | [Find Drivers with Improved Fuel Efficiency](/solution/3600-3699/3601.Find%20Drivers%20with%20Improved%20Fuel%20Efficiency/README_EN.md) | `Database` | Medium | |
|
||
| 3602 | [Hexadecimal and Hexatrigesimal Conversion](/solution/3600-3699/3602.Hexadecimal%20and%20Hexatrigesimal%20Conversion/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 160 |
|
||
| 3603 | [Minimum Cost Path with Alternating Directions II](/solution/3600-3699/3603.Minimum%20Cost%20Path%20with%20Alternating%20Directions%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Biweekly Contest 160 |
|
||
| 3604 | [Minimum Time to Reach Destination in Directed Graph](/solution/3600-3699/3604.Minimum%20Time%20to%20Reach%20Destination%20in%20Directed%20Graph/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Biweekly Contest 160 |
|
||
| 3605 | [Minimum Stability Factor of Array](/solution/3600-3699/3605.Minimum%20Stability%20Factor%20of%20Array/README_EN.md) | `Greedy`,`Segment Tree`,`Array`,`Math`,`Binary Search`,`Number Theory` | Hard | Biweekly Contest 160 |
|
||
| 3606 | [Coupon Code Validator](/solution/3600-3699/3606.Coupon%20Code%20Validator/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Easy | Weekly Contest 457 |
|
||
| 3607 | [Power Grid Maintenance](/solution/3600-3699/3607.Power%20Grid%20Maintenance/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 457 |
|
||
| 3608 | [Minimum Time for K Connected Components](/solution/3600-3699/3608.Minimum%20Time%20for%20K%20Connected%20Components/README_EN.md) | `Union Find`,`Graph`,`Binary Search`,`Sorting` | Medium | Weekly Contest 457 |
|
||
| 3609 | [Minimum Moves to Reach Target in Grid](/solution/3600-3699/3609.Minimum%20Moves%20to%20Reach%20Target%20in%20Grid/README_EN.md) | `Math` | Hard | Weekly Contest 457 |
|
||
| 3610 | [Minimum Number of Primes to Sum to Target](/solution/3600-3699/3610.Minimum%20Number%20of%20Primes%20to%20Sum%20to%20Target/README_EN.md) | | Medium | 🔒 |
|
||
| 3611 | [Find Overbooked Employees](/solution/3600-3699/3611.Find%20Overbooked%20Employees/README_EN.md) | `Database` | Medium | |
|
||
| 3612 | [Process String with Special Operations I](/solution/3600-3699/3612.Process%20String%20with%20Special%20Operations%20I/README_EN.md) | `String`,`Simulation` | Medium | Weekly Contest 458 |
|
||
| 3613 | [Minimize Maximum Component Cost](/solution/3600-3699/3613.Minimize%20Maximum%20Component%20Cost/README_EN.md) | `Sort`,`Union Find`,`Graph`,`Binary Search` | Medium | Weekly Contest 458 |
|
||
| 3614 | [Process String with Special Operations II](/solution/3600-3699/3614.Process%20String%20with%20Special%20Operations%20II/README_EN.md) | `String`,`Simulation` | Hard | Weekly Contest 458 |
|
||
| 3615 | [Longest Palindromic Path in Graph](/solution/3600-3699/3615.Longest%20Palindromic%20Path%20in%20Graph/README_EN.md) | `Bit Manipulation`,`Graph`,`String`,`Dynamic Programming` | Hard | Weekly Contest 458 |
|
||
| 3616 | [Number of Student Replacements](/solution/3600-3699/3616.Number%20of%20Student%20Replacements/README_EN.md) | | Medium | 🔒 |
|
||
| 3617 | [Find Students with Study Spiral Pattern](/solution/3600-3699/3617.Find%20Students%20with%20Study%20Spiral%20Pattern/README_EN.md) | | Hard | |
|
||
|
||
## Copyright
|
||
|
||
The copyright of this project belongs to [Doocs](https://github.com/doocs) community. For commercial reprints, please contact [@yanglbme](mailto:contact@yanglibin.info) for authorization. For non-commercial reprints, please indicate the source.
|
||
|
||
## Contact Us
|
||
|
||
We welcome everyone to add @yanglbme's personal WeChat (WeChat ID: YLB0109), with the note "leetcode". In the future, we will create algorithm and technology related discussion groups, where we can learn and share experiences together, and make progress together.
|
||
|
||
| <img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/images/qrcode-for-yanglbme-en.png" width="260px" align="left"/> |
|
||
| --------------------------------------------------------------------------------------------------------------------------------- |
|
||
|
||
## License
|
||
|
||
This work is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by-sa/4.0/">Creative Commons Attribution-ShareAlike 4.0 International License</a>. |