| 1 |
Two Sum |
Array
Hash Table |
⚠ |
Solution
|
| 2 |
Add Two Numbers |
Linked List
Math |
⚠⚠ |
Solution
|
| 3 |
Longest Substring Without Repeating Characters |
String
Hash Table
Sliding Window |
⚠⚠ |
Solution
|
| 4 |
Median of Two Sorted Arrays |
Binary Search
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 5 |
Longest Palindromic Substring |
String
Palindrome
Manacher's algorithm |
⚠⚠ |
Solution
|
| 6 |
Zigzag Conversion |
String |
⚠⚠ |
Solution
|
| 7 |
Reverse Integer |
String |
⚠⚠ |
Solution
|
| 8 |
String to Integer (atoi) |
String |
⚠⚠ |
Solution
|
| 9 |
Palindrome Number |
Palindrome
Math |
⚠ |
Solution
|
| 10 |
Regular Expression Matching |
String
Dynamic Programming
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 11 |
Container With Most Water |
Two Pointers
Greedy
Array |
⚠⚠ |
Solution
|
| 12 |
Integer to Roman |
Math |
⚠⚠ |
Solution
|
| 13 |
Roman to Integer |
Math |
⚠ |
Solution
|
| 14 |
Longest Common Prefix |
String |
⚠ |
Solution
|
| 15 |
3Sum |
Two Pointers |
⚠⚠ |
Solution
|
| 16 |
3Sum Closest |
Two Pointers |
⚠⚠ |
Solution
|
| 17 |
Letter Combinations of a Phone Number |
Backtracking
String |
⚠⚠ |
Solution
|
| 18 |
4Sum |
Two Pointers |
⚠⚠ |
Solution
|
| 19 |
Remove Nth Node From End of List |
Linked List
Two Pointers |
⚠⚠ |
Solution
|
| 20 |
Valid Parentheses |
Stack |
⚠ |
Solution
|
| 21 |
Merge Two Sorted Lists |
Linked List |
⚠ |
Solution
|
| 22 |
Generate Parentheses |
DFS |
⚠⚠ |
Solution
|
| 23 |
Merge k Sorted Lists |
Linked List
Priority Queue |
⚠⚠⚠ |
Solution
|
| 24 |
Swap Nodes in Pairs |
Linked List |
⚠⚠ |
Solution
|
| 25 |
Reverse Nodes in k-Group |
Linked List |
⚠⚠⚠ |
Solution
|
| 26 |
Remove Duplicates from Sorted Array |
Two Pointers |
⚠ |
Solution
|
| 27 |
Remove Element |
Two Pointers |
⚠ |
Solution
|
| 28 |
Find the Index of the First Occurrence in a String |
String Matching |
⚠ |
Solution
|
| 29 |
Divide Two Integers |
Math
Bitwise Operation |
⚠⚠ |
Solution
|
| 30 |
Substring with Concatenation of All Words |
Sliding Window
Hash Table |
⚠⚠⚠ |
Solution
|
| 31 |
Next Permutation |
Math
DO IT AGAIN |
⚠⚠ |
Solution
|
| 32 |
Longest Valid Parentheses |
Stack
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 33 |
Search in Rotated Sorted Array |
Binary Search |
⚠⚠ |
Solution
|
| 34 |
Find First and Last Position of Element in Sorted Array |
Binary Search |
⚠⚠ |
Solution
|
| 35 |
Search Insert Position |
|
⚠ |
Solution
|
| 36 |
Valid Sudoku |
Hash Table |
⚠⚠ |
Solution
|
| 37 |
Sudoku Solver |
Backtrack |
⚠⚠⚠ |
Solution
|
| 38 |
Count and Say |
|
⚠⚠ |
Solution
|
| 39 |
Combination Sum |
DFS |
⚠⚠ |
Solution
|
| 40 |
Combination Sum II |
DFS |
⚠⚠ |
Solution
|
| 41 |
First Missing Positive |
In-place Hash |
⚠⚠⚠ |
Solution
|
| 42 |
Trapping Rain Water |
Two Pointer
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 43 |
Multiply Strings |
Math |
⚠⚠ |
Solution
|
| 44 |
Wildcard Matching |
Backtrack
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 45 |
Jump Game II |
Dynamic Programming
Greedy |
⚠⚠ |
Solution
|
| 46 |
Permutations |
Math
DFS |
⚠⚠ |
Solution
|
| 47 |
Permutations II |
|
⚠⚠ |
Solution
|
| 48 |
Rotate Image |
|
⚠⚠ |
Solution
|
| 49 |
Group Anagrams |
String |
⚠⚠ |
Solution
|
| 50 |
Pow(x, n) |
Math |
⚠⚠ |
Solution
|
| 51 |
N-Queens |
DFS |
⚠⚠⚠ |
Solution
|
| 52 |
N-Queens II |
DFS |
⚠⚠⚠ |
Solution
|
| 53 |
Maximum Subarray |
Dynamic Programming
DO IT AGAIN |
⚠⚠ |
Solution
|
| 54 |
Spiral Matrix |
|
⚠⚠ |
Solution
|
| 55 |
Jump Game |
|
⚠⚠ |
Solution
|
| 56 |
Merge Intervals |
Sort |
⚠⚠ |
Solution
|
| 57 |
Insert Interval |
|
⚠⚠ |
Solution
|
| 58 |
Length of Last Word |
String |
⚠ |
Solution
|
| 59 |
Spiral Matrix II |
|
⚠⚠ |
Solution
|
| 60 |
Permutation Sequence |
Math
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 61 |
Rotate List |
Linked List |
⚠⚠ |
Solution
|
| 62 |
Unique Paths |
Dynamic Programming |
⚠⚠ |
Solution
|
| 63 |
Unique Paths II |
Dynamic Programming |
⚠⚠ |
Solution
|
| 64 |
Minimum Path Sum |
Dynamic Programming |
⚠⚠ |
Solution
|
| 65 |
Valid Number |
String
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 66 |
Plus One |
Math |
⚠ |
Solution
|
| 67 |
Add Binary |
Math |
⚠ |
Solution
|
| 68 |
Text Justification |
String
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 69 |
Sqrt(x) |
Math
Binary Search |
⚠ |
Solution
|
| 70 |
Climbing Stairs |
Dynamic Programming |
⚠ |
Solution
|
| 71 |
Simplify Path |
String |
⚠⚠ |
Solution
|
| 72 |
Edit Distance |
Dynamic Programming， DO IT AGAIN |
⚠⚠ |
Solution
|
| 73 |
Set Matrix Zeroes |
|
⚠⚠ |
Solution
|
| 74 |
Search a 2D Matrix |
Binary Search
DO IT AGAIN |
⚠⚠ |
Solution
|
| 75 |
Sort Colors |
|
⚠⚠ |
Solution
|
| 76 |
Minimum Window Substring |
String
Sliding Window
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 77 |
Combinations |
DFS |
⚠⚠ |
Solution
|
| 78 |
Subsets |
DFS |
⚠⚠ |
Solution
|
| 79 |
Word Search |
DFS |
⚠⚠ |
Solution
|
| 80 |
Remove Duplicates from Sorted Array II |
Two Pointers |
⚠⚠ |
Solution
|
| 81 |
Search in Rotated Sorted Array II |
Binary Search |
⚠⚠ |
Solution
|
| 82 |
Remove Duplicates from Sorted List II |
Two Pointers
Linked List |
⚠⚠ |
Solution
|
| 83 |
Remove Duplicates from Sorted List |
Linked List |
⚠ |
Solution
|
| 84 |
Largest Rectangle in Histogram |
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 85 |
Maximal Rectangle |
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 86 |
Partition List |
Linked List
Two Pointers |
⚠⚠ |
Solution
|
| 87 |
Scramble String |
Dynamic Programming
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 88 |
Merge Sorted Array |
Two Pointers |
⚠ |
Solution
|
| 89 |
Gray Code |
Math |
⚠⚠ |
Solution
|
| 90 |
Subsets II |
DFS |
⚠⚠ |
Solution
|
| 91 |
Decode Ways |
DFS
Dynamic Programming |
⚠⚠ |
Solution
|
| 92 |
Reverse Linked List II |
Linked List |
⚠⚠ |
Solution
|
| 93 |
Restore IP Addresses |
DFS |
⚠⚠ |
Solution
|
| 94 |
Binary Tree Inorder Traversal |
Tree |
⚠ |
Solution
|
| 95 |
Unique Binary Search Trees II |
Tree， DO IT AGAIN |
⚠⚠ |
Solution
|
| 96 |
Unique Binary Search Trees |
Dynamic Programming， DO IT AGAIN |
⚠⚠ |
Solution
|
| 97 |
Interleaving String |
Dynamic Programming |
⚠⚠ |
Solution
|
| 98 |
Validate Binary Search Tree |
Tree |
⚠⚠ |
Solution
|
| 99 |
Recover Binary Search Tree |
Tree |
⚠⚠ |
Solution
|
| 100 |
Same Tree |
Tree |
⚠ |
Solution
|
| 101 |
Symmetric Tree |
Tree |
⚠ |
Solution
|
| 102 |
Binary Tree Level Order Traversal |
Tree
BFS |
⚠⚠ |
Solution
|
| 103 |
Binary Tree Zigzag Level Order Traversal |
|
⚠⚠ |
Solution
|
| 104 |
Maximum Depth of Binary Tree |
Tree
DFS |
⚠ |
Solution
|
| 105 |
Construct Binary Tree from Preorder and Inorder Traversal |
Tree |
⚠⚠ |
Solution
|
| 106 |
Construct Binary Tree from Inorder and Postorder Traversal |
Tree |
⚠⚠ |
Solution
|
| 107 |
Binary Tree Level Order Traversal II |
Tree |
⚠⚠ |
Solution
|
| 108 |
Convert Sorted Array to Binary Search Tree |
Tree |
⚠ |
Solution
|
| 109 |
Convert Sorted List to Binary Search Tree |
|
⚠⚠ |
Solution
|
| 110 |
Balanced Binary Tree |
Tree |
⚠ |
Solution
|
| 111 |
Minimum Depth of Binary Tree |
Tree |
⚠ |
Solution
|
| 112 |
Path Sum |
Tree |
⚠ |
Solution
|
| 113 |
Path Sum II |
|
⚠⚠ |
Solution
|
| 114 |
Flatten Binary Tree to Linked List |
Tree |
⚠⚠ |
Solution
|
| 115 |
Distinct Subsequences |
String
Dynamic Programming |
⚠⚠⚠ |
Solution
|
| 116 |
Populating Next Right Pointers in Each Node |
Tree |
⚠⚠ |
Solution
|
| 117 |
Populating Next Right Pointers in Each Node II |
Tree |
⚠⚠ |
Solution
|
| 118 |
Pascal's Triangle |
|
⚠ |
Solution
|
| 119 |
Pascal's Triangle II |
|
⚠ |
Solution
|
| 120 |
Triangle |
Dynamic Programming |
⚠⚠ |
Solution
|
| 121 |
Best Time to Buy and Sell Stock |
Dynamic Programming |
⚠ |
Solution
|
| 122 |
Best Time to Buy and Sell Stock II |
Dynamic Programming |
⚠⚠ |
Solution
|
| 123 |
Best Time to Buy and Sell Stock III |
Dynamic Programming
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 124 |
Binary Tree Maximum Path Sum |
Tree |
⚠⚠⚠ |
Solution
|
| 125 |
Valid Palindrome |
String
Palindrome |
⚠ |
Solution
|
| 126 |
Word Ladder II |
|
⚠⚠⚠ |
Solution
|
| 127 |
Word Ladder |
|
⚠⚠⚠ |
Solution
|
| 128 |
Longest Consecutive Sequence |
Hash Table |
⚠⚠ |
Solution
|
| 129 |
Sum Root to Leaf Numbers |
|
⚠⚠ |
Solution
|
| 130 |
Surrounded Regions |
|
⚠⚠ |
Solution
|
| 131 |
Palindrome Partitioning |
|
⚠⚠ |
Solution
|
| 132 |
Palindrome Partitioning II |
|
⚠⚠⚠ |
Solution
|
| 133 |
Clone Graph |
|
⚠⚠ |
Solution
|
| 134 |
Gas Station |
|
⚠⚠ |
Solution
|
| 135 |
Candy |
|
⚠⚠⚠ |
Solution
|
| 136 |
Single Number |
|
⚠ |
Solution
|
| 137 |
Single Number II |
|
⚠⚠ |
Solution
|
| 138 |
Copy List with Random Pointer |
|
⚠⚠ |
Solution
|
| 139 |
Word Break |
|
⚠⚠ |
Solution
|
| 140 |
Word Break II |
|
⚠⚠⚠ |
Solution
|
| 141 |
Linked List Cycle |
|
⚠ |
Solution
|
| 142 |
Linked List Cycle II |
|
⚠⚠ |
Solution
|
| 143 |
Reorder List |
|
⚠⚠ |
Solution
|
| 144 |
Binary Tree Preorder Traversal |
|
⚠ |
Solution
|
| 145 |
Binary Tree Postorder Traversal |
|
⚠ |
Solution
|
| 146 |
LRU Cache |
|
⚠⚠ |
Solution
|
| 147 |
Insertion Sort List |
|
⚠⚠ |
Solution
|
| 148 |
Sort List |
|
⚠⚠ |
Solution
|
| 149 |
Max Points on a Line |
|
⚠⚠⚠ |
Solution
|
| 150 |
Evaluate Reverse Polish Notation |
|
⚠⚠ |
Solution
|
| 151 |
Reverse Words in a String |
|
⚠⚠ |
Solution
|
| 152 |
Maximum Product Subarray |
|
⚠⚠ |
Solution
|
| 153 |
Find Minimum in Rotated Sorted Array |
|
⚠⚠ |
Solution
|
| 154 |
Find Minimum in Rotated Sorted Array II |
|
⚠⚠⚠ |
Solution
|
| 155 |
Min Stack |
|
⚠⚠ |
Solution
|
| 160 |
Intersection of Two Linked Lists |
|
⚠ |
Solution
|
| 162 |
Find Peak Element |
|
⚠⚠ |
Solution
|
| 164 |
Maximum Gap |
|
⚠⚠ |
Solution
|
| 165 |
Compare Version Numbers |
|
⚠⚠ |
Solution
|
| 166 |
Fraction to Recurring Decimal |
|
⚠⚠ |
Solution
|
| 167 |
Two Sum II - Input Array Is Sorted |
|
⚠⚠ |
Solution
|
| 168 |
Excel Sheet Column Title |
|
⚠ |
Solution
|
| 169 |
Majority Element |
|
⚠ |
Solution
|
| 171 |
Excel Sheet Column Number |
|
⚠ |
Solution
|
| 172 |
Factorial Trailing Zeroes |
|
⚠⚠ |
Solution
|
| 173 |
Binary Search Tree Iterator |
|
⚠⚠ |
Solution
|
| 174 |
Dungeon Game |
|
⚠⚠⚠ |
Solution
|
| 179 |
Largest Number |
|
⚠⚠ |
Solution
|
| 187 |
Repeated DNA Sequences |
|
⚠⚠ |
Solution
|
| 188 |
Best Time to Buy and Sell Stock IV |
|
⚠⚠⚠ |
Solution
|
| 189 |
Rotate Array |
|
⚠⚠ |
Solution
|
| 190 |
Reverse Bits |
|
⚠ |
Solution
|
| 191 |
Number of 1 Bits |
|
⚠ |
Solution
|
| 198 |
House Robber |
|
⚠⚠ |
Solution
|
| 199 |
Binary Tree Right Side View |
|
⚠⚠ |
Solution
|
| 200 |
Number of Islands |
|
⚠⚠ |
Solution
|
| 201 |
Bitwise AND of Numbers Range |
|
⚠⚠ |
Solution
|
| 202 |
Happy Number |
|
⚠ |
Solution
|
| 203 |
Remove Linked List Elements |
|
⚠ |
Solution
|
| 204 |
Count Primes |
|
⚠⚠ |
Solution
|
| 205 |
Isomorphic Strings |
|
⚠ |
Solution
|
| 206 |
Reverse Linked List |
|
⚠ |
Solution
|
| 207 |
Course Schedule |
|
⚠⚠ |
Solution
|
| 208 |
Implement Trie (Prefix Tree) |
|
⚠⚠ |
Solution
|
| 209 |
Minimum Size Subarray Sum |
|
⚠⚠ |
Solution
|
| 210 |
Course Schedule II |
|
⚠⚠ |
Solution
|
| 211 |
Design Add and Search Words Data Structure |
|
⚠⚠ |
Solution
|
| 212 |
Word Search II |
|
⚠⚠⚠ |
Solution
|
| 213 |
House Robber II |
|
⚠⚠ |
Solution
|
| 214 |
Shortest Palindrome |
|
⚠⚠⚠ |
Solution
|
| 215 |
Kth Largest Element in an Array |
|
⚠⚠ |
Solution
|
| 216 |
Combination Sum III |
|
⚠⚠ |
Solution
|
| 217 |
Contains Duplicate |
|
⚠ |
Solution
|
| 218 |
The Skyline Problem |
|
⚠⚠⚠ |
Solution
|
| 219 |
Contains Duplicate II |
|
⚠ |
Solution
|
| 220 |
Contains Duplicate III |
Sliding Window
Bucket Sort
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 221 |
Maximal Square |
|
⚠⚠ |
Solution
|
| 222 |
Count Complete Tree Nodes |
|
⚠ |
Solution
|
| 223 |
Rectangle Area |
|
⚠⚠ |
Solution
|
| 224 |
Basic Calculator |
|
⚠⚠⚠ |
Solution
|
| 225 |
Implement Stack using Queues |
|
⚠ |
Solution
|
| 226 |
Invert Binary Tree |
|
⚠ |
Solution
|
| 227 |
Basic Calculator II |
|
⚠⚠ |
Solution
|
| 228 |
Summary Ranges |
|
⚠ |
Solution
|
| 229 |
Majority Element II |
|
⚠⚠ |
Solution
|
| 230 |
Kth Smallest Element in a BST |
|
⚠⚠ |
Solution
|
| 231 |
Power of Two |
|
⚠ |
Solution
|
| 232 |
Implement Queue using Stacks |
|
⚠ |
Solution
|
| 233 |
Number of Digit One |
|
⚠⚠⚠ |
Solution
|
| 234 |
Palindrome Linked List |
|
⚠ |
Solution
|
| 235 |
Lowest Common Ancestor of a Binary Search Tree |
|
⚠⚠ |
Solution
|
| 236 |
Lowest Common Ancestor of a Binary Tree |
|
⚠⚠ |
Solution
|
| 237 |
Delete Node in a Linked List |
|
⚠⚠ |
Solution
|
| 238 |
Product of Array Except Self |
|
⚠⚠ |
Solution
|
| 239 |
Sliding Window Maximum |
|
⚠⚠⚠ |
Solution
|
| 240 |
Search a 2D Matrix II |
|
⚠⚠ |
Solution
|
| 241 |
Different Ways to Add Parentheses |
|
⚠⚠ |
Solution
|
| 242 |
Valid Anagram |
|
⚠ |
Solution
|
| 257 |
Binary Tree Paths |
|
⚠ |
Solution
|
| 258 |
Add Digits |
|
⚠ |
Solution
|
| 260 |
Single Number III |
|
⚠⚠ |
Solution
|
| 263 |
Ugly Number |
|
⚠ |
Solution
|
| 264 |
Ugly Number II |
|
⚠⚠ |
Solution
|
| 268 |
Missing Number |
|
⚠ |
Solution
|
| 273 |
Integer to English Words |
|
⚠⚠⚠ |
Solution
|
| 274 |
H-Index |
|
⚠⚠ |
Solution
|
| 275 |
H-Index II |
|
⚠⚠ |
Solution
|
| 278 |
First Bad Version |
|
⚠ |
Solution
|
| 279 |
Perfect Squares |
Dynamic Programming |
⚠⚠ |
Solution
|
| 282 |
Expression Add Operators |
|
⚠⚠⚠ |
Solution
|
| 283 |
Move Zeroes |
|
⚠ |
Solution
|
| 284 |
Peeking Iterator |
|
⚠⚠ |
Solution
|
| 287 |
Find the Duplicate Number |
Two Pointer
DO IT AGAIN |
⚠⚠ |
Solution
|
| 289 |
Game of Life |
|
⚠⚠ |
Solution
|
| 290 |
Word Pattern |
|
⚠ |
Solution
|
| 292 |
Nim Game |
|
⚠ |
Solution
|
| 295 |
Find Median from Data Stream |
Heap |
⚠⚠⚠ |
Solution
|
| 297 |
Serialize and Deserialize Binary Tree |
|
⚠⚠⚠ |
Solution
|
| 299 |
Bulls and Cows |
|
⚠⚠ |
Solution
|
| 300 |
Longest Increasing Subsequence |
|
⚠⚠ |
Solution
|
| 301 |
Remove Invalid Parentheses |
|
⚠⚠⚠ |
Solution
|
| 303 |
Range Sum Query - Immutable |
|
⚠ |
Solution
|
| 304 |
Range Sum Query 2D - Immutable |
|
⚠⚠ |
Solution
|
| 306 |
Additive Number |
|
⚠⚠ |
Solution
|
| 307 |
Range Sum Query - Mutable |
|
⚠⚠ |
Solution
|
| 309 |
Best Time to Buy and Sell Stock with Cooldown |
|
⚠⚠ |
Solution
|
| 310 |
Minimum Height Trees |
|
⚠⚠ |
Solution
|
| 312 |
Burst Balloons |
|
⚠⚠⚠ |
Solution
|
| 313 |
Super Ugly Number |
|
⚠⚠ |
Solution
|
| 315 |
Count of Smaller Numbers After Self |
|
⚠⚠⚠ |
Solution
|
| 316 |
Remove Duplicate Letters |
|
⚠⚠ |
Solution
|
| 318 |
Maximum Product of Word Lengths |
|
⚠⚠ |
Solution
|
| 319 |
Bulb Switcher |
|
⚠⚠ |
Solution
|
| 321 |
Create Maximum Number |
|
⚠⚠⚠ |
Solution
|
| 322 |
Coin Change |
Dynamic Programming |
⚠⚠ |
Solution
|
| 324 |
Wiggle Sort II |
|
⚠⚠ |
Solution
|
| 326 |
Power of Three |
|
⚠ |
Solution
|
| 327 |
Count of Range Sum |
|
⚠⚠⚠ |
Solution
|
| 328 |
Odd Even Linked List |
|
⚠⚠ |
Solution
|
| 329 |
Longest Increasing Path in a Matrix |
|
⚠⚠⚠ |
Solution
|
| 330 |
Patching Array |
|
⚠⚠⚠ |
Solution
|
| 331 |
Verify Preorder Serialization of a Binary Tree |
|
⚠⚠ |
Solution
|
| 332 |
Reconstruct Itinerary |
|
⚠⚠⚠ |
Solution
|
| 334 |
Increasing Triplet Subsequence |
|
⚠⚠ |
Solution
|
| 335 |
Self Crossing |
|
⚠⚠⚠ |
Solution
|
| 336 |
Palindrome Pairs |
|
⚠⚠⚠ |
Solution
|
| 337 |
House Robber III |
|
⚠⚠ |
Solution
|
| 338 |
Counting Bits |
Bitwise Operation |
⚠ |
Solution
|
| 341 |
Flatten Nested List Iterator |
|
⚠⚠ |
Solution
|
| 342 |
Power of Four |
|
⚠ |
Solution
|
| 343 |
Integer Break |
|
⚠⚠ |
Solution
|
| 344 |
Reverse String |
|
⚠ |
Solution
|
| 345 |
Reverse Vowels of a String |
|
⚠ |
Solution
|
| 347 |
Top K Frequent Elements |
|
⚠⚠ |
Solution
|
| 349 |
Intersection of Two Arrays |
|
⚠ |
Solution
|
| 350 |
Intersection of Two Arrays II |
|
⚠ |
Solution
|
| 352 |
Data Stream as Disjoint Intervals |
|
⚠⚠⚠ |
Solution
|
| 354 |
Russian Doll Envelopes |
|
⚠⚠⚠ |
Solution
|
| 355 |
Design Twitter |
|
⚠⚠ |
Solution
|
| 357 |
Count Numbers with Unique Digits |
|
⚠⚠ |
Solution
|
| 363 |
Max Sum of Rectangle No Larger Than K |
|
⚠⚠⚠ |
Solution
|
| 365 |
Water and Jug Problem |
|
⚠⚠ |
Solution
|
| 367 |
Valid Perfect Square |
|
⚠ |
Solution
|
| 368 |
Largest Divisible Subset |
|
⚠⚠ |
Solution
|
| 371 |
Sum of Two Integers |
|
⚠⚠ |
Solution
|
| 372 |
Super Pow |
|
⚠⚠ |
Solution
|
| 373 |
Find K Pairs with Smallest Sums |
|
⚠⚠ |
Solution
|
| 374 |
Guess Number Higher or Lower |
|
⚠ |
Solution
|
| 375 |
Guess Number Higher or Lower II |
|
⚠⚠ |
Solution
|
| 376 |
Wiggle Subsequence |
|
⚠⚠ |
Solution
|
| 377 |
Combination Sum IV |
|
⚠⚠ |
Solution
|
| 378 |
Kth Smallest Element in a Sorted Matrix |
|
⚠⚠ |
Solution
|
| 380 |
Insert Delete GetRandom O(1) |
|
⚠⚠ |
Solution
|
| 381 |
Insert Delete GetRandom O(1) - Duplicates allowed |
|
⚠⚠⚠ |
Solution
|
| 382 |
Linked List Random Node |
|
⚠⚠ |
Solution
|
| 383 |
Ransom Note |
|
⚠ |
-
|
| 384 |
Shuffle an Array |
|
⚠⚠ |
Solution
|
| 385 |
Mini Parser |
|
⚠⚠ |
Solution
|
| 386 |
Lexicographical Numbers |
|
⚠⚠ |
Solution
|
| 387 |
First Unique Character in a String |
|
⚠ |
Solution
|
| 388 |
Longest Absolute File Path |
|
⚠⚠ |
Solution
|
| 389 |
Find the Difference |
|
⚠ |
Solution
|
| 390 |
Elimination Game |
|
⚠⚠ |
Solution
|
| 391 |
Perfect Rectangle |
|
⚠⚠⚠ |
Solution
|
| 392 |
Is Subsequence |
|
⚠ |
Solution
|
| 393 |
UTF-8 Validation |
|
⚠⚠ |
Solution
|
| 394 |
Decode String |
|
⚠⚠ |
Solution
|
| 395 |
Longest Substring with At Least K Repeating Characters |
|
⚠⚠ |
Solution
|
| 396 |
Rotate Function |
|
⚠⚠ |
Solution
|
| 397 |
Integer Replacement |
|
⚠⚠ |
Solution
|
| 398 |
Random Pick Index |
|
⚠⚠ |
Solution
|
| 399 |
Evaluate Division |
|
⚠⚠ |
Solution
|
| 400 |
Nth Digit |
|
⚠⚠ |
Solution
|
| 401 |
Binary Watch |
|
⚠ |
Solution
|
| 402 |
Remove K Digits |
|
⚠⚠ |
Solution
|
| 403 |
Frog Jump |
|
⚠⚠⚠ |
Solution
|
| 404 |
Sum of Left Leaves |
|
⚠ |
Solution
|
| 405 |
Convert a Number to Hexadecimal |
|
⚠ |
Solution
|
| 406 |
Queue Reconstruction by Height |
|
⚠⚠ |
Solution
|
| 407 |
Trapping Rain Water II |
|
⚠⚠⚠ |
Solution
|
| 409 |
Longest Palindrome |
|
⚠ |
Solution
|
| 410 |
Split Array Largest Sum |
|
⚠⚠⚠ |
Solution
|
| 412 |
Fizz Buzz |
|
⚠ |
Solution
|
| 413 |
Arithmetic Slices |
|
⚠⚠ |
Solution
|
| 414 |
Third Maximum Number |
|
⚠ |
Solution
|
| 415 |
Add Strings |
|
⚠ |
Solution
|
| 416 |
Partition Equal Subset Sum |
|
⚠⚠ |
Solution
|
| 417 |
Pacific Atlantic Water Flow |
|
⚠⚠ |
Solution
|
| 419 |
Battleships in a Board |
|
⚠⚠ |
Solution
|
| 420 |
Strong Password Checker |
|
⚠⚠⚠ |
Solution
|
| 421 |
Maximum XOR of Two Numbers in an Array |
|
⚠⚠ |
Solution
|
| 423 |
Reconstruct Original Digits from English |
|
⚠⚠ |
Solution
|
| 424 |
Longest Repeating Character Replacement |
|
⚠⚠ |
Solution
|
| 427 |
Construct Quad Tree |
|
⚠⚠ |
Solution
|
| 429 |
N-ary Tree Level Order Traversal |
|
⚠⚠ |
Solution
|
| 430 |
Flatten a Multilevel Doubly Linked List |
|
⚠⚠ |
Solution
|
| 432 |
All O`one Data Structure |
|
⚠⚠⚠ |
Solution
|
| 433 |
Minimum Genetic Mutation |
|
⚠⚠ |
Solution
|
| 434 |
Number of Segments in a String |
|
⚠ |
Solution
|
| 435 |
Non-overlapping Intervals |
|
⚠⚠ |
Solution
|
| 436 |
Find Right Interval |
|
⚠⚠ |
Solution
|
| 437 |
Path Sum III |
Tree
DFS
Prefix Sum |
⚠⚠ |
Solution
|
| 438 |
Find All Anagrams in a String |
|
⚠⚠ |
Solution
|
| 440 |
K-th Smallest in Lexicographical Order |
|
⚠⚠⚠ |
Solution
|
| 441 |
Arranging Coins |
|
⚠ |
Solution
|
| 442 |
Find All Duplicates in an Array |
|
⚠⚠ |
Solution
|
| 443 |
String Compression |
|
⚠⚠ |
Solution
|
| 445 |
Add Two Numbers II |
Linked List
Math |
⚠⚠ |
Solution
|
| 446 |
Arithmetic Slices II - Subsequence |
|
⚠⚠⚠ |
Solution
|
| 447 |
Number of Boomerangs |
Hash Table
Math |
⚠⚠ |
Solution
|
| 448 |
Find All Numbers Disappeared in an Array |
Hash Table
|
⚠ |
Solution
|
| 449 |
Serialize and Deserialize BST |
BST |
⚠⚠ |
Solution
|
| 450 |
Delete Node in a BST |
|
⚠⚠ |
Solution
|
| 451 |
Sort Characters By Frequency |
string |
⚠⚠ |
Solution
|
| 452 |
Minimum Number of Arrows to Burst Balloons |
|
⚠⚠ |
Solution
|
| 453 |
Minimum Moves to Equal Array Elements |
|
⚠⚠ |
Solution
|
| 454 |
4Sum II |
|
⚠⚠ |
Solution
|
| 455 |
Assign Cookies |
|
⚠ |
Solution
|
| 456 |
132 Pattern |
|
⚠⚠ |
Solution
|
| 457 |
Circular Array Loop |
|
⚠⚠ |
Solution
|
| 458 |
Poor Pigs |
|
⚠⚠⚠ |
Solution
|
| 459 |
Repeated Substring Pattern |
String
KMP |
⚠ |
Solution
|
| 460 |
LFU Cache |
|
⚠⚠⚠ |
Solution
|
| 461 |
Hamming Distance |
Bitwise |
⚠ |
Solution
|
| 462 |
Minimum Moves to Equal Array Elements II |
|
⚠⚠ |
Solution
|
| 463 |
Island Perimeter |
|
⚠ |
Solution
|
| 464 |
Can I Win |
|
⚠⚠ |
Solution
|
| 466 |
Count The Repetitions |
String
Dynamic Programming |
⚠⚠⚠ |
Solution
|
| 467 |
Unique Substrings in Wraparound String |
String
Dynamic Programming |
⚠⚠ |
Solution
|
| 468 |
Validate IP Address |
|
⚠⚠ |
Solution
|
| 470 |
Implement Rand10() Using Rand7() |
Math |
⚠⚠ |
Solution
|
| 472 |
Concatenated Words |
Set
|
⚠⚠⚠ |
Solution
|
| 473 |
Matchsticks to Square |
Dynamic Programming
Bitmask |
⚠⚠ |
Solution
|
| 474 |
Ones and Zeroes |
|
⚠⚠ |
Solution
|
| 475 |
Heaters |
Binary Search |
⚠⚠ |
Solution
|
| 476 |
Number Complement |
|
⚠ |
Solution
|
| 477 |
Total Hamming Distance |
Bitwise |
⚠⚠ |
Solution
|
| 478 |
Generate Random Point in a Circle |
|
⚠⚠ |
Solution
|
| 479 |
Largest Palindrome Product |
Palindrome |
⚠⚠⚠ |
Solution
|
| 480 |
Sliding Window Median |
Heap
Lazy Deletion |
⚠⚠⚠ |
Solution
|
| 481 |
Magical String |
|
⚠⚠ |
Solution
|
| 482 |
License Key Formatting |
|
⚠ |
Solution
|
| 483 |
Smallest Good Base |
Math |
⚠⚠⚠ |
Solution
|
| 485 |
Max Consecutive Ones |
|
⚠ |
Solution
|
| 486 |
Predict the Winner |
|
⚠⚠ |
Solution
|
| 488 |
Zuma Game |
|
⚠⚠⚠ |
-
|
| 491 |
Non-decreasing Subsequences |
|
⚠⚠ |
Solution
|
| 492 |
Construct the Rectangle |
Math |
⚠ |
Solution
|
| 493 |
Reverse Pairs |
Merge Sort |
⚠⚠⚠ |
Solution
|
| 494 |
Target Sum |
Dynamic Programming |
⚠⚠ |
Solution
|
| 495 |
Teemo Attacking |
|
⚠ |
Solution
|
| 496 |
Next Greater Element I |
Stack |
⚠ |
Solution
|
| 497 |
Random Point in Non-overlapping Rectangles |
Weighted Random |
⚠⚠ |
Solution
|
| 498 |
Diagonal Traverse |
|
⚠⚠ |
Solution
|
| 500 |
Keyboard Row |
|
⚠ |
Solution
|
| 501 |
Find Mode in Binary Search Tree |
|
⚠ |
Solution
|
| 502 |
IPO |
Greedy Algorithm
Heap |
⚠⚠⚠ |
Solution
|
| 503 |
Next Greater Element II |
Stack |
⚠⚠ |
Solution
|
| 504 |
Base 7 |
Math |
⚠ |
Solution
|
| 506 |
Relative Ranks |
Queue |
⚠ |
Solution
|
| 507 |
Perfect Number |
|
⚠ |
Solution
|
| 508 |
Most Frequent Subtree Sum |
DFS |
⚠⚠ |
Solution
|
| 509 |
Fibonacci Number |
|
⚠ |
Solution
|
| 513 |
Find Bottom Left Tree Value |
|
⚠⚠ |
Solution
|
| 514 |
Freedom Trail |
|
⚠⚠⚠ |
Solution
|
| 515 |
Find Largest Value in Each Tree Row |
BFS |
⚠⚠ |
Solution
|
| 516 |
Longest Palindromic Subsequence |
Dynamic Programming |
⚠⚠ |
Solution
|
| 517 |
Super Washing Machines |
|
⚠⚠⚠ |
Solution
|
| 518 |
Coin Change II |
Dynamic Programming |
⚠⚠ |
Solution
|
| 519 |
Random Flip Matrix |
|
⚠⚠ |
Solution
|
| 520 |
Detect Capital |
Math |
⚠ |
Solution
|
| 521 |
Longest Uncommon Subsequence I |
String |
⚠ |
Solution
|
| 522 |
Longest Uncommon Subsequence II |
String |
⚠⚠ |
Solution
|
| 523 |
Continuous Subarray Sum |
Hash Table
Prefix Sum |
⚠⚠ |
Solution
|
| 524 |
Longest Word in Dictionary through Deleting |
String |
⚠⚠ |
Solution
|
| 525 |
Contiguous Array |
Hash Table
Prefix Sum |
⚠⚠ |
Solution
|
| 526 |
Beautiful Arrangement |
DFS |
⚠⚠ |
Solution
|
| 528 |
Random Pick with Weight |
Binary Search
Prefix Sum
Weighted Random |
⚠⚠ |
Solution
|
| 529 |
Minesweeper |
BFS
DFS |
⚠⚠ |
Solution
|
| 530 |
Minimum Absolute Difference in BST |
DFS |
⚠ |
Solution
|
| 532 |
K-diff Pairs in an Array |
Set
Two Pointers
Hash Table |
⚠⚠ |
Solution
|
| 535 |
Encode and Decode TinyURL |
String
Hash Table |
⚠⚠ |
Solution
|
| 537 |
Complex Number Multiplication |
Math |
⚠⚠ |
Solution
|
| 538 |
Convert BST to Greater Tree |
BST |
⚠⚠ |
Solution
|
| 539 |
Minimum Time Difference |
String
Math |
⚠⚠ |
Solution
|
| 540 |
Single Element in a Sorted Array |
Binary Search |
⚠⚠ |
Solution
|
| 541 |
Reverse String II |
String |
⚠ |
Solution
|
| 542 |
01 Matrix |
BFS |
⚠⚠ |
Solution
|
| 543 |
Diameter of Binary Tree |
Tree
DO IT AGAIN |
⚠ |
Solution
|
| 546 |
Remove Boxes |
Dynamic Progamming
DO IT AGAIN |
⚠⚠⚠ |
Solution
|
| 547 |
Number of Provinces |
Graph
DFS
BFS |
⚠⚠ |
Solution
|
| 551 |
Student Attendance Record I |
String |
⚠ |
Solution
|
| 552 |
Student Attendance Record II |
|
⚠⚠⚠ |
Solution
|
| 553 |
Optimal Division |
String
Math |
⚠⚠ |
Solution
|
| 554 |
Brick Wall |
Dict |
⚠⚠ |
Solution
|
| 556 |
Next Greater Element III |
String |
⚠⚠ |
Solution
|
| 557 |
Reverse Words in a String III |
String |
⚠ |
Solution
|
| 558 |
Logical OR of Two Binary Grids Represented as Quad-Trees |
DFS |
⚠⚠ |
Solution
|
| 559 |
Maximum Depth of N-ary Tree |
BFS
DFS |
⚠ |
Solution
|
| 560 |
Subarray Sum Equals K |
Prefix
Dict |
⚠⚠ |
Solution
|
| 561 |
Array Partition |
|
⚠ |
Solution
|
| 563 |
Binary Tree Tilt |
DFS |
⚠ |
Solution
|
| 564 |
Find the Closest Palindrome |
|
⚠⚠⚠ |
-
|
| 565 |
Array Nesting |
|
⚠⚠ |
Solution
|
| 566 |
Reshape the Matrix |
|
⚠ |
Solution
|
| 567 |
Permutation in String |
Sliding Window
Dict |
⚠⚠ |
Solution
|
| 572 |
Subtree of Another Tree |
DFS |
⚠ |
Solution
|
| 575 |
Distribute Candies |
Hash Table |
⚠ |
Solution
|
| 576 |
Out of Boundary Paths |
Dynamic Programming |
⚠⚠ |
Solution
|
| 581 |
Shortest Unsorted Continuous Subarray |
|
⚠⚠ |
-
|
| 583 |
Delete Operation for Two Strings |
|
⚠⚠ |
-
|
| 587 |
Erect the Fence |
|
⚠⚠⚠ |
-
|
| 589 |
N-ary Tree Preorder Traversal |
|
⚠ |
Solution
|
| 590 |
N-ary Tree Postorder Traversal |
Tree |
⚠ |
Solution
|
| 591 |
Tag Validator |
|
⚠⚠⚠ |
-
|
| 592 |
Fraction Addition and Subtraction |
|
⚠⚠ |
-
|
| 593 |
Valid Square |
|
⚠⚠ |
-
|
| 594 |
Longest Harmonious Subsequence |
|
⚠ |
-
|
| 598 |
Range Addition II |
|
⚠ |
-
|
| 599 |
Minimum Index Sum of Two Lists |
|
⚠ |
-
|
| 600 |
Non-negative Integers without Consecutive Ones |
|
⚠⚠⚠ |
-
|
| 605 |
Can Place Flowers |
|
⚠ |
-
|
| 606 |
Construct String from Binary Tree |
|
⚠⚠ |
-
|
| 609 |
Find Duplicate File in System |
|
⚠⚠ |
-
|
| 611 |
Valid Triangle Number |
|
⚠⚠ |
-
|
| 617 |
Merge Two Binary Trees |
|
⚠ |
-
|
| 621 |
Task Scheduler |
|
⚠⚠ |
-
|
| 622 |
Design Circular Queue |
|
⚠⚠ |
-
|
| 623 |
Add One Row to Tree |
|
⚠⚠ |
-
|
| 624 |
Maximum Distance in Arrays |
|
⚠⚠ |
-
|
| 628 |
Maximum Product of Three Numbers |
|
⚠ |
-
|
| 629 |
K Inverse Pairs Array |
|
⚠⚠⚠ |
-
|
| 630 |
Course Schedule III |
|
⚠⚠⚠ |
-
|
| 632 |
Smallest Range Covering Elements from K Lists |
|
⚠⚠⚠ |
-
|
| 633 |
Sum of Square Numbers |
|
⚠⚠ |
-
|
| 636 |
Exclusive Time of Functions |
|
⚠⚠ |
-
|
| 637 |
Average of Levels in Binary Tree |
|
⚠ |
-
|
| 638 |
Shopping Offers |
|
⚠⚠ |
-
|
| 639 |
Decode Ways II |
|
⚠⚠⚠ |
-
|
| 640 |
Solve the Equation |
|
⚠⚠ |
-
|
| 641 |
Design Circular Deque |
|
⚠⚠ |
-
|
| 643 |
Maximum Average Subarray I |
Sliding Window |
⚠ |
Solution
|
| 645 |
Set Mismatch |
|
⚠ |
-
|
| 646 |
Maximum Length of Pair Chain |
|
⚠⚠ |
-
|
| 647 |
Palindromic Substrings |
String
DO IT AGAIN |
⚠⚠ |
Solution
|
| 648 |
Replace Words |
|
⚠⚠ |
-
|
| 649 |
Dota2 Senate |
|
⚠⚠ |
-
|
| 650 |
2 Keys Keyboard |
|
⚠⚠ |
-
|
| 652 |
Find Duplicate Subtrees |
|
⚠⚠ |
-
|
| 653 |
Two Sum IV - Input is a BST |
|
⚠ |
-
|
| 654 |
Maximum Binary Tree |
|
⚠⚠ |
-
|
| 655 |
Print Binary Tree |
|
⚠⚠ |
-
|
| 657 |
Robot Return to Origin |
|
⚠ |
-
|
| 658 |
Find K Closest Elements |
|
⚠⚠ |
-
|
| 659 |
Split Array into Consecutive Subsequences |
|
⚠⚠ |
-
|
| 661 |
Image Smoother |
|
⚠ |
-
|
| 662 |
Maximum Width of Binary Tree |
|
⚠⚠ |
-
|
| 664 |
Strange Printer |
|
⚠⚠⚠ |
-
|
| 665 |
Non-decreasing Array |
|
⚠⚠ |
-
|
| 667 |
Beautiful Arrangement II |
|
⚠⚠ |
-
|
| 668 |
Kth Smallest Number in Multiplication Table |
|
⚠⚠⚠ |
-
|
| 669 |
Trim a Binary Search Tree |
|
⚠⚠ |
-
|
| 670 |
Maximum Swap |
|
⚠⚠ |
-
|
| 671 |
Second Minimum Node In a Binary Tree |
|
⚠ |
-
|
| 672 |
Bulb Switcher II |
|
⚠⚠ |
-
|
| 673 |
Number of Longest Increasing Subsequence |
|
⚠⚠ |
-
|
| 674 |
Longest Continuous Increasing Subsequence |
|
⚠ |
-
|
| 675 |
Cut Off Trees for Golf Event |
|
⚠⚠⚠ |
-
|
| 676 |
Implement Magic Dictionary |
|
⚠⚠ |
-
|
| 677 |
Map Sum Pairs |
|
⚠⚠ |
-
|
| 678 |
Valid Parenthesis String |
|
⚠⚠ |
-
|
| 679 |
24 Game |
|
⚠⚠⚠ |
-
|
| 680 |
Valid Palindrome II |
|
⚠ |
-
|
| 682 |
Baseball Game |
|
⚠ |
-
|
| 684 |
Redundant Connection |
|
⚠⚠ |
-
|
| 685 |
Redundant Connection II |
|
⚠⚠⚠ |
-
|
| 686 |
Repeated String Match |
|
⚠⚠ |
-
|
| 687 |
Longest Univalue Path |
|
⚠⚠ |
-
|
| 688 |
Knight Probability in Chessboard |
|
⚠⚠ |
-
|
| 689 |
Maximum Sum of 3 Non-Overlapping Subarrays |
|
⚠⚠⚠ |
-
|
| 690 |
Employee Importance |
|
⚠⚠ |
-
|
| 691 |
Stickers to Spell Word |
|
⚠⚠⚠ |
-
|
| 692 |
Top K Frequent Words |
|
⚠⚠ |
-
|
| 693 |
Binary Number with Alternating Bits |
|
⚠ |
-
|
| 695 |
Max Area of Island |
DFS |
⚠⚠ |
Solution
|
| 696 |
Count Binary Substrings |
|
⚠ |
-
|
| 697 |
Degree of an Array |
|
⚠ |
-
|
| 698 |
Partition to K Equal Sum Subsets |
|
⚠⚠ |
-
|
| 699 |
Falling Squares |
|
⚠⚠⚠ |
-
|
| 700 |
Search in a Binary Search Tree |
|
⚠ |
-
|
| 701 |
Insert into a Binary Search Tree |
|
⚠⚠ |
-
|
| 703 |
Kth Largest Element in a Stream |
|
⚠ |
-
|
| 704 |
Binary Search |
Binary Search |
⚠ |
Solution
|
| 705 |
Design HashSet |
|
⚠ |
-
|
| 706 |
Design HashMap |
|
⚠ |
-
|
| 707 |
Design Linked List |
|
⚠⚠ |
-
|
| 709 |
To Lower Case |
|
⚠ |
-
|
| 710 |
Random Pick with Blacklist |
|
⚠⚠⚠ |
-
|
| 712 |
Minimum ASCII Delete Sum for Two Strings |
|
⚠⚠ |
-
|
| 713 |
Subarray Product Less Than K |
|
⚠⚠ |
-
|
| 714 |
Best Time to Buy and Sell Stock with Transaction Fee |
|
⚠⚠ |
-
|
| 715 |
Range Module |
|
⚠⚠⚠ |
-
|
| 717 |
1-bit and 2-bit Characters |
|
⚠ |
-
|
| 718 |
Maximum Length of Repeated Subarray |
|
⚠⚠ |
-
|
| 719 |
Find K-th Smallest Pair Distance |
|
⚠⚠⚠ |
-
|
| 720 |
Longest Word in Dictionary |
|
⚠⚠ |
-
|
| 721 |
Accounts Merge |
|
⚠⚠ |
-
|
| 722 |
Remove Comments |
|
⚠⚠ |
-
|
| 724 |
Find Pivot Index |
|
⚠ |
-
|
| 725 |
Split Linked List in Parts |
|
⚠⚠ |
-
|
| 726 |
Number of Atoms |
|
⚠⚠⚠ |
-
|
| 728 |
Self Dividing Numbers |
|
⚠ |
-
|
| 729 |
My Calendar I |
|
⚠⚠ |
-
|
| 730 |
Count Different Palindromic Subsequences |
|
⚠⚠⚠ |
-
|
| 731 |
My Calendar II |
|
⚠⚠ |
-
|
| 732 |
My Calendar III |
|
⚠⚠⚠ |
-
|
| 733 |
Flood Fill |
DFS |
⚠ |
Solution
|
| 735 |
Asteroid Collision |
|
⚠⚠ |
-
|
| 736 |
Parse Lisp Expression |
|
⚠⚠⚠ |
-
|
| 738 |
Monotone Increasing Digits |
|
⚠⚠ |
-
|
| 739 |
Daily Temperatures |
Monotonic Stack |
⚠⚠ |
Solution
|
| 740 |
Delete and Earn |
|
⚠⚠ |
-
|
| 741 |
Cherry Pickup |
|
⚠⚠⚠ |
-
|
| 743 |
Network Delay Time |
|
⚠⚠ |
-
|
| 744 |
Find Smallest Letter Greater Than Target |
Binary Search |
⚠ |
Solution
|
| 745 |
Prefix and Suffix Search |
|
⚠⚠⚠ |
-
|
| 746 |
Min Cost Climbing Stairs |
|
⚠ |
-
|
| 747 |
Largest Number At Least Twice of Others |
|
⚠ |
-
|
| 748 |
Shortest Completing Word |
|
⚠ |
-
|
| 749 |
Contain Virus |
|
⚠⚠⚠ |
-
|
| 752 |
Open the Lock |
|
⚠⚠ |
-
|
| 753 |
Cracking the Safe |
|
⚠⚠⚠ |
-
|
| 754 |
Reach a Number |
|
⚠⚠ |
-
|
| 756 |
Pyramid Transition Matrix |
|
⚠⚠ |
-
|
| 757 |
Set Intersection Size At Least Two |
|
⚠⚠⚠ |
-
|
| 761 |
Special Binary String |
|
⚠⚠⚠ |
-
|
| 762 |
Prime Number of Set Bits in Binary Representation |
|
⚠ |
-
|
| 763 |
Partition Labels |
|
⚠⚠ |
-
|
| 764 |
Largest Plus Sign |
|
⚠⚠ |
-
|
| 765 |
Couples Holding Hands |
|
⚠⚠⚠ |
-
|
| 766 |
Toeplitz Matrix |
|
⚠ |
-
|
| 767 |
Reorganize String |
|
⚠⚠ |
-
|
| 768 |
Max Chunks To Make Sorted II |
|
⚠⚠⚠ |
-
|
| 769 |
Max Chunks To Make Sorted |
|
⚠⚠ |
-
|
| 770 |
Basic Calculator IV |
|
⚠⚠⚠ |
-
|
| 771 |
Jewels and Stones |
|
⚠ |
-
|
| 773 |
Sliding Puzzle |
|
⚠⚠⚠ |
-
|
| 775 |
Global and Local Inversions |
|
⚠⚠ |
-
|
| 777 |
Swap Adjacent in LR String |
|
⚠⚠ |
-
|
| 778 |
Swim in Rising Water |
|
⚠⚠⚠ |
-
|
| 779 |
K-th Symbol in Grammar |
|
⚠⚠ |
-
|
| 780 |
Reaching Points |
|
⚠⚠⚠ |
-
|
| 781 |
Rabbits in Forest |
|
⚠⚠ |
-
|
| 782 |
Transform to Chessboard |
|
⚠⚠⚠ |
-
|
| 783 |
Minimum Distance Between BST Nodes |
|
⚠ |
-
|
| 784 |
Letter Case Permutation |
|
⚠⚠ |
-
|
| 785 |
Is Graph Bipartite? |
|
⚠⚠ |
-
|
| 786 |
K-th Smallest Prime Fraction |
|
⚠⚠ |
-
|
| 787 |
Cheapest Flights Within K Stops |
|
⚠⚠ |
-
|
| 788 |
Rotated Digits |
|
⚠⚠ |
-
|
| 789 |
Escape The Ghosts |
|
⚠⚠ |
-
|
| 790 |
Domino and Tromino Tiling |
|
⚠⚠ |
-
|
| 791 |
Custom Sort String |
|
⚠⚠ |
-
|
| 792 |
Number of Matching Subsequences |
|
⚠⚠ |
-
|
| 793 |
Preimage Size of Factorial Zeroes Function |
|
⚠⚠⚠ |
-
|
| 794 |
Valid Tic-Tac-Toe State |
|
⚠⚠ |
-
|
| 795 |
Number of Subarrays with Bounded Maximum |
|
⚠⚠ |
-
|
| 796 |
Rotate String |
|
⚠ |
-
|
| 797 |
All Paths From Source to Target |
|
⚠⚠ |
-
|
| 798 |
Smallest Rotation with Highest Score |
|
⚠⚠⚠ |
-
|
| 799 |
Champagne Tower |
|
⚠⚠ |
-
|
| 801 |
Minimum Swaps To Make Sequences Increasing |
|
⚠⚠⚠ |
-
|
| 802 |
Find Eventual Safe States |
|
⚠⚠ |
-
|
| 803 |
Bricks Falling When Hit |
|
⚠⚠⚠ |
-
|
| 804 |
Unique Morse Code Words |
|
⚠ |
-
|
| 805 |
Split Array With Same Average |
|
⚠⚠⚠ |
-
|
| 806 |
Number of Lines To Write String |
|
⚠ |
-
|
| 807 |
Max Increase to Keep City Skyline |
|
⚠⚠ |
-
|
| 808 |
Soup Servings |
|
⚠⚠ |
-
|
| 809 |
Expressive Words |
|
⚠⚠ |
-
|
| 810 |
Chalkboard XOR Game |
|
⚠⚠⚠ |
-
|
| 811 |
Subdomain Visit Count |
|
⚠⚠ |
-
|
| 812 |
Largest Triangle Area |
|
⚠ |
-
|
| 813 |
Largest Sum of Averages |
|
⚠⚠ |
-
|
| 814 |
Binary Tree Pruning |
|
⚠⚠ |
-
|
| 815 |
Bus Routes |
|
⚠⚠⚠ |
-
|
| 816 |
Ambiguous Coordinates |
|
⚠⚠ |
-
|
| 817 |
Linked List Components |
|
⚠⚠ |
-
|
| 818 |
Race Car |
|
⚠⚠⚠ |
-
|
| 819 |
Most Common Word |
|
⚠ |
-
|
| 820 |
Short Encoding of Words |
|
⚠⚠ |
-
|
| 821 |
Shortest Distance to a Character |
|
⚠ |
-
|
| 822 |
Card Flipping Game |
|
⚠⚠ |
-
|
| 823 |
Binary Trees With Factors |
|
⚠⚠ |
-
|
| 824 |
Goat Latin |
|
⚠ |
-
|
| 825 |
Friends Of Appropriate Ages |
Counting Sort
Prefix Sum
Sliding Window |
⚠⚠ |
Solution
|
| 826 |
Most Profit Assigning Work |
|
⚠⚠ |
-
|
| 827 |
Making A Large Island |
DFS |
⚠⚠⚠ |
Solution
|
| 828 |
Count Unique Characters of All Substrings of a Given String |
|
⚠⚠⚠ |
-
|
| 829 |
Consecutive Numbers Sum |
|
⚠⚠⚠ |
-
|
| 830 |
Positions of Large Groups |
|
⚠ |
-
|
| 831 |
Masking Personal Information |
|
⚠⚠ |
-
|
| 832 |
Flipping an Image |
|
⚠ |
-
|
| 833 |
Find And Replace in String |
|
⚠⚠ |
-
|
| 834 |
Sum of Distances in Tree |
|
⚠⚠⚠ |
-
|
| 835 |
Image Overlap |
|
⚠⚠ |
-
|
| 836 |
Rectangle Overlap |
|
⚠ |
-
|
| 837 |
New 21 Game |
|
⚠⚠ |
-
|
| 838 |
Push Dominoes |
|
⚠⚠ |
-
|
| 839 |
Similar String Groups |
|
⚠⚠⚠ |
-
|
| 840 |
Magic Squares In Grid |
|
⚠⚠ |
-
|
| 841 |
Keys and Rooms |
|
⚠⚠ |
-
|
| 842 |
Split Array into Fibonacci Sequence |
|
⚠⚠ |
-
|
| 843 |
Guess the Word |
|
⚠⚠⚠ |
-
|
| 844 |
Backspace String Compare |
|
⚠ |
-
|
| 845 |
Longest Mountain in Array |
|
⚠⚠ |
-
|
| 846 |
Hand of Straights |
|
⚠⚠ |
-
|
| 847 |
Shortest Path Visiting All Nodes |
|
⚠⚠⚠ |
-
|
| 848 |
Shifting Letters |
|
⚠⚠ |
-
|
| 849 |
Maximize Distance to Closest Person |
|
⚠⚠ |
-
|
| 850 |
Rectangle Area II |
|
⚠⚠⚠ |
-
|
| 851 |
Loud and Rich |
|
⚠⚠ |
-
|
| 852 |
Peak Index in a Mountain Array |
|
⚠⚠ |
-
|
| 853 |
Car Fleet |
Monotonic Stack |
⚠⚠ |
Solution
|
| 854 |
K-Similar Strings |
|
⚠⚠⚠ |
-
|
| 855 |
Exam Room |
|
⚠⚠ |
-
|
| 856 |
Score of Parentheses |
|
⚠⚠ |
-
|
| 857 |
Minimum Cost to Hire K Workers |
|
⚠⚠⚠ |
-
|
| 858 |
Mirror Reflection |
|
⚠⚠ |
-
|
| 859 |
Buddy Strings |
|
⚠ |
-
|
| 860 |
Lemonade Change |
|
⚠ |
-
|
| 861 |
Score After Flipping Matrix |
|
⚠⚠ |
-
|
| 862 |
Shortest Subarray with Sum at Least K |
|
⚠⚠⚠ |
-
|
| 863 |
All Nodes Distance K in Binary Tree |
|
⚠⚠ |
-
|
| 864 |
Shortest Path to Get All Keys |
|
⚠⚠⚠ |
-
|
| 865 |
Smallest Subtree with all the Deepest Nodes |
|
⚠⚠ |
-
|
| 866 |
Prime Palindrome |
|
⚠⚠ |
-
|
| 867 |
Transpose Matrix |
|
⚠ |
-
|
| 868 |
Binary Gap |
Bitwise operations |
⚠ |
Solution
|
| 869 |
Reordered Power of 2 |
|
⚠⚠ |
-
|
| 870 |
Advantage Shuffle |
|
⚠⚠ |
-
|
| 871 |
Minimum Number of Refueling Stops |
|
⚠⚠⚠ |
-
|
| 872 |
Leaf-Similar Trees |
|
⚠ |
-
|
| 873 |
Length of Longest Fibonacci Subsequence |
|
⚠⚠ |
-
|
| 874 |
Walking Robot Simulation |
|
⚠⚠ |
-
|
| 875 |
Koko Eating Bananas |
|
⚠⚠ |
-
|
| 876 |
Middle of the Linked List |
|
⚠ |
-
|
| 877 |
Stone Game |
|
⚠⚠ |
-
|
| 878 |
Nth Magical Number |
|
⚠⚠⚠ |
-
|
| 879 |
Profitable Schemes |
|
⚠⚠⚠ |
-
|
| 880 |
Decoded String at Index |
|
⚠⚠ |
-
|
| 881 |
Boats to Save People |
|
⚠⚠ |
-
|
| 882 |
Reachable Nodes In Subdivided Graph |
|
⚠⚠⚠ |
-
|
| 883 |
Projection Area of 3D Shapes |
|
⚠ |
-
|
| 884 |
Uncommon Words from Two Sentences |
|
⚠ |
-
|
| 885 |
Spiral Matrix III |
|
⚠⚠ |
-
|
| 886 |
Possible Bipartition |
|
⚠⚠ |
-
|
| 887 |
Super Egg Drop |
|
⚠⚠⚠ |
-
|
| 888 |
Fair Candy Swap |
|
⚠ |
-
|
| 889 |
Construct Binary Tree from Preorder and Postorder Traversal |
|
⚠⚠ |
-
|
| 890 |
Find and Replace Pattern |
|
⚠⚠ |
-
|
| 891 |
Sum of Subsequence Widths |
|
⚠⚠⚠ |
-
|
| 892 |
Surface Area of 3D Shapes |
|
⚠ |
-
|
| 893 |
Groups of Special-Equivalent Strings |
|
⚠⚠ |
-
|
| 894 |
All Possible Full Binary Trees |
|
⚠⚠ |
-
|
| 895 |
Maximum Frequency Stack |
|
⚠⚠⚠ |
-
|
| 896 |
Monotonic Array |
|
⚠ |
-
|
| 897 |
Increasing Order Search Tree |
|
⚠ |
-
|
| 898 |
Bitwise ORs of Subarrays |
|
⚠⚠ |
-
|
| 899 |
Orderly Queue |
|
⚠⚠⚠ |
-
|
| 900 |
RLE Iterator |
|
⚠⚠ |
-
|
| 901 |
Online Stock Span |
Monotonic Stack |
⚠⚠ |
Solution
|
| 902 |
Numbers At Most N Given Digit Set |
|
⚠⚠⚠ |
-
|
| 903 |
Valid Permutations for DI Sequence |
|
⚠⚠⚠ |
-
|
| 904 |
Fruit Into Baskets |
Sliding Window
Dict |
⚠⚠ |
Solution
|
| 905 |
Sort Array By Parity |
|
⚠ |
-
|
| 906 |
Super Palindromes |
|
⚠⚠⚠ |
-
|
| 907 |
Sum of Subarray Minimums |
|
⚠⚠ |
-
|
| 908 |
Smallest Range I |
|
⚠ |
-
|
| 909 |
Snakes and Ladders |
|
⚠⚠ |
-
|
| 910 |
Smallest Range II |
|
⚠⚠ |
-
|
| 911 |
Online Election |
|
⚠⚠ |
-
|
| 912 |
Sort an Array |
|
⚠⚠ |
-
|
| 913 |
Cat and Mouse |
|
⚠⚠⚠ |
-
|
| 914 |
X of a Kind in a Deck of Cards |
|
⚠ |
-
|
| 915 |
Partition Array into Disjoint Intervals |
|
⚠⚠ |
-
|
| 916 |
Word Subsets |
|
⚠⚠ |
-
|
| 917 |
Reverse Only Letters |
|
⚠ |
-
|
| 918 |
Maximum Sum Circular Subarray |
|
⚠⚠ |
-
|
| 919 |
Complete Binary Tree Inserter |
|
⚠⚠ |
-
|
| 920 |
Number of Music Playlists |
|
⚠⚠⚠ |
-
|
| 921 |
Minimum Add to Make Parentheses Valid |
|
⚠⚠ |
-
|
| 922 |
Sort Array By Parity II |
|
⚠ |
-
|
| 923 |
3Sum With Multiplicity |
|
⚠⚠ |
-
|
| 924 |
Minimize Malware Spread |
|
⚠⚠⚠ |
-
|
| 925 |
Long Pressed Name |
|
⚠ |
-
|
| 926 |
Flip String to Monotone Increasing |
|
⚠⚠ |
-
|
| 927 |
Three Equal Parts |
|
⚠⚠⚠ |
-
|
| 928 |
Minimize Malware Spread II |
|
⚠⚠⚠ |
-
|
| 929 |
Unique Email Addresses |
|
⚠ |
-
|
| 930 |
Binary Subarrays With Sum |
Prefix Sum
Sliding Window |
⚠⚠ |
Solution
|
| 931 |
Minimum Falling Path Sum |
|
⚠⚠ |
-
|
| 932 |
Beautiful Array |
|
⚠⚠ |
-
|
| 933 |
Number of Recent Calls |
|
⚠ |
-
|
| 934 |
Shortest Bridge |
DFS
BFS |
⚠⚠ |
Solution
|
| 935 |
Knight Dialer |
|
⚠⚠ |
-
|
| 936 |
Stamping The Sequence |
|
⚠⚠⚠ |
-
|
| 937 |
Reorder Data in Log Files |
|
⚠⚠ |
-
|
| 938 |
Range Sum of BST |
|
⚠ |
-
|
| 939 |
Minimum Area Rectangle |
|
⚠⚠ |
-
|
| 940 |
Distinct Subsequences II |
|
⚠⚠⚠ |
-
|
| 941 |
Valid Mountain Array |
|
⚠ |
-
|
| 942 |
DI String Match |
|
⚠ |
-
|
| 943 |
Find the Shortest Superstring |
|
⚠⚠⚠ |
-
|
| 944 |
Delete Columns to Make Sorted |
|
⚠ |
-
|
| 945 |
Minimum Increment to Make Array Unique |
|
⚠⚠ |
-
|
| 946 |
Validate Stack Sequences |
|
⚠⚠ |
-
|
| 947 |
Most Stones Removed with Same Row or Column |
|
⚠⚠ |
-
|
| 948 |
Bag of Tokens |
|
⚠⚠ |
-
|
| 949 |
Largest Time for Given Digits |
|
⚠⚠ |
-
|
| 950 |
Reveal Cards In Increasing Order |
|
⚠⚠ |
-
|
| 951 |
Flip Equivalent Binary Trees |
|
⚠⚠ |
-
|
| 952 |
Largest Component Size by Common Factor |
|
⚠⚠⚠ |
-
|
| 953 |
Verifying an Alien Dictionary |
|
⚠ |
-
|
| 954 |
Array of Doubled Pairs |
|
⚠⚠ |
-
|
| 955 |
Delete Columns to Make Sorted II |
|
⚠⚠ |
-
|
| 956 |
Tallest Billboard |
|
⚠⚠⚠ |
-
|
| 957 |
Prison Cells After N Days |
|
⚠⚠ |
-
|
| 958 |
Check Completeness of a Binary Tree |
|
⚠⚠ |
-
|
| 959 |
Regions Cut By Slashes |
|
⚠⚠ |
-
|
| 960 |
Delete Columns to Make Sorted III |
|
⚠⚠⚠ |
-
|
| 961 |
N-Repeated Element in Size 2N Array |
|
⚠ |
-
|
| 962 |
Maximum Width Ramp |
|
⚠⚠ |
-
|
| 963 |
Minimum Area Rectangle II |
|
⚠⚠ |
-
|
| 964 |
Least Operators to Express Number |
|
⚠⚠⚠ |
-
|
| 965 |
Univalued Binary Tree |
|
⚠ |
-
|
| 966 |
Vowel Spellchecker |
|
⚠⚠ |
-
|
| 967 |
Numbers With Same Consecutive Differences |
|
⚠⚠ |
-
|
| 968 |
Binary Tree Cameras |
|
⚠⚠⚠ |
-
|
| 969 |
Pancake Sorting |
|
⚠⚠ |
-
|
| 970 |
Powerful Integers |
|
⚠⚠ |
-
|
| 971 |
Flip Binary Tree To Match Preorder Traversal |
|
⚠⚠ |
-
|
| 972 |
Equal Rational Numbers |
|
⚠⚠⚠ |
-
|
| 973 |
K Closest Points to Origin |
|
⚠⚠ |
-
|
| 974 |
Subarray Sums Divisible by K |
|
⚠⚠ |
-
|
| 975 |
Odd Even Jump |
|
⚠⚠⚠ |
-
|
| 976 |
Largest Perimeter Triangle |
|
⚠ |
-
|
| 977 |
Squares of a Sorted Array |
|
⚠ |
-
|
| 978 |
Longest Turbulent Subarray |
|
⚠⚠ |
-
|
| 979 |
Distribute Coins in Binary Tree |
|
⚠⚠ |
-
|
| 980 |
Unique Paths III |
|
⚠⚠⚠ |
-
|
| 981 |
Time Based Key-Value Store |
|
⚠⚠ |
-
|
| 982 |
Triples with Bitwise AND Equal To Zero |
|
⚠⚠⚠ |
-
|
| 983 |
Minimum Cost For Tickets |
|
⚠⚠ |
-
|
| 984 |
String Without AAA or BBB |
|
⚠⚠ |
-
|
| 985 |
Sum of Even Numbers After Queries |
|
⚠⚠ |
-
|
| 986 |
Interval List Intersections |
|
⚠⚠ |
-
|
| 987 |
Vertical Order Traversal of a Binary Tree |
|
⚠⚠⚠ |
-
|
| 988 |
Smallest String Starting From Leaf |
|
⚠⚠ |
-
|
| 989 |
Add to Array-Form of Integer |
|
⚠ |
-
|
| 990 |
Satisfiability of Equality Equations |
|
⚠⚠ |
-
|
| 991 |
Broken Calculator |
|
⚠⚠ |
-
|
| 992 |
Subarrays with K Different Integers |
Sliding Window |
⚠⚠⚠ |
Solution
|
| 993 |
Cousins in Binary Tree |
|
⚠ |
-
|
| 994 |
Rotting Oranges |
BFS |
⚠⚠ |
Solution
|
| 995 |
Minimum Number of K Consecutive Bit Flips |
|
⚠⚠⚠ |
-
|
| 996 |
Number of Squareful Arrays |
|
⚠⚠⚠ |
-
|
| 997 |
Find the Town Judge |
|
⚠ |
-
|
| 998 |
Maximum Binary Tree II |
|
⚠⚠ |
-
|
| 999 |
Available Captures for Rook |
|
⚠ |
-
|
| 1000 |
Minimum Cost to Merge Stones |
|
⚠⚠⚠ |
-
|
| 1001 |
Grid Illumination |
|
⚠⚠⚠ |
-
|
| 1002 |
Find Common Characters |
|
⚠ |
-
|
| 1003 |
Check If Word Is Valid After Substitutions |
|
⚠⚠ |
-
|
| 1004 |
Max Consecutive Ones III |
Sliding Window |
⚠⚠ |
Solution
|
| 1005 |
Maximize Sum Of Array After K Negations |
|
⚠ |
-
|
| 1006 |
Clumsy Factorial |
|
⚠⚠ |
-
|
| 1007 |
Minimum Domino Rotations For Equal Row |
|
⚠⚠ |
-
|
| 1008 |
Construct Binary Search Tree from Preorder Traversal |
|
⚠⚠ |
-
|
| 1009 |
Complement of Base 10 Integer |
Bitwise operations |
⚠ |
Solution
|
| 1010 |
Pairs of Songs With Total Durations Divisible by 60 |
|
⚠⚠ |
-
|
| 1011 |
Capacity To Ship Packages Within D Days |
|
⚠⚠ |
-
|
| 1012 |
Numbers With Repeated Digits |
|
⚠⚠⚠ |
-
|
| 1013 |
Partition Array Into Three Parts With Equal Sum |
|
⚠ |
-
|
| 1014 |
Best Sightseeing Pair |
|
⚠⚠ |
-
|
| 1015 |
Smallest Integer Divisible by K |
|
⚠⚠ |
-
|
| 1016 |
Binary String With Substrings Representing 1 To N |
String
Math |
⚠⚠ |
Solution
|
| 1017 |
Convert to Base -2 |
|
⚠⚠ |
-
|
| 1018 |
Binary Prefix Divisible By 5 |
|
⚠ |
-
|
| 1019 |
Next Greater Node In Linked List |
Array
Monotonic Stack |
⚠⚠ |
Solution
|
| 1020 |
Number of Enclaves |
|
⚠⚠ |
Solution
|
| 1021 |
Remove Outermost Parentheses |
|
⚠ |
-
|
| 1022 |
Sum of Root To Leaf Binary Numbers |
|
⚠ |
-
|
| 1023 |
Camelcase Matching |
|
⚠⚠ |
-
|
| 1024 |
Video Stitching |
|
⚠⚠ |
-
|
| 1025 |
Divisor Game |
|
⚠ |
-
|
| 1026 |
Maximum Difference Between Node and Ancestor |
|
⚠⚠ |
-
|
| 1027 |
Longest Arithmetic Subsequence |
|
⚠⚠ |
-
|
| 1028 |
Recover a Tree From Preorder Traversal |
|
⚠⚠⚠ |
-
|
| 1029 |
Two City Scheduling |
|
⚠⚠ |
-
|
| 1030 |
Matrix Cells in Distance Order |
|
⚠ |
-
|
| 1031 |
Maximum Sum of Two Non-Overlapping Subarrays |
|
⚠⚠ |
-
|
| 1032 |
Stream of Characters |
|
⚠⚠⚠ |
-
|
| 1033 |
Moving Stones Until Consecutive |
|
⚠⚠ |
-
|
| 1034 |
Coloring A Border |
DFS |
⚠⚠ |
Solution
|
| 1035 |
Uncrossed Lines |
|
⚠⚠ |
-
|
| 1036 |
Escape a Large Maze |
|
⚠⚠⚠ |
-
|
| 1037 |
Valid Boomerang |
|
⚠ |
-
|
| 1038 |
Binary Search Tree to Greater Sum Tree |
|
⚠⚠ |
-
|
| 1039 |
Minimum Score Triangulation of Polygon |
|
⚠⚠ |
-
|
| 1040 |
Moving Stones Until Consecutive II |
|
⚠⚠ |
-
|
| 1041 |
Robot Bounded In Circle |
|
⚠⚠ |
-
|
| 1042 |
Flower Planting With No Adjacent |
|
⚠⚠ |
-
|
| 1043 |
Partition Array for Maximum Sum |
|
⚠⚠ |
-
|
| 1044 |
Longest Duplicate Substring |
|
⚠⚠⚠ |
-
|
| 1046 |
Last Stone Weight |
|
⚠ |
-
|
| 1047 |
Remove All Adjacent Duplicates In String |
|
⚠ |
-
|
| 1048 |
Longest String Chain |
|
⚠⚠ |
-
|
| 1049 |
Last Stone Weight II |
|
⚠⚠ |
-
|
| 1051 |
Height Checker |
|
⚠ |
-
|
| 1052 |
Grumpy Bookstore Owner |
Sliding Window |
⚠⚠ |
Solution
|
| 1053 |
Previous Permutation With One Swap |
|
⚠⚠ |
-
|
| 1054 |
Distant Barcodes |
|
⚠⚠ |
-
|
| 1061 |
Lexicographically Smallest Equivalent String |
|
⚠⚠ |
-
|
| 1071 |
Greatest Common Divisor of Strings |
|
⚠ |
-
|
| 1072 |
Flip Columns For Maximum Number of Equal Rows |
|
⚠⚠ |
-
|
| 1073 |
Adding Two Negabinary Numbers |
|
⚠⚠ |
-
|
| 1074 |
Number of Submatrices That Sum to Target |
|
⚠⚠⚠ |
-
|
| 1078 |
Occurrences After Bigram |
|
⚠ |
-
|
| 1079 |
Letter Tile Possibilities |
|
⚠⚠ |
-
|
| 1080 |
Insufficient Nodes in Root to Leaf Paths |
|
⚠⚠ |
-
|
| 1081 |
Smallest Subsequence of Distinct Characters |
|
⚠⚠ |
-
|
| 1089 |
Duplicate Zeros |
|
⚠ |
-
|
| 1090 |
Largest Values From Labels |
|
⚠⚠ |
-
|
| 1091 |
Shortest Path in Binary Matrix |
BFS |
⚠⚠ |
Solution
|
| 1092 |
Shortest Common Supersequence |
|
⚠⚠⚠ |
-
|
| 1093 |
Statistics from a Large Sample |
|
⚠⚠ |
-
|
| 1094 |
Car Pooling |
|
⚠⚠ |
-
|
| 1095 |
Find in Mountain Array |
|
⚠⚠⚠ |
-
|
| 1096 |
Brace Expansion II |
|
⚠⚠⚠ |
-
|
| 1103 |
Distribute Candies to People |
|
⚠ |
-
|
| 1104 |
Path In Zigzag Labelled Binary Tree |
|
⚠⚠ |
-
|
| 1105 |
Filling Bookcase Shelves |
|
⚠⚠ |
-
|
| 1106 |
Parsing A Boolean Expression |
|
⚠⚠⚠ |
-
|
| 1108 |
Defanging an IP Address |
|
⚠ |
-
|
| 1109 |
Corporate Flight Bookings |
|
⚠⚠ |
-
|
| 1110 |
Delete Nodes And Return Forest |
|
⚠⚠ |
-
|
| 1111 |
Maximum Nesting Depth of Two Valid Parentheses Strings |
|
⚠⚠ |
-
|
| 1122 |
Relative Sort Array |
|
⚠ |
-
|
| 1123 |
Lowest Common Ancestor of Deepest Leaves |
|
⚠⚠ |
-
|
| 1124 |
Longest Well-Performing Interval |
|
⚠⚠ |
-
|
| 1125 |
Smallest Sufficient Team |
|
⚠⚠⚠ |
-
|
| 1128 |
Number of Equivalent Domino Pairs |
|
⚠ |
-
|
| 1129 |
Shortest Path with Alternating Colors |
|
⚠⚠ |
-
|
| 1130 |
Minimum Cost Tree From Leaf Values |
|
⚠⚠ |
-
|
| 1131 |
Maximum of Absolute Value Expression |
|
⚠⚠ |
-
|
| 1137 |
N-th Tribonacci Number |
|
⚠ |
-
|
| 1138 |
Alphabet Board Path |
|
⚠⚠ |
-
|
| 1139 |
Largest 1-Bordered Square |
|
⚠⚠ |
-
|
| 1140 |
Stone Game II |
|
⚠⚠ |
-
|
| 1143 |
Longest Common Subsequence |
|
⚠⚠ |
-
|
| 1144 |
Decrease Elements To Make Array Zigzag |
|
⚠⚠ |
-
|
| 1145 |
Binary Tree Coloring Game |
|
⚠⚠ |
-
|
| 1146 |
Snapshot Array |
|
⚠⚠ |
-
|
| 1147 |
Longest Chunked Palindrome Decomposition |
|
⚠⚠⚠ |
-
|
| 1154 |
Day of the Year |
|
⚠ |
-
|
| 1155 |
Number of Dice Rolls With Target Sum |
|
⚠⚠ |
-
|
| 1156 |
Swap For Longest Repeated Character Substring |
|
⚠⚠ |
-
|
| 1157 |
Online Majority Element In Subarray |
|
⚠⚠⚠ |
-
|
| 1160 |
Find Words That Can Be Formed by Characters |
|
⚠ |
-
|
| 1161 |
Maximum Level Sum of a Binary Tree |
|
⚠⚠ |
-
|
| 1162 |
As Far from Land as Possible |
BFS |
⚠⚠ |
Solution
|
| 1163 |
Last Substring in Lexicographical Order |
|
⚠⚠⚠ |
-
|
| 1169 |
Invalid Transactions |
|
⚠⚠ |
-
|
| 1170 |
Compare Strings by Frequency of the Smallest Character |
|
⚠⚠ |
-
|
| 1171 |
Remove Zero Sum Consecutive Nodes from Linked List |
|
⚠⚠ |
-
|
| 1172 |
Dinner Plate Stacks |
|
⚠⚠⚠ |
-
|
| 1175 |
Prime Arrangements |
|
⚠ |
-
|
| 1177 |
Can Make Palindrome from Substring |
|
⚠⚠ |
-
|
| 1178 |
Number of Valid Words for Each Puzzle |
|
⚠⚠⚠ |
-
|
| 1184 |
Distance Between Bus Stops |
|
⚠ |
-
|
| 1185 |
Day of the Week |
|
⚠ |
-
|
| 1186 |
Maximum Subarray Sum with One Deletion |
|
⚠⚠ |
-
|
| 1187 |
Make Array Strictly Increasing |
|
⚠⚠⚠ |
-
|
| 1189 |
Maximum Number of Balloons |
|
⚠ |
-
|
| 1190 |
Reverse Substrings Between Each Pair of Parentheses |
|
⚠⚠ |
-
|
| 1191 |
K-Concatenation Maximum Sum |
|
⚠⚠ |
-
|
| 1192 |
Critical Connections in a Network |
|
⚠⚠⚠ |
-
|
| 1200 |
Minimum Absolute Difference |
|
⚠ |
-
|
| 1201 |
Ugly Number III |
|
⚠⚠ |
-
|
| 1202 |
Smallest String With Swaps |
|
⚠⚠ |
-
|
| 1203 |
Sort Items by Groups Respecting Dependencies |
|
⚠⚠⚠ |
-
|
| 1206 |
Design Skiplist |
|
⚠⚠⚠ |
-
|
| 1207 |
Unique Number of Occurrences |
|
⚠ |
-
|
| 1208 |
Get Equal Substrings Within Budget |
Sliding Window |
⚠⚠ |
Solution
|
| 1209 |
Remove All Adjacent Duplicates in String II |
|
⚠⚠ |
-
|
| 1210 |
Minimum Moves to Reach Target with Rotations |
|
⚠⚠⚠ |
-
|
| 1217 |
Minimum Cost to Move Chips to The Same Position |
|
⚠ |
-
|
| 1218 |
Longest Arithmetic Subsequence of Given Difference |
|
⚠⚠ |
-
|
| 1219 |
Path with Maximum Gold |
|
⚠⚠ |
-
|
| 1220 |
Count Vowels Permutation |
|
⚠⚠⚠ |
-
|
| 1221 |
Split a String in Balanced Strings |
|
⚠ |
-
|
| 1222 |
Queens That Can Attack the King |
|
⚠⚠ |
-
|
| 1223 |
Dice Roll Simulation |
|
⚠⚠⚠ |
-
|
| 1224 |
Maximum Equal Frequency |
|
⚠⚠⚠ |
-
|
| 1227 |
Airplane Seat Assignment Probability |
|
⚠⚠ |
-
|
| 1232 |
Check If It Is a Straight Line |
|
⚠ |
-
|
| 1233 |
Remove Sub-Folders from the Filesystem |
|
⚠⚠ |
-
|
| 1234 |
Replace the Substring for Balanced String |
|
⚠⚠ |
-
|
| 1235 |
Maximum Profit in Job Scheduling |
|
⚠⚠⚠ |
-
|
| 1237 |
Find Positive Integer Solution for a Given Equation |
|
⚠⚠ |
-
|
| 1238 |
Circular Permutation in Binary Representation |
|
⚠⚠ |
-
|
| 1239 |
Maximum Length of a Concatenated String with Unique Characters |
|
⚠⚠ |
-
|
| 1240 |
Tiling a Rectangle with the Fewest Squares |
|
⚠⚠⚠ |
-
|
| 1247 |
Minimum Swaps to Make Strings Equal |
|
⚠⚠ |
-
|
| 1248 |
Count Number of Nice Subarrays |
Slinding Window |
⚠⚠ |
Solution
|
| 1249 |
Minimum Remove to Make Valid Parentheses |
|
⚠⚠ |
-
|
| 1250 |
Check If It Is a Good Array |
|
⚠⚠⚠ |
-
|
| 1252 |
Cells with Odd Values in a Matrix |
|
⚠ |
-
|
| 1253 |
Reconstruct a 2-Row Binary Matrix |
|
⚠⚠ |
-
|
| 1254 |
Number of Closed Islands |
DFS |
⚠⚠ |
Solution
|
| 1255 |
Maximum Score Words Formed by Letters |
|
⚠⚠⚠ |
-
|
| 1260 |
Shift 2D Grid |
|
⚠ |
-
|
| 1261 |
Find Elements in a Contaminated Binary Tree |
|
⚠⚠ |
-
|
| 1262 |
Greatest Sum Divisible by Three |
|
⚠⚠ |
-
|
| 1263 |
Minimum Moves to Move a Box to Their Target Location |
|
⚠⚠⚠ |
-
|
| 1266 |
Minimum Time Visiting All Points |
|
⚠ |
-
|
| 1267 |
Count Servers that Communicate |
|
⚠⚠ |
-
|
| 1268 |
Search Suggestions System |
|
⚠⚠ |
-
|
| 1269 |
Number of Ways to Stay in the Same Place After Some Steps |
|
⚠⚠⚠ |
-
|
| 1275 |
Find Winner on a Tic Tac Toe Game |
|
⚠ |
-
|
| 1276 |
Number of Burgers with No Waste of Ingredients |
|
⚠⚠ |
-
|
| 1277 |
Count Square Submatrices with All Ones |
|
⚠⚠ |
-
|
| 1278 |
Palindrome Partitioning III |
|
⚠⚠⚠ |
-
|
| 1281 |
Subtract the Product and Sum of Digits of an Integer |
|
⚠ |
-
|
| 1282 |
Group the People Given the Group Size They Belong To |
|
⚠⚠ |
-
|
| 1283 |
Find the Smallest Divisor Given a Threshold |
|
⚠⚠ |
-
|
| 1284 |
Minimum Number of Flips to Convert Binary Matrix to Zero Matrix |
|
⚠⚠⚠ |
-
|
| 1286 |
Iterator for Combination |
|
⚠⚠ |
-
|
| 1287 |
Element Appearing More Than 25% In Sorted Array |
|
⚠ |
-
|
| 1288 |
Remove Covered Intervals |
|
⚠⚠ |
-
|
| 1289 |
Minimum Falling Path Sum II |
|
⚠⚠⚠ |
-
|
| 1290 |
Convert Binary Number in a Linked List to Integer |
|
⚠ |
-
|
| 1291 |
Sequential Digits |
|
⚠⚠ |
-
|
| 1292 |
Maximum Side Length of a Square with Sum Less than or Equal to Threshold |
|
⚠⚠ |
-
|
| 1293 |
Shortest Path in a Grid with Obstacles Elimination |
|
⚠⚠⚠ |
-
|
| 1295 |
Find Numbers with Even Number of Digits |
|
⚠ |
-
|
| 1296 |
Divide Array in Sets of K Consecutive Numbers |
|
⚠⚠ |
-
|
| 1297 |
Maximum Number of Occurrences of a Substring |
Sliding Window |
⚠⚠ |
Solution
|
| 1298 |
Maximum Candies You Can Get from Boxes |
|
⚠⚠⚠ |
-
|
| 1299 |
Replace Elements with Greatest Element on Right Side |
|
⚠ |
-
|
| 1300 |
Sum of Mutated Array Closest to Target |
|
⚠⚠ |
-
|
| 1301 |
Number of Paths with Max Score |
|
⚠⚠⚠ |
-
|
| 1302 |
Deepest Leaves Sum |
|
⚠⚠ |
-
|
| 1304 |
Find N Unique Integers Sum up to Zero |
|
⚠ |
-
|
| 1305 |
All Elements in Two Binary Search Trees |
|
⚠⚠ |
-
|
| 1306 |
Jump Game III |
|
⚠⚠ |
-
|
| 1307 |
Verbal Arithmetic Puzzle |
|
⚠⚠⚠ |
-
|
| 1309 |
Decrypt String from Alphabet to Integer Mapping |
|
⚠ |
-
|
| 1310 |
XOR Queries of a Subarray |
Bitwise Operation |
⚠⚠ |
Solution
|
| 1311 |
Get Watched Videos by Your Friends |
|
⚠⚠ |
-
|
| 1312 |
Minimum Insertion Steps to Make a String Palindrome |
|
⚠⚠⚠ |
-
|
| 1313 |
Decompress Run-Length Encoded List |
|
⚠ |
-
|
| 1314 |
Matrix Block Sum |
|
⚠⚠ |
-
|
| 1315 |
Sum of Nodes with Even-Valued Grandparent |
|
⚠⚠ |
-
|
| 1316 |
Distinct Echo Substrings |
|
⚠⚠⚠ |
-
|
| 1317 |
Convert Integer to the Sum of Two No-Zero Integers |
|
⚠ |
-
|
| 1318 |
Minimum Flips to Make a OR b Equal to c |
|
⚠⚠ |
-
|
| 1319 |
Number of Operations to Make Network Connected |
|
⚠⚠ |
-
|
| 1320 |
Minimum Distance to Type a Word Using Two Fingers |
|
⚠⚠⚠ |
-
|
| 1323 |
Maximum 69 Number |
|
⚠ |
-
|
| 1324 |
Print Words Vertically |
|
⚠⚠ |
-
|
| 1325 |
Delete Leaves With a Given Value |
|
⚠⚠ |
-
|
| 1326 |
Minimum Number of Taps to Open to Water a Garden |
|
⚠⚠⚠ |
-
|
| 1328 |
Break a Palindrome |
|
⚠⚠ |
-
|
| 1329 |
Sort the Matrix Diagonally |
|
⚠⚠ |
-
|
| 1330 |
Reverse Subarray To Maximize Array Value |
|
⚠⚠⚠ |
-
|
| 1331 |
Rank Transform of an Array |
|
⚠ |
-
|
| 1332 |
Remove Palindromic Subsequences |
|
⚠ |
-
|
| 1333 |
Filter Restaurants by Vegan-Friendly, Price and Distance |
|
⚠⚠ |
-
|
| 1334 |
Find the City With the Smallest Number of Neighbors at a Threshold Distance |
|
⚠⚠ |
-
|
| 1335 |
Minimum Difficulty of a Job Schedule |
|
⚠⚠⚠ |
-
|
| 1337 |
The K Weakest Rows in a Matrix |
|
⚠ |
-
|
| 1338 |
Reduce Array Size to The Half |
|
⚠⚠ |
-
|
| 1339 |
Maximum Product of Splitted Binary Tree |
|
⚠⚠ |
-
|
| 1340 |
Jump Game V |
|
⚠⚠⚠ |
-
|
| 1342 |
Number of Steps to Reduce a Number to Zero |
Bitwise operations |
⚠ |
Solution
|
| 1343 |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold |
Sliding Window |
⚠⚠ |
Solution
|
| 1344 |
Angle Between Hands of a Clock |
|
⚠⚠ |
-
|
| 1345 |
Jump Game IV |
|
⚠⚠⚠ |
-
|
| 1346 |
Check If N and Its Double Exist |
|
⚠ |
-
|
| 1347 |
Minimum Number of Steps to Make Two Strings Anagram |
|
⚠⚠ |
-
|
| 1348 |
Tweet Counts Per Frequency |
|
⚠⚠ |
-
|
| 1349 |
Maximum Students Taking Exam |
|
⚠⚠⚠ |
-
|
| 1351 |
Count Negative Numbers in a Sorted Matrix |
|
⚠ |
-
|
| 1352 |
Product of the Last K Numbers |
|
⚠⚠ |
-
|
| 1353 |
Maximum Number of Events That Can Be Attended |
|
⚠⚠ |
-
|
| 1354 |
Construct Target Array With Multiple Sums |
|
⚠⚠⚠ |
-
|
| 1356 |
Sort Integers by The Number of 1 Bits |
Bitwise operations |
⚠ |
Solution
|
| 1357 |
Apply Discount Every n Orders |
|
⚠⚠ |
-
|
| 1358 |
Number of Substrings Containing All Three Characters |
|
⚠⚠ |
-
|
| 1359 |
Count All Valid Pickup and Delivery Options |
|
⚠⚠⚠ |
-
|
| 1360 |
Number of Days Between Two Dates |
|
⚠ |
-
|
| 1361 |
Validate Binary Tree Nodes |
|
⚠⚠ |
-
|
| 1362 |
Closest Divisors |
|
⚠⚠ |
-
|
| 1363 |
Largest Multiple of Three |
|
⚠⚠⚠ |
-
|
| 1365 |
How Many Numbers Are Smaller Than the Current Number |
|
⚠ |
-
|
| 1366 |
Rank Teams by Votes |
|
⚠⚠ |
-
|
| 1367 |
Linked List in Binary Tree |
|
⚠⚠ |
-
|
| 1368 |
Minimum Cost to Make at Least One Valid Path in a Grid |
|
⚠⚠⚠ |
-
|
| 1370 |
Increasing Decreasing String |
|
⚠ |
-
|
| 1371 |
Find the Longest Substring Containing Vowels in Even Counts |
|
⚠⚠ |
-
|
| 1372 |
Longest ZigZag Path in a Binary Tree |
|
⚠⚠ |
-
|
| 1373 |
Maximum Sum BST in Binary Tree |
|
⚠⚠⚠ |
-
|
| 1374 |
Generate a String With Characters That Have Odd Counts |
|
⚠ |
-
|
| 1375 |
Number of Times Binary String Is Prefix-Aligned |
|
⚠⚠ |
-
|
| 1376 |
Time Needed to Inform All Employees |
|
⚠⚠ |
-
|
| 1377 |
Frog Position After T Seconds |
|
⚠⚠⚠ |
-
|
| 1379 |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
|
⚠ |
-
|
| 1380 |
Lucky Numbers in a Matrix |
|
⚠ |
-
|
| 1381 |
Design a Stack With Increment Operation |
|
⚠⚠ |
-
|
| 1382 |
Balance a Binary Search Tree |
|
⚠⚠ |
-
|
| 1383 |
Maximum Performance of a Team |
|
⚠⚠⚠ |
-
|
| 1385 |
Find the Distance Value Between Two Arrays |
Binary Search |
⚠ |
Solution
|
| 1386 |
Cinema Seat Allocation |
|
⚠⚠ |
-
|
| 1387 |
Sort Integers by The Power Value |
|
⚠⚠ |
-
|
| 1388 |
Pizza With 3n Slices |
|
⚠⚠⚠ |
-
|
| 1389 |
Create Target Array in the Given Order |
|
⚠ |
-
|
| 1390 |
Four Divisors |
|
⚠⚠ |
-
|
| 1391 |
Check if There is a Valid Path in a Grid |
DFS |
⚠⚠ |
Solution
|
| 1392 |
Longest Happy Prefix |
|
⚠⚠⚠ |
-
|
| 1394 |
Find Lucky Integer in an Array |
|
⚠ |
-
|
| 1395 |
Count Number of Teams |
|
⚠⚠ |
-
|
| 1396 |
Design Underground System |
|
⚠⚠ |
-
|
| 1397 |
Find All Good Strings |
|
⚠⚠⚠ |
-
|
| 1399 |
Count Largest Group |
|
⚠ |
-
|
| 1400 |
Construct K Palindrome Strings |
|
⚠⚠ |
-
|
| 1401 |
Circle and Rectangle Overlapping |
|
⚠⚠ |
-
|
| 1402 |
Reducing Dishes |
|
⚠⚠⚠ |
-
|
| 1403 |
Minimum Subsequence in Non-Increasing Order |
|
⚠ |
-
|
| 1404 |
Number of Steps to Reduce a Number in Binary Representation to One |
|
⚠⚠ |
-
|
| 1405 |
Longest Happy String |
|
⚠⚠ |
-
|
| 1406 |
Stone Game III |
|
⚠⚠⚠ |
-
|
| 1408 |
String Matching in an Array |
|
⚠ |
-
|
| 1409 |
Queries on a Permutation With Key |
|
⚠⚠ |
-
|
| 1410 |
HTML Entity Parser |
|
⚠⚠ |
-
|
| 1411 |
Number of Ways to Paint N × 3 Grid |
|
⚠⚠⚠ |
-
|
| 1413 |
Minimum Value to Get Positive Step by Step Sum |
|
⚠ |
-
|
| 1414 |
Find the Minimum Number of Fibonacci Numbers Whose Sum Is K |
|
⚠⚠ |
-
|
| 1415 |
The k-th Lexicographical String of All Happy Strings of Length n |
Math |
⚠⚠ |
Solution
|
| 1416 |
Restore The Array |
|
⚠⚠⚠ |
-
|
| 1417 |
Reformat The String |
|
⚠ |
-
|
| 1418 |
Display Table of Food Orders in a Restaurant |
|
⚠⚠ |
-
|
| 1419 |
Minimum Number of Frogs Croaking |
|
⚠⚠ |
-
|
| 1420 |
Build Array Where You Can Find The Maximum Exactly K Comparisons |
|
⚠⚠⚠ |
-
|
| 1422 |
Maximum Score After Splitting a String |
|
⚠ |
-
|
| 1423 |
Maximum Points You Can Obtain from Cards |
Sliding Window |
⚠⚠ |
Solution
|
| 1424 |
Diagonal Traverse II |
|
⚠⚠ |
-
|
| 1425 |
Constrained Subsequence Sum |
|
⚠⚠⚠ |
-
|
| 1431 |
Kids With the Greatest Number of Candies |
|
⚠ |
-
|
| 1432 |
Max Difference You Can Get From Changing an Integer |
|
⚠⚠ |
-
|
| 1433 |
Check If a String Can Break Another String |
|
⚠⚠ |
-
|
| 1434 |
Number of Ways to Wear Different Hats to Each Other |
|
⚠⚠⚠ |
-
|
| 1436 |
Destination City |
|
⚠ |
-
|
| 1437 |
Check If All 1's Are at Least Length K Places Away |
|
⚠ |
-
|
| 1438 |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
|
⚠⚠ |
-
|
| 1439 |
Find the Kth Smallest Sum of a Matrix With Sorted Rows |
|
⚠⚠⚠ |
-
|
| 1441 |
Build an Array With Stack Operations |
|
⚠⚠ |
-
|
| 1442 |
Count Triplets That Can Form Two Arrays of Equal XOR |
Bitwise Operation
Prefix Sum |
⚠⚠ |
Solution
|
| 1443 |
Minimum Time to Collect All Apples in a Tree |
|
⚠⚠ |
-
|
| 1444 |
Number of Ways of Cutting a Pizza |
|
⚠⚠⚠ |
-
|
| 1446 |
Consecutive Characters |
|
⚠ |
-
|
| 1447 |
Simplified Fractions |
|
⚠⚠ |
-
|
| 1448 |
Count Good Nodes in Binary Tree |
|
⚠⚠ |
-
|
| 1449 |
Form Largest Integer With Digits That Add up to Target |
|
⚠⚠⚠ |
-
|
| 1450 |
Number of Students Doing Homework at a Given Time |
|
⚠ |
-
|
| 1451 |
Rearrange Words in a Sentence |
|
⚠⚠ |
-
|
| 1452 |
People Whose List of Favorite Companies Is Not a Subset of Another List |
|
⚠⚠ |
-
|
| 1453 |
Maximum Number of Darts Inside of a Circular Dartboard |
|
⚠⚠⚠ |
-
|
| 1455 |
Check If a Word Occurs As a Prefix of Any Word in a Sentence |
|
⚠ |
-
|
| 1456 |
Maximum Number of Vowels in a Substring of Given Length |
Sliding Window |
⚠⚠ |
Solution
|
| 1457 |
Pseudo-Palindromic Paths in a Binary Tree |
|
⚠⚠ |
-
|
| 1458 |
Max Dot Product of Two Subsequences |
|
⚠⚠⚠ |
-
|
| 1460 |
Make Two Arrays Equal by Reversing Subarrays |
|
⚠ |
-
|
| 1461 |
Check If a String Contains All Binary Codes of Size K |
|
⚠⚠ |
Solution
|
| 1462 |
Course Schedule IV |
|
⚠⚠ |
-
|
| 1463 |
Cherry Pickup II |
|
⚠⚠⚠ |
-
|
| 1464 |
Maximum Product of Two Elements in an Array |
|
⚠ |
-
|
| 1465 |
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
|
⚠⚠ |
-
|
| 1466 |
Reorder Routes to Make All Paths Lead to the City Zero |
|
⚠⚠ |
-
|
| 1467 |
Probability of a Two Boxes Having The Same Number of Distinct Balls |
|
⚠⚠⚠ |
-
|
| 1470 |
Shuffle the Array |
|
⚠ |
-
|
| 1471 |
The k Strongest Values in an Array |
|
⚠⚠ |
-
|
| 1472 |
Design Browser History |
|
⚠⚠ |
-
|
| 1473 |
Paint House III |
|
⚠⚠⚠ |
-
|
| 1475 |
Final Prices With a Special Discount in a Shop |
Monotonic Stack |
⚠ |
Solution
|
| 1476 |
Subrectangle Queries |
|
⚠⚠ |
-
|
| 1477 |
Find Two Non-overlapping Sub-arrays Each With Target Sum |
|
⚠⚠ |
-
|
| 1478 |
Allocate Mailboxes |
|
⚠⚠⚠ |
-
|
| 1480 |
Running Sum of 1d Array |
|
⚠ |
-
|
| 1481 |
Least Number of Unique Integers after K Removals |
|
⚠⚠ |
-
|
| 1482 |
Minimum Number of Days to Make m Bouquets |
|
⚠⚠ |
-
|
| 1483 |
Kth Ancestor of a Tree Node |
|
⚠⚠⚠ |
-
|
| 1486 |
XOR Operation in an Array |
Bitwise operations |
⚠ |
Solution
|
| 1487 |
Making File Names Unique |
|
⚠⚠ |
-
|
| 1488 |
Avoid Flood in The City |
|
⚠⚠ |
-
|
| 1489 |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree |
|
⚠⚠⚠ |
-
|
| 1491 |
Average Salary Excluding the Minimum and Maximum Salary |
|
⚠ |
-
|
| 1492 |
The kth Factor of n |
|
⚠⚠ |
-
|
| 1493 |
Longest Subarray of 1's After Deleting One Element |
|
⚠⚠ |
Solution
|
| 1494 |
Parallel Courses II |
|
⚠⚠⚠ |
-
|
| 1496 |
Path Crossing |
|
⚠ |
-
|
| 1497 |
Check If Array Pairs Are Divisible by k |
|
⚠⚠ |
-
|
| 1498 |
Number of Subsequences That Satisfy the Given Sum Condition |
|
⚠⚠ |
-
|
| 1499 |
Max Value of Equation |
|
⚠⚠⚠ |
-
|
| 1502 |
Can Make Arithmetic Progression From Sequence |
|
⚠ |
-
|
| 1503 |
Last Moment Before All Ants Fall Out of a Plank |
|
⚠⚠ |
-
|
| 1504 |
Count Submatrices With All Ones |
|
⚠⚠ |
-
|
| 1505 |
Minimum Possible Integer After at Most K Adjacent Swaps On Digits |
|
⚠⚠⚠ |
-
|
| 1507 |
Reformat Date |
|
⚠ |
-
|
| 1508 |
Range Sum of Sorted Subarray Sums |
|
⚠⚠ |
-
|
| 1509 |
Minimum Difference Between Largest and Smallest Value in Three Moves |
|
⚠⚠ |
-
|
| 1510 |
Stone Game IV |
|
⚠⚠⚠ |
-
|
| 1512 |
Number of Good Pairs |
|
⚠ |
-
|
| 1513 |
Number of Substrings With Only 1s |
|
⚠⚠ |
-
|
| 1514 |
Path with Maximum Probability |
|
⚠⚠ |
-
|
| 1515 |
Best Position for a Service Centre |
|
⚠⚠⚠ |
-
|
| 1518 |
Water Bottles |
|
⚠ |
-
|
| 1519 |
Number of Nodes in the Sub-Tree With the Same Label |
|
⚠⚠ |
-
|
| 1520 |
Maximum Number of Non-Overlapping Substrings |
|
⚠⚠⚠ |
-
|
| 1521 |
Find a Value of a Mysterious Function Closest to Target |
|
⚠⚠⚠ |
-
|
| 1523 |
Count Odd Numbers in an Interval Range |
|
⚠ |
-
|
| 1524 |
Number of Sub-arrays With Odd Sum |
|
⚠⚠ |
-
|
| 1525 |
Number of Good Ways to Split a String |
|
⚠⚠ |
-
|
| 1526 |
Minimum Number of Increments on Subarrays to Form a Target Array |
|
⚠⚠⚠ |
-
|
| 1528 |
Shuffle String |
|
⚠ |
-
|
| 1529 |
Minimum Suffix Flips |
|
⚠⚠ |
-
|
| 1530 |
Number of Good Leaf Nodes Pairs |
|
⚠⚠ |
-
|
| 1531 |
String Compression II |
|
⚠⚠⚠ |
-
|
| 1534 |
Count Good Triplets |
|
⚠ |
-
|
| 1535 |
Find the Winner of an Array Game |
|
⚠⚠ |
-
|
| 1536 |
Minimum Swaps to Arrange a Binary Grid |
|
⚠⚠ |
-
|
| 1537 |
Get the Maximum Score |
|
⚠⚠⚠ |
-
|
| 1539 |
Kth Missing Positive Number |
|
⚠ |
-
|
| 1540 |
Can Convert String in K Moves |
|
⚠⚠ |
-
|
| 1541 |
Minimum Insertions to Balance a Parentheses String |
|
⚠⚠ |
-
|
| 1542 |
Find Longest Awesome Substring |
|
⚠⚠⚠ |
-
|
| 1544 |
Make The String Great |
|
⚠ |
-
|
| 1545 |
Find Kth Bit in Nth Binary String |
|
⚠⚠ |
-
|
| 1546 |
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target |
|
⚠⚠ |
-
|
| 1547 |
Minimum Cost to Cut a Stick |
|
⚠⚠⚠ |
-
|
| 1550 |
Three Consecutive Odds |
|
⚠ |
-
|
| 1551 |
Minimum Operations to Make Array Equal |
|
⚠⚠ |
-
|
| 1552 |
Magnetic Force Between Two Balls |
|
⚠⚠ |
-
|
| 1553 |
Minimum Number of Days to Eat N Oranges |
|
⚠⚠⚠ |
-
|
| 1556 |
Thousand Separator |
|
⚠ |
-
|
| 1557 |
Minimum Number of Vertices to Reach All Nodes |
|
⚠⚠ |
-
|
| 1558 |
Minimum Numbers of Function Calls to Make Target Array |
|
⚠⚠ |
-
|
| 1559 |
Detect Cycles in 2D Grid |
DFS |
⚠⚠ |
Solution
|
| 1560 |
Most Visited Sector in a Circular Track |
|
⚠ |
-
|
| 1561 |
Maximum Number of Coins You Can Get |
|
⚠⚠ |
-
|
| 1562 |
Find Latest Group of Size M |
|
⚠⚠ |
-
|
| 1563 |
Stone Game V |
|
⚠⚠⚠ |
-
|
| 1566 |
Detect Pattern of Length M Repeated K or More Times |
|
⚠ |
-
|
| 1567 |
Maximum Length of Subarray With Positive Product |
|
⚠⚠ |
-
|
| 1568 |
Minimum Number of Days to Disconnect Island |
|
⚠⚠⚠ |
-
|
| 1569 |
Number of Ways to Reorder Array to Get Same BST |
|
⚠⚠⚠ |
-
|
| 1572 |
Matrix Diagonal Sum |
|
⚠ |
-
|
| 1573 |
Number of Ways to Split a String |
|
⚠⚠ |
-
|
| 1574 |
Shortest Subarray to be Removed to Make Array Sorted |
|
⚠⚠ |
-
|
| 1575 |
Count All Possible Routes |
|
⚠⚠⚠ |
-
|
| 1576 |
Replace All ?'s to Avoid Consecutive Repeating Characters |
|
⚠ |
-
|
| 1577 |
Number of Ways Where Square of Number Is Equal to Product of Two Numbers |
|
⚠⚠ |
-
|
| 1578 |
Minimum Time to Make Rope Colorful |
|
⚠⚠ |
-
|
| 1579 |
Remove Max Number of Edges to Keep Graph Fully Traversable |
|
⚠⚠⚠ |
-
|
| 1582 |
Special Positions in a Binary Matrix |
|
⚠ |
-
|
| 1583 |
Count Unhappy Friends |
|
⚠⚠ |
-
|
| 1584 |
Min Cost to Connect All Points |
|
⚠⚠ |
-
|
| 1585 |
Check If String Is Transformable With Substring Sort Operations |
|
⚠⚠⚠ |
-
|
| 1588 |
Sum of All Odd Length Subarrays |
|
⚠ |
-
|
| 1589 |
Maximum Sum Obtained of Any Permutation |
|
⚠⚠ |
-
|
| 1590 |
Make Sum Divisible by P |
|
⚠⚠ |
-
|
| 1591 |
Strange Printer II |
|
⚠⚠⚠ |
-
|
| 1592 |
Rearrange Spaces Between Words |
|
⚠ |
-
|
| 1593 |
Split a String Into the Max Number of Unique Substrings |
|
⚠⚠ |
-
|
| 1594 |
Maximum Non Negative Product in a Matrix |
|
⚠⚠ |
-
|
| 1595 |
Minimum Cost to Connect Two Groups of Points |
|
⚠⚠⚠ |
-
|
| 1598 |
Crawler Log Folder |
|
⚠ |
-
|
| 1599 |
Maximum Profit of Operating a Centennial Wheel |
|
⚠⚠ |
-
|
| 1600 |
Throne Inheritance |
|
⚠⚠ |
-
|
| 1601 |
Maximum Number of Achievable Transfer Requests |
|
⚠⚠⚠ |
-
|
| 1603 |
Design Parking System |
|
⚠ |
-
|
| 1604 |
Alert Using Same Key-Card Three or More Times in a One Hour Period |
|
⚠⚠ |
-
|
| 1605 |
Find Valid Matrix Given Row and Column Sums |
|
⚠⚠ |
-
|
| 1606 |
Find Servers That Handled Most Number of Requests |
|
⚠⚠⚠ |
-
|
| 1608 |
Special Array With X Elements Greater Than or Equal X |
|
⚠ |
-
|
| 1609 |
Even Odd Tree |
|
⚠⚠ |
-
|
| 1610 |
Maximum Number of Visible Points |
|
⚠⚠⚠ |
-
|
| 1611 |
Minimum One Bit Operations to Make Integers Zero |
|
⚠⚠⚠ |
-
|
| 1614 |
Maximum Nesting Depth of the Parentheses |
|
⚠ |
-
|
| 1615 |
Maximal Network Rank |
|
⚠⚠ |
-
|
| 1616 |
Split Two Strings to Make Palindrome |
|
⚠⚠ |
-
|
| 1617 |
Count Subtrees With Max Distance Between Cities |
|
⚠⚠⚠ |
-
|
| 1619 |
Mean of Array After Removing Some Elements |
|
⚠ |
-
|
| 1620 |
Coordinate With Maximum Network Quality |
|
⚠⚠ |
-
|
| 1621 |
Number of Sets of K Non-Overlapping Line Segments |
|
⚠⚠ |
-
|
| 1622 |
Fancy Sequence |
|
⚠⚠⚠ |
-
|
| 1624 |
Largest Substring Between Two Equal Characters |
|
⚠ |
-
|
| 1625 |
Lexicographically Smallest String After Applying Operations |
|
⚠⚠ |
-
|
| 1626 |
Best Team With No Conflicts |
|
⚠⚠ |
-
|
| 1627 |
Graph Connectivity With Threshold |
|
⚠⚠⚠ |
-
|
| 1629 |
Slowest Key |
|
⚠ |
-
|
| 1630 |
Arithmetic Subarrays |
|
⚠⚠ |
-
|
| 1631 |
Path With Minimum Effort |
|
⚠⚠ |
-
|
| 1632 |
Rank Transform of a Matrix |
|
⚠⚠⚠ |
-
|
| 1636 |
Sort Array by Increasing Frequency |
|
⚠ |
-
|
| 1637 |
Widest Vertical Area Between Two Points Containing No Points |
|
⚠ |
-
|
| 1638 |
Count Substrings That Differ by One Character |
|
⚠⚠ |
-
|
| 1639 |
Number of Ways to Form a Target String Given a Dictionary |
|
⚠⚠⚠ |
-
|
| 1640 |
Check Array Formation Through Concatenation |
|
⚠ |
-
|
| 1641 |
Count Sorted Vowel Strings |
|
⚠⚠ |
-
|
| 1642 |
Furthest Building You Can Reach |
|
⚠⚠ |
-
|
| 1643 |
Kth Smallest Instructions |
|
⚠⚠⚠ |
-
|
| 1646 |
Get Maximum in Generated Array |
|
⚠ |
-
|
| 1647 |
Minimum Deletions to Make Character Frequencies Unique |
|
⚠⚠ |
-
|
| 1648 |
Sell Diminishing-Valued Colored Balls |
|
⚠⚠ |
-
|
| 1649 |
Create Sorted Array through Instructions |
|
⚠⚠⚠ |
-
|
| 1652 |
Defuse the Bomb |
Sliding Window |
⚠ |
Solution
|
| 1653 |
Minimum Deletions to Make String Balanced |
|
⚠⚠ |
-
|
| 1654 |
Minimum Jumps to Reach Home |
|
⚠⚠ |
-
|
| 1655 |
Distribute Repeating Integers |
|
⚠⚠⚠ |
-
|
| 1656 |
Design an Ordered Stream |
|
⚠ |
-
|
| 1657 |
Determine if Two Strings Are Close |
|
⚠⚠ |
-
|
| 1658 |
Minimum Operations to Reduce X to Zero |
Sliding Window |
⚠⚠ |
Solution
|
| 1659 |
Maximize Grid Happiness |
|
⚠⚠⚠ |
-
|
| 1662 |
Check If Two String Arrays are Equivalent |
|
⚠ |
-
|
| 1663 |
Smallest String With A Given Numeric Value |
|
⚠⚠ |
-
|
| 1664 |
Ways to Make a Fair Array |
|
⚠⚠ |
-
|
| 1665 |
Minimum Initial Energy to Finish Tasks |
|
⚠⚠⚠ |
-
|
| 1668 |
Maximum Repeating Substring |
|
⚠ |
-
|
| 1669 |
Merge In Between Linked Lists |
|
⚠⚠ |
-
|
| 1670 |
Design Front Middle Back Queue |
|
⚠⚠ |
-
|
| 1671 |
Minimum Number of Removals to Make Mountain Array |
|
⚠⚠⚠ |
-
|
| 1672 |
Richest Customer Wealth |
|
⚠ |
-
|
| 1673 |
Find the Most Competitive Subsequence |
|
⚠⚠ |
-
|
| 1674 |
Minimum Moves to Make Array Complementary |
|
⚠⚠ |
-
|
| 1675 |
Minimize Deviation in Array |
|
⚠⚠⚠ |
-
|
| 1678 |
Goal Parser Interpretation |
|
⚠ |
-
|
| 1679 |
Max Number of K-Sum Pairs |
|
⚠⚠ |
-
|
| 1680 |
Concatenation of Consecutive Binary Numbers |
|
⚠⚠ |
-
|
| 1681 |
Minimum Incompatibility |
|
⚠⚠⚠ |
-
|
| 1684 |
Count the Number of Consistent Strings |
|
⚠ |
-
|
| 1685 |
Sum of Absolute Differences in a Sorted Array |
|
⚠⚠ |
-
|
| 1686 |
Stone Game VI |
|
⚠⚠ |
-
|
| 1687 |
Delivering Boxes from Storage to Ports |
|
⚠⚠⚠ |
-
|
| 1688 |
Count of Matches in Tournament |
|
⚠ |
-
|
| 1689 |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
|
⚠⚠ |
-
|
| 1690 |
Stone Game VII |
|
⚠⚠ |
-
|
| 1691 |
Maximum Height by Stacking Cuboids |
|
⚠⚠⚠ |
-
|
| 1694 |
Reformat Phone Number |
|
⚠ |
-
|
| 1695 |
Maximum Erasure Value |
Sliding Window
Dict |
⚠⚠ |
Solution
|
| 1696 |
Jump Game VI |
|
⚠⚠ |
-
|
| 1697 |
Checking Existence of Edge Length Limited Paths |
|
⚠⚠⚠ |
-
|
| 1700 |
Number of Students Unable to Eat Lunch |
|
⚠ |
-
|
| 1701 |
Average Waiting Time |
|
⚠⚠ |
-
|
| 1702 |
Maximum Binary String After Change |
|
⚠⚠ |
-
|
| 1703 |
Minimum Adjacent Swaps for K Consecutive Ones |
|
⚠⚠⚠ |
-
|
| 1704 |
Determine if String Halves Are Alike |
|
⚠ |
-
|
| 1705 |
Maximum Number of Eaten Apples |
|
⚠⚠ |
-
|
| 1706 |
Where Will the Ball Fall |
|
⚠⚠ |
-
|
| 1707 |
Maximum XOR With an Element From Array |
|
⚠⚠⚠ |
-
|
| 1710 |
Maximum Units on a Truck |
|
⚠ |
-
|
| 1711 |
Count Good Meals |
|
⚠⚠ |
-
|
| 1712 |
Ways to Split Array Into Three Subarrays |
|
⚠⚠ |
-
|
| 1713 |
Minimum Operations to Make a Subsequence |
|
⚠⚠⚠ |
-
|
| 1716 |
Calculate Money in Leetcode Bank |
|
⚠ |
-
|
| 1717 |
Maximum Score From Removing Substrings |
|
⚠⚠ |
-
|
| 1718 |
Construct the Lexicographically Largest Valid Sequence |
|
⚠⚠ |
-
|
| 1719 |
Number Of Ways To Reconstruct A Tree |
|
⚠⚠⚠ |
-
|
| 1720 |
Decode XORed Array |
Bitwise operation |
⚠ |
Solution
|
| 1721 |
Swapping Nodes in a Linked List |
|
⚠⚠ |
-
|
| 1722 |
Minimize Hamming Distance After Swap Operations |
|
⚠⚠ |
-
|
| 1723 |
Find Minimum Time to Finish All Jobs |
|
⚠⚠⚠ |
-
|
| 1725 |
Number Of Rectangles That Can Form The Largest Square |
|
⚠ |
-
|
| 1726 |
Tuple with Same Product |
|
⚠⚠ |
-
|
| 1727 |
Largest Submatrix With Rearrangements |
|
⚠⚠ |
-
|
| 1728 |
Cat and Mouse II |
|
⚠⚠⚠ |
-
|
| 1732 |
Find the Highest Altitude |
|
⚠ |
-
|
| 1733 |
Minimum Number of People to Teach |
|
⚠⚠ |
-
|
| 1734 |
Decode XORed Permutation |
|
⚠⚠ |
-
|
| 1735 |
Count Ways to Make Array With Product |
|
⚠⚠⚠ |
-
|
| 1736 |
Latest Time by Replacing Hidden Digits |
|
⚠ |
-
|
| 1737 |
Change Minimum Characters to Satisfy One of Three Conditions |
|
⚠⚠ |
-
|
| 1738 |
Find Kth Largest XOR Coordinate Value |
|
⚠⚠ |
-
|
| 1739 |
Building Boxes |
|
⚠⚠⚠ |
-
|
| 1742 |
Maximum Number of Balls in a Box |
|
⚠ |
-
|
| 1743 |
Restore the Array From Adjacent Pairs |
|
⚠⚠ |
-
|
| 1744 |
Can You Eat Your Favorite Candy on Your Favorite Day? |
|
⚠⚠ |
-
|
| 1745 |
Palindrome Partitioning IV |
|
⚠⚠⚠ |
-
|
| 1748 |
Sum of Unique Elements |
|
⚠ |
-
|
| 1749 |
Maximum Absolute Sum of Any Subarray |
|
⚠⚠ |
-
|
| 1750 |
Minimum Length of String After Deleting Similar Ends |
|
⚠⚠ |
-
|
| 1751 |
Maximum Number of Events That Can Be Attended II |
|
⚠⚠⚠ |
-
|
| 1752 |
Check if Array Is Sorted and Rotated |
|
⚠ |
-
|
| 1753 |
Maximum Score From Removing Stones |
|
⚠⚠ |
-
|
| 1754 |
Largest Merge Of Two Strings |
|
⚠⚠ |
-
|
| 1755 |
Closest Subsequence Sum |
|
⚠⚠⚠ |
-
|
| 1758 |
Minimum Changes To Make Alternating Binary String |
|
⚠ |
-
|
| 1759 |
Count Number of Homogenous Substrings |
|
⚠⚠ |
-
|
| 1760 |
Minimum Limit of Balls in a Bag |
|
⚠⚠ |
-
|
| 1761 |
Minimum Degree of a Connected Trio in a Graph |
|
⚠⚠⚠ |
-
|
| 1763 |
Longest Nice Substring |
|
⚠ |
-
|
| 1764 |
Form Array by Concatenating Subarrays of Another Array |
|
⚠⚠ |
-
|
| 1765 |
Map of Highest Peak |
BFS |
⚠⚠ |
Solution
|
| 1766 |
Tree of Coprimes |
|
⚠⚠⚠ |
-
|
| 1768 |
Merge Strings Alternately |
|
⚠ |
-
|
| 1769 |
Minimum Number of Operations to Move All Balls to Each Box |
|
⚠⚠ |
-
|
| 1770 |
Maximum Score from Performing Multiplication Operations |
|
⚠⚠⚠ |
-
|
| 1771 |
Maximize Palindrome Length From Subsequences |
|
⚠⚠⚠ |
-
|
| 1773 |
Count Items Matching a Rule |
|
⚠ |
-
|
| 1774 |
Closest Dessert Cost |
|
⚠⚠ |
-
|
| 1775 |
Equal Sum Arrays With Minimum Number of Operations |
|
⚠⚠ |
-
|
| 1776 |
Car Fleet II |
|
⚠⚠⚠ |
-
|
| 1779 |
Find Nearest Point That Has the Same X or Y Coordinate |
|
⚠ |
-
|
| 1780 |
Check if Number is a Sum of Powers of Three |
|
⚠⚠ |
-
|
| 1781 |
Sum of Beauty of All Substrings |
|
⚠⚠ |
-
|
| 1782 |
Count Pairs Of Nodes |
|
⚠⚠⚠ |
-
|
| 1784 |
Check if Binary String Has at Most One Segment of Ones |
|
⚠ |
-
|
| 1785 |
Minimum Elements to Add to Form a Given Sum |
|
⚠⚠ |
-
|
| 1786 |
Number of Restricted Paths From First to Last Node |
|
⚠⚠ |
-
|
| 1787 |
Make the XOR of All Segments Equal to Zero |
|
⚠⚠⚠ |
-
|
| 1790 |
Check if One String Swap Can Make Strings Equal |
|
⚠ |
-
|
| 1791 |
Find Center of Star Graph |
|
⚠ |
-
|
| 1792 |
Maximum Average Pass Ratio |
|
⚠⚠ |
-
|
| 1793 |
Maximum Score of a Good Subarray |
|
⚠⚠⚠ |
-
|
| 1796 |
Second Largest Digit in a String |
|
⚠ |
-
|
| 1797 |
Design Authentication Manager |
|
⚠⚠ |
-
|
| 1798 |
Maximum Number of Consecutive Values You Can Make |
|
⚠⚠ |
-
|
| 1799 |
Maximize Score After N Operations |
|
⚠⚠⚠ |
-
|
| 1800 |
Maximum Ascending Subarray Sum |
|
⚠ |
-
|
| 1801 |
Number of Orders in the Backlog |
|
⚠⚠ |
-
|
| 1802 |
Maximum Value at a Given Index in a Bounded Array |
|
⚠⚠ |
-
|
| 1803 |
Count Pairs With XOR in a Range |
|
⚠⚠⚠ |
-
|
| 1805 |
Number of Different Integers in a String |
|
⚠ |
-
|
| 1806 |
Minimum Number of Operations to Reinitialize a Permutation |
|
⚠⚠ |
-
|
| 1807 |
Evaluate the Bracket Pairs of a String |
|
⚠⚠ |
-
|
| 1808 |
Maximize Number of Nice Divisors |
|
⚠⚠⚠ |
-
|
| 1812 |
Determine Color of a Chessboard Square |
|
⚠ |
-
|
| 1813 |
Sentence Similarity III |
|
⚠⚠ |
-
|
| 1814 |
Count Nice Pairs in an Array |
|
⚠⚠ |
-
|
| 1815 |
Maximum Number of Groups Getting Fresh Donuts |
|
⚠⚠⚠ |
-
|
| 1816 |
Truncate Sentence |
|
⚠ |
-
|
| 1817 |
Finding the Users Active Minutes |
|
⚠⚠ |
-
|
| 1818 |
Minimum Absolute Sum Difference |
|
⚠⚠ |
-
|
| 1819 |
Number of Different Subsequences GCDs |
|
⚠⚠⚠ |
-
|
| 1822 |
Sign of the Product of an Array |
|
⚠ |
-
|
| 1823 |
Find the Winner of the Circular Game |
|
⚠⚠ |
-
|
| 1824 |
Minimum Sideway Jumps |
|
⚠⚠ |
-
|
| 1825 |
Finding MK Average |
|
⚠⚠⚠ |
-
|
| 1827 |
Minimum Operations to Make the Array Increasing |
|
⚠ |
-
|
| 1828 |
Queries on Number of Points Inside a Circle |
|
⚠⚠ |
-
|
| 1829 |
Maximum XOR for Each Query |
Bitwise Operation |
⚠⚠ |
Solution
|
| 1830 |
Minimum Number of Operations to Make String Sorted |
|
⚠⚠⚠ |
-
|
| 1832 |
Check if the Sentence Is Pangram |
|
⚠ |
-
|
| 1833 |
Maximum Ice Cream Bars |
|
⚠⚠ |
-
|
| 1834 |
Single-Threaded CPU |
|
⚠⚠ |
-
|
| 1835 |
Find XOR Sum of All Pairs Bitwise AND |
|
⚠⚠⚠ |
-
|
| 1837 |
Sum of Digits in Base K |
|
⚠ |
-
|
| 1838 |
Frequency of the Most Frequent Element |
|
⚠⚠ |
-
|
| 1839 |
Longest Substring Of All Vowels in Order |
|
⚠⚠ |
-
|
| 1840 |
Maximum Building Height |
|
⚠⚠⚠ |
-
|
| 1844 |
Replace All Digits with Characters |
|
⚠ |
-
|
| 1845 |
Seat Reservation Manager |
|
⚠⚠ |
-
|
| 1846 |
Maximum Element After Decreasing and Rearranging |
|
⚠⚠ |
-
|
| 1847 |
Closest Room |
|
⚠⚠⚠ |
-
|
| 1848 |
Minimum Distance to the Target Element |
|
⚠ |
-
|
| 1849 |
Splitting a String Into Descending Consecutive Values |
|
⚠⚠ |
-
|
| 1850 |
Minimum Adjacent Swaps to Reach the Kth Smallest Number |
|
⚠⚠ |
-
|
| 1851 |
Minimum Interval to Include Each Query |
|
⚠⚠⚠ |
-
|
| 1854 |
Maximum Population Year |
|
⚠ |
-
|
| 1855 |
Maximum Distance Between a Pair of Values |
|
⚠⚠ |
-
|
| 1856 |
Maximum Subarray Min-Product |
|
⚠⚠ |
-
|
| 1857 |
Largest Color Value in a Directed Graph |
|
⚠⚠⚠ |
-
|
| 1859 |
Sorting the Sentence |
|
⚠ |
-
|
| 1860 |
Incremental Memory Leak |
|
⚠⚠ |
-
|
| 1861 |
Rotating the Box |
|
⚠⚠ |
-
|
| 1862 |
Sum of Floored Pairs |
|
⚠⚠⚠ |
-
|
| 1863 |
Sum of All Subset XOR Totals |
|
⚠ |
-
|
| 1864 |
Minimum Number of Swaps to Make the Binary String Alternating |
|
⚠⚠ |
-
|
| 1865 |
Finding Pairs With a Certain Sum |
|
⚠⚠ |
-
|
| 1866 |
Number of Ways to Rearrange Sticks With K Sticks Visible |
|
⚠⚠⚠ |
-
|
| 1869 |
Longer Contiguous Segments of Ones than Zeros |
|
⚠ |
-
|
| 1870 |
Minimum Speed to Arrive on Time |
|
⚠⚠ |
-
|
| 1871 |
Jump Game VII |
|
⚠⚠ |
-
|
| 1872 |
Stone Game VIII |
|
⚠⚠⚠ |
-
|
| 1876 |
Substrings of Size Three with Distinct Characters |
|
⚠ |
-
|
| 1877 |
Minimize Maximum Pair Sum in Array |
|
⚠⚠ |
-
|
| 1878 |
Get Biggest Three Rhombus Sums in a Grid |
|
⚠⚠ |
-
|
| 1879 |
Minimum XOR Sum of Two Arrays |
|
⚠⚠⚠ |
-
|
| 1880 |
Check if Word Equals Summation of Two Words |
|
⚠ |
-
|
| 1881 |
Maximum Value after Insertion |
|
⚠⚠ |
-
|
| 1882 |
Process Tasks Using Servers |
|
⚠⚠ |
-
|
| 1883 |
Minimum Skips to Arrive at Meeting On Time |
|
⚠⚠⚠ |
-
|
| 1884 |
Egg Drop With 2 Eggs and N Floors |
|
⚠⚠ |
-
|
| 1886 |
Determine Whether Matrix Can Be Obtained By Rotation |
|
⚠ |
-
|
| 1887 |
Reduction Operations to Make the Array Elements Equal |
|
⚠⚠ |
-
|
| 1888 |
Minimum Number of Flips to Make the Binary String Alternating |
Sliding Window |
⚠⚠ |
Solution
|
| 1889 |
Minimum Space Wasted From Packaging |
|
⚠⚠⚠ |
-
|
| 1893 |
Check if All the Integers in a Range Are Covered |
|
⚠ |
-
|
| 1894 |
Find the Student that Will Replace the Chalk |
|
⚠⚠ |
-
|
| 1895 |
Largest Magic Square |
|
⚠⚠ |
-
|
| 1896 |
Minimum Cost to Change the Final Value of Expression |
|
⚠⚠⚠ |
-
|
| 1897 |
Redistribute Characters to Make All Strings Equal |
|
⚠ |
-
|
| 1898 |
Maximum Number of Removable Characters |
|
⚠⚠ |
-
|
| 1899 |
Merge Triplets to Form Target Triplet |
|
⚠⚠ |
-
|
| 1900 |
The Earliest and Latest Rounds Where Players Compete |
|
⚠⚠⚠ |
-
|
| 1901 |
Find a Peak Element II |
|
⚠⚠ |
-
|
| 1903 |
Largest Odd Number in String |
|
⚠ |
-
|
| 1904 |
The Number of Full Rounds You Have Played |
|
⚠⚠ |
-
|
| 1905 |
Count Sub Islands |
DFS |
⚠⚠ |
Solution
|
| 1906 |
Minimum Absolute Difference Queries |
|
⚠⚠ |
-
|
| 1909 |
Remove One Element to Make the Array Strictly Increasing |
|
⚠ |
-
|
| 1910 |
Remove All Occurrences of a Substring |
|
⚠⚠ |
-
|
| 1911 |
Maximum Alternating Subsequence Sum |
|
⚠⚠ |
-
|
| 1912 |
Design Movie Rental System |
|
⚠⚠⚠ |
-
|
| 1913 |
Maximum Product Difference Between Two Pairs |
|
⚠ |
-
|
| 1914 |
Cyclically Rotating a Grid |
|
⚠⚠ |
-
|
| 1915 |
Number of Wonderful Substrings |
|
⚠⚠ |
-
|
| 1916 |
Count Ways to Build Rooms in an Ant Colony |
|
⚠⚠⚠ |
-
|
| 1920 |
Build Array from Permutation |
|
⚠ |
-
|
| 1921 |
Eliminate Maximum Number of Monsters |
|
⚠⚠ |
-
|
| 1922 |
Count Good Numbers |
|
⚠⚠ |
-
|
| 1923 |
Longest Common Subpath |
|
⚠⚠⚠ |
-
|
| 1925 |
Count Square Sum Triples |
|
⚠ |
-
|
| 1926 |
Nearest Exit from Entrance in Maze |
|
⚠⚠ |
Solution
|
| 1927 |
Sum Game |
|
⚠⚠ |
-
|
| 1928 |
Minimum Cost to Reach Destination in Time |
|
⚠⚠⚠ |
-
|
| 1929 |
Concatenation of Array |
|
⚠ |
-
|
| 1930 |
Unique Length-3 Palindromic Subsequences |
|
⚠⚠ |
-
|
| 1931 |
Painting a Grid With Three Different Colors |
|
⚠⚠⚠ |
-
|
| 1932 |
Merge BSTs to Create Single BST |
|
⚠⚠⚠ |
-
|
| 1935 |
Maximum Number of Words You Can Type |
|
⚠ |
-
|
| 1936 |
Add Minimum Number of Rungs |
|
⚠⚠ |
-
|
| 1937 |
Maximum Number of Points with Cost |
|
⚠⚠ |
-
|
| 1938 |
Maximum Genetic Difference Query |
|
⚠⚠⚠ |
-
|
| 1941 |
Check if All Characters Have Equal Number of Occurrences |
|
⚠ |
-
|
| 1942 |
The Number of the Smallest Unoccupied Chair |
|
⚠⚠ |
-
|
| 1943 |
Describe the Painting |
|
⚠⚠ |
-
|
| 1944 |
Number of Visible People in a Queue |
|
⚠⚠⚠ |
-
|
| 1945 |
Sum of Digits of String After Convert |
|
⚠ |
-
|
| 1946 |
Largest Number After Mutating Substring |
|
⚠⚠ |
-
|
| 1947 |
Maximum Compatibility Score Sum |
|
⚠⚠ |
-
|
| 1948 |
Delete Duplicate Folders in System |
|
⚠⚠⚠ |
-
|
| 1952 |
Three Divisors |
|
⚠ |
-
|
| 1953 |
Maximum Number of Weeks for Which You Can Work |
|
⚠⚠ |
-
|
| 1954 |
Minimum Garden Perimeter to Collect Enough Apples |
|
⚠⚠ |
-
|
| 1955 |
Count Number of Special Subsequences |
|
⚠⚠⚠ |
-
|
| 1957 |
Delete Characters to Make Fancy String |
|
⚠ |
-
|
| 1958 |
Check if Move is Legal |
|
⚠⚠ |
-
|
| 1959 |
Minimum Total Space Wasted With K Resizing Operations |
|
⚠⚠ |
-
|
| 1960 |
Maximum Product of the Length of Two Palindromic Substrings |
|
⚠⚠⚠ |
-
|
| 1961 |
Check If String Is a Prefix of Array |
|
⚠ |
-
|
| 1962 |
Remove Stones to Minimize the Total |
|
⚠⚠ |
-
|
| 1963 |
Minimum Number of Swaps to Make the String Balanced |
|
⚠⚠ |
-
|
| 1964 |
Find the Longest Valid Obstacle Course at Each Position |
|
⚠⚠⚠ |
-
|
| 1967 |
Number of Strings That Appear as Substrings in Word |
|
⚠ |
-
|
| 1968 |
Array With Elements Not Equal to Average of Neighbors |
|
⚠⚠ |
-
|
| 1969 |
Minimum Non-Zero Product of the Array Elements |
|
⚠⚠ |
-
|
| 1970 |
Last Day Where You Can Still Cross |
|
⚠⚠⚠ |
-
|
| 1971 |
Find if Path Exists in Graph |
|
⚠ |
-
|
| 1974 |
Minimum Time to Type Word Using Special Typewriter |
|
⚠ |
-
|
| 1975 |
Maximum Matrix Sum |
|
⚠⚠ |
-
|
| 1976 |
Number of Ways to Arrive at Destination |
|
⚠⚠ |
-
|
| 1977 |
Number of Ways to Separate Numbers |
|
⚠⚠⚠ |
-
|
| 1979 |
Find Greatest Common Divisor of Array |
|
⚠ |
-
|
| 1980 |
Find Unique Binary String |
|
⚠⚠ |
-
|
| 1981 |
Minimize the Difference Between Target and Chosen Elements |
|
⚠⚠ |
-
|
| 1982 |
Find Array Given Subset Sums |
|
⚠⚠⚠ |
-
|
| 1984 |
Minimum Difference Between Highest and Lowest of K Scores |
|
⚠ |
Solution
|
| 1985 |
Find the Kth Largest Integer in the Array |
|
⚠⚠ |
-
|
| 1986 |
Minimum Number of Work Sessions to Finish the Tasks |
|
⚠⚠ |
-
|
| 1987 |
Number of Unique Good Subsequences |
|
⚠⚠⚠ |
-
|
| 1991 |
Find the Middle Index in Array |
|
⚠ |
-
|
| 1992 |
Find All Groups of Farmland |
|
⚠⚠ |
-
|
| 1993 |
Operations on Tree |
|
⚠⚠ |
-
|
| 1994 |
The Number of Good Subsets |
|
⚠⚠⚠ |
-
|
| 1995 |
Count Special Quadruplets |
|
⚠ |
-
|
| 1996 |
The Number of Weak Characters in the Game |
|
⚠⚠ |
-
|
| 1997 |
First Day Where You Have Been in All the Rooms |
|
⚠⚠ |
-
|
| 1998 |
GCD Sort of an Array |
|
⚠⚠⚠ |
-
|
| 2000 |
Reverse Prefix of Word |
|
⚠ |
-
|
| 2001 |
Number of Pairs of Interchangeable Rectangles |
|
⚠⚠ |
-
|
| 2002 |
Maximum Product of the Length of Two Palindromic Subsequences |
|
⚠⚠ |
-
|
| 2003 |
Smallest Missing Genetic Value in Each Subtree |
|
⚠⚠⚠ |
-
|
| 2006 |
Count Number of Pairs With Absolute Difference K |
|
⚠ |
-
|
| 2007 |
Find Original Array From Doubled Array |
|
⚠⚠ |
-
|
| 2008 |
Maximum Earnings From Taxi |
|
⚠⚠ |
-
|
| 2009 |
Minimum Number of Operations to Make Array Continuous |
|
⚠⚠⚠ |
-
|
| 2011 |
Final Value of Variable After Performing Operations |
|
⚠ |
-
|
| 2012 |
Sum of Beauty in the Array |
|
⚠⚠ |
-
|
| 2013 |
Detect Squares |
|
⚠⚠ |
-
|
| 2014 |
Longest Subsequence Repeated k Times |
|
⚠⚠⚠ |
-
|
| 2016 |
Maximum Difference Between Increasing Elements |
|
⚠ |
-
|
| 2017 |
Grid Game |
|
⚠⚠ |
-
|
| 2018 |
Check if Word Can Be Placed In Crossword |
|
⚠⚠ |
-
|
| 2019 |
The Score of Students Solving Math Expression |
|
⚠⚠⚠ |
-
|
| 2022 |
Convert 1D Array Into 2D Array |
|
⚠ |
-
|
| 2023 |
Number of Pairs of Strings With Concatenation Equal to Target |
|
⚠⚠ |
-
|
| 2024 |
Maximize the Confusion of an Exam |
Sliding Window |
⚠⚠ |
Solution
|
| 2025 |
Maximum Number of Ways to Partition an Array |
|
⚠⚠⚠ |
-
|
| 2027 |
Minimum Moves to Convert String |
|
⚠ |
-
|
| 2028 |
Find Missing Observations |
|
⚠⚠ |
-
|
| 2029 |
Stone Game IX |
|
⚠⚠ |
-
|
| 2030 |
Smallest K-Length Subsequence With Occurrences of a Letter |
|
⚠⚠⚠ |
-
|
| 2032 |
Two Out of Three |
|
⚠ |
-
|
| 2033 |
Minimum Operations to Make a Uni-Value Grid |
|
⚠⚠ |
-
|
| 2034 |
Stock Price Fluctuation |
|
⚠⚠ |
-
|
| 2035 |
Partition Array Into Two Arrays to Minimize Sum Difference |
|
⚠⚠⚠ |
-
|
| 2037 |
Minimum Number of Moves to Seat Everyone |
|
⚠ |
-
|
| 2038 |
Remove Colored Pieces if Both Neighbors are the Same Color |
|
⚠⚠ |
-
|
| 2039 |
The Time When the Network Becomes Idle |
|
⚠⚠ |
-
|
| 2040 |
Kth Smallest Product of Two Sorted Arrays |
|
⚠⚠⚠ |
-
|
| 2042 |
Check if Numbers Are Ascending in a Sentence |
|
⚠ |
-
|
| 2043 |
Simple Bank System |
|
⚠⚠ |
-
|
| 2044 |
Count Number of Maximum Bitwise-OR Subsets |
|
⚠⚠ |
-
|
| 2045 |
Second Minimum Time to Reach Destination |
|
⚠⚠⚠ |
-
|
| 2047 |
Number of Valid Words in a Sentence |
|
⚠ |
-
|
| 2048 |
Next Greater Numerically Balanced Number |
Math |
⚠⚠ |
Solution
|
| 2049 |
Count Nodes With the Highest Score |
|
⚠⚠ |
-
|
| 2050 |
Parallel Courses III |
|
⚠⚠⚠ |
-
|
| 2053 |
Kth Distinct String in an Array |
|
⚠ |
-
|
| 2054 |
Two Best Non-Overlapping Events |
|
⚠⚠ |
-
|
| 2055 |
Plates Between Candles |
|
⚠⚠ |
-
|
| 2056 |
Number of Valid Move Combinations On Chessboard |
|
⚠⚠⚠ |
-
|
| 2057 |
Smallest Index With Equal Value |
|
⚠ |
-
|
| 2058 |
Find the Minimum and Maximum Number of Nodes Between Critical Points |
|
⚠⚠ |
-
|
| 2059 |
Minimum Operations to Convert Number |
|
⚠⚠ |
-
|
| 2060 |
Check if an Original String Exists Given Two Encoded Strings |
|
⚠⚠⚠ |
-
|
| 2062 |
Count Vowel Substrings of a String |
|
⚠ |
-
|
| 2063 |
Vowels of All Substrings |
|
⚠⚠ |
-
|
| 2064 |
Minimized Maximum of Products Distributed to Any Store |
|
⚠⚠ |
-
|
| 2065 |
Maximum Path Quality of a Graph |
|
⚠⚠⚠ |
-
|
| 2068 |
Check Whether Two Strings are Almost Equivalent |
|
⚠ |
-
|
| 2069 |
Walking Robot Simulation II |
|
⚠⚠ |
-
|
| 2070 |
Most Beautiful Item for Each Query |
|
⚠⚠ |
-
|
| 2071 |
Maximum Number of Tasks You Can Assign |
|
⚠⚠⚠ |
-
|
| 2073 |
Time Needed to Buy Tickets |
|
⚠ |
-
|
| 2074 |
Reverse Nodes in Even Length Groups |
|
⚠⚠ |
-
|
| 2075 |
Decode the Slanted Ciphertext |
|
⚠⚠ |
-
|
| 2076 |
Process Restricted Friend Requests |
|
⚠⚠⚠ |
-
|
| 2078 |
Two Furthest Houses With Different Colors |
|
⚠ |
-
|
| 2079 |
Watering Plants |
|
⚠⚠ |
-
|
| 2080 |
Range Frequency Queries |
Hash Table
Binary Search |
⚠⚠ |
Solution
|
| 2081 |
Sum of k-Mirror Numbers |
|
⚠⚠⚠ |
-
|
| 2085 |
Count Common Words With One Occurrence |
|
⚠ |
-
|
| 2086 |
Minimum Number of Food Buckets to Feed the Hamsters |
|
⚠⚠ |
-
|
| 2087 |
Minimum Cost Homecoming of a Robot in a Grid |
|
⚠⚠ |
-
|
| 2088 |
Count Fertile Pyramids in a Land |
|
⚠⚠⚠ |
-
|
| 2089 |
Find Target Indices After Sorting Array |
|
⚠ |
-
|
| 2090 |
K Radius Subarray Averages |
Sliding Window |
⚠⚠ |
Solution
|
| 2091 |
Removing Minimum and Maximum From Array |
|
⚠⚠ |
-
|
| 2092 |
Find All People With Secret |
|
⚠⚠⚠ |
-
|
| 2094 |
Finding 3-Digit Even Numbers |
|
⚠ |
-
|
| 2095 |
Delete the Middle Node of a Linked List |
|
⚠⚠ |
-
|
| 2096 |
Step-By-Step Directions From a Binary Tree Node to Another |
|
⚠⚠ |
-
|
| 2097 |
Valid Arrangement of Pairs |
|
⚠⚠⚠ |
-
|
| 2099 |
Find Subsequence of Length K With the Largest Sum |
|
⚠ |
-
|
| 2100 |
Find Good Days to Rob the Bank |
|
⚠⚠ |
-
|
| 2101 |
Detonate the Maximum Bombs |
|
⚠⚠ |
-
|
| 2102 |
Sequentially Ordinal Rank Tracker |
|
⚠⚠⚠ |
-
|
| 2103 |
Rings and Rods |
|
⚠ |
-
|
| 2104 |
Sum of Subarray Ranges |
|
⚠⚠ |
-
|
| 2105 |
Watering Plants II |
|
⚠⚠ |
-
|
| 2106 |
Maximum Fruits Harvested After at Most K Steps |
|
⚠⚠⚠ |
-
|
| 2108 |
Find First Palindromic String in the Array |
|
⚠ |
-
|
| 2109 |
Adding Spaces to a String |
|
⚠⚠ |
-
|
| 2110 |
Number of Smooth Descent Periods of a Stock |
|
⚠⚠ |
-
|
| 2111 |
Minimum Operations to Make the Array K-Increasing |
|
⚠⚠⚠ |
-
|
| 2114 |
Maximum Number of Words Found in Sentences |
|
⚠ |
-
|
| 2115 |
Find All Possible Recipes from Given Supplies |
|
⚠⚠ |
-
|
| 2116 |
Check if a Parentheses String Can Be Valid |
|
⚠⚠ |
-
|
| 2117 |
Abbreviating the Product of a Range |
|
⚠⚠⚠ |
-
|
| 2119 |
A Number After a Double Reversal |
|
⚠ |
-
|
| 2120 |
Execution of All Suffix Instructions Staying in a Grid |
|
⚠⚠ |
-
|
| 2121 |
Intervals Between Identical Elements |
|
⚠⚠ |
-
|
| 2122 |
Recover the Original Array |
|
⚠⚠⚠ |
-
|
| 2124 |
Check if All A's Appears Before All B's |
|
⚠ |
-
|
| 2125 |
Number of Laser Beams in a Bank |
|
⚠⚠ |
-
|
| 2126 |
Destroying Asteroids |
|
⚠⚠ |
-
|
| 2127 |
Maximum Employees to Be Invited to a Meeting |
|
⚠⚠⚠ |
-
|
| 2129 |
Capitalize the Title |
|
⚠ |
-
|
| 2130 |
Maximum Twin Sum of a Linked List |
|
⚠⚠ |
-
|
| 2131 |
Longest Palindrome by Concatenating Two Letter Words |
|
⚠⚠ |
-
|
| 2132 |
Stamping the Grid |
|
⚠⚠⚠ |
-
|
| 2133 |
Check if Every Row and Column Contains All Numbers |
|
⚠ |
-
|
| 2134 |
Minimum Swaps to Group All 1's Together II |
Sliding Window |
⚠⚠ |
Solution
|
| 2135 |
Count Words Obtained After Adding a Letter |
|
⚠⚠ |
-
|
| 2136 |
Earliest Possible Day of Full Bloom |
|
⚠⚠⚠ |
-
|
| 2138 |
Divide a String Into Groups of Size k |
|
⚠ |
-
|
| 2139 |
Minimum Moves to Reach Target Score |
|
⚠⚠ |
-
|
| 2140 |
Solving Questions With Brainpower |
|
⚠⚠ |
-
|
| 2141 |
Maximum Running Time of N Computers |
|
⚠⚠⚠ |
-
|
| 2144 |
Minimum Cost of Buying Candies With Discount |
|
⚠ |
-
|
| 2145 |
Count the Hidden Sequences |
|
⚠⚠ |
-
|
| 2146 |
K Highest Ranked Items Within a Price Range |
|
⚠⚠ |
Solution
|
| 2147 |
Number of Ways to Divide a Long Corridor |
|
⚠⚠⚠ |
-
|
| 2148 |
Count Elements With Strictly Smaller and Greater Elements |
|
⚠ |
-
|
| 2149 |
Rearrange Array Elements by Sign |
|
⚠⚠ |
-
|
| 2150 |
Find All Lonely Numbers in the Array |
|
⚠⚠ |
-
|
| 2151 |
Maximum Good People Based on Statements |
|
⚠⚠⚠ |
-
|
| 2154 |
Keep Multiplying Found Values by Two |
|
⚠ |
Solution
|
| 2155 |
All Divisions With the Highest Score of a Binary Array |
|
⚠⚠ |
-
|
| 2156 |
Find Substring With Given Hash Value |
|
⚠⚠⚠ |
Solution
|
| 2157 |
Groups of Strings |
|
⚠⚠⚠ |
-
|
| 2160 |
Minimum Sum of Four Digit Number After Splitting Digits |
|
⚠ |
-
|
| 2161 |
Partition Array According to Given Pivot |
|
⚠⚠ |
-
|
| 2162 |
Minimum Cost to Set Cooking Time |
|
⚠⚠ |
-
|
| 2163 |
Minimum Difference in Sums After Removal of Elements |
|
⚠⚠⚠ |
-
|
| 2164 |
Sort Even and Odd Indices Independently |
|
⚠ |
-
|
| 2165 |
Smallest Value of the Rearranged Number |
|
⚠⚠ |
-
|
| 2166 |
Design Bitset |
|
⚠⚠ |
-
|
| 2167 |
Minimum Time to Remove All Cars Containing Illegal Goods |
|
⚠⚠⚠ |
-
|
| 2169 |
Count Operations to Obtain Zero |
|
⚠ |
-
|
| 2170 |
Minimum Operations to Make the Array Alternating |
|
⚠⚠ |
-
|
| 2171 |
Removing Minimum Number of Magic Beans |
|
⚠⚠ |
-
|
| 2172 |
Maximum AND Sum of Array |
|
⚠⚠⚠ |
-
|
| 2176 |
Count Equal and Divisible Pairs in an Array |
|
⚠ |
-
|
| 2177 |
Find Three Consecutive Integers That Sum to a Given Number |
|
⚠⚠ |
-
|
| 2178 |
Maximum Split of Positive Even Integers |
|
⚠⚠ |
-
|
| 2179 |
Count Good Triplets in an Array |
|
⚠⚠⚠ |
-
|
| 2180 |
Count Integers With Even Digit Sum |
|
⚠ |
-
|
| 2181 |
Merge Nodes in Between Zeros |
|
⚠⚠ |
-
|
| 2182 |
Construct String With Repeat Limit |
|
⚠⚠ |
-
|
| 2183 |
Count Array Pairs Divisible by K |
|
⚠⚠⚠ |
-
|
| 2185 |
Counting Words With a Given Prefix |
|
⚠ |
-
|
| 2186 |
Minimum Number of Steps to Make Two Strings Anagram II |
|
⚠⚠ |
-
|
| 2187 |
Minimum Time to Complete Trips |
|
⚠⚠ |
-
|
| 2188 |
Minimum Time to Finish the Race |
|
⚠⚠⚠ |
-
|
| 2190 |
Most Frequent Number Following Key In an Array |
|
⚠ |
-
|
| 2191 |
Sort the Jumbled Numbers |
|
⚠⚠ |
-
|
| 2192 |
All Ancestors of a Node in a Directed Acyclic Graph |
|
⚠⚠ |
-
|
| 2193 |
Minimum Number of Moves to Make Palindrome |
|
⚠⚠⚠ |
-
|
| 2194 |
Cells in a Range on an Excel Sheet |
|
⚠ |
-
|
| 2195 |
Append K Integers With Minimal Sum |
|
⚠⚠ |
-
|
| 2196 |
Create Binary Tree From Descriptions |
|
⚠⚠ |
-
|
| 2197 |
Replace Non-Coprime Numbers in Array |
|
⚠⚠⚠ |
-
|
| 2200 |
Find All K-Distant Indices in an Array |
|
⚠ |
Solution
|
| 2201 |
Count Artifacts That Can Be Extracted |
|
⚠⚠ |
-
|
| 2202 |
Maximize the Topmost Element After K Moves |
|
⚠⚠ |
-
|
| 2203 |
Minimum Weighted Subgraph With the Required Paths |
|
⚠⚠⚠ |
-
|
| 2206 |
Divide Array Into Equal Pairs |
|
⚠ |
-
|
| 2207 |
Maximize Number of Subsequences in a String |
|
⚠⚠ |
-
|
| 2208 |
Minimum Operations to Halve Array Sum |
|
⚠⚠ |
-
|
| 2209 |
Minimum White Tiles After Covering With Carpets |
|
⚠⚠⚠ |
-
|
| 2210 |
Count Hills and Valleys in an Array |
|
⚠ |
-
|
| 2211 |
Count Collisions on a Road |
|
⚠⚠ |
-
|
| 2212 |
Maximum Points in an Archery Competition |
|
⚠⚠ |
-
|
| 2213 |
Longest Substring of One Repeating Character |
|
⚠⚠⚠ |
-
|
| 2215 |
Find the Difference of Two Arrays |
|
⚠ |
-
|
| 2216 |
Minimum Deletions to Make Array Beautiful |
|
⚠⚠ |
-
|
| 2217 |
Find Palindrome With Fixed Length |
|
⚠⚠ |
-
|
| 2218 |
Maximum Value of K Coins From Piles |
|
⚠⚠⚠ |
-
|
| 2220 |
Minimum Bit Flips to Convert Number |
Bitwise operations |
⚠ |
Solution
|
| 2221 |
Find Triangular Sum of an Array |
|
⚠⚠ |
-
|
| 2222 |
Number of Ways to Select Buildings |
|
⚠⚠ |
-
|
| 2223 |
Sum of Scores of Built Strings |
|
⚠⚠⚠ |
-
|
| 2224 |
Minimum Number of Operations to Convert Time |
|
⚠ |
-
|
| 2225 |
Find Players With Zero or One Losses |
|
⚠⚠ |
-
|
| 2226 |
Maximum Candies Allocated to K Children |
|
⚠⚠ |
-
|
| 2227 |
Encrypt and Decrypt Strings |
|
⚠⚠⚠ |
-
|
| 2231 |
Largest Number After Digit Swaps by Parity |
|
⚠ |
-
|
| 2232 |
Minimize Result by Adding Parentheses to Expression |
|
⚠⚠ |
-
|
| 2233 |
Maximum Product After K Increments |
|
⚠⚠ |
-
|
| 2234 |
Maximum Total Beauty of the Gardens |
|
⚠⚠⚠ |
-
|
| 2235 |
Add Two Integers |
|
⚠ |
-
|
| 2236 |
Root Equals Sum of Children |
|
⚠ |
-
|
| 2239 |
Find Closest Number to Zero |
|
⚠ |
-
|
| 2240 |
Number of Ways to Buy Pens and Pencils |
|
⚠⚠ |
-
|
| 2241 |
Design an ATM Machine |
|
⚠⚠ |
-
|
| 2242 |
Maximum Score of a Node Sequence |
|
⚠⚠⚠ |
-
|
| 2243 |
Calculate Digit Sum of a String |
|
⚠ |
-
|
| 2244 |
Minimum Rounds to Complete All Tasks |
|
⚠⚠ |
-
|
| 2245 |
Maximum Trailing Zeros in a Cornered Path |
|
⚠⚠ |
-
|
| 2246 |
Longest Path With Different Adjacent Characters |
|
⚠⚠⚠ |
-
|
| 2248 |
Intersection of Multiple Arrays |
|
⚠ |
-
|
| 2249 |
Count Lattice Points Inside a Circle |
|
⚠⚠ |
-
|
| 2250 |
Count Number of Rectangles Containing Each Point |
|
⚠⚠ |
-
|
| 2251 |
Number of Flowers in Full Bloom |
|
⚠⚠⚠ |
-
|
| 2255 |
Count Prefixes of a Given String |
|
⚠ |
-
|
| 2256 |
Minimum Average Difference |
|
⚠⚠ |
-
|
| 2257 |
Count Unguarded Cells in the Grid |
|
⚠⚠ |
-
|
| 2258 |
Escape the Spreading Fire |
|
⚠⚠⚠ |
-
|
| 2259 |
Remove Digit From Number to Maximize Result |
|
⚠ |
-
|
| 2260 |
Minimum Consecutive Cards to Pick Up |
|
⚠⚠ |
-
|
| 2261 |
K Divisible Elements Subarrays |
|
⚠⚠ |
-
|
| 2262 |
Total Appeal of A String |
|
⚠⚠⚠ |
-
|
| 2264 |
Largest 3-Same-Digit Number in String |
|
⚠ |
-
|
| 2265 |
Count Nodes Equal to Average of Subtree |
|
⚠⚠ |
-
|
| 2266 |
Count Number of Texts |
|
⚠⚠ |
-
|
| 2267 |
Check if There Is a Valid Parentheses String Path |
|
⚠⚠⚠ |
-
|
| 2269 |
Find the K-Beauty of a Number |
|
⚠ |
Solution
|
| 2270 |
Number of Ways to Split Array |
|
⚠⚠ |
-
|
| 2271 |
Maximum White Tiles Covered by a Carpet |
|
⚠⚠ |
-
|
| 2272 |
Substring With Largest Variance |
|
⚠⚠⚠ |
-
|
| 2273 |
Find Resultant Array After Removing Anagrams |
String
Two Pointers |
⚠ |
Solution
|
| 2274 |
Maximum Consecutive Floors Without Special Floors |
|
⚠⚠ |
-
|
| 2275 |
Largest Combination With Bitwise AND Greater Than Zero |
|
⚠⚠ |
-
|
| 2276 |
Count Integers in Intervals |
|
⚠⚠⚠ |
-
|
| 2278 |
Percentage of Letter in String |
|
⚠ |
-
|
| 2279 |
Maximum Bags With Full Capacity of Rocks |
|
⚠⚠ |
-
|
| 2280 |
Minimum Lines to Represent a Line Chart |
|
⚠⚠ |
-
|
| 2281 |
Sum of Total Strength of Wizards |
|
⚠⚠⚠ |
-
|
| 2283 |
Check if Number Has Equal Digit Count and Digit Value |
|
⚠ |
-
|
| 2284 |
Sender With Largest Word Count |
|
⚠⚠ |
-
|
| 2285 |
Maximum Total Importance of Roads |
|
⚠⚠ |
-
|
| 2286 |
Booking Concert Tickets in Groups |
|
⚠⚠⚠ |
-
|
| 2287 |
Rearrange Characters to Make Target String |
|
⚠ |
-
|
| 2288 |
Apply Discount to Prices |
|
⚠⚠ |
-
|
| 2289 |
Steps to Make Array Non-decreasing |
|
⚠⚠ |
-
|
| 2290 |
Minimum Obstacle Removal to Reach Corner |
|
⚠⚠⚠ |
-
|
| 2293 |
Min Max Game |
|
⚠ |
-
|
| 2294 |
Partition Array Such That Maximum Difference Is K |
|
⚠⚠ |
-
|
| 2295 |
Replace Elements in an Array |
|
⚠⚠ |
-
|
| 2296 |
Design a Text Editor |
|
⚠⚠⚠ |
-
|
| 2299 |
Strong Password Checker II |
|
⚠ |
-
|
| 2300 |
Successful Pairs of Spells and Potions |
Binary Search |
⚠⚠ |
Solution
|
| 2301 |
Match Substring After Replacement |
|
⚠⚠⚠ |
-
|
| 2302 |
Count Subarrays With Score Less Than K |
|
⚠⚠⚠ |
-
|
| 2303 |
Calculate Amount Paid in Taxes |
|
⚠ |
-
|
| 2304 |
Minimum Path Cost in a Grid |
|
⚠⚠ |
-
|
| 2305 |
Fair Distribution of Cookies |
|
⚠⚠ |
-
|
| 2306 |
Naming a Company |
|
⚠⚠⚠ |
-
|
| 2309 |
Greatest English Letter in Upper and Lower Case |
|
⚠ |
-
|
| 2310 |
Sum of Numbers With Units Digit K |
|
⚠⚠ |
-
|
| 2311 |
Longest Binary Subsequence Less Than or Equal to K |
|
⚠⚠ |
-
|
| 2312 |
Selling Pieces of Wood |
|
⚠⚠⚠ |
-
|
| 2315 |
Count Asterisks |
|
⚠ |
-
|
| 2316 |
Count Unreachable Pairs of Nodes in an Undirected Graph |
|
⚠⚠ |
-
|
| 2317 |
Maximum XOR After Operations |
|
⚠⚠ |
-
|
| 2318 |
Number of Distinct Roll Sequences |
|
⚠⚠⚠ |
-
|
| 2319 |
Check if Matrix Is X-Matrix |
|
⚠ |
-
|
| 2320 |
Count Number of Ways to Place Houses |
|
⚠⚠ |
-
|
| 2321 |
Maximum Score Of Spliced Array |
|
⚠⚠⚠ |
-
|
| 2322 |
Minimum Score After Removals on a Tree |
|
⚠⚠⚠ |
-
|
| 2325 |
Decode the Message |
|
⚠ |
-
|
| 2326 |
Spiral Matrix IV |
|
⚠⚠ |
-
|
| 2327 |
Number of People Aware of a Secret |
|
⚠⚠ |
-
|
| 2328 |
Number of Increasing Paths in a Grid |
|
⚠⚠⚠ |
-
|
| 2331 |
Evaluate Boolean Binary Tree |
|
⚠ |
-
|
| 2332 |
The Latest Time to Catch a Bus |
|
⚠⚠ |
-
|
| 2333 |
Minimum Sum of Squared Difference |
|
⚠⚠ |
-
|
| 2334 |
Subarray With Elements Greater Than Varying Threshold |
|
⚠⚠⚠ |
-
|
| 2335 |
Minimum Amount of Time to Fill Cups |
|
⚠ |
-
|
| 2336 |
Smallest Number in Infinite Set |
|
⚠⚠ |
-
|
| 2337 |
Move Pieces to Obtain a String |
|
⚠⚠ |
-
|
| 2338 |
Count the Number of Ideal Arrays |
|
⚠⚠⚠ |
-
|
| 2341 |
Maximum Number of Pairs in Array |
|
⚠ |
-
|
| 2342 |
Max Sum of a Pair With Equal Sum of Digits |
|
⚠⚠ |
-
|
| 2343 |
Query Kth Smallest Trimmed Number |
|
⚠⚠ |
-
|
| 2344 |
Minimum Deletions to Make Array Divisible |
|
⚠⚠⚠ |
-
|
| 2347 |
Best Poker Hand |
|
⚠ |
-
|
| 2348 |
Number of Zero-Filled Subarrays |
|
⚠⚠ |
-
|
| 2349 |
Design a Number Container System |
|
⚠⚠ |
-
|
| 2350 |
Shortest Impossible Sequence of Rolls |
|
⚠⚠⚠ |
-
|
| 2351 |
First Letter to Appear Twice |
|
⚠ |
-
|
| 2352 |
Equal Row and Column Pairs |
|
⚠⚠ |
-
|
| 2353 |
Design a Food Rating System |
|
⚠⚠ |
-
|
| 2354 |
Number of Excellent Pairs |
|
⚠⚠⚠ |
-
|
| 2357 |
Make Array Zero by Subtracting Equal Amounts |
|
⚠ |
-
|
| 2358 |
Maximum Number of Groups Entering a Competition |
|
⚠⚠ |
-
|
| 2359 |
Find Closest Node to Given Two Nodes |
|
⚠⚠ |
-
|
| 2360 |
Longest Cycle in a Graph |
|
⚠⚠⚠ |
-
|
| 2363 |
Merge Similar Items |
|
⚠ |
-
|
| 2364 |
Count Number of Bad Pairs |
|
⚠⚠ |
-
|
| 2365 |
Task Scheduler II |
|
⚠⚠ |
-
|
| 2366 |
Minimum Replacements to Sort the Array |
|
⚠⚠⚠ |
-
|
| 2367 |
Number of Arithmetic Triplets |
|
⚠ |
-
|
| 2368 |
Reachable Nodes With Restrictions |
|
⚠⚠ |
-
|
| 2369 |
Check if There is a Valid Partition For The Array |
|
⚠⚠ |
-
|
| 2370 |
Longest Ideal Subsequence |
|
⚠⚠ |
-
|
| 2373 |
Largest Local Values in a Matrix |
|
⚠ |
-
|
| 2374 |
Node With Highest Edge Score |
|
⚠⚠ |
-
|
| 2375 |
Construct Smallest Number From DI String |
|
⚠⚠ |
-
|
| 2376 |
Count Special Integers |
|
⚠⚠⚠ |
-
|
| 2379 |
Minimum Recolors to Get K Consecutive Black Blocks |
Sliding Window |
⚠ |
Solution
|
| 2380 |
Time Needed to Rearrange a Binary String |
|
⚠⚠ |
-
|
| 2381 |
Shifting Letters II |
|
⚠⚠ |
-
|
| 2382 |
Maximum Segment Sum After Removals |
|
⚠⚠⚠ |
-
|
| 2383 |
Minimum Hours of Training to Win a Competition |
|
⚠ |
-
|
| 2384 |
Largest Palindromic Number |
|
⚠⚠ |
-
|
| 2385 |
Amount of Time for Binary Tree to Be Infected |
|
⚠⚠ |
-
|
| 2386 |
Find the K-Sum of an Array |
|
⚠⚠⚠ |
-
|
| 2389 |
Longest Subsequence With Limited Sum |
Binary Search |
⚠ |
Solution
|
| 2390 |
Removing Stars From a String |
|
⚠⚠ |
-
|
| 2391 |
Minimum Amount of Time to Collect Garbage |
|
⚠⚠ |
-
|
| 2392 |
Build a Matrix With Conditions |
|
⚠⚠⚠ |
-
|
| 2395 |
Find Subarrays With Equal Sum |
|
⚠ |
-
|
| 2396 |
Strictly Palindromic Number |
|
⚠⚠ |
-
|
| 2397 |
Maximum Rows Covered by Columns |
|
⚠⚠ |
-
|
| 2398 |
Maximum Number of Robots Within Budget |
|
⚠⚠⚠ |
-
|
| 2399 |
Check Distances Between Same Letters |
|
⚠ |
-
|
| 2400 |
Number of Ways to Reach a Position After Exactly k Steps |
|
⚠⚠ |
-
|
| 2401 |
Longest Nice Subarray |
|
⚠⚠ |
-
|
| 2402 |
Meeting Rooms III |
|
⚠⚠⚠ |
-
|
| 2404 |
Most Frequent Even Element |
|
⚠ |
-
|
| 2405 |
Optimal Partition of String |
|
⚠⚠ |
-
|
| 2406 |
Divide Intervals Into Minimum Number of Groups |
|
⚠⚠ |
-
|
| 2407 |
Longest Increasing Subsequence II |
|
⚠⚠⚠ |
-
|
| 2409 |
Count Days Spent Together |
|
⚠ |
-
|
| 2410 |
Maximum Matching of Players With Trainers |
|
⚠⚠ |
-
|
| 2411 |
Smallest Subarrays With Maximum Bitwise OR |
|
⚠⚠ |
-
|
| 2412 |
Minimum Money Required Before Transactions |
|
⚠⚠⚠ |
-
|
| 2413 |
Smallest Even Multiple |
|
⚠ |
-
|
| 2414 |
Length of the Longest Alphabetical Continuous Substring |
|
⚠⚠ |
-
|
| 2415 |
Reverse Odd Levels of Binary Tree |
|
⚠⚠ |
-
|
| 2416 |
Sum of Prefix Scores of Strings |
|
⚠⚠⚠ |
-
|
| 2418 |
Sort the People |
|
⚠ |
-
|
| 2419 |
Longest Subarray With Maximum Bitwise AND |
|
⚠⚠ |
-
|
| 2420 |
Find All Good Indices |
|
⚠⚠ |
-
|
| 2421 |
Number of Good Paths |
|
⚠⚠⚠ |
-
|
| 2423 |
Remove Letter To Equalize Frequency |
|
⚠ |
-
|
| 2424 |
Longest Uploaded Prefix |
|
⚠⚠ |
-
|
| 2425 |
Bitwise XOR of All Pairings |
|
⚠⚠ |
-
|
| 2426 |
Number of Pairs Satisfying Inequality |
|
⚠⚠⚠ |
-
|
| 2427 |
Number of Common Factors |
|
⚠ |
-
|
| 2428 |
Maximum Sum of an Hourglass |
|
⚠⚠ |
-
|
| 2429 |
Minimize XOR |
Bitwise Operation |
⚠⚠ |
Solution
|
| 2430 |
Maximum Deletions on a String |
|
⚠⚠⚠ |
-
|
| 2432 |
The Employee That Worked on the Longest Task |
|
⚠ |
-
|
| 2433 |
Find The Original Array of Prefix Xor |
Bitwise operation |
⚠⚠ |
Solution
|
| 2434 |
Using a Robot to Print the Lexicographically Smallest String |
|
⚠⚠ |
-
|
| 2435 |
Paths in Matrix Whose Sum Is Divisible by K |
|
⚠⚠⚠ |
-
|
| 2437 |
Number of Valid Clock Times |
|
⚠ |
-
|
| 2438 |
Range Product Queries of Powers |
|
⚠⚠ |
-
|
| 2439 |
Minimize Maximum of Array |
|
⚠⚠ |
-
|
| 2440 |
Create Components With Same Value |
|
⚠⚠⚠ |
-
|
| 2441 |
Largest Positive Integer That Exists With Its Negative |
|
⚠ |
-
|
| 2442 |
Count Number of Distinct Integers After Reverse Operations |
|
⚠⚠ |
-
|
| 2443 |
Sum of Number and Its Reverse |
|
⚠⚠ |
-
|
| 2444 |
Count Subarrays With Fixed Bounds |
|
⚠⚠⚠ |
-
|
| 2446 |
Determine if Two Events Have Conflict |
|
⚠ |
-
|
| 2447 |
Number of Subarrays With GCD Equal to K |
|
⚠⚠ |
-
|
| 2448 |
Minimum Cost to Make Array Equal |
|
⚠⚠⚠ |
-
|
| 2449 |
Minimum Number of Operations to Make Arrays Similar |
|
⚠⚠⚠ |
-
|
| 2451 |
Odd String Difference |
|
⚠ |
-
|
| 2452 |
Words Within Two Edits of Dictionary |
|
⚠⚠ |
-
|
| 2453 |
Destroy Sequential Targets |
|
⚠⚠ |
-
|
| 2454 |
Next Greater Element IV |
|
⚠⚠⚠ |
-
|
| 2455 |
Average Value of Even Numbers That Are Divisible by Three |
|
⚠ |
-
|
| 2456 |
Most Popular Video Creator |
|
⚠⚠ |
-
|
| 2457 |
Minimum Addition to Make Integer Beautiful |
|
⚠⚠ |
-
|
| 2458 |
Height of Binary Tree After Subtree Removal Queries |
|
⚠⚠⚠ |
-
|
| 2460 |
Apply Operations to an Array |
|
⚠ |
-
|
| 2461 |
Maximum Sum of Distinct Subarrays With Length K |
Sliding Window
Dict |
⚠⚠ |
Solution
|
| 2462 |
Total Cost to Hire K Workers |
|
⚠⚠ |
-
|
| 2463 |
Minimum Total Distance Traveled |
|
⚠⚠⚠ |
-
|
| 2465 |
Number of Distinct Averages |
|
⚠ |
-
|
| 2466 |
Count Ways To Build Good Strings |
|
⚠⚠ |
-
|
| 2467 |
Most Profitable Path in a Tree |
|
⚠⚠ |
-
|
| 2468 |
Split Message Based on Limit |
|
⚠⚠⚠ |
-
|
| 2469 |
Convert the Temperature |
|
⚠ |
-
|
| 2470 |
Number of Subarrays With LCM Equal to K |
|
⚠⚠ |
-
|
| 2471 |
Minimum Number of Operations to Sort a Binary Tree by Level |
|
⚠⚠ |
-
|
| 2472 |
Maximum Number of Non-overlapping Palindrome Substrings |
|
⚠⚠⚠ |
-
|
| 2475 |
Number of Unequal Triplets in Array |
|
⚠ |
-
|
| 2476 |
Closest Nodes Queries in a Binary Search Tree |
|
⚠⚠ |
-
|
| 2477 |
Minimum Fuel Cost to Report to the Capital |
|
⚠⚠ |
-
|
| 2478 |
Number of Beautiful Partitions |
|
⚠⚠⚠ |
-
|
| 2481 |
Minimum Cuts to Divide a Circle |
|
⚠ |
-
|
| 2482 |
Difference Between Ones and Zeros in Row and Column |
|
⚠⚠ |
-
|
| 2483 |
Minimum Penalty for a Shop |
|
⚠⚠ |
-
|
| 2484 |
Count Palindromic Subsequences |
|
⚠⚠⚠ |
-
|
| 2485 |
Find the Pivot Integer |
|
⚠ |
-
|
| 2486 |
Append Characters to String to Make Subsequence |
|
⚠⚠ |
-
|
| 2487 |
Remove Nodes From Linked List |
|
⚠⚠ |
-
|
| 2488 |
Count Subarrays With Median K |
|
⚠⚠⚠ |
-
|
| 2490 |
Circular Sentence |
|
⚠ |
-
|
| 2491 |
Divide Players Into Teams of Equal Skill |
|
⚠⚠ |
-
|
| 2492 |
Minimum Score of a Path Between Two Cities |
|
⚠⚠ |
-
|
| 2493 |
Divide Nodes Into the Maximum Number of Groups |
|
⚠⚠⚠ |
-
|
| 2496 |
Maximum Value of a String in an Array |
|
⚠ |
-
|
| 2497 |
Maximum Star Sum of a Graph |
|
⚠⚠ |
-
|
| 2498 |
Frog Jump II |
|
⚠⚠ |
-
|
| 2499 |
Minimum Total Cost to Make Arrays Unequal |
|
⚠⚠⚠ |
-
|
| 2500 |
Delete Greatest Value in Each Row |
|
⚠ |
-
|
| 2501 |
Longest Square Streak in an Array |
|
⚠⚠ |
-
|
| 2502 |
Design Memory Allocator |
|
⚠⚠ |
-
|
| 2503 |
Maximum Number of Points From Grid Queries |
|
⚠⚠⚠ |
-
|
| 2506 |
Count Pairs Of Similar Strings |
|
⚠ |
-
|
| 2507 |
Smallest Value After Replacing With Sum of Prime Factors |
|
⚠⚠ |
-
|
| 2508 |
Add Edges to Make Degrees of All Nodes Even |
|
⚠⚠⚠ |
-
|
| 2509 |
Cycle Length Queries in a Tree |
|
⚠⚠⚠ |
-
|
| 2511 |
Maximum Enemy Forts That Can Be Captured |
|
⚠ |
-
|
| 2512 |
Reward Top K Students |
|
⚠⚠ |
-
|
| 2513 |
Minimize the Maximum of Two Arrays |
|
⚠⚠ |
-
|
| 2514 |
Count Anagrams |
|
⚠⚠⚠ |
-
|
| 2515 |
Shortest Distance to Target String in a Circular Array |
|
⚠ |
-
|
| 2516 |
Take K of Each Character From Left and Right |
|
⚠⚠ |
-
|
| 2517 |
Maximum Tastiness of Candy Basket |
|
⚠⚠ |
-
|
| 2518 |
Number of Great Partitions |
|
⚠⚠⚠ |
-
|
| 2520 |
Count the Digits That Divide a Number |
|
⚠ |
-
|
| 2521 |
Distinct Prime Factors of Product of Array |
|
⚠⚠ |
-
|
| 2522 |
Partition String Into Substrings With Values at Most K |
|
⚠⚠ |
-
|
| 2523 |
Closest Prime Numbers in Range |
|
⚠⚠ |
-
|
| 2525 |
Categorize Box According to Criteria |
|
⚠ |
-
|
| 2526 |
Find Consecutive Integers from a Data Stream |
|
⚠⚠ |
-
|
| 2527 |
Find Xor-Beauty of Array |
|
⚠⚠ |
-
|
| 2528 |
Maximize the Minimum Powered City |
|
⚠⚠⚠ |
-
|
| 2529 |
Maximum Count of Positive Integer and Negative Integer |
Binary Search |
⚠ |
Solution
|
| 2530 |
Maximal Score After Applying K Operations |
|
⚠⚠ |
-
|
| 2531 |
Make Number of Distinct Characters Equal |
|
⚠⚠ |
-
|
| 2532 |
Time to Cross a Bridge |
|
⚠⚠⚠ |
-
|
| 2535 |
Difference Between Element Sum and Digit Sum of an Array |
|
⚠ |
-
|
| 2536 |
Increment Submatrices by One |
|
⚠⚠ |
-
|
| 2537 |
Count the Number of Good Subarrays |
|
⚠⚠ |
-
|
| 2538 |
Difference Between Maximum and Minimum Price Sum |
|
⚠⚠⚠ |
-
|
| 2540 |
Minimum Common Value |
|
⚠ |
-
|
| 2541 |
Minimum Operations to Make Array Equal II |
|
⚠⚠ |
-
|
| 2542 |
Maximum Subsequence Score |
|
⚠⚠ |
-
|
| 2543 |
Check if Point Is Reachable |
|
⚠⚠⚠ |
-
|
| 2544 |
Alternating Digit Sum |
|
⚠ |
-
|
| 2545 |
Sort the Students by Their Kth Score |
|
⚠⚠ |
-
|
| 2546 |
Apply Bitwise Operations to Make Strings Equal |
|
⚠⚠ |
-
|
| 2547 |
Minimum Cost to Split an Array |
|
⚠⚠⚠ |
-
|
| 2549 |
Count Distinct Numbers on Board |
|
⚠ |
-
|
| 2550 |
Count Collisions of Monkeys on a Polygon |
|
⚠⚠ |
-
|
| 2551 |
Put Marbles in Bags |
|
⚠⚠⚠ |
-
|
| 2552 |
Count Increasing Quadruplets |
|
⚠⚠⚠ |
-
|
| 2553 |
Separate the Digits in an Array |
|
⚠ |
-
|
| 2554 |
Maximum Number of Integers to Choose From a Range I |
|
⚠⚠ |
-
|
| 2555 |
Maximize Win From Two Segments |
|
⚠⚠ |
-
|
| 2556 |
Disconnect Path in a Binary Matrix by at Most One Flip |
|
⚠⚠ |
-
|
| 2558 |
Take Gifts From the Richest Pile |
|
⚠ |
-
|
| 2559 |
Count Vowel Strings in Ranges |
|
⚠⚠ |
-
|
| 2560 |
House Robber IV |
|
⚠⚠ |
-
|
| 2561 |
Rearranging Fruits |
|
⚠⚠⚠ |
-
|
| 2562 |
Find the Array Concatenation Value |
|
⚠ |
-
|
| 2563 |
Count the Number of Fair Pairs |
|
⚠⚠ |
-
|
| 2564 |
Substring XOR Queries |
|
⚠⚠ |
-
|
| 2565 |
Subsequence With the Minimum Score |
|
⚠⚠⚠ |
-
|
| 2566 |
Maximum Difference by Remapping a Digit |
|
⚠ |
-
|
| 2567 |
Minimum Score by Changing Two Elements |
|
⚠⚠ |
-
|
| 2568 |
Minimum Impossible OR |
|
⚠⚠ |
-
|
| 2569 |
Handling Sum Queries After Update |
|
⚠⚠⚠ |
-
|
| 2570 |
Merge Two 2D Arrays by Summing Values |
|
⚠ |
-
|
| 2571 |
Minimum Operations to Reduce an Integer to 0 |
|
⚠⚠ |
-
|
| 2572 |
Count the Number of Square-Free Subsets |
|
⚠⚠ |
-
|
| 2573 |
Find the String with LCP |
|
⚠⚠⚠ |
-
|
| 2574 |
Left and Right Sum Differences |
|
⚠ |
-
|
| 2575 |
Find the Divisibility Array of a String |
|
⚠⚠ |
-
|
| 2576 |
Find the Maximum Number of Marked Indices |
|
⚠⚠ |
-
|
| 2577 |
Minimum Time to Visit a Cell In a Grid |
|
⚠⚠⚠ |
-
|
| 2578 |
Split With Minimum Sum |
|
⚠ |
-
|
| 2579 |
Count Total Number of Colored Cells |
|
⚠⚠ |
-
|
| 2580 |
Count Ways to Group Overlapping Ranges |
|
⚠⚠ |
-
|
| 2581 |
Count Number of Possible Root Nodes |
|
⚠⚠⚠ |
-
|
| 2582 |
Pass the Pillow |
|
⚠ |
-
|
| 2583 |
Kth Largest Sum in a Binary Tree |
|
⚠⚠ |
-
|
| 2584 |
Split the Array to Make Coprime Products |
|
⚠⚠⚠ |
-
|
| 2585 |
Number of Ways to Earn Points |
|
⚠⚠⚠ |
-
|
| 2586 |
Count the Number of Vowel Strings in Range |
|
⚠ |
-
|
| 2587 |
Rearrange Array to Maximize Prefix Score |
|
⚠⚠ |
-
|
| 2588 |
Count the Number of Beautiful Subarrays |
|
⚠⚠ |
-
|
| 2589 |
Minimum Time to Complete All Tasks |
|
⚠⚠⚠ |
-
|
| 2591 |
Distribute Money to Maximum Children |
|
⚠ |
-
|
| 2592 |
Maximize Greatness of an Array |
|
⚠⚠ |
-
|
| 2593 |
Find Score of an Array After Marking All Elements |
|
⚠⚠ |
-
|
| 2594 |
Minimum Time to Repair Cars |
|
⚠⚠ |
-
|
| 2595 |
Number of Even and Odd Bits |
Bitwise Operation |
⚠ |
Solution
|
| 2596 |
Check Knight Tour Configuration |
|
⚠⚠ |
-
|
| 2597 |
The Number of Beautiful Subsets |
|
⚠⚠ |
-
|
| 2598 |
Smallest Missing Non-negative Integer After Operations |
Math |
⚠⚠ |
Solution
|
| 2600 |
K Items With the Maximum Sum |
|
⚠ |
-
|
| 2601 |
Prime Subtraction Operation |
|
⚠⚠ |
-
|
| 2602 |
Minimum Operations to Make All Array Elements Equal |
|
⚠⚠ |
-
|
| 2603 |
Collect Coins in a Tree |
|
⚠⚠⚠ |
-
|
| 2605 |
Form Smallest Number From Two Digit Arrays |
|
⚠ |
-
|
| 2606 |
Find the Substring With Maximum Cost |
|
⚠⚠ |
-
|
| 2607 |
Make K-Subarray Sums Equal |
|
⚠⚠ |
-
|
| 2608 |
Shortest Cycle in a Graph |
|
⚠⚠⚠ |
-
|
| 2609 |
Find the Longest Balanced Substring of a Binary String |
|
⚠ |
-
|
| 2610 |
Convert an Array Into a 2D Array With Conditions |
|
⚠⚠ |
-
|
| 2611 |
Mice and Cheese |
|
⚠⚠ |
-
|
| 2612 |
Minimum Reverse Operations |
|
⚠⚠⚠ |
-
|
| 2614 |
Prime In Diagonal |
|
⚠ |
-
|
| 2615 |
Sum of Distances |
|
⚠⚠ |
-
|
| 2616 |
Minimize the Maximum Difference of Pairs |
|
⚠⚠ |
-
|
| 2617 |
Minimum Number of Visited Cells in a Grid |
|
⚠⚠⚠ |
-
|
| 2639 |
Find the Width of Columns of a Grid |
|
⚠ |
-
|
| 2640 |
Find the Score of All Prefixes of an Array |
|
⚠⚠ |
-
|
| 2641 |
Cousins in Binary Tree II |
|
⚠⚠ |
-
|
| 2642 |
Design Graph With Shortest Path Calculator |
|
⚠⚠⚠ |
-
|
| 2643 |
Row With Maximum Ones |
|
⚠ |
-
|
| 2644 |
Find the Maximum Divisibility Score |
|
⚠ |
-
|
| 2645 |
Minimum Additions to Make Valid String |
|
⚠⚠ |
-
|
| 2646 |
Minimize the Total Price of the Trips |
|
⚠⚠⚠ |
-
|
| 2651 |
Calculate Delayed Arrival Time |
|
⚠ |
-
|
| 2652 |
Sum Multiples |
|
⚠ |
-
|
| 2653 |
Sliding Subarray Beauty |
Sliding Window
Heap
Multiset |
⚠⚠ |
Solution
|
| 2654 |
Minimum Number of Operations to Make All Array Elements Equal to 1 |
|
⚠⚠ |
-
|
| 2656 |
Maximum Sum With Exactly K Elements |
|
⚠ |
-
|
| 2657 |
Find the Prefix Common Array of Two Arrays |
Dict
Bitwise Operation |
⚠⚠ |
Solution
|
| 2658 |
Maximum Number of Fish in a Grid |
DFS |
⚠⚠ |
Solution
|
| 2659 |
Make Array Empty |
|
⚠⚠⚠ |
-
|
| 2660 |
Determine the Winner of a Bowling Game |
|
⚠ |
-
|
| 2661 |
First Completely Painted Row or Column |
|
⚠⚠ |
-
|
| 2662 |
Minimum Cost of a Path With Special Roads |
|
⚠⚠ |
-
|
| 2663 |
Lexicographically Smallest Beautiful String |
|
⚠⚠⚠ |
-
|
| 2670 |
Find the Distinct Difference Array |
|
⚠ |
-
|
| 2671 |
Frequency Tracker |
|
⚠⚠ |
-
|
| 2672 |
Number of Adjacent Elements With the Same Color |
|
⚠⚠ |
-
|
| 2673 |
Make Costs of Paths Equal in a Binary Tree |
|
⚠⚠ |
-
|
| 2678 |
Number of Senior Citizens |
|
⚠ |
-
|
| 2679 |
Sum in a Matrix |
|
⚠⚠ |
-
|
| 2680 |
Maximum OR |
|
⚠⚠ |
-
|
| 2681 |
Power of Heroes |
|
⚠⚠⚠ |
-
|
| 2682 |
Find the Losers of the Circular Game |
|
⚠ |
-
|
| 2683 |
Neighboring Bitwise XOR |
Bitwise Operation |
⚠⚠ |
Solution
|
| 2684 |
Maximum Number of Moves in a Grid |
DFS |
⚠⚠ |
Solution
|
| 2685 |
Count the Number of Complete Components |
|
⚠⚠ |
-
|
| 2696 |
Minimum String Length After Removing Substrings |
|
⚠ |
-
|
| 2697 |
Lexicographically Smallest Palindrome |
|
⚠ |
-
|
| 2698 |
Find the Punishment Number of an Integer |
|
⚠⚠ |
-
|
| 2699 |
Modify Graph Edge Weights |
|
⚠⚠⚠ |
-
|
| 2706 |
Buy Two Chocolates |
|
⚠ |
-
|
| 2707 |
Extra Characters in a String |
|
⚠⚠ |
-
|
| 2708 |
Maximum Strength of a Group |
|
⚠⚠ |
-
|
| 2709 |
Greatest Common Divisor Traversal |
|
⚠⚠⚠ |
-
|
| 2710 |
Remove Trailing Zeros From a String |
|
⚠ |
-
|
| 2711 |
Difference of Number of Distinct Values on Diagonals |
|
⚠⚠ |
-
|
| 2712 |
Minimum Cost to Make All Characters Equal |
|
⚠⚠ |
-
|
| 2713 |
Maximum Strictly Increasing Cells in a Matrix |
|
⚠⚠⚠ |
-
|
| 2716 |
Minimize String Length |
|
⚠ |
-
|
| 2717 |
Semi-Ordered Permutation |
|
⚠ |
-
|
| 2718 |
Sum of Matrix After Queries |
|
⚠⚠ |
-
|
| 2719 |
Count of Integers |
|
⚠⚠⚠ |
-
|
| 2729 |
Check if The Number is Fascinating |
|
⚠ |
-
|
| 2730 |
Find the Longest Semi-Repetitive Substring |
|
⚠⚠ |
-
|
| 2731 |
Movement of Robots |
|
⚠⚠ |
-
|
| 2732 |
Find a Good Subset of the Matrix |
|
⚠⚠⚠ |
-
|
| 2733 |
Neither Minimum nor Maximum |
|
⚠ |
-
|
| 2734 |
Lexicographically Smallest String After Substring Operation |
|
⚠⚠ |
-
|
| 2735 |
Collecting Chocolates |
|
⚠⚠ |
-
|
| 2736 |
Maximum Sum Queries |
|
⚠⚠⚠ |
-
|
| 2739 |
Total Distance Traveled |
|
⚠ |
-
|
| 2740 |
Find the Value of the Partition |
|
⚠⚠ |
-
|
| 2741 |
Special Permutations |
|
⚠⚠ |
-
|
| 2742 |
Painting the Walls |
|
⚠⚠⚠ |
-
|
| 2744 |
Find Maximum Number of String Pairs |
|
⚠ |
-
|
| 2745 |
Construct the Longest New String |
|
⚠⚠ |
-
|
| 2746 |
Decremental String Concatenation |
|
⚠⚠ |
-
|
| 2747 |
Count Zero Request Servers |
|
⚠⚠ |
-
|
| 2748 |
Number of Beautiful Pairs |
|
⚠ |
-
|
| 2749 |
Minimum Operations to Make the Integer Zero |
|
⚠⚠ |
-
|
| 2750 |
Ways to Split Array Into Good Subarrays |
|
⚠⚠ |
-
|
| 2751 |
Robot Collisions |
|
⚠⚠⚠ |
-
|
| 2760 |
Longest Even Odd Subarray With Threshold |
|
⚠ |
-
|
| 2761 |
Prime Pairs With Target Sum |
|
⚠⚠ |
-
|
| 2762 |
Continuous Subarrays |
|
⚠⚠ |
-
|
| 2763 |
Sum of Imbalance Numbers of All Subarrays |
|
⚠⚠⚠ |
-
|
| 2765 |
Longest Alternating Subarray |
|
⚠ |
-
|
| 2766 |
Relocate Marbles |
|
⚠⚠ |
-
|
| 2767 |
Partition String Into Minimum Beautiful Substrings |
|
⚠⚠ |
-
|
| 2768 |
Number of Black Blocks |
|
⚠⚠ |
-
|
| 2769 |
Find the Maximum Achievable Number |
|
⚠ |
-
|
| 2770 |
Maximum Number of Jumps to Reach the Last Index |
|
⚠⚠ |
-
|
| 2771 |
Longest Non-decreasing Subarray From Two Arrays |
|
⚠⚠ |
-
|
| 2772 |
Apply Operations to Make All Array Elements Equal to Zero |
|
⚠⚠ |
-
|
| 2778 |
Sum of Squares of Special Elements |
|
⚠ |
-
|
| 2779 |
Maximum Beauty of an Array After Applying Operation |
|
⚠⚠ |
-
|
| 2780 |
Minimum Index of a Valid Split |
|
⚠⚠ |
-
|
| 2781 |
Length of the Longest Valid Substring |
|
⚠⚠⚠ |
-
|
| 2784 |
Check if Array is Good |
|
⚠ |
-
|
| 2785 |
Sort Vowels in a String |
|
⚠⚠ |
-
|
| 2786 |
Visit Array Positions to Maximize Score |
|
⚠⚠ |
-
|
| 2787 |
Ways to Express an Integer as Sum of Powers |
|
⚠⚠ |
-
|
| 2788 |
Split Strings by Separator |
|
⚠ |
-
|
| 2789 |
Largest Element in an Array after Merge Operations |
|
⚠⚠ |
-
|
| 2790 |
Maximum Number of Groups With Increasing Length |
|
⚠⚠⚠ |
-
|
| 2791 |
Count Paths That Can Form a Palindrome in a Tree |
|
⚠⚠⚠ |
-
|
| 2798 |
Number of Employees Who Met the Target |
|
⚠ |
-
|
| 2799 |
Count Complete Subarrays in an Array |
|
⚠⚠ |
-
|
| 2800 |
Shortest String That Contains Three Strings |
|
⚠⚠ |
-
|
| 2801 |
Count Stepping Numbers in Range |
|
⚠⚠⚠ |
-
|
| 2806 |
Account Balance After Rounded Purchase |
|
⚠ |
-
|
| 2807 |
Insert Greatest Common Divisors in Linked List |
|
⚠⚠ |
-
|
| 2808 |
Minimum Seconds to Equalize a Circular Array |
|
⚠⚠ |
-
|
| 2809 |
Minimum Time to Make Array Sum At Most x |
|
⚠⚠⚠ |
-
|
| 2810 |
Faulty Keyboard |
|
⚠ |
-
|
| 2811 |
Check if it is Possible to Split Array |
|
⚠⚠ |
-
|
| 2812 |
Find the Safest Path in a Grid |
|
⚠⚠ |
-
|
| 2813 |
Maximum Elegance of a K-Length Subsequence |
|
⚠⚠⚠ |
-
|
| 2815 |
Max Pair Sum in an Array |
|
⚠ |
-
|
| 2816 |
Double a Number Represented as a Linked List |
|
⚠⚠ |
-
|
| 2817 |
Minimum Absolute Difference Between Elements With Constraint |
|
⚠⚠ |
-
|
| 2818 |
Apply Operations to Maximize Score |
|
⚠⚠⚠ |
-
|
| 2824 |
Count Pairs Whose Sum is Less than Target |
|
⚠ |
-
|
| 2825 |
Make String a Subsequence Using Cyclic Increments |
|
⚠⚠ |
-
|
| 2826 |
Sorting Three Groups |
|
⚠⚠ |
-
|
| 2827 |
Number of Beautiful Integers in the Range |
|
⚠⚠⚠ |
-
|
| 2828 |
Check if a String Is an Acronym of Words |
|
⚠ |
-
|
| 2829 |
Determine the Minimum Sum of a k-avoiding Array |
|
⚠⚠ |
-
|
| 2830 |
Maximize the Profit as the Salesman |
|
⚠⚠ |
-
|
| 2831 |
Find the Longest Equal Subarray |
|
⚠⚠ |
-
|
| 2833 |
Furthest Point From Origin |
|
⚠ |
-
|
| 2834 |
Find the Minimum Possible Sum of a Beautiful Array |
|
⚠⚠ |
-
|
| 2835 |
Minimum Operations to Form Subsequence With Target Sum |
|
⚠⚠⚠ |
-
|
| 2836 |
Maximize Value of Function in a Ball Passing Game |
|
⚠⚠⚠ |
-
|
| 2839 |
Check if Strings Can be Made Equal With Operations I |
|
⚠ |
-
|
| 2840 |
Check if Strings Can be Made Equal With Operations II |
|
⚠⚠ |
-
|
| 2841 |
Maximum Sum of Almost Unique Subarray |
Sliding Window
Dict |
⚠⚠ |
Solution
|
| 2842 |
Count K-Subsequences of a String With Maximum Beauty |
|
⚠⚠⚠ |
-
|
| 2843 |
Count Symmetric Integers |
|
⚠ |
-
|
| 2844 |
Minimum Operations to Make a Special Number |
|
⚠⚠ |
-
|
| 2845 |
Count of Interesting Subarrays |
|
⚠⚠ |
-
|
| 2846 |
Minimum Edge Weight Equilibrium Queries in a Tree |
|
⚠⚠⚠ |
-
|
| 2848 |
Points That Intersect With Cars |
|
⚠ |
-
|
| 2849 |
Determine if a Cell Is Reachable at a Given Time |
|
⚠⚠ |
-
|
| 2850 |
Minimum Moves to Spread Stones Over Grid |
|
⚠⚠ |
-
|
| 2851 |
String Transformation |
|
⚠⚠⚠ |
-
|
| 2855 |
Minimum Right Shifts to Sort the Array |
|
⚠ |
-
|
| 2856 |
Minimum Array Length After Pair Removals |
|
⚠⚠ |
-
|
| 2857 |
Count Pairs of Points With Distance k |
|
⚠⚠ |
-
|
| 2858 |
Minimum Edge Reversals So Every Node Is Reachable |
|
⚠⚠⚠ |
-
|
| 2859 |
Sum of Values at Indices With K Set Bits |
|
⚠ |
-
|
| 2860 |
Happy Students |
|
⚠⚠ |
-
|
| 2861 |
Maximum Number of Alloys |
|
⚠⚠ |
-
|
| 2862 |
Maximum Element-Sum of a Complete Subset of Indices |
|
⚠⚠⚠ |
-
|
| 2864 |
Maximum Odd Binary Number |
|
⚠ |
-
|
| 2865 |
Beautiful Towers I |
|
⚠⚠ |
-
|
| 2866 |
Beautiful Towers II |
|
⚠⚠ |
-
|
| 2867 |
Count Valid Paths in a Tree |
|
⚠⚠⚠ |
-
|
| 2869 |
Minimum Operations to Collect Elements |
|
⚠ |
-
|
| 2870 |
Minimum Number of Operations to Make Array Empty |
|
⚠⚠ |
-
|
| 2871 |
Split Array Into Maximum Number of Subarrays |
|
⚠⚠ |
-
|
| 2872 |
Maximum Number of K-Divisible Components |
|
⚠⚠⚠ |
-
|
| 2873 |
Maximum Value of an Ordered Triplet I |
|
⚠ |
-
|
| 2874 |
Maximum Value of an Ordered Triplet II |
|
⚠⚠ |
-
|
| 2875 |
Minimum Size Subarray in Infinite Array |
|
⚠⚠ |
-
|
| 2876 |
Count Visited Nodes in a Directed Graph |
|
⚠⚠⚠ |
-
|
| 2894 |
Divisible and Non-divisible Sums Difference |
|
⚠ |
-
|
| 2895 |
Minimum Processing Time |
|
⚠⚠ |
-
|
| 2896 |
Apply Operations to Make Two Strings Equal |
|
⚠⚠ |
-
|
| 2897 |
Apply Operations on Array to Maximize Sum of Squares |
|
⚠⚠⚠ |
-
|
| 2899 |
Last Visited Integers |
|
⚠ |
-
|
| 2900 |
Longest Unequal Adjacent Groups Subsequence I |
|
⚠ |
-
|
| 2901 |
Longest Unequal Adjacent Groups Subsequence II |
|
⚠⚠ |
-
|
| 2902 |
Count of Sub-Multisets With Bounded Sum |
|
⚠⚠⚠ |
-
|
| 2903 |
Find Indices With Index and Value Difference I |
|
⚠ |
-
|
| 2904 |
Shortest and Lexicographically Smallest Beautiful String |
|
⚠⚠ |
-
|
| 2905 |
Find Indices With Index and Value Difference II |
|
⚠⚠ |
-
|
| 2906 |
Construct Product Matrix |
|
⚠⚠ |
-
|
| 2908 |
Minimum Sum of Mountain Triplets I |
|
⚠ |
-
|
| 2909 |
Minimum Sum of Mountain Triplets II |
|
⚠⚠ |
-
|
| 2910 |
Minimum Number of Groups to Create a Valid Assignment |
|
⚠⚠ |
-
|
| 2911 |
Minimum Changes to Make K Semi-palindromes |
|
⚠⚠⚠ |
-
|
| 2913 |
Subarrays Distinct Element Sum of Squares I |
|
⚠ |
-
|
| 2914 |
Minimum Number of Changes to Make Binary String Beautiful |
|
⚠⚠ |
-
|
| 2915 |
Length of the Longest Subsequence That Sums to Target |
|
⚠⚠ |
-
|
| 2916 |
Subarrays Distinct Element Sum of Squares II |
|
⚠⚠⚠ |
-
|
| 2917 |
Find the K-or of an Array |
Bitwise Operation |
⚠ |
Solution
|
| 2918 |
Minimum Equal Sum of Two Arrays After Replacing Zeros |
|
⚠⚠ |
-
|
| 2919 |
Minimum Increment Operations to Make Array Beautiful |
|
⚠⚠ |
-
|
| 2920 |
Maximum Points After Collecting Coins From All Nodes |
|
⚠⚠⚠ |
-
|
| 2923 |
Find Champion I |
|
⚠ |
-
|
| 2924 |
Find Champion II |
|
⚠⚠ |
-
|
| 2925 |
Maximum Score After Applying Operations on a Tree |
|
⚠⚠ |
-
|
| 2926 |
Maximum Balanced Subsequence Sum |
|
⚠⚠⚠ |
-
|
| 2928 |
Distribute Candies Among Children I |
|
⚠ |
-
|
| 2929 |
Distribute Candies Among Children II |
|
⚠⚠ |
-
|
| 2930 |
Number of Strings Which Can Be Rearranged to Contain Substring |
|
⚠⚠ |
-
|
| 2931 |
Maximum Spending After Buying Items |
|
⚠⚠⚠ |
-
|
| 2932 |
Maximum Strong Pair XOR I |
|
⚠ |
-
|
| 2933 |
High-Access Employees |
|
⚠⚠ |
-
|
| 2934 |
Minimum Operations to Maximize Last Elements in Arrays |
|
⚠⚠ |
-
|
| 2935 |
Maximum Strong Pair XOR II |
|
⚠⚠⚠ |
-
|
| 2937 |
Make Three Strings Equal |
|
⚠ |
-
|
| 2938 |
Separate Black and White Balls |
|
⚠⚠ |
-
|
| 2939 |
Maximum Xor Product |
|
⚠⚠ |
-
|
| 2940 |
Find Building Where Alice and Bob Can Meet |
|
⚠⚠⚠ |
-
|
| 2942 |
Find Words Containing Character |
|
⚠ |
-
|
| 2943 |
Maximize Area of Square Hole in Grid |
|
⚠⚠ |
-
|
| 2944 |
Minimum Number of Coins for Fruits |
|
⚠⚠ |
-
|
| 2945 |
Find Maximum Non-decreasing Array Length |
|
⚠⚠⚠ |
-
|
| 2946 |
Matrix Similarity After Cyclic Shifts |
|
⚠ |
-
|
| 2947 |
Count Beautiful Substrings I |
|
⚠⚠ |
-
|
| 2948 |
Make Lexicographically Smallest Array by Swapping Elements |
|
⚠⚠ |
-
|
| 2949 |
Count Beautiful Substrings II |
|
⚠⚠⚠ |
-
|
| 2951 |
Find the Peaks |
|
⚠ |
-
|
| 2952 |
Minimum Number of Coins to be Added |
|
⚠⚠ |
-
|
| 2953 |
Count Complete Substrings |
Sliding Window |
⚠⚠⚠ |
Solution
|
| 2954 |
Count the Number of Infection Sequences |
|
⚠⚠⚠ |
-
|
| 2956 |
Find Common Elements Between Two Arrays |
|
⚠ |
-
|
| 2957 |
Remove Adjacent Almost-Equal Characters |
|
⚠⚠ |
-
|
| 2958 |
Length of Longest Subarray With at Most K Frequency |
Sliding Window
Dict |
⚠⚠ |
Solution
|
| 2959 |
Number of Possible Sets of Closing Branches |
|
⚠⚠⚠ |
-
|
| 2960 |
Count Tested Devices After Test Operations |
|
⚠ |
-
|
| 2961 |
Double Modular Exponentiation |
|
⚠⚠ |
-
|
| 2962 |
Count Subarrays Where Max Element Appears at Least K Times |
|
⚠⚠ |
-
|
| 2963 |
Count the Number of Good Partitions |
|
⚠⚠⚠ |
-
|
| 2965 |
Find Missing and Repeated Values |
|
⚠ |
-
|
| 2966 |
Divide Array Into Arrays With Max Difference |
|
⚠⚠ |
-
|
| 2967 |
Minimum Cost to Make Array Equalindromic |
|
⚠⚠ |
-
|
| 2968 |
Apply Operations to Maximize Frequency Score |
|
⚠⚠⚠ |
-
|
| 2970 |
Count the Number of Incremovable Subarrays I |
|
⚠ |
-
|
| 2971 |
Find Polygon With the Largest Perimeter |
|
⚠⚠ |
-
|
| 2972 |
Count the Number of Incremovable Subarrays II |
|
⚠⚠⚠ |
-
|
| 2973 |
Find Number of Coins to Place in Tree Nodes |
|
⚠⚠⚠ |
-
|
| 2974 |
Minimum Number Game |
|
⚠ |
-
|
| 2975 |
Maximum Square Area by Removing Fences From a Field |
|
⚠⚠ |
-
|
| 2976 |
Minimum Cost to Convert String I |
|
⚠⚠ |
-
|
| 2977 |
Minimum Cost to Convert String II |
|
⚠⚠⚠ |
-
|
| 2980 |
Check if Bitwise OR Has Trailing Zeros |
Bitwise operation |
⚠ |
Solution
|
| 2981 |
Find Longest Special Substring That Occurs Thrice I |
|
⚠⚠ |
-
|
| 2982 |
Find Longest Special Substring That Occurs Thrice II |
|
⚠⚠ |
-
|
| 2983 |
Palindrome Rearrangement Queries |
|
⚠⚠⚠ |
-
|
| 2996 |
Smallest Missing Integer Greater Than Sequential Prefix Sum |
|
⚠ |
-
|
| 2997 |
Minimum Number of Operations to Make Array XOR Equal to K |
Bitwise Operation |
⚠⚠ |
Solution
|
| 2998 |
Minimum Number of Operations to Make X and Y Equal |
|
⚠⚠ |
-
|
| 2999 |
Count the Number of Powerful Integers |
|
⚠⚠⚠ |
-
|
| 3000 |
Maximum Area of Longest Diagonal Rectangle |
|
⚠ |
-
|
| 3001 |
Minimum Moves to Capture The Queen |
|
⚠⚠ |
-
|
| 3002 |
Maximum Size of a Set After Removals |
|
⚠⚠ |
-
|
| 3003 |
Maximize the Number of Partitions After Operations |
|
⚠⚠⚠ |
-
|
| 3005 |
Count Elements With Maximum Frequency |
|
⚠ |
-
|
| 3006 |
Find Beautiful Indices in the Given Array I |
|
⚠⚠ |
-
|
| 3007 |
Maximum Number That Sum of the Prices Is Less Than or Equal to K |
|
⚠⚠ |
-
|
| 3008 |
Find Beautiful Indices in the Given Array II |
|
⚠⚠⚠ |
-
|
| 3010 |
Divide an Array Into Subarrays With Minimum Cost I |
|
⚠ |
-
|
| 3011 |
Find if Array Can Be Sorted |
|
⚠⚠ |
-
|
| 3012 |
Minimize Length of Array Using Operations |
|
⚠⚠ |
-
|
| 3013 |
Divide an Array Into Subarrays With Minimum Cost II |
|
⚠⚠⚠ |
-
|
| 3014 |
Minimum Number of Pushes to Type Word I |
|
⚠ |
-
|
| 3015 |
Count the Number of Houses at a Certain Distance I |
|
⚠⚠ |
-
|
| 3016 |
Minimum Number of Pushes to Type Word II |
|
⚠⚠ |
-
|
| 3017 |
Count the Number of Houses at a Certain Distance II |
|
⚠⚠⚠ |
-
|
| 3019 |
Number of Changing Keys |
|
⚠ |
-
|
| 3020 |
Find the Maximum Number of Elements in Subset |
|
⚠⚠ |
-
|
| 3021 |
Alice and Bob Playing Flower Game |
|
⚠⚠ |
-
|
| 3022 |
Minimize OR of Remaining Elements Using Operations |
|
⚠⚠⚠ |
-
|
| 3024 |
Type of Triangle |
|
⚠ |
-
|
| 3025 |
Find the Number of Ways to Place People I |
|
⚠⚠ |
-
|
| 3026 |
Maximum Good Subarray Sum |
|
⚠⚠ |
-
|
| 3027 |
Find the Number of Ways to Place People II |
|
⚠⚠⚠ |
-
|
| 3028 |
Ant on the Boundary |
|
⚠ |
-
|
| 3029 |
Minimum Time to Revert Word to Initial State I |
|
⚠⚠ |
-
|
| 3030 |
Find the Grid of Region Average |
|
⚠⚠ |
-
|
| 3031 |
Minimum Time to Revert Word to Initial State II |
|
⚠⚠⚠ |
-
|
| 3033 |
Modify the Matrix |
|
⚠ |
-
|
| 3034 |
Number of Subarrays That Match a Pattern I |
|
⚠⚠ |
-
|
| 3035 |
Maximum Palindromes After Operations |
|
⚠⚠ |
-
|
| 3036 |
Number of Subarrays That Match a Pattern II |
|
⚠⚠⚠ |
-
|
| 3038 |
Maximum Number of Operations With the Same Score I |
|
⚠ |
-
|
| 3039 |
Apply Operations to Make String Empty |
|
⚠⚠ |
-
|
| 3040 |
Maximum Number of Operations With the Same Score II |
|
⚠⚠ |
-
|
| 3041 |
Maximize Consecutive Elements in an Array After Modification |
|
⚠⚠⚠ |
-
|
| 3042 |
Count Prefix and Suffix Pairs I |
|
⚠ |
-
|
| 3043 |
Find the Length of the Longest Common Prefix |
|
⚠⚠ |
-
|
| 3044 |
Most Frequent Prime |
|
⚠⚠ |
-
|
| 3045 |
Count Prefix and Suffix Pairs II |
|
⚠⚠⚠ |
-
|
| 3046 |
Split the Array |
|
⚠ |
-
|
| 3047 |
Find the Largest Area of Square Inside Two Rectangles |
|
⚠⚠ |
-
|
| 3048 |
Earliest Second to Mark Indices I |
|
⚠⚠ |
-
|
| 3049 |
Earliest Second to Mark Indices II |
|
⚠⚠⚠ |
-
|
| 3065 |
Minimum Operations to Exceed Threshold Value I |
|
⚠ |
-
|
| 3066 |
Minimum Operations to Exceed Threshold Value II |
|
⚠⚠ |
-
|
| 3067 |
Count Pairs of Connectable Servers in a Weighted Tree Network |
|
⚠⚠ |
-
|
| 3068 |
Find the Maximum Sum of Node Values |
|
⚠⚠⚠ |
-
|
| 3069 |
Distribute Elements Into Two Arrays I |
|
⚠ |
-
|
| 3070 |
Count Submatrices with Top-Left Element and Sum Less Than k |
Prefix Sum |
⚠⚠ |
Solution
|
| 3071 |
Minimum Operations to Write the Letter Y on a Grid |
|
⚠⚠ |
-
|
| 3072 |
Distribute Elements Into Two Arrays II |
|
⚠⚠⚠ |
-
|
| 3074 |
Apple Redistribution into Boxes |
|
⚠ |
-
|
| 3075 |
Maximize Happiness of Selected Children |
|
⚠⚠ |
-
|
| 3076 |
Shortest Uncommon Substring in an Array |
|
⚠⚠ |
-
|
| 3077 |
Maximum Strength of K Disjoint Subarrays |
|
⚠⚠⚠ |
-
|
| 3079 |
Find the Sum of Encrypted Integers |
|
⚠ |
-
|
| 3080 |
Mark Elements on Array by Performing Queries |
|
⚠⚠ |
-
|
| 3081 |
Replace Question Marks in String to Minimize Its Value |
|
⚠⚠ |
-
|
| 3082 |
Find the Sum of the Power of All Subsequences |
|
⚠⚠⚠ |
-
|
| 3083 |
Existence of a Substring in a String and Its Reverse |
|
⚠ |
-
|
| 3084 |
Count Substrings Starting and Ending with Given Character |
|
⚠⚠ |
-
|
| 3085 |
Minimum Deletions to Make String K-Special |
|
⚠⚠ |
-
|
| 3086 |
Minimum Moves to Pick K Ones |
|
⚠⚠⚠ |
-
|
| 3090 |
Maximum Length Substring With Two Occurrences |
Sliding Window
Dict |
⚠ |
Solution
|
| 3091 |
Apply Operations to Make Sum of Array Greater Than or Equal to k |
|
⚠⚠ |
-
|
| 3092 |
Most Frequent IDs |
|
⚠⚠ |
-
|
| 3093 |
Longest Common Suffix Queries |
|
⚠⚠⚠ |
-
|
| 3095 |
Shortest Subarray With OR at Least K I |
|
⚠ |
-
|
| 3096 |
Minimum Levels to Gain More Points |
|
⚠⚠ |
-
|
| 3097 |
Shortest Subarray With OR at Least K II |
|
⚠⚠ |
-
|
| 3098 |
Find the Sum of Subsequence Powers |
|
⚠⚠⚠ |
-
|
| 3099 |
Harshad Number |
|
⚠ |
-
|
| 3100 |
Water Bottles II |
|
⚠⚠ |
-
|
| 3101 |
Count Alternating Subarrays |
|
⚠⚠ |
-
|
| 3102 |
Minimize Manhattan Distances |
|
⚠⚠⚠ |
-
|
| 3105 |
Longest Strictly Increasing or Strictly Decreasing Subarray |
|
⚠ |
-
|
| 3106 |
Lexicographically Smallest String After Operations With Constraint |
|
⚠⚠ |
-
|
| 3107 |
Minimum Operations to Make Median of Array Equal to K |
|
⚠⚠ |
-
|
| 3108 |
Minimum Cost Walk in Weighted Graph |
|
⚠⚠⚠ |
-
|
| 3110 |
Score of a String |
|
⚠ |
-
|
| 3111 |
Minimum Rectangles to Cover Points |
|
⚠⚠ |
-
|
| 3112 |
Minimum Time to Visit Disappearing Nodes |
|
⚠⚠ |
-
|
| 3113 |
Find the Number of Subarrays Where Boundary Elements Are Maximum |
|
⚠⚠⚠ |
-
|
| 3114 |
Latest Time You Can Obtain After Replacing Characters |
|
⚠ |
-
|
| 3115 |
Maximum Prime Difference |
|
⚠⚠ |
-
|
| 3116 |
Kth Smallest Amount With Single Denomination Combination |
|
⚠⚠⚠ |
-
|
| 3117 |
Minimum Sum of Values by Dividing Array |
|
⚠⚠⚠ |
-
|
| 3120 |
Count the Number of Special Characters I |
|
⚠ |
-
|
| 3121 |
Count the Number of Special Characters II |
|
⚠⚠ |
-
|
| 3122 |
Minimum Number of Operations to Satisfy Conditions |
|
⚠⚠ |
-
|
| 3123 |
Find Edges in Shortest Paths |
|
⚠⚠⚠ |
-
|
| 3127 |
Make a Square with the Same Color |
|
⚠ |
-
|
| 3128 |
Right Triangles |
|
⚠⚠ |
-
|
| 3129 |
Find All Possible Stable Binary Arrays I |
|
⚠⚠ |
-
|
| 3130 |
Find All Possible Stable Binary Arrays II |
|
⚠⚠⚠ |
-
|
| 3131 |
Find the Integer Added to Array I |
|
⚠ |
-
|
| 3132 |
Find the Integer Added to Array II |
|
⚠⚠ |
-
|
| 3133 |
Minimum Array End |
|
⚠⚠ |
-
|
| 3134 |
Find the Median of the Uniqueness Array |
|
⚠⚠⚠ |
-
|
| 3136 |
Valid Word |
|
⚠ |
-
|
| 3137 |
Minimum Number of Operations to Make Word K-Periodic |
|
⚠⚠ |
-
|
| 3138 |
Minimum Length of Anagram Concatenation |
|
⚠⚠ |
-
|
| 3139 |
Minimum Cost to Equalize Array |
|
⚠⚠⚠ |
-
|
| 3142 |
Check if Grid Satisfies Conditions |
|
⚠ |
-
|
| 3143 |
Maximum Points Inside the Square |
|
⚠⚠ |
-
|
| 3144 |
Minimum Substring Partition of Equal Character Frequency |
|
⚠⚠ |
-
|
| 3145 |
Find Products of Elements of Big Array |
|
⚠⚠⚠ |
-
|
| 3146 |
Permutation Difference between Two Strings |
|
⚠ |
-
|
| 3147 |
Taking Maximum Energy From the Mystic Dungeon |
|
⚠⚠ |
-
|
| 3148 |
Maximum Difference Score in a Grid |
|
⚠⚠ |
-
|
| 3149 |
Find the Minimum Cost Array Permutation |
|
⚠⚠⚠ |
-
|
| 3151 |
Special Array I |
|
⚠ |
-
|
| 3152 |
Special Array II |
|
⚠⚠ |
-
|
| 3153 |
Sum of Digit Differences of All Pairs |
|
⚠⚠ |
-
|
| 3154 |
Find Number of Ways to Reach the K-th Stair |
|
⚠⚠⚠ |
-
|
| 3158 |
Find the XOR of Numbers Which Appear Twice |
|
⚠ |
-
|
| 3159 |
Find Occurrences of an Element in an Array |
|
⚠⚠ |
-
|
| 3160 |
Find the Number of Distinct Colors Among the Balls |
|
⚠⚠ |
-
|
| 3161 |
Block Placement Queries |
|
⚠⚠⚠ |
-
|
| 3162 |
Find the Number of Good Pairs I |
|
⚠ |
-
|
| 3163 |
String Compression III |
|
⚠⚠ |
-
|
| 3164 |
Find the Number of Good Pairs II |
|
⚠⚠ |
-
|
| 3165 |
Maximum Sum of Subsequence With Non-adjacent Elements |
|
⚠⚠⚠ |
-
|
| 3168 |
Minimum Number of Chairs in a Waiting Room |
|
⚠ |
-
|
| 3169 |
Count Days Without Meetings |
|
⚠⚠ |
-
|
| 3170 |
Lexicographically Minimum String After Removing Stars |
|
⚠⚠ |
-
|
| 3171 |
Find Subarray With Bitwise OR Closest to K |
|
⚠⚠⚠ |
-
|
| 3174 |
Clear Digits |
|
⚠ |
-
|
| 3175 |
Find The First Player to win K Games in a Row |
|
⚠⚠ |
-
|
| 3176 |
Find the Maximum Length of a Good Subsequence I |
|
⚠⚠ |
-
|
| 3177 |
Find the Maximum Length of a Good Subsequence II |
|
⚠⚠⚠ |
-
|
| 3178 |
Find the Child Who Has the Ball After K Seconds |
|
⚠ |
-
|
| 3179 |
Find the N-th Value After K Seconds |
|
⚠⚠ |
-
|
| 3180 |
Maximum Total Reward Using Operations I |
|
⚠⚠ |
-
|
| 3181 |
Maximum Total Reward Using Operations II |
|
⚠⚠⚠ |
-
|
| 3184 |
Count Pairs That Form a Complete Day I |
|
⚠ |
-
|
| 3185 |
Count Pairs That Form a Complete Day II |
|
⚠⚠ |
-
|
| 3186 |
Maximum Total Damage With Spell Casting |
|
⚠⚠ |
-
|
| 3187 |
Peaks in Array |
|
⚠⚠⚠ |
-
|
| 3190 |
Find Minimum Operations to Make All Elements Divisible by Three |
|
⚠ |
-
|
| 3191 |
Minimum Operations to Make Binary Array Elements Equal to One I |
|
⚠⚠ |
-
|
| 3192 |
Minimum Operations to Make Binary Array Elements Equal to One II |
|
⚠⚠ |
-
|
| 3193 |
Count the Number of Inversions |
|
⚠⚠⚠ |
-
|
| 3194 |
Minimum Average of Smallest and Largest Elements |
|
⚠ |
-
|
| 3195 |
Find the Minimum Area to Cover All Ones I |
|
⚠⚠ |
-
|
| 3196 |
Maximize Total Cost of Alternating Subarrays |
|
⚠⚠ |
-
|
| 3197 |
Find the Minimum Area to Cover All Ones II |
|
⚠⚠⚠ |
-
|
| 3200 |
Maximum Height of a Triangle |
|
⚠ |
-
|
| 3201 |
Find the Maximum Length of Valid Subsequence I |
|
⚠⚠ |
-
|
| 3202 |
Find the Maximum Length of Valid Subsequence II |
|
⚠⚠ |
-
|
| 3203 |
Find Minimum Diameter After Merging Two Trees |
|
⚠⚠⚠ |
-
|
| 3206 |
Alternating Groups I |
|
⚠ |
-
|
| 3207 |
Maximum Points After Enemy Battles |
|
⚠⚠ |
-
|
| 3208 |
Alternating Groups II |
|
⚠⚠ |
-
|
| 3209 |
Number of Subarrays With AND Value of K |
|
⚠⚠⚠ |
-
|
| 3210 |
Find the Encrypted String |
|
⚠ |
-
|
| 3211 |
Generate Binary Strings Without Adjacent Zeros |
|
⚠⚠ |
-
|
| 3212 |
Count Submatrices With Equal Frequency of X and Y |
|
⚠⚠ |
-
|
| 3213 |
Construct String with Minimum Cost |
|
⚠⚠⚠ |
-
|
| 3216 |
Lexicographically Smallest String After a Swap |
|
⚠ |
-
|
| 3217 |
Delete Nodes From Linked List Present in Array |
|
⚠⚠ |
-
|
| 3218 |
Minimum Cost for Cutting Cake I |
|
⚠⚠ |
-
|
| 3219 |
Minimum Cost for Cutting Cake II |
|
⚠⚠⚠ |
-
|
| 3222 |
Find the Winning Player in Coin Game |
|
⚠ |
-
|
| 3223 |
Minimum Length of String After Operations |
|
⚠⚠ |
-
|
| 3224 |
Minimum Array Changes to Make Differences Equal |
|
⚠⚠ |
-
|
| 3225 |
Maximum Score From Grid Operations |
|
⚠⚠⚠ |
-
|
| 3226 |
Number of Bit Changes to Make Two Integers Equal |
Bitwise operations |
⚠ |
Solution
|
| 3227 |
Vowels Game in a String |
|
⚠⚠ |
-
|
| 3228 |
Maximum Number of Operations to Move Ones to the End |
|
⚠⚠ |
-
|
| 3229 |
Minimum Operations to Make Array Equal to Target |
|
⚠⚠⚠ |
-
|
| 3232 |
Find if Digit Game Can Be Won |
|
⚠ |
-
|
| 3233 |
Find the Count of Numbers Which Are Not Special |
|
⚠⚠ |
-
|
| 3234 |
Count the Number of Substrings With Dominant Ones |
|
⚠⚠ |
-
|
| 3235 |
Check if the Rectangle Corner Is Reachable |
|
⚠⚠⚠ |
-
|
| 3238 |
Find the Number of Winning Players |
|
⚠ |
-
|
| 3239 |
Minimum Number of Flips to Make Binary Grid Palindromic I |
|
⚠⚠ |
-
|
| 3240 |
Minimum Number of Flips to Make Binary Grid Palindromic II |
|
⚠⚠ |
-
|
| 3241 |
Time Taken to Mark All Nodes |
|
⚠⚠⚠ |
-
|
| 3242 |
Design Neighbor Sum Service |
|
⚠ |
-
|
| 3243 |
Shortest Distance After Road Addition Queries I |
|
⚠⚠ |
-
|
| 3244 |
Shortest Distance After Road Addition Queries II |
|
⚠⚠⚠ |
-
|
| 3245 |
Alternating Groups III |
|
⚠⚠⚠ |
-
|
| 3248 |
Snake in Matrix |
|
⚠ |
-
|
| 3249 |
Count the Number of Good Nodes |
|
⚠⚠ |
-
|
| 3250 |
Find the Count of Monotonic Pairs I |
|
⚠⚠⚠ |
-
|
| 3251 |
Find the Count of Monotonic Pairs II |
|
⚠⚠⚠ |
-
|
| 3254 |
Find the Power of K-Size Subarrays I |
|
⚠⚠ |
-
|
| 3255 |
Find the Power of K-Size Subarrays II |
|
⚠⚠ |
-
|
| 3256 |
Maximum Value Sum by Placing Three Rooks I |
|
⚠⚠⚠ |
-
|
| 3257 |
Maximum Value Sum by Placing Three Rooks II |
|
⚠⚠⚠ |
-
|
| 3258 |
Count Substrings That Satisfy K-Constraint I |
|
⚠ |
-
|
| 3259 |
Maximum Energy Boost From Two Drinks |
|
⚠⚠ |
-
|
| 3260 |
Find the Largest Palindrome Divisible by K |
|
⚠⚠⚠ |
-
|
| 3261 |
Count Substrings That Satisfy K-Constraint II |
|
⚠⚠⚠ |
-
|
| 3264 |
Final Array State After K Multiplication Operations I |
|
⚠ |
-
|
| 3265 |
Count Almost Equal Pairs I |
|
⚠⚠ |
-
|
| 3266 |
Final Array State After K Multiplication Operations II |
|
⚠⚠⚠ |
-
|
| 3267 |
Count Almost Equal Pairs II |
|
⚠⚠⚠ |
-
|
| 3270 |
Find the Key of the Numbers |
|
⚠ |
-
|
| 3271 |
Hash Divided String |
|
⚠⚠ |
-
|
| 3272 |
Find the Count of Good Integers |
|
⚠⚠⚠ |
-
|
| 3273 |
Minimum Amount of Damage Dealt to Bob |
|
⚠⚠⚠ |
-
|
| 3274 |
Check if Two Chessboard Squares Have the Same Color |
|
⚠ |
-
|
| 3275 |
K-th Nearest Obstacle Queries |
|
⚠⚠ |
-
|
| 3276 |
Select Cells in Grid With Maximum Score |
|
⚠⚠⚠ |
-
|
| 3277 |
Maximum XOR Score Subarray Queries |
|
⚠⚠⚠ |
-
|
| 3280 |
Convert Date to Binary |
|
⚠ |
-
|
| 3281 |
Maximize Score of Numbers in Ranges |
|
⚠⚠ |
-
|
| 3282 |
Reach End of Array With Max Score |
|
⚠⚠ |
-
|
| 3283 |
Maximum Number of Moves to Kill All Pawns |
|
⚠⚠⚠ |
-
|
| 3285 |
Find Indices of Stable Mountains |
|
⚠ |
-
|
| 3286 |
Find a Safe Walk Through a Grid |
|
⚠⚠ |
-
|
| 3287 |
Find the Maximum Sequence Value of Array |
|
⚠⚠⚠ |
-
|
| 3288 |
Length of the Longest Increasing Path |
|
⚠⚠⚠ |
-
|
| 3289 |
The Two Sneaky Numbers of Digitville |
|
⚠ |
-
|
| 3290 |
Maximum Multiplication Score |
|
⚠⚠ |
-
|
| 3291 |
Minimum Number of Valid Strings to Form Target I |
|
⚠⚠ |
-
|
| 3292 |
Minimum Number of Valid Strings to Form Target II |
|
⚠⚠⚠ |
-
|
| 3295 |
Report Spam Message |
|
⚠⚠ |
-
|
| 3296 |
Minimum Number of Seconds to Make Mountain Height Zero |
|
⚠⚠ |
-
|
| 3297 |
Count Substrings That Can Be Rearranged to Contain a String I |
|
⚠⚠ |
-
|
| 3298 |
Count Substrings That Can Be Rearranged to Contain a String II |
|
⚠⚠⚠ |
-
|
| 3300 |
Minimum Element After Replacement With Digit Sum |
|
⚠ |
-
|
| 3301 |
Maximize the Total Height of Unique Towers |
|
⚠⚠ |
-
|
| 3302 |
Find the Lexicographically Smallest Valid Sequence |
|
⚠⚠ |
-
|
| 3303 |
Find the Occurrence of First Almost Equal Substring |
|
⚠⚠⚠ |
-
|
| 3304 |
Find the K-th Character in String Game I |
|
⚠ |
-
|
| 3305 |
Count of Substrings Containing Every Vowel and K Consonants I |
|
⚠⚠ |
-
|
| 3306 |
Count of Substrings Containing Every Vowel and K Consonants II |
Sliding Window
DO IT AGAIN |
⚠⚠ |
Solution
|
| 3307 |
Find the K-th Character in String Game II |
|
⚠⚠⚠ |
-
|
| 3309 |
Maximum Possible Number by Binary Concatenation |
|
⚠⚠ |
-
|
| 3310 |
Remove Methods From Project |
|
⚠⚠ |
-
|
| 3311 |
Construct 2D Grid Matching Graph Layout |
|
⚠⚠⚠ |
-
|
| 3312 |
Sorted GCD Pair Queries |
|
⚠⚠⚠ |
-
|
| 3314 |
Construct the Minimum Bitwise Array I |
|
⚠ |
-
|
| 3315 |
Construct the Minimum Bitwise Array II |
|
⚠⚠ |
-
|
| 3316 |
Find Maximum Removals From Source String |
|
⚠⚠ |
-
|
| 3317 |
Find the Number of Possible Ways for an Event |
|
⚠⚠⚠ |
-
|
| 3318 |
Find X-Sum of All K-Long Subarrays I |
|
⚠ |
-
|
| 3319 |
K-th Largest Perfect Subtree Size in Binary Tree |
|
⚠⚠ |
-
|
| 3320 |
Count The Number of Winning Sequences |
|
⚠⚠⚠ |
-
|
| 3321 |
Find X-Sum of All K-Long Subarrays II |
|
⚠⚠⚠ |
-
|
| 3324 |
Find the Sequence of Strings Appeared on the Screen |
|
⚠⚠ |
-
|
| 3325 |
Count Substrings With K-Frequency Characters I |
|
⚠⚠ |
-
|
| 3326 |
Minimum Division Operations to Make Array Non Decreasing |
|
⚠⚠ |
-
|
| 3327 |
Check if DFS Strings Are Palindromes |
|
⚠⚠⚠ |
-
|
| 3330 |
Find the Original Typed String I |
|
⚠ |
-
|
| 3331 |
Find Subtree Sizes After Changes |
|
⚠⚠ |
-
|
| 3332 |
Maximum Points Tourist Can Earn |
|
⚠⚠ |
-
|
| 3333 |
Find the Original Typed String II |
|
⚠⚠⚠ |
-
|
| 3334 |
Find the Maximum Factor Score of Array |
|
⚠⚠ |
-
|
| 3335 |
Total Characters in String After Transformations I |
|
⚠⚠ |
-
|
| 3336 |
Find the Number of Subsequences With Equal GCD |
|
⚠⚠⚠ |
-
|
| 3337 |
Total Characters in String After Transformations II |
|
⚠⚠⚠ |
-
|
| 3340 |
Check Balanced String |
|
⚠ |
-
|
| 3341 |
Find Minimum Time to Reach Last Room I |
|
⚠⚠ |
-
|
| 3342 |
Find Minimum Time to Reach Last Room II |
|
⚠⚠ |
-
|
| 3343 |
Count Number of Balanced Permutations |
|
⚠⚠⚠ |
-
|
| 3345 |
Smallest Divisible Digit Product I |
|
⚠ |
-
|
| 3346 |
Maximum Frequency of an Element After Performing Operations I |
|
⚠⚠ |
-
|
| 3347 |
Maximum Frequency of an Element After Performing Operations II |
|
⚠⚠⚠ |
-
|
| 3348 |
Smallest Divisible Digit Product II |
|
⚠⚠⚠ |
-
|
| 3349 |
Adjacent Increasing Subarrays Detection I |
|
⚠ |
-
|
| 3350 |
Adjacent Increasing Subarrays Detection II |
|
⚠⚠ |
-
|
| 3351 |
Sum of Good Subsequences |
|
⚠⚠⚠ |
-
|
| 3352 |
Count K-Reducible Numbers Less Than N |
|
⚠⚠⚠ |
-
|
| 3354 |
Make Array Elements Equal to Zero |
|
⚠ |
-
|
| 3355 |
Zero Array Transformation I |
|
⚠⚠ |
-
|
| 3356 |
Zero Array Transformation II |
|
⚠⚠ |
-
|
| 3357 |
Minimize the Maximum Adjacent Element Difference |
|
⚠⚠⚠ |
-
|
| 3360 |
Stone Removal Game |
|
⚠ |
-
|
| 3361 |
Shift Distance Between Two Strings |
|
⚠⚠ |
-
|
| 3362 |
Zero Array Transformation III |
|
⚠⚠ |
-
|
| 3363 |
Find the Maximum Number of Fruits Collected |
|
⚠⚠⚠ |
-
|
| 3364 |
Minimum Positive Sum Subarray |
|
⚠ |
-
|
| 3365 |
Rearrange K Substrings to Form Target String |
|
⚠⚠ |
-
|
| 3366 |
Minimum Array Sum |
|
⚠⚠ |
-
|
| 3367 |
Maximize Sum of Weights after Edge Removals |
|
⚠⚠⚠ |
-
|
| 3370 |
Smallest Number With All Set Bits |
Bitwise operations |
⚠ |
Solution
|
| 3371 |
Identify the Largest Outlier in an Array |
|
⚠⚠ |
-
|
| 3372 |
Maximize the Number of Target Nodes After Connecting Trees I |
|
⚠⚠ |
-
|
| 3373 |
Maximize the Number of Target Nodes After Connecting Trees II |
|
⚠⚠⚠ |
-
|
| 3375 |
Minimum Operations to Make Array Values Equal to K |
|
⚠ |
-
|
| 3376 |
Minimum Time to Break Locks I |
|
⚠⚠ |
-
|
| 3377 |
Digit Operations to Make Two Integers Equal |
|
⚠⚠ |
-
|
| 3378 |
Count Connected Components in LCM Graph |
|
⚠⚠⚠ |
-
|
| 3379 |
Transformed Array |
|
⚠ |
-
|
| 3380 |
Maximum Area Rectangle With Point Constraints I |
|
⚠⚠ |
-
|
| 3381 |
Maximum Subarray Sum With Length Divisible by K |
|
⚠⚠ |
-
|
| 3382 |
Maximum Area Rectangle With Point Constraints II |
|
⚠⚠⚠ |
-
|
| 3386 |
Button with Longest Push Time |
|
⚠ |
-
|
| 3387 |
Maximize Amount After Two Days of Conversions |
|
⚠⚠ |
-
|
| 3388 |
Count Beautiful Splits in an Array |
|
⚠⚠ |
-
|
| 3389 |
Minimum Operations to Make Character Frequencies Equal |
|
⚠⚠⚠ |
-
|
| 3392 |
Count Subarrays of Length Three With a Condition |
|
⚠ |
-
|
| 3393 |
Count Paths With the Given XOR Value |
|
⚠⚠ |
-
|
| 3394 |
Check if Grid can be Cut into Sections |
|
⚠⚠ |
-
|
| 3395 |
Subsequences with a Unique Middle Mode I |
|
⚠⚠⚠ |
-
|
| 3396 |
Minimum Number of Operations to Make Elements in Array Distinct |
|
⚠ |
-
|
| 3397 |
Maximum Number of Distinct Elements After Operations |
|
⚠⚠ |
-
|
| 3398 |
Smallest Substring With Identical Characters I |
|
⚠⚠⚠ |
-
|
| 3399 |
Smallest Substring With Identical Characters II |
|
⚠⚠⚠ |
-
|
| 3402 |
Minimum Operations to Make Columns Strictly Increasing |
|
⚠ |
-
|
| 3403 |
Find the Lexicographically Largest String From the Box I |
|
⚠⚠ |
-
|
| 3404 |
Count Special Subsequences |
|
⚠⚠ |
-
|
| 3405 |
Count the Number of Arrays with K Matching Adjacent Elements |
|
⚠⚠⚠ |
-
|
| 3407 |
Substring Matching Pattern |
|
⚠ |
-
|
| 3408 |
Design Task Manager |
|
⚠⚠ |
-
|
| 3409 |
Longest Subsequence With Decreasing Adjacent Difference |
|
⚠⚠ |
-
|
| 3410 |
Maximize Subarray Sum After Removing All Occurrences of One Element |
|
⚠⚠⚠ |
-
|
| 3411 |
Maximum Subarray With Equal Products |
|
⚠ |
-
|
| 3412 |
Find Mirror Score of a String |
|
⚠⚠ |
-
|
| 3413 |
Maximum Coins From K Consecutive Bags |
|
⚠⚠ |
-
|
| 3414 |
Maximum Score of Non-overlapping Intervals |
|
⚠⚠⚠ |
-
|
| 3417 |
Zigzag Grid Traversal With Skip |
|
⚠ |
-
|
| 3418 |
Maximum Amount of Money Robot Can Earn |
|
⚠⚠ |
-
|
| 3419 |
Minimize the Maximum Edge Weight of Graph |
|
⚠⚠ |
-
|
| 3420 |
Count Non-Decreasing Subarrays After K Operations |
|
⚠⚠⚠ |
-
|
| 3423 |
Maximum Difference Between Adjacent Elements in a Circular Array |
|
⚠ |
-
|
| 3424 |
Minimum Cost to Make Arrays Identical |
|
⚠⚠ |
-
|
| 3425 |
Longest Special Path |
|
⚠⚠⚠ |
-
|
| 3426 |
Manhattan Distances of All Arrangements of Pieces |
|
⚠⚠⚠ |
-
|
| 3427 |
Sum of Variable Length Subarrays |
|
⚠ |
-
|
| 3428 |
Maximum and Minimum Sums of at Most Size K Subsequences |
|
⚠⚠ |
-
|
| 3429 |
Paint House IV |
|
⚠⚠ |
-
|
| 3430 |
Maximum and Minimum Sums of at Most Size K Subarrays |
|
⚠⚠⚠ |
-
|
| 3432 |
Count Partitions with Even Sum Difference |
|
⚠ |
-
|
| 3433 |
Count Mentions Per User |
|
⚠⚠ |
-
|
| 3434 |
Maximum Frequency After Subarray Operation |
|
⚠⚠ |
-
|
| 3435 |
Frequencies of Shortest Supersequences |
|
⚠⚠⚠ |
-
|
| 3438 |
Find Valid Pair of Adjacent Digits in String |
|
⚠ |
-
|
| 3439 |
Reschedule Meetings for Maximum Free Time I |
Sliding Window |
⚠⚠ |
Solution
|
| 3440 |
Reschedule Meetings for Maximum Free Time II |
|
⚠⚠ |
-
|
| 3441 |
Minimum Cost Good Caption |
|
⚠⚠⚠ |
-
|
| 3442 |
Maximum Difference Between Even and Odd Frequency I |
|
⚠ |
-
|
| 3443 |
Maximum Manhattan Distance After K Changes |
|
⚠⚠ |
-
|
| 3444 |
Minimum Increments for Target Multiples in an Array |
|
⚠⚠⚠ |
-
|
| 3445 |
Maximum Difference Between Even and Odd Frequency II |
|
⚠⚠⚠ |
-
|
| 3446 |
Sort Matrix by Diagonals |
|
⚠⚠ |
-
|
| 3447 |
Assign Elements to Groups with Constraints |
|
⚠⚠ |
-
|
| 3448 |
Count Substrings Divisible By Last Digit |
|
⚠⚠⚠ |
-
|
| 3449 |
Maximize the Minimum Game Score |
|
⚠⚠⚠ |
-
|
| 3452 |
Sum of Good Numbers |
|
⚠ |
-
|
| 3453 |
Separate Squares I |
|
⚠⚠ |
-
|
| 3454 |
Separate Squares II |
|
⚠⚠⚠ |
-
|
| 3455 |
Shortest Matching Substring |
|
⚠⚠⚠ |
-
|
| 3456 |
Find Special Substring of Length K |
|
⚠ |
-
|
| 3457 |
Eat Pizzas! |
|
⚠⚠ |
-
|
| 3458 |
Select K Disjoint Special Substrings |
|
⚠⚠ |
-
|
| 3459 |
Length of Longest V-Shaped Diagonal Segment |
|
⚠⚠⚠ |
-
|
| 3461 |
Check If Digits Are Equal in String After Operations I |
String |
⚠ |
Solution
|
| 3462 |
Maximum Sum With at Most K Elements |
|
⚠⚠ |
-
|
| 3463 |
Check If Digits Are Equal in String After Operations II |
|
⚠⚠⚠ |
-
|
| 3464 |
Maximize the Distance Between Points on a Square |
|
⚠⚠⚠ |
-
|
| 3467 |
Transform Array by Parity |
|
⚠ |
-
|
| 3468 |
Find the Number of Copy Arrays |
|
⚠⚠ |
-
|
| 3469 |
Find Minimum Cost to Remove Array Elements |
|
⚠⚠ |
-
|
| 3470 |
Permutations IV |
|
⚠⚠⚠ |
-
|
| 3471 |
Find the Largest Almost Missing Integer |
|
⚠ |
-
|
| 3472 |
Longest Palindromic Subsequence After at Most K Operations |
|
⚠⚠ |
-
|
| 3473 |
Sum of K Subarrays With Length at Least M |
|
⚠⚠ |
-
|
| 3474 |
Lexicographically Smallest Generated String |
|
⚠⚠⚠ |
-
|
| 3477 |
Fruits Into Baskets II |
|
⚠ |
-
|
| 3478 |
Choose K Elements With Maximum Sum |
|
⚠⚠ |
-
|
| 3479 |
Fruits Into Baskets III |
|
⚠⚠ |
-
|
| 3480 |
Maximize Subarrays After Removing One Conflicting Pair |
|
⚠⚠⚠ |
-
|
| 3483 |
Unique 3-Digit Even Numbers |
|
⚠ |
-
|
| 3484 |
Design Spreadsheet |
|
⚠⚠ |
-
|
| 3485 |
Longest Common Prefix of K Strings After Removal |
|
⚠⚠⚠ |
-
|
| 3486 |
Longest Special Path II |
|
⚠⚠⚠ |
-
|
| 3487 |
Maximum Unique Subarray Sum After Deletion |
|
⚠ |
-
|
| 3488 |
Closest Equal Element Queries |
|
⚠⚠ |
-
|
| 3489 |
Zero Array Transformation IV |
|
⚠⚠ |
-
|
| 3490 |
Count Beautiful Numbers |
|
⚠⚠⚠ |
-
|
| 3492 |
Maximum Containers on a Ship |
|
⚠ |
-
|
| 3493 |
Properties Graph |
|
⚠⚠ |
-
|
| 3494 |
Find the Minimum Amount of Time to Brew Potions |
|
⚠⚠ |
-
|
| 3495 |
Minimum Operations to Make Array Elements Zero |
|
⚠⚠⚠ |
-
|
| 3498 |
Reverse Degree of a String |
|
⚠ |
-
|
| 3499 |
Maximize Active Section with Trade I |
|
⚠⚠ |
-
|
| 3500 |
Minimum Cost to Divide Array Into Subarrays |
|
⚠⚠⚠ |
-
|
| 3501 |
Maximize Active Section with Trade II |
|
⚠⚠⚠ |
-
|
| 3502 |
Minimum Cost to Reach Every Position |
|
⚠ |
-
|
| 3503 |
Longest Palindrome After Substring Concatenation I |
|
⚠⚠ |
-
|
| 3504 |
Longest Palindrome After Substring Concatenation II |
|
⚠⚠⚠ |
-
|
| 3505 |
Minimum Operations to Make Elements Within K Subarrays Equal |
|
⚠⚠⚠ |
-
|
| 3507 |
Minimum Pair Removal to Sort Array I |
|
⚠ |
-
|
| 3508 |
Implement Router |
|
⚠⚠ |
-
|
| 3509 |
Maximum Product of Subsequences With an Alternating Sum Equal to K |
|
⚠⚠⚠ |
-
|
| 3510 |
Minimum Pair Removal to Sort Array II |
|
⚠⚠⚠ |
-
|
| 3512 |
Minimum Operations to Make Array Sum Divisible by K |
|
⚠ |
-
|
| 3513 |
Number of Unique XOR Triplets I |
|
⚠⚠ |
-
|
| 3514 |
Number of Unique XOR Triplets II |
|
⚠⚠ |
-
|
| 3515 |
Shortest Path in a Weighted Tree |
|
⚠⚠⚠ |
-
|
| 3516 |
Find Closest Person |
|
⚠ |
-
|
| 3517 |
Smallest Palindromic Rearrangement I |
|
⚠⚠ |
-
|
| 3518 |
Smallest Palindromic Rearrangement II |
|
⚠⚠⚠ |
-
|
| 3519 |
Count Numbers with Non-Decreasing Digits |
|
⚠⚠⚠ |
-
|
| 3522 |
Calculate Score After Performing Instructions |
|
⚠⚠ |
-
|
| 3523 |
Make Array Non-decreasing |
|
⚠⚠ |
-
|
| 3524 |
Find X Value of Array I |
|
⚠⚠ |
-
|
| 3525 |
Find X Value of Array II |
|
⚠⚠⚠ |
-
|
| 3527 |
Find the Most Common Response |
|
⚠⚠ |
-
|
| 3528 |
Unit Conversion I |
|
⚠⚠ |
-
|
| 3529 |
Count Cells in Overlapping Horizontal and Vertical Substrings |
|
⚠⚠ |
-
|
| 3530 |
Maximum Profit from Valid Topological Order in DAG |
|
⚠⚠⚠ |
-
|
| 3531 |
Count Covered Buildings |
|
⚠⚠ |
-
|
| 3532 |
Path Existence Queries in a Graph I |
|
⚠⚠ |
-
|
| 3533 |
Concatenated Divisibility |
|
⚠⚠⚠ |
-
|
| 3534 |
Path Existence Queries in a Graph II |
|
⚠⚠⚠ |
-
|
| 3536 |
Maximum Product of Two Digits |
|
⚠ |
-
|
| 3537 |
Fill a Special Grid |
|
⚠⚠ |
-
|
| 3538 |
Merge Operations for Minimum Travel Time |
|
⚠⚠⚠ |
-
|
| 3539 |
Find Sum of Array Product of Magical Sequences |
|
⚠⚠⚠ |
-
|
| 3541 |
Find Most Frequent Vowel and Consonant |
|
⚠ |
-
|
| 3542 |
Minimum Operations to Convert All Elements to Zero |
|
⚠⚠ |
-
|
| 3543 |
Maximum Weighted K-Edge Path |
|
⚠⚠ |
-
|
| 3544 |
Subtree Inversion Sum |
|
⚠⚠⚠ |
-
|
| 3545 |
Minimum Deletions for At Most K Distinct Characters |
|
⚠ |
-
|
| 3546 |
Equal Sum Grid Partition I |
|
⚠⚠ |
-
|
| 3547 |
Maximum Sum of Edge Values in a Graph |
|
⚠⚠⚠ |
-
|
| 3548 |
Equal Sum Grid Partition II |
|
⚠⚠⚠ |
-
|
| 3550 |
Smallest Index With Digit Sum Equal to Index |
|
⚠ |
-
|
| 3551 |
Minimum Swaps to Sort by Digit Sum |
|
⚠⚠ |
-
|
| 3552 |
Grid Teleportation Traversal |
|
⚠⚠ |
-
|
| 3553 |
Minimum Weighted Subgraph With the Required Paths II |
|
⚠⚠⚠ |
-
|
| 3556 |
Sum of Largest Prime Substrings |
|
⚠⚠ |
-
|
| 3557 |
Find Maximum Number of Non Intersecting Substrings |
|
⚠⚠ |
-
|
| 3558 |
Number of Ways to Assign Edge Weights I |
|
⚠⚠ |
-
|
| 3559 |
Number of Ways to Assign Edge Weights II |
|
⚠⚠⚠ |
-
|
| 3560 |
Find Minimum Log Transportation Cost |
|
⚠ |
-
|
| 3561 |
Resulting String After Adjacent Removals |
|
⚠⚠ |
-
|
| 3562 |
Maximum Profit from Trading Stocks with Discounts |
|
⚠⚠⚠ |
-
|
| 3563 |
Lexicographically Smallest String After Adjacent Removals |
|
⚠⚠⚠ |
-
|
| 3566 |
Partition Array into Two Equal Product Subsets |
|
⚠⚠ |
-
|
| 3567 |
Minimum Absolute Difference in Sliding Submatrix |
|
⚠⚠ |
-
|
| 3568 |
Minimum Moves to Clean the Classroom |
|
⚠⚠ |
-
|
| 3569 |
Maximize Count of Distinct Primes After Split |
|
⚠⚠⚠ |
-
|
| 3572 |
Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values |
|
⚠⚠ |
-
|
| 3573 |
Best Time to Buy and Sell Stock V |
|
⚠⚠ |
-
|
| 3574 |
Maximize Subarray GCD Score |
|
⚠⚠⚠ |
-
|
| 3575 |
Maximum Good Subtree Score |
|
⚠⚠⚠ |
-
|
| 3576 |
Transform Array to All Equal Elements |
|
⚠⚠ |
-
|
| 3577 |
Count the Number of Computer Unlocking Permutations |
|
⚠⚠ |
-
|
| 3578 |
Count Partitions With Max-Min Difference at Most K |
|
⚠⚠ |
-
|
| 3579 |
Minimum Steps to Convert String with Operations |
|
⚠⚠⚠ |
-
|
| 3582 |
Generate Tag for Video Caption |
|
⚠ |
-
|
| 3583 |
Count Special Triplets |
|
⚠⚠ |
-
|
| 3584 |
Maximum Product of First and Last Elements of a Subsequence |
|
⚠⚠ |
-
|
| 3585 |
Find Weighted Median Node in Tree |
|
⚠⚠⚠ |
-
|
| 3587 |
Minimum Adjacent Swaps to Alternate Parity |
|
⚠⚠ |
-
|
| 3588 |
Find Maximum Area of a Triangle |
|
⚠⚠ |
-
|
| 3589 |
Count Prime-Gap Balanced Subarrays |
|
⚠⚠ |
-
|
| 3590 |
Kth Smallest Path XOR Sum |
|
⚠⚠⚠ |
-
|
| 3591 |
Check if Any Element Has Prime Frequency |
|
⚠ |
-
|
| 3592 |
Inverse Coin Change |
|
⚠⚠ |
-
|
| 3593 |
Minimum Increments to Equalize Leaf Paths |
|
⚠⚠ |
-
|
| 3594 |
Minimum Time to Transport All Individuals |
|
⚠⚠⚠ |
-
|
| 3597 |
Partition String |
|
⚠⚠ |
-
|
| 3598 |
Longest Common Prefix Between Adjacent Strings After Removals |
|
⚠⚠ |
-
|
| 3599 |
Partition Array to Minimize XOR |
|
⚠⚠ |
-
|
| 3600 |
Maximize Spanning Tree Stability with Upgrades |
|
⚠⚠⚠ |
-
|
| 3602 |
Hexadecimal and Hexatrigesimal Conversion |
|
⚠ |
-
|
| 3603 |
Minimum Cost Path with Alternating Directions II |
|
⚠⚠ |
-
|
| 3604 |
Minimum Time to Reach Destination in Directed Graph |
|
⚠⚠ |
-
|
| 3605 |
Minimum Stability Factor of Array |
|
⚠⚠⚠ |
-
|
| 3606 |
Coupon Code Validator |
|
⚠ |
-
|
| 3607 |
Power Grid Maintenance |
|
⚠⚠ |
-
|
| 3608 |
Minimum Time for K Connected Components |
|
⚠⚠ |
-
|
| 3609 |
Minimum Moves to Reach Target in Grid |
|
⚠⚠⚠ |
-
|
| 3612 |
Process String with Special Operations I |
|
⚠⚠ |
-
|
| 3613 |
Minimize Maximum Component Cost |
|
⚠⚠ |
-
|
| 3614 |
Process String with Special Operations II |
|
⚠⚠⚠ |
-
|
| 3615 |
Longest Palindromic Path in Graph |
|
⚠⚠⚠ |
-
|
| 3618 |
Split Array by Prime Indices |
|
⚠⚠ |
-
|
| 3619 |
Count Islands With Total Value Divisible by K |
DFS |
⚠⚠ |
Solution
|
| 3620 |
Network Recovery Pathways |
|
⚠⚠⚠ |
-
|
| 3621 |
Number of Integers With Popcount-Depth Equal to K I |
|
⚠⚠⚠ |
-
|
| 3622 |
Check Divisibility by Digit Sum and Product |
|
⚠ |
-
|
| 3623 |
Count Number of Trapezoids I |
|
⚠⚠ |
-
|
| 3624 |
Number of Integers With Popcount-Depth Equal to K II |
|
⚠⚠⚠ |
-
|
| 3625 |
Count Number of Trapezoids II |
|
⚠⚠⚠ |
-
|
| 3627 |
Maximum Median Sum of Subsequences of Size 3 |
|
⚠⚠ |
-
|
| 3628 |
Maximum Number of Subsequences After One Inserting |
|
⚠⚠ |
-
|
| 3629 |
Minimum Jumps to Reach End via Prime Teleportation |
|
⚠⚠ |
-
|
| 3630 |
Partition Array for Maximum XOR and AND |
|
⚠⚠⚠ |
-
|
| 3633 |
Earliest Finish Time for Land and Water Rides I |
|
⚠ |
-
|
| 3634 |
Minimum Removals to Balance Array |
Sliding Window |
⚠⚠ |
Solution
|
| 3635 |
Earliest Finish Time for Land and Water Rides II |
|
⚠⚠ |
-
|
| 3636 |
Threshold Majority Queries |
|
⚠⚠⚠ |
-
|
| 3637 |
Trionic Array I |
|
⚠ |
-
|
| 3638 |
Maximum Balanced Shipments |
|
⚠⚠ |
-
|
| 3639 |
Minimum Time to Activate String |
|
⚠⚠ |
-
|
| 3640 |
Trionic Array II |
|
⚠⚠⚠ |
-
|
| 3643 |
Flip Square Submatrix Vertically |
|
⚠ |
Solution
|
| 3644 |
Maximum K to Sort a Permutation |
|
⚠⚠ |
-
|
| 3645 |
Maximum Total from Optimal Activation Order |
|
⚠⚠ |
-
|
| 3646 |
Next Special Palindrome Number |
|
⚠⚠⚠ |
-
|
| 3648 |
Minimum Sensors to Cover Grid |
|
⚠⚠ |
-
|
| 3649 |
Number of Perfect Pairs |
|
⚠⚠ |
-
|
| 3650 |
Minimum Cost Path with Edge Reversals |
|
⚠⚠ |
-
|
| 3651 |
Minimum Cost Path with Teleportations |
|
⚠⚠⚠ |
-
|
| 3652 |
Best Time to Buy and Sell Stock using Strategy |
Sliding Window |
⚠⚠ |
Solution
|
| 3653 |
XOR After Range Multiplication Queries I |
|
⚠⚠ |
-
|
| 3654 |
Minimum Sum After Divisible Sum Deletions |
|
⚠⚠ |
-
|
| 3655 |
XOR After Range Multiplication Queries II |
|
⚠⚠⚠ |
-
|
| 3658 |
GCD of Odd and Even Sums |
|
⚠ |
-
|
| 3659 |
Partition Array Into K-Distinct Groups |
|
⚠⚠ |
-
|
| 3660 |
Jump Game IX |
|
⚠⚠ |
-
|
| 3661 |
Maximum Walls Destroyed by Robots |
|
⚠⚠⚠ |
-
|
| 3663 |
Find The Least Frequent Digit |
|
⚠ |
-
|
| 3664 |
Two-Letter Card Game |
|
⚠⚠ |
-
|
| 3665 |
Twisted Mirror Path Count |
|
⚠⚠ |
-
|
| 3666 |
Minimum Operations to Equalize Binary String |
|
⚠⚠⚠ |
-
|
| 3668 |
Restore Finishing Order |
|
⚠ |
-
|
| 3669 |
Balanced K-Factor Decomposition |
|
⚠⚠ |
-
|
| 3670 |
Maximum Product of Two Integers With No Common Bits |
|
⚠⚠ |
-
|
| 3671 |
Sum of Beautiful Subsequences |
|
⚠⚠⚠ |
-
|
| 3674 |
Minimum Operations to Equalize Array |
|
⚠ |
-
|
| 3675 |
Minimum Operations to Transform String |
|
⚠⚠ |
-
|
| 3676 |
Count Bowl Subarrays |
|
⚠⚠ |
-
|
| 3677 |
Count Binary Palindromic Numbers |
|
⚠⚠⚠ |
-
|
| 3678 |
Smallest Absent Positive Greater Than Average |
|
⚠ |
-
|
| 3679 |
Minimum Discards to Balance Inventory |
Sliding Window
Dict |
⚠⚠ |
Solution
|
| 3680 |
Generate Schedule |
|
⚠⚠ |
-
|
| 3681 |
Maximum XOR of Subsequences |
|
⚠⚠⚠ |
-
|
| 3683 |
Earliest Time to Finish One Task |
|
⚠ |
-
|
| 3684 |
Maximize Sum of At Most K Distinct Elements |
|
⚠ |
-
|
| 3685 |
Subsequence Sum After Capping Elements |
|
⚠⚠ |
-
|
| 3686 |
Number of Stable Subsequences |
|
⚠⚠⚠ |
-
|
| 3688 |
Bitwise OR of Even Numbers in an Array |
|
⚠ |
-
|
| 3689 |
Maximum Total Subarray Value I |
|
⚠⚠ |
-
|
| 3690 |
Split and Merge Array Transformation |
|
⚠⚠ |
-
|
| 3691 |
Maximum Total Subarray Value II |
|
⚠⚠⚠ |
-
|
| 3692 |
Majority Frequency Characters |
|
⚠ |
-
|
| 3693 |
Climbing Stairs II |
|
⚠⚠ |
-
|
| 3694 |
Distinct Points Reachable After Substring Removal |
Sliding Window
Dict |
⚠⚠ |
Solution
|
| 3695 |
Maximize Alternating Sum Using Swaps |
|
⚠⚠⚠ |
-
|
| 3697 |
Compute Decimal Representation |
|
⚠ |
-
|
| 3698 |
Split Array With Minimum Difference |
|
⚠⚠ |
-
|
| 3699 |
Number of ZigZag Arrays I |
|
⚠⚠⚠ |
-
|
| 3700 |
Number of ZigZag Arrays II |
|
⚠⚠⚠ |
-
|
| 3701 |
Compute Alternating Sum |
|
⚠ |
-
|
| 3702 |
Longest Subsequence With Non-Zero Bitwise XOR |
Bitwise Operation |
⚠⚠ |
Solution
|
| 3703 |
Remove K-Balanced Substrings |
|
⚠⚠ |
-
|
| 3704 |
Count No-Zero Pairs That Sum to N |
|
⚠⚠⚠ |
-
|
| 3707 |
Equal Score Substrings |
|
⚠ |
-
|
| 3708 |
Longest Fibonacci Subarray |
|
⚠⚠ |
-
|
| 3709 |
Design Exam Scores Tracker |
|
⚠⚠ |
-
|
| 3710 |
Maximum Partition Factor |
|
⚠⚠⚠ |
-
|
| 3712 |
Sum of Elements With Frequency Divisible by K |
|
⚠ |
-
|
| 3713 |
Longest Balanced Substring I |
|
⚠⚠ |
-
|
| 3714 |
Longest Balanced Substring II |
|
⚠⚠ |
-
|
| 3715 |
Sum of Perfect Square Ancestors |
|
⚠⚠⚠ |
-
|
| 3718 |
Smallest Missing Multiple of K |
|
⚠ |
-
|
| 3719 |
Longest Balanced Subarray I |
|
⚠⚠ |
-
|
| 3720 |
Lexicographically Smallest Permutation Greater Than Target |
|
⚠⚠ |
-
|
| 3721 |
Longest Balanced Subarray II |
|
⚠⚠⚠ |
-
|
| 3722 |
Lexicographically Smallest String After Reverse |
|
⚠⚠ |
-
|
| 3723 |
Maximize Sum of Squares of Digits |
|
⚠⚠ |
-
|
| 3724 |
Minimum Operations to Transform Array |
|
⚠⚠ |
-
|
| 3725 |
Count Ways to Choose Coprime Integers from Rows |
|
⚠⚠⚠ |
-
|
| 3726 |
Remove Zeros in Decimal Representation |
|
⚠ |
-
|
| 3727 |
Maximum Alternating Sum of Squares |
|
⚠⚠ |
-
|
| 3728 |
Stable Subarrays With Equal Boundary and Interior Sum |
|
⚠⚠ |
-
|
| 3729 |
Count Distinct Subarrays Divisible by K in Sorted Array |
|
⚠⚠⚠ |
-
|
| 3731 |
Find Missing Elements |
|
⚠ |
-
|
| 3732 |
Maximum Product of Three Elements After One Replacement |
|
⚠⚠ |
-
|
| 3733 |
Minimum Time to Complete All Deliveries |
|
⚠⚠ |
-
|
| 3734 |
Lexicographically Smallest Palindromic Permutation Greater Than Target |
|
⚠⚠⚠ |
-
|
| 3736 |
Minimum Moves to Equal Array Elements III |
|
⚠ |
-
|
| 3737 |
Count Subarrays With Majority Element I |
|
⚠⚠ |
-
|
| 3738 |
Longest Non-Decreasing Subarray After Replacing at Most One Element |
|
⚠⚠ |
-
|
| 3739 |
Count Subarrays With Majority Element II |
|
⚠⚠⚠ |
-
|
| 3740 |
Minimum Distance Between Three Equal Elements I |
|
⚠ |
-
|
| 3741 |
Minimum Distance Between Three Equal Elements II |
|
⚠⚠ |
-
|
| 3742 |
Maximum Path Score in a Grid |
|
⚠⚠ |
-
|
| 3743 |
Maximize Cyclic Partition Score |
|
⚠⚠⚠ |
-
|
| 3745 |
Maximize Expression of Three Elements |
|
⚠ |
-
|
| 3746 |
Minimum String Length After Balanced Removals |
|
⚠⚠ |
-
|
| 3747 |
Count Distinct Integers After Removing Zeros |
|
⚠⚠ |
-
|
| 3748 |
Count Stable Subarrays |
|
⚠⚠⚠ |
-
|
| 3750 |
Minimum Number of Flips to Reverse Binary String |
|
⚠ |
-
|
| 3751 |
Total Waviness of Numbers in Range I |
|
⚠⚠ |
-
|
| 3752 |
Lexicographically Smallest Negated Permutation that Sums to Target |
|
⚠⚠ |
-
|
| 3753 |
Total Waviness of Numbers in Range II |
|
⚠⚠⚠ |
-
|
| 3754 |
Concatenate Non-Zero Digits and Multiply by Sum I |
|
⚠ |
-
|
| 3755 |
Find Maximum Balanced XOR Subarray Length |
|
⚠⚠ |
-
|
| 3756 |
Concatenate Non-Zero Digits and Multiply by Sum II |
|
⚠⚠ |
-
|
| 3757 |
Number of Effective Subsequences |
|
⚠⚠⚠ |
-
|
| 3759 |
Count Elements With at Least K Greater Values |
|
⚠⚠ |
-
|
| 3760 |
Maximum Substrings With Distinct Start |
|
⚠⚠ |
-
|
| 3761 |
Minimum Absolute Distance Between Mirror Pairs |
|
⚠⚠ |
-
|
| 3762 |
Minimum Operations to Equalize Subarrays |
|
⚠⚠⚠ |
-
|
| 3765 |
Complete Prime Number |
|
⚠⚠ |
-
|
| 3766 |
Minimum Operations to Make Binary Palindrome |
|
⚠⚠ |
-
|
| 3767 |
Maximize Points After Choosing K Tasks |
|
⚠⚠ |
-
|
| 3768 |
Minimum Inversion Count in Subarrays of Fixed Length |
|
⚠⚠⚠ |
-
|
| 3769 |
Sort Integers by Binary Reflection |
|
⚠ |
-
|
| 3770 |
Largest Prime from Consecutive Prime Sum |
|
⚠⚠ |
-
|
| 3771 |
Total Score of Dungeon Runs |
|
⚠⚠ |
-
|
| 3772 |
Maximum Subgraph Score in a Tree |
|
⚠⚠⚠ |
-
|
| 3774 |
Absolute Difference Between Maximum and Minimum K Elements |
|
⚠ |
-
|
| 3775 |
Reverse Words With Same Vowel Count |
|
⚠⚠ |
-
|
| 3776 |
Minimum Moves to Balance Circular Array |
|
⚠⚠ |
-
|
| 3777 |
Minimum Deletions to Make Alternating Substring |
|
⚠⚠⚠ |
-
|
| 3779 |
Minimum Number of Operations to Have Distinct Elements |
|
⚠⚠ |
-
|
| 3780 |
Maximum Sum of Three Numbers Divisible by Three |
|
⚠⚠ |
-
|
| 3781 |
Maximum Score After Binary Swaps |
|
⚠⚠ |
-
|
| 3782 |
Last Remaining Integer After Alternating Deletion Operations |
|
⚠⚠⚠ |
-
|
| 3783 |
Mirror Distance of an Integer |
|
⚠ |
-
|
| 3784 |
Minimum Deletion Cost to Make All Characters Equal |
|
⚠⚠ |
-
|
| 3785 |
Minimum Swaps to Avoid Forbidden Values |
|
⚠⚠⚠ |
-
|
| 3786 |
Total Sum of Interaction Cost in Tree Groups |
|
⚠⚠⚠ |
-
|
| 3788 |
Maximum Score of a Split |
|
⚠⚠ |
-
|
| 3789 |
Minimum Cost to Acquire Required Items |
|
⚠⚠ |
-
|
| 3790 |
Smallest All-Ones Multiple |
|
⚠⚠ |
-
|
| 3791 |
Number of Balanced Integers in a Range |
|
⚠⚠⚠ |
-
|
| 3794 |
Reverse String Prefix |
|
⚠ |
-
|
| 3795 |
Minimum Subarray Length With Distinct Sum At Least K |
|
⚠⚠ |
-
|
| 3796 |
Find Maximum Value in a Constrained Sequence |
|
⚠⚠ |
-
|
| 3797 |
Count Routes to Climb a Rectangular Grid |
|
⚠⚠⚠ |
-
|
| 3798 |
Largest Even Number |
|
⚠ |
-
|
| 3799 |
Word Squares II |
|
⚠⚠ |
-
|
| 3800 |
Minimum Cost to Make Two Binary Strings Equal |
|
⚠⚠ |
-
|
| 3801 |
Minimum Cost to Merge Sorted Lists |
|
⚠⚠⚠ |
-
|
| 3803 |
Count Residue Prefixes |
|
⚠ |
-
|
| 3804 |
Number of Centered Subarrays |
|
⚠⚠ |
-
|
| 3805 |
Count Caesar Cipher Pairs |
|
⚠⚠ |
-
|
| 3806 |
Maximum Bitwise AND After Increment Operations |
|
⚠⚠⚠ |
-
|
| 3809 |
Best Reachable Tower |
|
⚠⚠ |
-
|
| 3810 |
Minimum Operations to Reach Target Array |
|
⚠⚠ |
-
|
| 3811 |
Number of Alternating XOR Partitions |
|
⚠⚠ |
-
|
| 3812 |
Minimum Edge Toggles on a Tree |
|
⚠⚠⚠ |
-
|
| 3813 |
Vowel-Consonant Score |
|
⚠ |
-
|
| 3814 |
Maximum Capacity Within Budget |
|
⚠⚠ |
-
|
| 3815 |
Design Auction System |
|
⚠⚠ |
-
|
| 3816 |
Lexicographically Smallest String After Deleting Duplicate Characters |
|
⚠⚠⚠ |
-
|
| 3818 |
Minimum Prefix Removal to Make Array Strictly Increasing |
|
⚠⚠ |
-
|
| 3819 |
Rotate Non Negative Elements |
|
⚠⚠ |
-
|
| 3820 |
Pythagorean Distance Nodes in a Tree |
|
⚠⚠ |
-
|
| 3821 |
Find Nth Smallest Integer With K One Bits |
|
⚠⚠⚠ |
-
|
| 3823 |
Reverse Letters Then Special Characters in a String |
|
⚠ |
-
|
| 3824 |
Minimum K to Reduce Array Within Limit |
|
⚠⚠ |
-
|
| 3825 |
Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND |
|
⚠⚠ |
-
|
| 3826 |
Minimum Partition Score |
|
⚠⚠⚠ |
-
|
| 3827 |
Count Monobit Integers |
|
⚠ |
-
|
| 3828 |
Final Element After Subarray Deletions |
|
⚠⚠ |
-
|
| 3829 |
Design Ride Sharing System |
|
⚠⚠ |
-
|
| 3830 |
Longest Alternating Subarray After Removing At Most One Element |
|
⚠⚠⚠ |
-
|
| 3833 |
Count Dominant Indices |
|
⚠ |
-
|
| 3834 |
Merge Adjacent Equal Elements |
|
⚠⚠ |
-
|
| 3835 |
Count Subarrays With Cost Less Than or Equal to K |
|
⚠⚠ |
-
|
| 3836 |
Maximum Score Using Exactly K Pairs |
|
⚠⚠⚠ |
-
|
| 3838 |
Weighted Word Mapping |
|
⚠ |
-
|
| 3839 |
Number of Prefix Connected Groups |
|
⚠⚠ |
-
|
| 3840 |
House Robber V |
|
⚠⚠ |
-
|
| 3841 |
Palindromic Path Queries in a Tree |
|
⚠⚠⚠ |
-
|
| 3842 |
Toggle Light Bulbs |
|
⚠ |
-
|
| 3843 |
First Element with Unique Frequency |
|
⚠⚠ |
-
|
| 3844 |
Longest Almost-Palindromic Substring |
|
⚠⚠ |
-
|
| 3845 |
Maximum Subarray XOR with Bounded Range |
|
⚠⚠⚠ |
-
|
| 3847 |
Find the Score Difference in a Game |
|
⚠⚠ |
-
|
| 3848 |
Check Digitorial Permutation |
|
⚠⚠ |
-
|
| 3849 |
Maximum Bitwise XOR After Rearrangement |
|
⚠⚠ |
-
|
| 3850 |
Count Sequences to K |
|
⚠⚠⚠ |
-
|
| 3852 |
Smallest Pair With Different Frequencies |
|
⚠ |
-
|
| 3853 |
Merge Close Characters |
|
⚠⚠ |
-
|
| 3854 |
Minimum Operations to Make Array Parity Alternating |
|
⚠⚠ |
-
|
| 3855 |
Sum of K-Digit Numbers in a Range |
|
⚠⚠⚠ |
-
|
| 3856 |
Trim Trailing Vowels |
|
⚠ |
-
|
| 3857 |
Minimum Cost to Split into Ones |
|
⚠⚠ |
-
|
| 3858 |
Minimum Bitwise OR From Grid |
|
⚠⚠ |
-
|
| 3859 |
Count Subarrays With K Distinct Integers |
|
⚠⚠⚠ |
-
|
| 3861 |
Minimum Capacity Box |
|
⚠ |
Solution
|
| 3862 |
Find the Smallest Balanced Index |
Prefix Sum |
⚠⚠ |
Solution
|
| 3863 |
Minimum Operations to Sort a String |
String |
⚠⚠ |
Solution
|
| 3864 |
Minimum Cost to Partition a Binary String |
Prefix Sum
DFS |
⚠⚠⚠ |
Solution
|
| 3866 |
First Unique Even Element |
|
⚠ |
Solution
|
| 3867 |
Sum of GCD of Formed Pairs |
Math |
⚠⚠ |
Solution
|
| 3868 |
Minimum Cost to Equalize Arrays Using Swaps |
|
⚠⚠ |
Solution
|
| 3869 |
Count Fancy Numbers in a Range |
|
⚠⚠⚠ |
-
|
| 3870 |
Count Commas in Range |
|
⚠ |
-
|
| 3871 |
Count Commas in Range II |
|
⚠⚠ |
-
|
| 3872 |
Longest Arithmetic Sequence After Changing At Most One Element |
|
⚠⚠ |
-
|
| 3873 |
Maximum Points Activated with One Addition |
|
⚠⚠⚠ |
-
|
| 3875 |
Construct Uniform Parity Array I |
Math |
⚠ |
Solution
|
| 3876 |
Construct Uniform Parity Array II |
Math |
⚠⚠ |
Solution
|
| 3877 |
Minimum Removals to Achieve Target XOR |
Dynamic Programming |
⚠⚠ |
Solution
|
| 3878 |
Count Good Subarrays |
|
⚠⚠⚠ |
-
|
| 3880 |
Minimum Absolute Difference Between Two Values |
|
⚠ |
-
|
| 3881 |
Direction Assignments with Exactly K Visible People |
|
⚠⚠ |
-
|
| 3882 |
Minimum XOR Path in a Grid |
|
⚠⚠ |
-
|
| 3883 |
Count Non Decreasing Arrays With Given Digit Sums |
|
⚠⚠⚠ |
-
|
| 3884 |
First Matching Character From Both Ends |
String |
⚠ |
Solution
|
| 3885 |
Design Event Manager |
Heap
Hash Map |
⚠⚠ |
Solution
|
| 3886 |
Sum of Sortable Integers |
|
⚠⚠⚠ |
Solution
|
| 3887 |
Incremental Even-Weighted Cycle Queries |
|
⚠⚠⚠ |
-
|
