0001 |
Easy |
Two Sum |
0002 |
Medium |
Add Two Numbers |
0003 |
Medium |
Longest Substring Without Repeating Characters |
0004 |
Hard |
Median of Two Sorted Arrays |
0005 |
Medium |
Longest Palindromic Substring |
0006 |
Medium |
Zigzag Conversion |
0007 |
Medium |
Reverse Integer |
0008 |
Medium |
String to Integer (atoi) |
0009 |
Easy |
Palindrome Number |
0011 |
Medium |
Container With Most Water |
0012 |
Medium |
Integer to Roman |
0013 |
Easy |
Roman to Integer |
0014 |
Easy |
Longest Common Prefix |
0015 |
Medium |
3Sum |
0016 |
Medium |
3Sum Closest |
0017 |
Medium |
Letter Combinations of a Phone Number |
0018 |
Medium |
4Sum |
0019 |
Medium |
Remove Nth Node From the End of List |
0020 |
Easy |
Valid Parentheses |
0021 |
Easy |
Merge Two Sorted Lists |
0022 |
Medium |
Generate Parentheses |
0023 |
Hard |
Merge k Sorted Lists |
0024 |
Medium |
Swap Nodes in Pairs |
0025 |
Hard |
Reverse Nodes in k-Group |
0026 |
Easy |
Remove Duplicates from Sorted Array |
0027 |
Easy |
Remove Element |
0028 |
Medium |
Find the Index of the First Occurrence in a String |
0029 |
Medium |
Divide Two Integers |
0030 |
Hard |
Substring with Concatenation of All Words |
0031 |
Medium |
Next Permutation |
0032 |
Hard |
Longest Valid Parentheses |
0033 |
Medium |
Search in Rotated Sorted Array |
0034 |
Medium |
Find First and Last Position of Element in Sorted Array |
0035 |
Easy |
Search Insert Position |
0036 |
Medium |
Valid Sudoku |
0037 |
Hard |
Sudoku Solver |
0038 |
Medium |
Count and Say |
0039 |
Medium |
Combination Sum |
0040 |
Medium |
Combination Sum II |
0041 |
Hard |
First Missing Positive |
0042 |
Medium |
Trapping Rain Water |
0043 |
Medium |
Multiply Strings |
0044 |
Hard |
Wildcard Matching |
0045 |
Medium |
Jump Game II |
0046 |
Medium |
Permutations |
0047 |
Medium |
Permutations II |
0048 |
Medium |
Rotate Image |
0049 |
Medium |
Group Anagrams |
0050 |
Medium |
Pow(x, n) |
0051 |
Hard |
N-Queens |
0052 |
Hard |
N-Queens II |
0053 |
Medium |
Maximum Subarray |
0054 |
Medium |
Spiral Matrix |
0055 |
Medium |
Jump Game |
0056 |
Medium |
Merge Intervals |
0057 |
Medium |
Insert Interval |
0058 |
Easy |
Length of Last Word |
0059 |
Medium |
Spiral Matrix II |
0060 |
Hard |
Permutation Sequence |
0061 |
Medium |
Rotate List |
0062 |
Medium |
Unique Paths |
0063 |
Medium |
Unique Paths II |
0064 |
Medium |
Minimum Path Sum |
0065 |
Hard |
Valid Number |
0066 |
Easy |
Plus One |
0067 |
Easy |
Add Binary |
0068 |
Hard |
Text Justification |
0069 |
Easy |
Sqrt(x) |
0070 |
Easy |
Climbing Stairs |
0071 |
Medium |
Simplify Path |
0072 |
Hard |
Edit Distance |
0073 |
Medium |
Set Matrix Zeroes |
0074 |
Medium |
Search a 2D Matrix |
0075 |
Medium |
Sort Colors |
0076 |
Hard |
Minimum Window Substring |
0077 |
Medium |
Combinations |
0078 |
Medium |
Subsets |
0079 |
Medium |
Word Search |
0080 |
Medium |
Remove Duplicates from Sorted Array II |
0081 |
Medium |
Search in Rotated Sorted Array II |
0082 |
Medium |
Remove Duplicates from Sorted List II |
0083 |
Easy |
Remove Duplicates from Sorted List |
0084 |
Hard |
Largest Rectangle in Histogram |
0085 |
Hard |
Maximal Rectangle |
0086 |
Medium |
Partition List |
0087 |
Hard |
Scramble String |
0088 |
Easy |
Merge Sorted Array |
0089 |
Medium |
Gray Code |
0090 |
Medium |
Subsets II |
0091 |
Medium |
Decode Ways |
0092 |
Medium |
Reverse Linked List II |
0093 |
Medium |
Restore IP Addresses |
0094 |
Easy |
Binary Tree Inorder Traversal |
0095 |
Medium |
Unique Binary Search Trees II |
0096 |
Medium |
Unique Binary Search Trees |
0097 |
Medium |
Interleaving String |
0098 |
Medium |
Validate Binary Search Tree |
0099 |
Medium |
Recover Binary Search Tree |
0100 |
Easy |
Same Tree |
0101 |
Easy |
Symmetric Tree |
0102 |
Medium |
Binary Tree Level Order Traversal |
0103 |
Medium |
Binary Tree Zigzag Level Order Traversal |
0104 |
Easy |
Maximum Depth of Binary Tree |
0105 |
Medium |
Construct Binary Tree from Preorder and Inorder Traversal |
0106 |
Medium |
Construct Binary Tree from Inorder and Postorder Traversal |
0107 |
Medium |
Binary Tree Level Order Traversal II |
0108 |
Easy |
Convert Sorted Array to Binary Search Tree |
0109 |
Medium |
Convert Sorted List to Binary Search Tree |
0110 |
Easy |
Balanced Binary Tree |
0111 |
Easy |
Minimum Depth of Binary Tree |
0112 |
Easy |
Path Sum |
0113 |
Medium |
Path Sum II |
0114 |
Medium |
Flatten Binary Tree to Linked List |
0115 |
Hard |
Distinct Subsequences |
0116 |
Medium |
Populating Next Right Pointers in Each Node |
0117 |
Medium |
Populating Next Right Pointers in Each Node II |
0118 |
Easy |
Pascal's Triangle |
0119 |
Easy |
Pascal's Triangle II |
0120 |
Medium |
Triangle |
0121 |
Easy |
Best Time to Buy and Sell Stock |
0122 |
Medium |
Best Time to Buy and Sell Stock II |
0123 |
Hard |
Best Time to Buy and Sell Stock III |
0124 |
Hard |
Binary Tree Maximum Path Sum |
0125 |
Easy |
Valid Palindrome |
0126 |
Hard |
Word Ladder II |
0127 |
Hard |
Word Ladder |
0128 |
Medium |
Longest Consecutive Sequence |
0129 |
Medium |
Sum Root to Leaf Numbers |
0130 |
Medium |
Surrounded Regions |
0131 |
Medium |
Palindrome Partitioning |
0132 |
Hard |
Palindrome Partitioning II |
0133 |
Medium |
Clone Graph |
0134 |
Medium |
Gas Station |
0135 |
Hard |
Candy |
0136 |
Easy |
Single Number |
0137 |
Medium |
Single Number II |
0138 |
Medium |
Copy List with Random Pointer |
0139 |
Medium |
Word Break |
0140 |
Hard |
Word Break II |
0141 |
Easy |
Linked List Cycle |
0142 |
Medium |
Linked List Cycle II |
0143 |
Medium |
Reorder List |
0144 |
Medium |
Binary Tree Preorder Traversal |
0145 |
Easy |
Binary Tree Postorder Traversal |
0146 |
Medium |
LRU Cache |
0147 |
Medium |
Insertion Sort List |
0148 |
Medium |
Sort List |
0149 |
Hard |
Max Points on a Line |
0150 |
Medium |
Evaluate Reverse Polish Notation |
0151 |
Medium |
Reverse Words in a String |
0152 |
Medium |
Maximum Product Subarray |
0153 |
Medium |
Find Minimum in Rotated Sorted Array |
0154 |
Hard |
Find Minimum in Rotated Sorted Array II |
0155 |
Medium |
Min Stack |
0160 |
Easy |
Intersection of Two Linked Lists |
0162 |
Medium |
Find Peak Element |
0164 |
Hard |
Maximum Gap |
0165 |
Medium |
Compare Version Numbers |
0166 |
Medium |
Fraction to Recurring Decimal |
0167 |
Medium |
Two Sum II - Input Array Is Sorted |
0168 |
Easy |
Excel Sheet Column Title |
0169 |
Easy |
Majority Element |
0171 |
Easy |
Excel Sheet Column Number |
0172 |
Medium |
Factorial Trailing Zeroes |
0173 |
Medium |
Binary Search Tree Iterator |
0174 |
Hard |
Dungeon Game |
0175 |
Easy |
Combine Two Tables |
0176 |
Medium |
Second Highest Salary |
0177 |
Medium |
Nth Highest Salary |
0178 |
Medium |
Rank Scores |
0179 |
Medium |
Largest Number |
0180 |
Medium |
Consecutive Numbers |
0181 |
Easy |
Employees Earning More Than Their Managers |
0182 |
Easy |
Duplicate Emails |
0183 |
Easy |
Customers Who Never Order |
0184 |
Medium |
Department Highest Salary |
0185 |
Hard |
Department Top Three Salaries |
0187 |
Medium |
Repeated DNA Sequences |
0188 |
Hard |
Best Time to Buy and Sell Stock IV |
0189 |
Medium |
Rotate Array |
0190 |
Easy |
Reverse Bits |
0191 |
Easy |
Number of 1 Bits |
0192 |
Medium |
Word Frequency |
0193 |
Easy |
Valid Phone Numbers |
0194 |
Medium |
Transpose File |
0195 |
Easy |
Tenth Line |
0196 |
Easy |
Delete Duplicate Emails |
0197 |
Easy |
Rising Temperature |
0198 |
Medium |
House Robber |
0199 |
Medium |
Binary Tree Right Side View |
0200 |
Medium |
Number of Islands |
0201 |
Medium |
Bitwise AND of Numbers Range |
0202 |
Easy |
Happy Number |
0203 |
Easy |
Remove Linked List Elements |
0204 |
Medium |
Count Primes |
0205 |
Easy |
Isomorphic Strings |
0206 |
Easy |
Reverse Linked List |
0207 |
Medium |
Course Schedule |
0208 |
Medium |
Implement Trie (Prefix Tree) |
0209 |
Medium |
Minimum Size Subarray Sum |
0210 |
Medium |
Course Schedule II |
0211 |
Medium |
Design Add and Search Words Data Structure |
0212 |
Hard |
Word Search II |
0213 |
Medium |
House Robber II |
0214 |
Hard |
Shortest Palindrome |
0215 |
Medium |
Kth Largest Element in an Array |
0216 |
Medium |
Combination Sum III |
0217 |
Easy |
Contains Duplicate |
0218 |
Hard |
The Skyline Problem |
0219 |
Easy |
Contains Duplicate II |
0220 |
Hard |
Contains Duplicate III |
0221 |
Medium |
Maximal Square |
0222 |
Medium |
Count Complete Tree Nodes |
0223 |
Medium |
Rectangle Area |
0224 |
Hard |
Basic Calculator |
0225 |
Easy |
Implement Stack using Queues |
0226 |
Easy |
Invert Binary Tree |
0227 |
Medium |
Basic Calculator II |
0228 |
Easy |
Summary Ranges |
0229 |
Medium |
Majority Element II |
0231 |
Easy |
Power of Two |
0232 |
Easy |
Implement Queue using Stacks |
0233 |
Hard |
Number of Digit One |
0234 |
Easy |
Palindrome Linked List |
0235 |
Medium |
Lowest Common Ancestor of a Binary Search Tree |
0236 |
Medium |
Lowest Common Ancestor of a Binary Tree |
0237 |
Medium |
Delete Node in a Linked List |
0238 |
Medium |
Product of Array Except Self |
0239 |
Hard |
Sliding Window Maximum |
0240 |
Medium |
Search a 2D Matrix II |
0241 |
Medium |
Different Ways to Add Parentheses |
0242 |
Easy |
Valid Anagram |
0257 |
Easy |
Binary Tree Paths |
0258 |
Easy |
Add Digits |
0260 |
Medium |
Single Number III |
0262 |
Hard |
Trips and Users |
0263 |
Easy |
Ugly Number |
0264 |
Medium |
Ugly Number II |
0268 |
Easy |
Missing Number |
0273 |
Hard |
Integer to English Words |
0274 |
Medium |
H-Index |
0275 |
Medium |
H-Index II |
0278 |
Easy |
First Bad Version |
0279 |
Medium |
Perfect Squares |
0282 |
Hard |
Expression Add Operators |
0283 |
Easy |
Move Zeroes |
0284 |
Medium |
Peeking Iterator |
0287 |
Medium |
Find the Duplicate Number |
0289 |
Medium |
Game of Life |
0290 |
Easy |
Word Pattern |
0292 |
Easy |
Nim Game |
0295 |
Hard |
Find Median from Data Stream |
0297 |
Hard |
Serialize and Deserialize Binary Tree |
0299 |
Medium |
Bulls and Cows |
0300 |
Medium |
Longest Increasing Subsequence |
0301 |
Hard |
Remove Invalid Parentheses |
0303 |
Easy |
Range Sum Query - Immutable |
0304 |
Medium |
Range Sum Query 2D - Immutable |
0306 |
Medium |
Additive Number |
0307 |
Medium |
Range Sum Query - Mutable |
0309 |
Medium |
Best Time to Buy and Sell Stock with Cooldown |
0310 |
Medium |
Minimum Height Trees |
0312 |
Hard |
Burst Balloons |
0313 |
Medium |
Super Ugly Number |
0315 |
Hard |
Count of Smaller Numbers After Self |
0316 |
Medium |
Remove Duplicate Letters |
0318 |
Medium |
Maximum Product of Word Lengths |
0319 |
Medium |
Bulb Switcher |
0321 |
Hard |
Create Maximum Number |
0322 |
Medium |
Coin Change |
0324 |
Medium |
Wiggle Sort II |
0326 |
Easy |
Power of Three |
0327 |
Hard |
Count of Range Sum |
0328 |
Medium |
Odd Even Linked List |
0329 |
Hard |
Longest Increasing Path in a Matrix |
0330 |
Hard |
Patching Array |
0331 |
Medium |
Verify Preorder Serialization of a Binary Tree |
0332 |
Hard |
Reconstruct Itinerary |
0334 |
Medium |
Increasing Triplet Subsequence |
0336 |
Hard |
Palindrome Pairs |
0337 |
Medium |
House Robber III |
0338 |
Easy |
Counting Bits |
0341 |
Medium |
Flatten Nested List Iterator |
0342 |
Easy |
Power of Four |
0343 |
Medium |
Integer Break |
0344 |
Easy |
Reverse String |
0345 |
Easy |
Reverse Vowels of a String |
0347 |
Medium |
Top K Frequent Elements |
0349 |
Easy |
Intersection of Two Arrays |
0350 |
Easy |
Intersection of Two Arrays II |
0352 |
Hard |
Data Stream as Disjoint Intervals |
0354 |
Hard |
Russian Doll Envelopes |
0355 |
Medium |
Design Twitter |
0357 |
Medium |
Count Numbers with Unique Digits |
0365 |
Medium |
Water and Jug Problem |
0367 |
Easy |
Valid Perfect Square |
0368 |
Medium |
Largest Divisible Subset |
0371 |
Medium |
Sum of Two Integers |
0373 |
Medium |
Find K Pairs with Smallest Sums |
0374 |
Easy |
Guess Number Higher or Lower |
0375 |
Medium |
Guess Number Higher or Lower II |
0376 |
Medium |
Wiggle Subsequence |
0377 |
Medium |
Combination Sum IV |
0378 |
Medium |
Kth Smallest Element in a Sorted Matrix |
0380 |
Medium |
Insert Delete GetRandom O(1) |
0382 |
Medium |
Linked List Random Node |
0383 |
Easy |
Ransom Note |
0384 |
Medium |
Shuffle an Array |
0385 |
Medium |
Mini Parser |
0386 |
Medium |
Lexicographical Numbers |
0387 |
Easy |
First Unique Character in a String |
0388 |
Medium |
Longest Absolute File Path |
0389 |
Easy |
Find the Difference |
0390 |
Medium |
Elimination Game |
0392 |
Easy |
Is Subsequence |
0393 |
Medium |
UTF-8 Validation |
0394 |
Medium |
Decode String |
0395 |
Medium |
Longest Substring with At Least K Repeating Characters |
0396 |
Medium |
Rotate Function |
0397 |
Medium |
Integer Replacement |
0398 |
Medium |
Random Pick Index |
0399 |
Medium |
Evaluate Division |
0401 |
Easy |
Binary Watch |
0402 |
Medium |
Remove K Digits |
0403 |
Hard |
Frog Jump |
0404 |
Easy |
Sum of Left Leaves |
0405 |
Easy |
Convert a Number to Hexadecimal |
0406 |
Medium |
Queue Reconstruction by Height |
0409 |
Easy |
Longest Palindrome |
0410 |
Hard |
Split Array Largest Sum |
0412 |
Easy |
Fizz Buzz |
0413 |
Medium |
Arithmetic Slices |
0414 |
Easy |
Third Maximum Number |
0415 |
Easy |
Add Strings |
0416 |
Medium |
Partition Equal Subset Sum |
0417 |
Medium |
Pacific Atlantic Water Flow |
0419 |
Medium |
Battleships in a Board |
0421 |
Medium |
Maximum XOR of Two Numbers in an Array |
0423 |
Medium |
Reconstruct Original Digits from English |
0424 |
Medium |
Longest Repeating Character Replacement |
0427 |
Medium |
Construct Quad Tree |
0429 |
Medium |
N-ary Tree Level Order Traversal |
0430 |
Medium |
Flatten a Multilevel Doubly Linked list |
0432 |
Hard |
All O`one Data Structure |
0433 |
Medium |
Minimum Genetic Mutation |
0434 |
Easy |
Number of Segments in a String |
0435 |
Medium |
Non-overlapping Intervals |
0436 |
Medium |
Find Right Interval |
0437 |
Medium |
Path Sum III |
0438 |
Medium |
Find All Anagrams in a String |
0440 |
Hard |
K-th Smallest in Lexicographical Order |
0441 |
Easy |
Arranging Coins |
0442 |
Medium |
Find All Duplicates in an Array |
0443 |
Medium |
String Compression |
0445 |
Medium |
Add Two Numbers II |
0446 |
Hard |
Arithmetic Slices II - Subsequence |
0447 |
Medium |
Number of Boomerangs |
0448 |
Easy |
Find All Numbers Disappeared in an Array |
0449 |
Medium |
Serialize and Deserialize BST |
0450 |
Medium |
Delete Node in a BST |
0451 |
Medium |
Sort Characters By Frequency |
0452 |
Medium |
Minimum Number of Arrows to Burst Balloons |
0453 |
Medium |
Minimum Moves to Equal Array Elements |
0454 |
Medium |
4Sum II |
0455 |
Easy |
Assign Cookies |
0456 |
Medium |
132 Pattern |
0457 |
Medium |
Circular Array Loop |
0458 |
Hard |
Poor Pigs |
0459 |
Easy |
Repeated Substring Pattern |
0460 |
Hard |
LFU Cache |
0461 |
Easy |
Hamming Distance |
0462 |
Medium |
Minimum Moves to Equal Array Elements II |
0463 |
Easy |
Island Perimeter |
0464 |
Medium |
Can I Win |
0467 |
Medium |
Unique Substrings in Wraparound String |
0468 |
Medium |
Validate IP Address |
0472 |
Hard |
Concatenated Words |
0473 |
Medium |
Matchsticks to Square |
0474 |
Medium |
Ones and Zeroes |
0475 |
Medium |
Heaters |
0476 |
Easy |
Number Complement |
0477 |
Medium |
Total Hamming Distance |
0481 |
Medium |
Magical String |
0482 |
Easy |
License Key Formatting |
0485 |
Easy |
Max Consecutive Ones |
0486 |
Medium |
Reachable Nodes With Restrictions |
0491 |
Medium |
Non-decreasing Subsequences |
0492 |
Easy |
Construct the Rectangle |
0493 |
Hard |
Reverse Pairs |
0494 |
Medium |
Target Sum |
0496 |
Medium |
Next Greater Element I |
0498 |
Medium |
Diagonal Traverse |
0501 |
Easy |
Find Mode in Binary Search Tree |
0502 |
Hard |
IPO |
0503 |
Medium |
Next Greater Element II |
0506 |
Easy |
Relative Ranks |
0508 |
Medium |
Most Frequent Subtree Sum |
0509 |
Easy |
Fibonacci Number |
0511 |
Easy |
Game Play Analysis I |
0513 |
Medium |
Find Bottom Left Tree Value |
0514 |
Hard |
Freedom Trail |
0515 |
Medium |
Find Largest Value in Each Tree Row |
0516 |
Medium |
Longest Palindromic Subsequence |
0518 |
Medium |
Coin Change II |
0520 |
Easy |
Detect Capital |
0522 |
Medium |
Longest Uncommon Subsequence II |
0523 |
Medium |
Continuous Subarray Sum |
0524 |
Medium |
Longest Word in Dictionary through Deleting |
0525 |
Medium |
Contiguous Array |
0526 |
Medium |
Beautiful Arrangement |
0529 |
Medium |
Minesweeper |
0530 |
Easy |
Minimum Absolute Difference in BST |
0532 |
Medium |
K-diff Pairs in an Array |
0535 |
Medium |
Encode and Decode TinyURL |
0537 |
Medium |
Complex Number Multiplication |
0538 |
Medium |
Convert BST to Greater Tree |
0539 |
Medium |
Minimum Time Difference |
0540 |
Medium |
Single Element in a Sorted Array |
0542 |
Medium |
01 Matrix |
0543 |
Easy |
Diameter of Binary Tree |
0546 |
Hard |
Remove Boxes |
0547 |
Medium |
Number of Provinces |
0550 |
Medium |
Game Play Analysis IV |
0552 |
Hard |
Student Attendance Record II |
0553 |
Medium |
Optimal Division |
0554 |
Medium |
Brick Wall |
0556 |
Medium |
Next Greater Element III |
0557 |
Easy |
Reverse Words in a String III |
0559 |
Easy |
Maximum Depth of N-ary Tree |
0560 |
Medium |
Subarray Sum Equals K |
0561 |
Easy |
Array Partition |
0563 |
Easy |
Binary Tree Tilt |
0564 |
Hard |
Find the Closest Palindrome |
0565 |
Medium |
Array Nesting |
0566 |
Easy |
Reshape the Matrix |
0567 |
Medium |
Permutation in String |
0570 |
Medium |
Managers with at Least 5 Direct Reports |
0572 |
Easy |
Subtree of Another Tree |
0576 |
Medium |
Out of Boundary Paths |
0577 |
Easy |
Employee Bonus |
0581 |
Medium |
Shortest Unsorted Continuous Subarray |
0583 |
Medium |
Delete Operation for Two Strings |
0584 |
Easy |
Find Customer Referee |
0585 |
Medium |
Investments in 2016 |
0586 |
Easy |
Customer Placing the Largest Number of Orders |
0587 |
Hard |
Erect the Fence |
0589 |
Easy |
N-ary Tree Preorder Traversal |
0590 |
Easy |
N-ary Tree Postorder Traversal |
0592 |
Medium |
Fraction Addition and Subtraction |
0593 |
Medium |
Valid Square |
0595 |
Easy |
Big Countries |
0596 |
Easy |
Classes More Than 5 Students |
0601 |
Hard |
Human Traffic of Stadium |
0602 |
Medium |
Friend Requests II: Who Has the Most Friends |
0605 |
Easy |
Can Place Flowers |
0606 |
Easy |
Construct String from Binary Tree |
0607 |
Easy |
Sales Person |
0608 |
Medium |
Tree Node |
0609 |
Medium |
Find Duplicate File in System |
0610 |
Easy |
Triangle Judgement |
0611 |
Medium |
Valid Triangle Number |
0617 |
Easy |
Merge Two Binary Trees |
0619 |
Easy |
Biggest Single Number |
0620 |
Easy |
Not Boring Movies |
0621 |
Medium |
Task Scheduler |
0622 |
Medium |
Design Circular Queue |
0623 |
Medium |
Add One Row to Tree |
0624 |
Medium |
Maximum Distance in Arrays |
0626 |
Medium |
Exchange Seats |
0627 |
Easy |
Swap Salary |
0629 |
Hard |
K Inverse Pairs Array |
0632 |
Hard |
Smallest Range Covering Elements from K Lists |
0633 |
Medium |
Sum of Square Numbers |
0636 |
Medium |
Exclusive Time of Functions |
0637 |
Easy |
Average of Levels in Binary Tree |
0638 |
Medium |
Shopping Offers |
0640 |
Medium |
Solve the Equation |
0641 |
Medium |
Design Circular Deque |
0643 |
Easy |
Maximum Average Subarray I |
0645 |
Easy |
Set Mismatch |
0646 |
Medium |
Maximum Length of Pair Chain |
0647 |
Medium |
Palindromic Substrings |
0648 |
Medium |
Replace Words |
0649 |
Medium |
Dota2 Senate |
0650 |
Medium |
2 Keys Keyboard |
0652 |
Medium |
Find Duplicate Subtrees |
0653 |
Easy |
Two Sum IV - Input is a BST |
0654 |
Medium |
Maximum Binary Tree |
0655 |
Medium |
Print Binary Tree |
0658 |
Medium |
Find K Closest Elements |
0659 |
Medium |
Split Array into Consecutive Subsequences |
0661 |
Easy |
Image Smoother |
0662 |
Medium |
Maximum Width of Binary Tree |
0664 |
Hard |
Strange Printer |
0665 |
Medium |
Non-decreasing Array |
0667 |
Medium |
Beautiful Arrangement II |
0669 |
Medium |
Trim a Binary Search Tree |
0670 |
Medium |
Maximum Swap |
0671 |
Easy |
Second Minimum Node In a Binary Tree |
0672 |
Medium |
Bulb Switcher II |
0673 |
Medium |
Number of Longest Increasing Subsequence |
0676 |
Medium |
Implement Magic Dictionary |
0677 |
Medium |
Map Sum Pairs |
0678 |
Medium |
Valid Parenthesis String |
0684 |
Medium |
Redundant Connection |
0687 |
Medium |
Longest Univalue Path |
0688 |
Medium |
Knight Probability in Chessboard |
0689 |
Hard |
Maximum Sum of 3 Non-Overlapping Subarrays |
0690 |
Medium |
Employee Importance |
0692 |
Medium |
Top K Frequent Words |
0695 |
Medium |
Max Area of Island |
0698 |
Medium |
Partition to K Equal Sum Subsets |
0699 |
Hard |
Falling Squares |
0700 |
Easy |
Search in a Binary Search Tree |
0701 |
Medium |
Insert into a Binary Search Tree |
0703 |
Easy |
Kth Largest Element in a Stream |
0704 |
Easy |
Binary Search |
0705 |
Easy |
Design HashSet |
0706 |
Easy |
Design HashMap |
0707 |
Medium |
Design Linked List |
0712 |
Medium |
Minimum ASCII Delete Sum for Two Strings |
0713 |
Medium |
Subarray Product Less Than K |
0714 |
Medium |
Best Time to Buy and Sell Stock with Transaction Fee |
0715 |
Hard |
Range Module |
0717 |
Easy |
1-bit and 2-bit Characters |
0718 |
Medium |
Maximum Length of Repeated Subarray |
0719 |
Hard |
Find K-th Smallest Pair Distance |
0720 |
Medium |
Longest Word in Dictionary |
0722 |
Medium |
Remove Comments |
0724 |
Easy |
Find Pivot Index |
0725 |
Medium |
Split Linked List in Parts |
0726 |
Hard |
Number of Atoms |
0729 |
Medium |
My Calendar I |
0731 |
Medium |
My Calendar II |
0732 |
Hard |
My Calendar III |
0733 |
Easy |
Flood Fill |
0735 |
Medium |
Asteroid Collision |
0738 |
Medium |
Monotone Increasing Digits |
0739 |
Medium |
Daily Temperatures |
0740 |
Medium |
Delete and Earn |
0743 |
Medium |
Network Delay Time |
0744 |
Easy |
Find Smallest Letter Greater Than Target |
0746 |
Easy |
Min Cost Climbing Stairs |
0747 |
Easy |
Largest Number At Least Twice of Others |
0752 |
Medium |
Open the Lock |
0754 |
Medium |
Reach a Number |
0756 |
Medium |
Pyramid Transition Matrix |
0763 |
Medium |
Partition Labels |
0767 |
Medium |
Reorganize String |
0769 |
Medium |
Max Chunks To Make Sorted |
0771 |
Easy |
Jewels and Stones |
0773 |
Hard |
Sliding Puzzle |
0778 |
Hard |
Swim in Rising Water |
0779 |
Medium |
K-th Symbol in Grammar |
0781 |
Medium |
Rabbits in Forest |
0783 |
Easy |
Minimum Distance Between BST Nodes |
0784 |
Medium |
Letter Case Permutation |
0785 |
Medium |
Is Graph Bipartite? |
0786 |
Medium |
K-th Smallest Prime Fraction |
0787 |
Medium |
Cheapest Flights Within K Stops |
0788 |
Medium |
Rotated Digits |
0789 |
Medium |
Escape The Ghosts |
0790 |
Medium |
Domino and Tromino Tiling |
0791 |
Medium |
Custom Sort String |
0792 |
Medium |
Number of Matching Subsequences |
0795 |
Medium |
Number of Subarrays with Bounded Maximum |
0796 |
Easy |
Rotate String |
0797 |
Medium |
All Paths From Source to Target |
0799 |
Medium |
Champagne Tower |
0802 |
Medium |
Find Eventual Safe States |
0807 |
Medium |
Max Increase to Keep City Skyline |
0808 |
Medium |
Soup Servings |
0811 |
Medium |
Subdomain Visit Count |
0813 |
Medium |
Largest Sum of Averages |
0814 |
Medium |
Binary Tree Pruning |
0815 |
Hard |
Bus Routes |
0816 |
Medium |
Ambiguous Coordinates |
0817 |
Medium |
Linked List Components |
0820 |
Medium |
Short Encoding of Words |
0823 |
Medium |
Binary Trees With Factors |
0826 |
Medium |
Most Profit Assigning Work |
0830 |
Medium |
Kth Smallest Element in a BST |
0831 |
Medium |
Masking Personal Information |
0833 |
Medium |
Find And Replace in String |
0834 |
Hard |
Sum of Distances in Tree |
0835 |
Medium |
Image Overlap |
0837 |
Medium |
New 21 Game |
0838 |
Medium |
Push Dominoes |
0839 |
Hard |
Similar String Groups |
0840 |
Medium |
Magic Squares In Grid |
0841 |
Medium |
Keys and Rooms |
0844 |
Easy |
Backspace String Compare |
0846 |
Medium |
Hand of Straights |
0847 |
Hard |
Shortest Path Visiting All Nodes |
0851 |
Medium |
Loud and Rich |
0852 |
Medium |
Peak Index in a Mountain Array |
0853 |
Medium |
Car Fleet |
0856 |
Medium |
Score of Parentheses |
0857 |
Hard |
Minimum Cost to Hire K Workers |
0858 |
Medium |
Mirror Reflection |
0859 |
Easy |
Buddy Strings |
0860 |
Easy |
Lemonade Change |
0861 |
Medium |
Score After Flipping Matrix |
0862 |
Hard |
Shortest Subarray with Sum at Least K |
0863 |
Medium |
All Nodes Distance K in Binary Tree |
0864 |
Hard |
Shortest Path to Get All Keys |
0865 |
Medium |
Smallest Subtree with all the Deepest Nodes |
0867 |
Easy |
Transpose Matrix |
0869 |
Medium |
Reordered Power of 2 |
0870 |
Medium |
Advantage Shuffle |
0872 |
Easy |
Leaf-Similar Trees |
0874 |
Medium |
Walking Robot Simulation |
0875 |
Medium |
Koko Eating Bananas |
0876 |
Easy |
Middle of the Linked List |
0877 |
Medium |
Stone Game |
0879 |
Hard |
Profitable Schemes |
0880 |
Medium |
Decoded String at Index |
0881 |
Medium |
Boats to Save People |
0884 |
Easy |
Uncommon Words from Two Sentences |
0885 |
Medium |
Spiral Matrix III |
0886 |
Medium |
Possible Bipartition |
0889 |
Medium |
Construct Binary Tree from Preorder and Postorder Traversal |
0890 |
Medium |
Find and Replace Pattern |
0893 |
Medium |
Groups of Special-Equivalent Strings |
0894 |
Medium |
All Possible Full Binary Trees |
0895 |
Hard |
Maximum Frequency Stack |
0896 |
Easy |
Monotonic Array |
0897 |
Easy |
Increasing Order Search Tree |
0900 |
Medium |
RLE Iterator |
0901 |
Medium |
Online Stock Span |
0904 |
Medium |
Fruit Into Baskets |
0905 |
Easy |
Sort Array By Parity |
0907 |
Medium |
Sum of Subarray Minimums |
0909 |
Medium |
Snakes and Ladders |
0911 |
Medium |
Online Election |
0912 |
Medium |
Sort an Array |
0915 |
Medium |
Partition Array into Disjoint Intervals |
0916 |
Medium |
Word Subsets |
0918 |
Medium |
Maximum Sum Circular Subarray |
0919 |
Medium |
Complete Binary Tree Inserter |
0920 |
Hard |
Number of Music Playlists |
0921 |
Medium |
Minimum Add to Make Parentheses Valid |
0926 |
Medium |
Flip String to Monotone Increasing |
0930 |
Medium |
Binary Subarrays With Sum |
0931 |
Medium |
Minimum Falling Path Sum |
0932 |
Medium |
Beautiful Array |
0933 |
Easy |
Number of Recent Calls |
0934 |
Medium |
Shortest Bridge |
0935 |
Medium |
Knight Dialer |
0937 |
Medium |
Reorder Data in Log Files |
0938 |
Easy |
Range Sum of BST |
0939 |
Medium |
Minimum Area Rectangle |
0941 |
Easy |
Valid Mountain Array |
0944 |
Easy |
Delete Columns to Make Sorted |
0945 |
Medium |
Minimum Increment to Make Array Unique |
0946 |
Medium |
Validate Stack Sequences |
0947 |
Medium |
Most Stones Removed with Same Row or Column |
0948 |
Medium |
Bag of Tokens |
0950 |
Medium |
Reveal Cards In Increasing Order |
0951 |
Medium |
Flip Equivalent Binary Trees |
0953 |
Easy |
Verifying an Alien Dictionary |
0956 |
Medium |
Tallest Billboard |
0958 |
Medium |
Check Completeness of a Binary Tree |
0959 |
Medium |
Regions Cut By Slashes |
0962 |
Medium |
Maximum Width Ramp |
0965 |
Easy |
Univalued Binary Tree |
0966 |
Medium |
Vowel Spellchecker |
0967 |
Medium |
Numbers With Same Consecutive Differences |
0969 |
Medium |
Pancake Sorting |
0973 |
Medium |
K Closest Points to Origin |
0974 |
Medium |
Subarray Sums Divisible by K |
0977 |
Easy |
Squares of a Sorted Array |
0979 |
Medium |
Distribute Coins in Binary Tree |
0980 |
Hard |
Unique Paths III |
0981 |
Medium |
Time Based Key-Value Store |
0983 |
Medium |
Minimum Cost For Tickets |
0985 |
Medium |
Sum of Even Numbers After Queries |
0986 |
Medium |
Interval List Intersections |
0988 |
Medium |
Smallest String Starting From Leaf |
0989 |
Easy |
Add to Array-Form of Integer |
0990 |
Medium |
Satisfiability of Equality Equations |
0991 |
Medium |
Broken Calculator |
0992 |
Hard |
Subarrays with K Different Integers |
0993 |
Easy |
Cousins in Binary Tree |
0994 |
Medium |
Rotting Oranges |
0995 |
Hard |
Minimum Number of K Consecutive Bit Flips |
0997 |
Easy |
Find the Town Judge |
0998 |
Medium |
Maximum Binary Tree II |
1002 |
Easy |
Find Common Characters |
1003 |
Medium |
Check If Word Is Valid After Substitutions |
1004 |
Medium |
Max Consecutive Ones III |
1006 |
Medium |
Clumsy Factorial |
1007 |
Medium |
Minimum Domino Rotations For Equal Row |
1008 |
Medium |
Construct Binary Search Tree from Preorder Traversal |
1009 |
Easy |
Complement of Base 10 Integer |
1010 |
Medium |
Pairs of Songs With Total Durations Divisible by 60 |
1011 |
Medium |
Capacity To Ship Packages Within D Days |
1014 |
Medium |
Best Sightseeing Pair |
1016 |
Medium |
Binary String With Substrings Representing 1 To N |
1017 |
Medium |
Convert to Base -2 |
1019 |
Medium |
Next Greater Node In Linked List |
1020 |
Medium |
Number of Enclaves |
1022 |
Easy |
Sum of Root To Leaf Binary Numbers |
1023 |
Medium |
Camelcase Matching |
1024 |
Medium |
Video Stitching |
1026 |
Medium |
Maximum Difference Between Node and Ancestor |
1027 |
Medium |
Longest Arithmetic Subsequence |
1029 |
Medium |
Two City Scheduling |
1031 |
Medium |
Maximum Sum of Two Non-Overlapping Subarrays |
1033 |
Medium |
Moving Stones Until Consecutive |
1035 |
Medium |
Uncrossed Lines |
1038 |
Medium |
Binary Search Tree to Greater Sum Tree |
1039 |
Medium |
Minimum Score Triangulation of Polygon |
1040 |
Medium |
Moving Stones Until Consecutive II |
1041 |
Medium |
Robot Bounded In Circle |
1042 |
Medium |
Flower Planting With No Adjacent |
1043 |
Medium |
Partition Array for Maximum Sum |
1045 |
Medium |
Customers Who Bought All Products |
1046 |
Easy |
Last Stone Weight |
1047 |
Easy |
Remove All Adjacent Duplicates In String |
1048 |
Medium |
Longest String Chain |
1049 |
Medium |
Last Stone Weight II |
1050 |
Easy |
Actors and Directors Who Cooperated At Least Three Times |
1051 |
Easy |
Height Checker |
1052 |
Medium |
Grumpy Bookstore Owner |
1061 |
Medium |
Lexicographically Smallest Equivalent String |
1068 |
Easy |
Product Sales Analysis I |
1070 |
Medium |
Product Sales Analysis III |
1071 |
Easy |
Greatest Common Divisor of Strings |
1072 |
Medium |
Flip Columns For Maximum Number of Equal Rows |
1074 |
Hard |
Number of Submatrices That Sum to Target |
1075 |
Easy |
Project Employees I |
1079 |
Medium |
Letter Tile Possibilities |
1080 |
Medium |
Insufficient Nodes in Root to Leaf Paths |
1081 |
Medium |
Smallest Subsequence of Distinct Characters |
1084 |
Easy |
Sales Analysis III |
1089 |
Easy |
Duplicate Zeros |
1090 |
Medium |
Largest Values From Labels |
1091 |
Medium |
Shortest Path in Binary Matrix |
1094 |
Medium |
Car Pooling |
1095 |
Easy |
Find Numbers with Even Number of Digits |
1095 |
Hard |
Find in Mountain Array |
1099 |
Easy |
Replace Elements with Greatest Element on Right Side |
1104 |
Medium |
Path In Zigzag Labelled Binary Tree |
1105 |
Medium |
Filling Bookcase Shelves |
1106 |
Hard |
Parsing A Boolean Expression |
1108 |
Easy |
Defanging an IP Address |
1109 |
Medium |
Corporate Flight Bookings |
1110 |
Medium |
Delete Nodes And Return Forest |
1111 |
Medium |
Maximum Nesting Depth of Two Valid Parentheses Strings |
1122 |
Easy |
Relative Sort Array |
1123 |
Medium |
Lowest Common Ancestor of Deepest Leaves |
1125 |
Hard |
Smallest Sufficient Team |
1129 |
Medium |
Shortest Path with Alternating Colors |
1130 |
Medium |
Minimum Cost Tree From Leaf Values |
1137 |
Easy |
N-th Tribonacci Number |
1138 |
Medium |
Alphabet Board Path |
1139 |
Medium |
Largest 1-Bordered Square |
1140 |
Medium |
Stone Game II |
1141 |
Easy |
User Activity for the Past 30 Days I |
1143 |
Medium |
Longest Common Subsequence |
1145 |
Medium |
Binary Tree Coloring Game |
1146 |
Medium |
Snapshot Array |
1148 |
Easy |
Article Views I |
1155 |
Medium |
Number of Dice Rolls With Target Sum |
1158 |
Medium |
Market Analysis I |
1160 |
Easy |
Find Words That Can Be Formed by Characters |
1161 |
Medium |
Maximum Level Sum of a Binary Tree |
1162 |
Medium |
As Far from Land as Possible |
1164 |
Medium |
Product Price at a Given Date |
1170 |
Medium |
Compare Strings by Frequency of the Smallest Character |
1171 |
Medium |
Remove Zero Sum Consecutive Nodes from Linked List |
1174 |
Medium |
Immediate Food Delivery II |
1179 |
Easy |
Reformat Department Table |
1187 |
Hard |
Make Array Strictly Increasing |
1190 |
Medium |
Reverse Substrings Between Each Pair of Parentheses |
1193 |
Medium |
Monthly Transactions I |
1202 |
Medium |
Smallest String With Swaps |
1203 |
Hard |
Sort Items by Groups Respecting Dependencies |
1204 |
Medium |
Last Person to Fit in the Bus |
1207 |
Easy |
Unique Number of Occurrences |
1208 |
Medium |
Get Equal Substrings Within Budget |
1209 |
Medium |
Remove All Adjacent Duplicates in String II |
1211 |
Easy |
Queries Quality and Percentage |
1218 |
Medium |
Longest Arithmetic Subsequence of Given Difference |
1219 |
Medium |
Path with Maximum Gold |
1220 |
Hard |
Count Vowels Permutation |
1221 |
Easy |
Split a String in Balanced Strings |
1222 |
Medium |
Queens That Can Attack the King |
1227 |
Medium |
Airplane Seat Assignment Probability |
1232 |
Easy |
Check If It Is a Straight Line |
1233 |
Medium |
Remove Sub-Folders from the Filesystem |
1235 |
Hard |
Maximum Profit in Job Scheduling |
1237 |
Medium |
Find Positive Integer Solution for a Given Equation |
1238 |
Medium |
Circular Permutation in Binary Representation |
1239 |
Medium |
Maximum Length of a Concatenated String with Unique Characters |
1247 |
Medium |
Minimum Swaps to Make Strings Equal |
1248 |
Medium |
Count Number of Nice Subarrays |
1249 |
Medium |
Minimum Remove to Make Valid Parentheses |
1251 |
Easy |
Average Selling Price |
1254 |
Medium |
Number of Closed Islands |
1255 |
Hard |
Maximum Score Words Formed by Letters |
1261 |
Medium |
Find Elements in a Contaminated Binary Tree |
1262 |
Medium |
Greatest Sum Divisible by Three |
1262 |
Medium |
Greatest Sum Divisible by Three |
1266 |
Easy |
Minimum Time Visiting All Points |
1267 |
Medium |
Count Servers that Communicate |
1268 |
Medium |
Search Suggestions System |
1269 |
Hard |
Number of Ways to Stay in the Same Place After Some Steps |
1276 |
Medium |
Number of Burgers with No Waste of Ingredients |
1277 |
Medium |
Count Square Submatrices with All Ones |
1280 |
Easy |
Students and Examinations |
1281 |
Easy |
Subtract the Product and Sum of Digits of an Integer |
1282 |
Medium |
Group the People Given the Group Size They Belong To |
1283 |
Medium |
Find the Smallest Divisor Given a Threshold |
1284 |
Hard |
Minimum Number of Flips to Convert Binary Matrix to Zero Matrix |
1286 |
Medium |
Iterator for Combination |
1287 |
Easy |
Element Appearing More Than 25% In Sorted Array |
1288 |
Medium |
Remove Covered Intervals |
1289 |
Hard |
Minimum Falling Path Sum II |
1290 |
Easy |
Convert Binary Number in a Linked List to Integer |
1291 |
Medium |
Sequential Digits |
1292 |
Medium |
Maximum Side Length of a Square with Sum Less than or Equal to Threshold |
1296 |
Medium |
Divide Array in Sets of K Consecutive Numbers |
1297 |
Medium |
Maximum Number of Occurrences of a Substring |
1302 |
Medium |
Deepest Leaves Sum |
1305 |
Medium |
All Elements in Two Binary Search Trees |
1306 |
Medium |
Jump Game III |
1310 |
Medium |
XOR Queries of a Subarray |
1311 |
Medium |
Get Watched Videos by Your Friends |
1312 |
Hard |
Minimum Insertion Steps to Make a String Palindrome |
1313 |
Easy |
Decompress Run-Length Encoded List |
1314 |
Medium |
Matrix Block Sum |
1315 |
Medium |
Sum of Nodes with Even-Valued Grandparent |
1318 |
Medium |
Minimum Flips to Make a OR b Equal to c |
1319 |
Medium |
Number of Operations to Make Network Connected |
1321 |
Medium |
Restaurant Growth |
1323 |
Easy |
Maximum 69 Number |
1324 |
Medium |
Print Words Vertically |
1325 |
Medium |
Delete Leaves With a Given Value |
1326 |
Hard |
Minimum Number of Taps to Open to Water a Garden |
1327 |
Easy |
List the Products Ordered in a Period |
1328 |
Medium |
Break a Palindrome |
1329 |
Medium |
Sort the Matrix Diagonally |
1331 |
Easy |
Rank Transform of an Array |
1333 |
Medium |
Filter Restaurants by Vegan-Friendly, Price and Distance |
1334 |
Medium |
Find the City With the Smallest Number of Neighbors at a Threshold Distance |
1335 |
Hard |
Minimum Difficulty of a Job Schedule |
1337 |
Easy |
The K Weakest Rows in a Matrix |
1338 |
Medium |
Reduce Array Size to The Half |
1339 |
Medium |
Maximum Product of Splitted Binary Tree |
1341 |
Medium |
Movie Rating |
1342 |
Easy |
Number of Steps to Reduce a Number to Zero |
1343 |
Medium |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold |
1344 |
Medium |
Angle Between Hands of a Clock |
1345 |
Hard |
Jump Game IV |
1346 |
Easy |
Check if N and Its Double Exist |
1347 |
Medium |
Minimum Number of Steps to Make Two Strings Anagram |
1351 |
Easy |
Count Negative Numbers in a Sorted Matrix |
1352 |
Medium |
Product of the Last K Numbers |
1356 |
Easy |
Sort Integers by The Number of 1 Bits |
1357 |
Medium |
Apply Discount Every n Orders |
1358 |
Medium |
Number of Substrings Containing All Three Characters |
1359 |
Hard |
Count All Valid Pickup and Delivery Options |
1361 |
Medium |
Validate Binary Tree Nodes |
1362 |
Medium |
Closest Divisors |
1365 |
Easy |
How Many Numbers Are Smaller Than the Current Number |
1366 |
Medium |
Rank Teams by Votes |
1367 |
Medium |
Linked List in Binary Tree |
1371 |
Medium |
Find the Longest Substring Containing Vowels in Even Counts |
1372 |
Medium |
Longest ZigZag Path in a Binary Tree |
1373 |
Hard |
Maximum Sum BST in Binary Tree |
1375 |
Medium |
Number of Times Binary String Is Prefix-Aligned |
1376 |
Medium |
Time Needed to Inform All Employees |
1378 |
Easy |
Replace Employee ID With The Unique Identifier |
1379 |
Easy |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
1380 |
Easy |
Lucky Numbers in a Matrix |
1381 |
Medium |
Design a Stack With Increment Operation |
1382 |
Medium |
Balance a Binary Search Tree |
1387 |
Medium |
Sort Integers by The Power Value |
1389 |
Easy |
Create Target Array in the Given Order |
1393 |
Medium |
Capital Gain/Loss |
1395 |
Medium |
Count Number of Teams |
1396 |
Medium |
Design Underground System |
1400 |
Medium |
Construct K Palindrome Strings |
1402 |
Hard |
Reducing Dishes |
1404 |
Medium |
Number of Steps to Reduce a Number in Binary Representation to One |
1405 |
Medium |
Longest Happy String |
1406 |
Hard |
Stone Game III |
1407 |
Easy |
Top Travellers |
1409 |
Medium |
Queries on a Permutation With Key |
1410 |
Medium |
HTML Entity Parser |
1414 |
Medium |
Find the Minimum Number of Fibonacci Numbers Whose Sum Is K |
1415 |
Medium |
The k-th Lexicographical String of All Happy Strings of Length n |
1416 |
Hard |
Restore The Array |
1418 |
Medium |
Display Table of Food Orders in a Restaurant |
1419 |
Medium |
Minimum Number of Frogs Croaking |
1420 |
Hard |
Build Array Where You Can Find The Maximum Exactly K Comparisons |
1422 |
Easy |
Maximum Score After Splitting a String |
1423 |
Medium |
Maximum Points You Can Obtain from Cards |
1424 |
Medium |
Diagonal Traverse II |
1425 |
Hard |
Constrained Subsequence Sum |
1431 |
Easy |
Kids With the Greatest Number of Candies |
1433 |
Medium |
Check If a String Can Break Another String |
1436 |
Easy |
Destination City |
1438 |
Medium |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
1441 |
Medium |
Build an Array With Stack Operations |
1442 |
Medium |
Count Triplets That Can Form Two Arrays of Equal XOR |
1443 |
Medium |
Minimum Time to Collect All Apples in a Tree |
1444 |
Hard |
Number of Ways of Cutting a Pizza |
1447 |
Medium |
Simplified Fractions |
1448 |
Medium |
Count Good Nodes in Binary Tree |
1451 |
Medium |
Rearrange Words in a Sentence |
1452 |
Medium |
People Whose List of Favorite Companies Is Not a Subset of Another List |
1455 |
Easy |
Check If a Word Occurs As a Prefix of Any Word in a Sentence |
1456 |
Medium |
Maximum Number of Vowels in a Substring of Given Length |
1457 |
Medium |
Pseudo-Palindromic Paths in a Binary Tree |
1458 |
Hard |
Max Dot Product of Two Subsequences |
1460 |
Easy |
Make Two Arrays Equal by Reversing Subarrays |
1461 |
Medium |
Check If a String Contains All Binary Codes of Size K |
1462 |
Medium |
Course Schedule IV |
1463 |
Hard |
Cherry Pickup II |
1464 |
Easy |
Maximum Product of Two Elements in an Array |
1466 |
Medium |
Reorder Routes to Make All Paths Lead to the City Zero |
1470 |
Easy |
Shuffle the Array |
1471 |
Medium |
The k Strongest Values in an Array |
1472 |
Medium |
Design Browser History |
1475 |
Easy |
Final Prices With a Special Discount in a Shop |
1476 |
Medium |
Subrectangle Queries |
1480 |
Easy |
Running Sum of 1d Array |
1481 |
Medium |
Least Number of Unique Integers after K Removals |
1482 |
Medium |
Minimum Number of Days to Make m Bouquets |
1484 |
Easy |
Group Sold Products By The Date |
1486 |
Easy |
XOR Operation in an Array |
1489 |
Hard |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree |
1491 |
Easy |
Average Salary Excluding the Minimum and Maximum Salary |
1492 |
Medium |
The kth Factor of n |
1493 |
Medium |
Longest Subarray of 1's After Deleting One Element |
1496 |
Easy |
Path Crossing |
1497 |
Medium |
Check If Array Pairs Are Divisible by k |
1498 |
Medium |
Number of Subsequences That Satisfy the Given Sum Condition |
1502 |
Easy |
Can Make Arithmetic Progression From Sequence |
1503 |
Medium |
Last Moment Before All Ants Fall Out of a Plank |
1504 |
Medium |
Count Submatrices With All Ones |
1508 |
Medium |
Range Sum of Sorted Subarray Sums |
1509 |
Medium |
Minimum Difference Between Largest and Smallest Value in Three Moves |
1512 |
Easy |
Number of Good Pairs |
1514 |
Medium |
Path with Maximum Probability |
1517 |
Easy |
Find Users With Valid E-Mails |
1518 |
Easy |
Water Bottles |
1519 |
Medium |
Number of Nodes in the Sub-Tree With the Same Label |
1523 |
Easy |
Count Odd Numbers in an Interval Range |
1525 |
Medium |
Number of Good Ways to Split a String |
1526 |
Hard |
Minimum Number of Increments on Subarrays to Form a Target Array |
1527 |
Easy |
Patients With a Condition |
1529 |
Medium |
Minimum Suffix Flips |
1530 |
Medium |
Number of Good Leaf Nodes Pairs |
1531 |
Hard |
String Compression II |
1535 |
Medium |
Find the Winner of an Array Game |
1539 |
Easy |
Kth Missing Positive Number |
1541 |
Medium |
Minimum Insertions to Balance a Parentheses String |
1544 |
Easy |
Make The String Great |
1545 |
Medium |
Find Kth Bit in Nth Binary String |
1547 |
Hard |
Minimum Cost to Cut a Stick |
1550 |
Easy |
Three Consecutive Odds |
1551 |
Medium |
Minimum Operations to Make Array Equal |
1552 |
Medium |
Magnetic Force Between Two Balls |
1557 |
Medium |
Minimum Number of Vertices to Reach All Nodes |
1558 |
Medium |
Minimum Numbers of Function Calls to Make Target Array |
1561 |
Medium |
Maximum Number of Coins You Can Get |
1567 |
Medium |
Maximum Length of Subarray With Positive Product |
1568 |
Hard |
Minimum Number of Days to Disconnect Island |
1569 |
Hard |
Number of Ways to Reorder Array to Get Same BST |
1572 |
Easy |
Matrix Diagonal Sum |
1574 |
Medium |
Shortest Subarray to be Removed to Make Array Sorted |
1575 |
Medium |
Count All Possible Routes |
1578 |
Medium |
Minimum Time to Make Rope Colorful |
1579 |
Hard |
Remove Max Number of Edges to Keep Graph Fully Traversable |
1581 |
Easy |
Customer Who Visited but Did Not Make Any Transactions |
1582 |
Easy |
Special Positions in a Binary Matrix |
1583 |
Medium |
Count Unhappy Friends |
1584 |
Medium |
Min Cost to Connect All Points |
1587 |
Easy |
Bank Account Summary II |
1590 |
Medium |
Make Sum Divisible by P |
1593 |
Medium |
Split a String Into the Max Number of Unique Substrings |
1598 |
Easy |
Crawler Log Folder |
1600 |
Medium |
Throne Inheritance |
1601 |
Hard |
Maximum Number of Achievable Transfer Requests |
1603 |
Easy |
Design Parking System |
1605 |
Medium |
Find Valid Matrix Given Row and Column Sums |
1608 |
Easy |
Special Array With X Elements Greater Than or Equal X |
1609 |
Medium |
Even Odd Tree |
1611 |
Hard |
Minimum One Bit Operations to Make Integers Zero |
1614 |
Easy |
Maximum Nesting Depth of the Parentheses |
1615 |
Medium |
Maximal Network Rank |
1624 |
Easy |
Largest Substring Between Two Equal Characters |
1625 |
Medium |
Lexicographically Smallest String After Applying Operations |
1626 |
Medium |
Best Team With No Conflicts |
1630 |
Medium |
Arithmetic Subarrays |
1631 |
Medium |
Path With Minimum Effort |
1633 |
Easy |
Percentage of Users Attended a Contest |
1636 |
Easy |
Sort Array by Increasing Frequency |
1637 |
Medium |
Widest Vertical Area Between Two Points Containing No Points |
1638 |
Medium |
Count Substrings That Differ by One Character |
1639 |
Hard |
Number of Ways to Form a Target String Given a Dictionary |
1641 |
Medium |
Count Sorted Vowel Strings |
1642 |
Medium |
Furthest Building You Can Reach |
1646 |
Easy |
Get Maximum in Generated Array |
1647 |
Medium |
Minimum Deletions to Make Character Frequencies Unique |
1652 |
Easy |
Defuse the Bomb |
1653 |
Medium |
Minimum Deletions to Make String Balanced |
1657 |
Medium |
Determine if Two Strings Are Close |
1658 |
Medium |
Minimum Operations to Reduce X to Zero |
1661 |
Easy |
Average Time of Process per Machine |
1662 |
Easy |
Check If Two String Arrays are Equivalent |
1663 |
Medium |
Smallest String With A Given Numeric Value |
1664 |
Medium |
Ways to Make a Fair Array |
1667 |
Easy |
Fix Names in a Table |
1669 |
Medium |
Merge In Between Linked Lists |
1670 |
Medium |
Design Front Middle Back Queue |
1671 |
Hard |
Minimum Number of Removals to Make Mountain Array |
1672 |
Easy |
Richest Customer Wealth |
1673 |
Medium |
Find the Most Competitive Subsequence |
1675 |
Hard |
Minimize Deviation in Array |
1678 |
Easy |
Goal Parser Interpretation |
1679 |
Medium |
Max Number of K-Sum Pairs |
1680 |
Medium |
Concatenation of Consecutive Binary Numbers |
1683 |
Easy |
Invalid Tweets |
1684 |
Easy |
Count the Number of Consistent Strings |
1685 |
Medium |
Sum of Absolute Differences in a Sorted Array |
1686 |
Medium |
Stone Game VI |
1688 |
Easy |
Count of Matches in Tournament |
1689 |
Medium |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
1690 |
Medium |
Stone Game VII |
1693 |
Easy |
Daily Leads and Partners |
1695 |
Medium |
Maximum Erasure Value |
1696 |
Medium |
Jump Game VI |
1697 |
Hard |
Checking Existence of Edge Length Limited Paths |
1700 |
Easy |
Number of Students Unable to Eat Lunch |
1701 |
Medium |
Average Waiting Time |
1704 |
Easy |
Determine if String Halves Are Alike |
1706 |
Medium |
Where Will the Ball Fall |
1716 |
Easy |
Calculate Money in Leetcode Bank |
1717 |
Medium |
Maximum Score From Removing Substrings |
1718 |
Medium |
Construct the Lexicographically Largest Valid Sequence |
1720 |
Easy |
Decode XORed Array |
1721 |
Medium |
Swapping Nodes in a Linked List |
1722 |
Medium |
Minimize Hamming Distance After Swap Operations |
1726 |
Medium |
Tuple with Same Product |
1727 |
Medium |
Largest Submatrix With Rearrangements |
1729 |
Easy |
Find Followers Count |
1731 |
Easy |
The Number of Employees Which Report to Each Employee |
1732 |
Easy |
Find the Highest Altitude |
1734 |
Medium |
Decode XORed Permutation |
1738 |
Medium |
Find Kth Largest XOR Coordinate Value |
1741 |
Easy |
Find Total Time Spent by Each Employee |
1743 |
Medium |
Restore the Array From Adjacent Pairs |
1749 |
Medium |
Maximum Absolute Sum of Any Subarray |
1750 |
Medium |
Minimum Length of String After Deleting Similar Ends |
1751 |
Hard |
Maximum Number of Events That Can Be Attended II |
1753 |
Medium |
Maximum Score From Removing Stones |
1754 |
Medium |
Largest Merge Of Two Strings |
1757 |
Easy |
Recyclable and Low Fat Products |
1758 |
Easy |
Minimum Changes To Make Alternating Binary String |
1759 |
Medium |
Count Number of Homogenous Substrings |
1760 |
Medium |
Minimum Limit of Balls in a Bag |
1764 |
Medium |
Form Array by Concatenating Subarrays of Another Array |
1765 |
Medium |
Map of Highest Peak |
1768 |
Easy |
Merge Strings Alternately |
1769 |
Medium |
Minimum Number of Operations to Move All Balls to Each Box |
1775 |
Medium |
Equal Sum Arrays With Minimum Number of Operations |
1780 |
Medium |
Check if Number is a Sum of Powers of Three |
1781 |
Medium |
Sum of Beauty of All Substrings |
1786 |
Medium |
Number of Restricted Paths From First to Last Node |
1789 |
Easy |
Primary Department for Each Employee |
1791 |
Easy |
Find Center of Star Graph |
1792 |
Medium |
Maximum Average Pass Ratio |
1793 |
Hard |
Maximum Score of a Good Subarray |
1795 |
Easy |
Rearrange Products Table |
1797 |
Medium |
Design Authentication Manager |
1798 |
Medium |
Maximum Number of Consecutive Values You Can Make |
1799 |
Medium |
Maximize Score After N Operations |
1801 |
Medium |
Number of Orders in the Backlog |
1802 |
Medium |
Maximum Value at a Given Index in a Bounded Array |
1806 |
Medium |
Minimum Number of Operations to Reinitialize a Permutation |
1807 |
Medium |
Evaluate the Bracket Pairs of a String |
1813 |
Medium |
Sentence Similarity III |
1814 |
Medium |
Count Nice Pairs in an Array |
1817 |
Medium |
Finding the Users Active Minutes |
1822 |
Easy |
Sign of the Product of an Array |
1823 |
Medium |
Find the Winner of the Circular Game |
1824 |
Medium |
Minimum Sideway Jumps |
1828 |
Medium |
Queries on Number of Points Inside a Circle |
1829 |
Medium |
Maximum XOR for Each Query |
1833 |
Medium |
Maximum Ice Cream Bars |
1834 |
Medium |
Single-Threaded CPU |
1835 |
Hard |
Find XOR Sum of All Pairs Bitwise AND |
1838 |
Medium |
Frequency of the Most Frequent Element |
1839 |
Medium |
Longest Substring Of All Vowels in Order |
1845 |
Medium |
Seat Reservation Manager |
1846 |
Medium |
Maximum Element After Decreasing and Rearranging |
1850 |
Medium |
Minimum Adjacent Swaps to Reach the Kth Smallest Number |
1855 |
Medium |
Maximum Distance Between a Pair of Values |
1857 |
Hard |
Largest Color Value in a Directed Graph |
1860 |
Medium |
Incremental Memory Leak |
1861 |
Medium |
Rotating the Box |
1863 |
Easy |
Sum of All Subset XOR Totals |
1865 |
Medium |
Finding Pairs With a Certain Sum |
1870 |
Medium |
Minimum Speed to Arrive on Time |
1873 |
Easy |
Calculate Special Bonus |
1877 |
Medium |
Minimize Maximum Pair Sum in Array |
1884 |
Medium |
Egg Drop With 2 Eggs and N Floors |
1887 |
Medium |
Reduction Operations to Make the Array Elements Equal |
1890 |
Easy |
The Latest Login in 2020 |
1894 |
Medium |
Find the Student that Will Replace the Chalk |
1895 |
Medium |
Largest Magic Square |
1897 |
Easy |
Redistribute Characters to Make All Strings Equal |
1899 |
Medium |
Merge Triplets to Form Target Triplet |
1901 |
Medium |
Find a Peak Element II |
1903 |
Easy |
Largest Odd Number in String |
1905 |
Medium |
Count Sub Islands |
1907 |
Medium |
Count Salary Categories |
1910 |
Medium |
Remove All Occurrences of a Substring |
1911 |
Medium |
Maximum Alternating Subsequence Sum |
1913 |
Easy |
Maximum Product Difference Between Two Pairs |
1914 |
Medium |
Cyclically Rotating a Grid |
1915 |
Medium |
Number of Wonderful Substrings |
1920 |
Easy |
Build Array from Permutation |
1921 |
Medium |
Eliminate Maximum Number of Monsters |
1926 |
Medium |
Nearest Exit from Entrance in Maze |
1929 |
Easy |
Concatenation of Array |
1930 |
Medium |
Unique Length-3 Palindromic Subsequences |
1934 |
Medium |
Confirmation Rate |
1937 |
Medium |
Maximum Number of Points with Cost |
1942 |
Medium |
The Number of the Smallest Unoccupied Chair |
1943 |
Medium |
Describe the Painting |
1944 |
Hard |
Number of Visible People in a Queue |
1945 |
Easy |
Sum of Digits of String After Convert |
1947 |
Medium |
Maximum Compatibility Score Sum |
1954 |
Medium |
Minimum Garden Perimeter to Collect Enough Apples |
1957 |
Easy |
Delete Characters to Make Fancy String |
1962 |
Medium |
Remove Stones to Minimize the Total |
1963 |
Medium |
Minimum Number of Swaps to Make the String Balanced |
1964 |
Hard |
Find the Longest Valid Obstacle Course at Each Position |
1965 |
Easy |
Employees With Missing Information |
1970 |
Hard |
Last Day Where You Can Still Cross |
1971 |
Easy |
Find if Path Exists in Graph |
1975 |
Medium |
Maximum Matrix Sum |
1976 |
Medium |
Number of Ways to Arrive at Destination |
1978 |
Easy |
Employees Whose Manager Left the Company |
1980 |
Medium |
Find Unique Binary String |
1991 |
Easy |
Find the Middle Index in Array |
1992 |
Medium |
Find All Groups of Farmland |
2000 |
Easy |
Reverse Prefix of Word |
2001 |
Medium |
Number of Pairs of Interchangeable Rectangles |
2002 |
Medium |
Maximum Product of the Length of Two Palindromic Subsequences |
2009 |
Hard |
Minimum Number of Operations to Make Array Continuous |
2011 |
Easy |
Final Value of Variable After Performing Operations |
2013 |
Medium |
Detect Squares |
2022 |
Easy |
Convert 1D Array Into 2D Array |
2023 |
Medium |
Number of Pairs of Strings With Concatenation Equal to Target |
2024 |
Medium |
Maximize the Confusion of an Exam |
2028 |
Medium |
Find Missing Observations |
2033 |
Medium |
Minimum Operations to Make a Uni-Value Grid |
2037 |
Easy |
Minimum Number of Moves to Seat Everyone |
2038 |
Medium |
Remove Colored Pieces if Both Neighbors are the Same Color |
2039 |
Medium |
The Time When the Network Becomes Idle |
2043 |
Medium |
Simple Bank System |
2044 |
Medium |
Count Number of Maximum Bitwise-OR Subsets |
2045 |
Hard |
Second Minimum Time to Reach Destination |
2049 |
Medium |
Count Nodes With the Highest Score |
2050 |
Hard |
Parallel Courses III |
2053 |
Easy |
Kth Distinct String in an Array |
2054 |
Medium |
Two Best Non-Overlapping Events |
2058 |
Medium |
Find the Minimum and Maximum Number of Nodes Between Critical Points |
2059 |
Medium |
Minimum Operations to Convert Number |
2063 |
Medium |
Vowels of All Substrings |
2064 |
Medium |
Minimized Maximum of Products Distributed to Any Store |
2070 |
Medium |
Most Beautiful Item for Each Query |
2073 |
Easy |
Time Needed to Buy Tickets |
2074 |
Medium |
Reverse Nodes in Even Length Groups |
2075 |
Medium |
Decode the Slanted Ciphertext |
2079 |
Medium |
Watering Plants |
2080 |
Medium |
Range Frequency Queries |
2085 |
Easy |
Count Common Words With One Occurrence |
2087 |
Medium |
Minimum Cost Homecoming of a Robot in a Grid |
2090 |
Medium |
K Radius Subarray Averages |
2091 |
Medium |
Removing Minimum and Maximum From Array |
2092 |
Hard |
Find All People With Secret |
2095 |
Medium |
Delete the Middle Node of a Linked List |
2096 |
Medium |
Step-By-Step Directions From a Binary Tree Node to Another |
2097 |
Hard |
Valid Arrangement of Pairs |
2100 |
Medium |
Find Good Days to Rob the Bank |
2101 |
Medium |
Detonate the Maximum Bombs |
2102 |
Hard |
Sequentially Ordinal Rank Tracker |
2104 |
Medium |
Sum of Subarray Ranges |
2108 |
Easy |
Find First Palindromic String in the Array |
2109 |
Medium |
Adding Spaces to a String |
2110 |
Medium |
Number of Smooth Descent Periods of a Stock |
2114 |
Easy |
Maximum Number of Words Found in Sentences |
2115 |
Medium |
Find All Possible Recipes from Given Supplies |
2120 |
Medium |
Execution of All Suffix Instructions Staying in a Grid |
2125 |
Medium |
Number of Laser Beams in a Bank |
2126 |
Medium |
Destroying Asteroids |
2130 |
Medium |
Maximum Twin Sum of a Linked List |
2131 |
Medium |
Longest Palindrome by Concatenating Two Letter Words |
2134 |
Medium |
Minimum Swaps to Group All 1's Together II |
2136 |
Hard |
Earliest Possible Day of Full Bloom |
2139 |
Medium |
Minimum Moves to Reach Target Score |
2140 |
Medium |
Solving Questions With Brainpower |
2141 |
Hard |
Maximum Running Time of N Computers |
2147 |
Hard |
Number of Ways to Divide a Long Corridor |
2149 |
Medium |
Rearrange Array Elements by Sign |
2150 |
Medium |
Find All Lonely Numbers in the Array |
2155 |
Medium |
All Divisions With the Highest Score of a Binary Array |
2160 |
Easy |
Minimum Sum of Four Digit Number After Splitting Digits |
2161 |
Medium |
Partition Array According to Given Pivot |
2165 |
Medium |
Smallest Value of the Rearranged Number |
2177 |
Medium |
Find Three Consecutive Integers That Sum to a Given Number |
2178 |
Medium |
Maximum Split of Positive Even Integers |
2181 |
Medium |
Merge Nodes in Between Zeros |
2182 |
Medium |
Construct String With Repeat Limit |
2186 |
Medium |
Minimum Number of Steps to Make Two Strings Anagram II |
2187 |
Medium |
Minimum Time to Complete Trips |
2191 |
Medium |
Sort the Jumbled Numbers |
2192 |
Medium |
All Ancestors of a Node in a Directed Acyclic Graph |
2196 |
Medium |
Create Binary Tree From Descriptions |
2201 |
Medium |
Count Artifacts That Can Be Extracted |
2212 |
Medium |
Maximum Points in an Archery Competition |
2215 |
Easy |
Find the Difference of Two Arrays |
2218 |
Hard |
Maximum Value of K Coins From Piles |
2220 |
Easy |
Minimum Bit Flips to Convert Number |
2221 |
Medium |
Find Triangular Sum of an Array |
2222 |
Medium |
Number of Ways to Select Buildings |
2225 |
Medium |
Find Players With Zero or One Losses |
2232 |
Medium |
Minimize Result by Adding Parentheses to Expression |
2235 |
Easy |
Add Two Integers |
2236 |
Easy |
Root Equals Sum of Children |
2240 |
Medium |
Number of Ways to Buy Pens and Pencils |
2243 |
Easy |
Calculate Digit Sum of a String |
2244 |
Medium |
Minimum Rounds to Complete All Tasks |
2246 |
Hard |
Longest Path With Different Adjacent Characters |
2249 |
Medium |
Count Lattice Points Inside a Circle |
2251 |
Hard |
Number of Flowers in Full Bloom |
2257 |
Medium |
Count Unguarded Cells in the Grid |
2260 |
Medium |
Minimum Consecutive Cards to Pick Up |
2264 |
Easy |
Largest 3-Same-Digit Number in String |
2265 |
Medium |
Count Nodes Equal to Average of Subtree |
2265 |
Medium |
Count Nodes Equal to Average of Subtree |
2272 |
Hard |
Substring With Largest Variance |
2274 |
Medium |
Maximum Consecutive Floors Without Special Floors |
2275 |
Medium |
Largest Combination With Bitwise AND Greater Than Zero |
2279 |
Medium |
Maximum Bags With Full Capacity of Rocks |
2284 |
Medium |
Sender With Largest Word Count |
2285 |
Medium |
Maximum Total Importance of Roads |
2290 |
Hard |
Minimum Obstacle Removal to Reach Corner |
2294 |
Medium |
Partition Array Such That Maximum Difference Is K |
2295 |
Medium |
Replace Elements in an Array |
2300 |
Medium |
Successful Pairs of Spells and Potions |
2304 |
Medium |
Minimum Path Cost in a Grid |
2305 |
Medium |
Fair Distribution of Cookies |
2306 |
Hard |
Naming a Company |
2316 |
Medium |
Count Unreachable Pairs of Nodes in an Undirected Graph |
2317 |
Medium |
Maximum XOR After Operations |
2326 |
Medium |
Spiral Matrix IV |
2328 |
Hard |
Number of Increasing Paths in a Grid |
2331 |
Easy |
Evaluate Boolean Binary Tree |
2336 |
Medium |
Smallest Number in Infinite Set |
2337 |
Medium |
Move Pieces to Obtain a String |
2342 |
Medium |
Max Sum of a Pair With Equal Sum of Digits |
2343 |
Medium |
Query Kth Smallest Trimmed Number |
2348 |
Medium |
Number of Zero-Filled Subarrays |
2352 |
Medium |
Equal Row and Column Pairs |
2353 |
Medium |
Design a Food Rating System |
2356 |
Easy |
Number of Unique Subjects Taught by Each Teacher |
2358 |
Medium |
Maximum Number of Groups Entering a Competition |
2359 |
Medium |
Find Closest Node to Given Two Nodes |
2360 |
Hard |
Longest Cycle in a Graph |
2365 |
Medium |
Task Scheduler II |
2366 |
Hard |
Minimum Replacements to Sort the Array |
2368 |
Medium |
Reachable Nodes With Restrictions |
2369 |
Medium |
Check if There is a Valid Partition For The Array |
2370 |
Medium |
Longest Ideal Subsequence |
2373 |
Easy |
Largest Local Values in a Matrix |
2374 |
Medium |
Node With Highest Edge Score |
2375 |
Medium |
Construct Smallest Number From DI String |
2380 |
Medium |
Time Needed to Rearrange a Binary String |
2385 |
Medium |
Amount of Time for Binary Tree to Be Infected |
2390 |
Medium |
Removing Stars From a String |
2391 |
Medium |
Minimum Amount of Time to Collect Garbage |
2392 |
Hard |
Build a Matrix With Conditions |
2396 |
Medium |
Strictly Palindromic Number |
2397 |
Medium |
Maximum Rows Covered by Columns |
2401 |
Medium |
Longest Nice Subarray |
2402 |
Hard |
Meeting Rooms III |
2405 |
Medium |
Optimal Partition of String |
2406 |
Medium |
Divide Intervals Into Minimum Number of Groups |
2410 |
Medium |
Maximum Matching of Players With Trainers |
2413 |
Easy |
Smallest Even Multiple |
2414 |
Medium |
Length of the Longest Alphabetical Continuous Substring |
2415 |
Medium |
Reverse Odd Levels of Binary Tree |
2416 |
Hard |
Sum of Prefix Scores of Strings |
2418 |
Easy |
Sort the People |
2419 |
Medium |
Longest Subarray With Maximum Bitwise AND |
2421 |
Medium |
Number of Good Paths |
2423 |
Easy |
Remove Letter To Equalize Frequency |
2424 |
Medium |
Longest Uploaded Prefix |
2425 |
Medium |
Bitwise XOR of All Pairings |
2428 |
Medium |
Maximum Sum of an Hourglass |
2433 |
Medium |
Find The Original Array of Prefix Xor |
2439 |
Medium |
Minimize Maximum of Array |
2441 |
Easy |
Largest Positive Integer That Exists With Its Negative |
2442 |
Medium |
Count Number of Distinct Integers After Reverse Operations |
2444 |
Hard |
Count Subarrays With Fixed Bounds |
2448 |
Hard |
Minimum Cost to Make Array Equal |
2452 |
Medium |
Words Within Two Edits of Dictionary |
2458 |
Hard |
Height of Binary Tree After Subtree Removal Queries |
2461 |
Medium |
Maximum Sum of Distinct Subarrays With Length K |
2462 |
Medium |
Total Cost to Hire K Workers |
2463 |
Medium |
Minimum Total Distance Traveled |
2465 |
Easy |
Number of Distinct Averages |
2466 |
Medium |
Count Ways To Build Good Strings |
2467 |
Medium |
Most Profitable Path in a Tree |
2469 |
Easy |
Convert the Temperature |
2471 |
Medium |
Minimum Number of Operations to Sort a Binary Tree by Level |
2477 |
Medium |
Minimum Fuel Cost to Report to the Capital |
2482 |
Medium |
Difference Between Ones and Zeros in Row and Column |
2483 |
Medium |
Minimum Penalty for a Shop |
2485 |
Easy |
Find the Pivot Integer |
2486 |
Medium |
Append Characters to String to Make Subsequence |
2487 |
Medium |
Remove Nodes From Linked List |
2490 |
Easy |
Circular Sentence |
2491 |
Medium |
Divide Players Into Teams of Equal Skill |
2492 |
Medium |
Minimum Score of a Path Between Two Cities |
2497 |
Medium |
Maximum Star Sum of a Graph |
2498 |
Medium |
Frog Jump II |
2501 |
Medium |
Longest Square Streak in an Array |
2516 |
Medium |
Take K of Each Character From Left and Right |
2517 |
Medium |
Maximum Tastiness of Candy Basket |
2526 |
Medium |
Find Consecutive Integers from a Data Stream |
2527 |
Medium |
Find Xor-Beauty of Array |
2530 |
Medium |
Maximal Score After Applying K Operations |
2536 |
Medium |
Increment Submatrices by One |
2537 |
Medium |
Count the Number of Good Subarrays |
2540 |
Easy |
Minimum Common Value |
2542 |
Medium |
Maximum Subsequence Score |
2545 |
Medium |
Sort the Students by Their Kth Score |
2551 |
Hard |
Put Marbles in Bags |
2554 |
Medium |
Maximum Number of Integers to Choose From a Range I |
2558 |
Easy |
Take Gifts From the Richest Pile |
2559 |
Medium |
Count Vowel Strings in Ranges |
2563 |
Medium |
Count the Number of Fair Pairs |
2568 |
Medium |
Minimum Impossible OR |
2571 |
Medium |
Minimum Operations to Reduce an Integer to 0 |
2574 |
Easy |
Left and Right Sum Differences |
2577 |
Hard |
Minimum Time to Visit a Cell In a Grid |
2579 |
Medium |
Count Total Number of Colored Cells |
2582 |
Easy |
Pass the Pillow |
2583 |
Medium |
Kth Largest Sum in a Binary Tree |
2588 |
Medium |
Count the Number of Beautiful Subarrays |
2592 |
Medium |
Maximize Greatness of an Array |
2593 |
Medium |
Find Score of an Array After Marking All Elements |
2596 |
Medium |
Check Knight Tour Configuration |
2597 |
Medium |
The Number of Beautiful Subsets |
2601 |
Medium |
Prime Subtraction Operation |
2606 |
Medium |
Find the Substring With Maximum Cost |
2610 |
Medium |
Convert an Array Into a 2D Array With Conditions |
2616 |
Medium |
Minimize the Maximum Difference of Pairs |
2620 |
Easy |
Counter |
2621 |
Easy |
Sleep |
2622 |
Medium |
Cache With Time Limit |
2623 |
Medium |
Memoize |
2626 |
Easy |
Array Reduce Transformation |
2627 |
Medium |
Debounce |
2629 |
Easy |
Function Composition |
2632 |
Medium |
Curry |
2634 |
Easy |
Filter Elements from Array |
2635 |
Easy |
Apply Transform Over Each Element in Array |
2636 |
Medium |
Promise Pool |
2637 |
Easy |
Promise Time Limit |
2640 |
Medium |
Find the Score of All Prefixes of an Array |
2641 |
Medium |
Cousins in Binary Tree II |
2642 |
Hard |
Design Graph With Shortest Path Calculator |
2645 |
Medium |
Minimum Additions to Make Valid String |
2657 |
Medium |
Find the Prefix Common Array of Two Arrays |
2658 |
Medium |
Maximum Number of Fish in a Grid |
2661 |
Medium |
First Completely Painted Row or Column |
2665 |
Easy |
Counter II |
2666 |
Easy |
Allow One Function Call |
2667 |
Easy |
Create Hello World Function |
2672 |
Medium |
Number of Adjacent Elements With the Same Color |
2673 |
Medium |
Make Costs of Paths Equal in a Binary Tree |
2676 |
Medium |
Throttle |
2678 |
Easy |
Number of Senior Citizens |
2679 |
Medium |
Sum in a Matrix |
2683 |
Medium |
Neighboring Bitwise XOR |
2684 |
Medium |
Maximum Number of Moves in a Grid |
2685 |
Medium |
Count the Number of Complete Components |
2696 |
Easy |
Minimum String Length After Removing Substrings |
2698 |
Medium |
Find the Punishment Number of an Integer |
2699 |
Hard |
Modify Graph Edge Weights |
2706 |
Easy |
Buy Two Chocolates |
2707 |
Medium |
Extra Characters in a String |
2709 |
Hard |
Greatest Common Divisor Traversal |
2711 |
Medium |
Difference of Number of Distinct Values on Diagonals |
2712 |
Medium |
Minimum Cost to Make All Characters Equal |
2740 |
Medium |
Find the Value of the Partition |
2742 |
Hard |
Painting the Walls |
2745 |
Medium |
Construct the Longest New String |
2751 |
Hard |
Robot Collisions |
2762 |
Medium |
Continuous Subarrays |
2766 |
Medium |
Relocate Marbles |
2767 |
Medium |
Partition String Into Minimum Beautiful Substrings |
2769 |
Easy |
Find the Maximum Achievable Number |
2779 |
Medium |
Maximum Beauty of an Array After Applying Operation |
2780 |
Medium |
Minimum Index of a Valid Split |
2785 |
Medium |
Sort Vowels in a String |
2798 |
Easy |
Number of Employees Who Met the Target |
2799 |
Medium |
Count Complete Subarrays in an Array |
2807 |
Medium |
Insert Greatest Common Divisors in Linked List |
2812 |
Medium |
Find the Safest Path in a Grid |
2816 |
Medium |
Double a Number Represented as a Linked List |
2824 |
Easy |
Count Pairs Whose Sum is Less than Target |
2825 |
Medium |
Make String a Subsequence Using Cyclic Increments |
2840 |
Medium |
Check if Strings Can be Made Equal With Operations II |
2849 |
Medium |
Determine if a Cell Is Reachable at a Given Time |
2856 |
Medium |
Minimum Array Length After Pair Removals |
2859 |
Easy |
Sum of Values at Indices With K Set Bits |
2860 |
Medium |
Happy Students |
2864 |
Easy |
Maximum Odd Binary Number |
2870 |
Medium |
Minimum Number of Operations to Make Array Empty |
2872 |
Hard |
Maximum Number of K-Divisible Components |
2894 |
Easy |
Divisible and Non-divisible Sums Difference |
2895 |
Medium |
Minimum Processing Time |
2900 |
Medium |
Longest Unequal Adjacent Groups Subsequence I |
2909 |
Medium |
Minimum Sum of Mountain Triplets II |
2914 |
Medium |
Minimum Number of Changes to Make Binary String Beautiful |
2924 |
Medium |
Find Champion II |
2931 |
Hard |
Maximum Spending After Buying Items |
2938 |
Medium |
Separate Black and White Balls |
2940 |
Hard |
Find Building Where Alice and Bob Can Meet |
2942 |
Easy |
Find Words Containing Character |
2947 |
Medium |
Count Beautiful Substrings I |
2952 |
Medium |
Minimum Number of Coins to be Added |
2957 |
Medium |
Remove Adjacent Almost-Equal Characters |
2958 |
Medium |
Length of Longest Subarray With at Most K Frequency |
2962 |
Medium |
Count Subarrays Where Max Element Appears at Least K Times |
2966 |
Medium |
Divide Array Into Arrays With Max Difference |
2971 |
Medium |
Find Polygon With the Largest Perimeter |
2976 |
Medium |
Minimum Cost to Convert String I |
2981 |
Medium |
Find Longest Special Substring That Occurs Thrice I |
2982 |
Medium |
Find Longest Special Substring That Occurs Thrice II |
2997 |
Medium |
Minimum Number of Operations to Make Array XOR Equal to K |
3005 |
Easy |
Count Elements With Maximum Frequency |
3011 |
Medium |
Find if Array Can Be Sorted |
3015 |
Medium |
Count the Number of Houses at a Certain Distance I |
3016 |
Medium |
Minimum Number of Pushes to Type Word II |
3034 |
Medium |
Number of Subarrays That Match a Pattern I |
3039 |
Medium |
Apply Operations to Make String Empty |
3043 |
Medium |
Find the Length of the Longest Common Prefix |
3067 |
Medium |
Count Pairs of Connectable Servers in a Weighted Tree Network |
3068 |
Hard |
Find the Maximum Sum of Node Values |
3070 |
Medium |
Count Submatrices with Top-Left Element and Sum Less Than k |
3075 |
Medium |
Maximize Happiness of Selected Children |
3080 |
Medium |
Mark Elements on Array by Performing Queries |
3097 |
Medium |
Shortest Subarray With OR at Least K II |
3100 |
Medium |
Water Bottles II |
3101 |
Medium |
Count Alternating Subarrays |
3106 |
Medium |
Lexicographically Smallest String After Operations With Constraint |
3110 |
Easy |
Score of a String |
3111 |
Medium |
Minimum Rectangles to Cover Points |
3133 |
Medium |
Minimum Array End |
3137 |
Medium |
Minimum Number of Operations to Make Word K-Periodic |
3146 |
Easy |
Permutation Difference between Two Strings |
3152 |
Medium |
Special Array II |
3159 |
Medium |
Find Occurrences of an Element in an Array |
3163 |
Medium |
String Compression III |
3190 |
Easy |
Find Minimum Operations to Make All Elements Divisible by Three |
3191 |
Medium |
Minimum Operations to Make Binary Array Elements Equal to One I |
3192 |
Medium |
Minimum Operations to Make Binary Array Elements Equal to One II |
3195 |
Medium |
Find the Minimum Area to Cover All Ones I |
3203 |
Hard |
Find Minimum Diameter After Merging Two Trees |
3211 |
Medium |
Generate Binary Strings Without Adjacent Zeros |
3212 |
Medium |
Count Submatrices With Equal Frequency of X and Y |
3217 |
Medium |
Delete Nodes From Linked List Present in Array |
3218 |
Medium |
Minimum Cost for Cutting Cake I |
3223 |
Medium |
Minimum Length of String After Operations |
3227 |
Medium |
Vowels Game in a String |
3228 |
Medium |
Maximum Number of Operations to Move Ones to the End |
3239 |
Medium |
Minimum Number of Flips to Make Binary Grid Palindromic I |
3243 |
Medium |
Shortest Distance After Road Addition Queries I |
3249 |
Medium |
Count the Number of Good Nodes |
3254 |
Medium |
Find the Power of K-Size Subarrays I |
3264 |
Easy |
Final Array State After K Multiplication Operations I |
3280 |
Easy |
Convert Date to Binary |
3285 |
Easy |
Find Indices of Stable Mountains |
3289 |
Easy |
The Two Sneaky Numbers of Digitville |
3291 |
Medium |
Minimum Number of Valid Strings to Form Target I |
3310 |
Medium |
Remove Methods From Project |