| 1 |
Two Sum |
C++ Go Python |
Easy |
| 2 |
Add Two Numbers |
C++ Go Python |
Medium |
| 3 |
Longest Substring Without Repeating Characters |
C++ Go Python |
Medium |
| 4 |
Median of Two Sorted Arrays |
C++ Go Python |
Hard |
| 5 |
Longest Palindromic Substring |
Go Python |
Medium |
| 6 |
ZigZag Conversion |
Go Python |
Medium |
| 7 |
Reverse Integer |
Python |
Easy |
| 8 |
String to Integer (atoi) |
Python |
Medium |
| 9 |
Palindrome Number |
Python |
Easy |
| 10 |
Regular Expression Matching |
Python |
Hard |
| 11 |
Container With Most Water |
C++ Python |
Medium |
| 12 |
Integer to Roman |
Python |
Medium |
| 13 |
Roman to Integer |
Go Python |
Easy |
| 14 |
Longest Common Prefix |
Python |
Easy |
| 15 |
3Sum |
C++ Python |
Medium |
| 16 |
3Sum Closest |
Python |
Medium |
| 17 |
Letter Combinations of a Phone Number |
Python |
Medium |
| 18 |
4Sum |
Python |
Medium |
| 19 |
Remove Nth Node From End of List |
C++ Python |
Medium |
| 20 |
Valid Parentheses |
C++ Python |
Easy |
| 21 |
Merge Two Sorted Lists |
C++ Python |
Easy |
| 22 |
Generate Parentheses |
Python |
Medium |
| 23 |
Merge k Sorted Lists |
Python |
Hard |
| 24 |
Swap Nodes in Pairs |
Python |
Medium |
| 25 |
Reverse Nodes in k-Group |
C++ |
Medium |
| 26 |
Remove Duplicates from Sorted Array |
Python |
Easy |
| 27 |
Remove Element |
Python |
Easy |
| 28 |
Find the Index of the First Occurrence in a String |
Go Python |
Easy |
| 29 |
Divide Two Integers |
Go |
Medium |
| 30 |
Substring with Concatenation of All Words |
C++ Go |
Hard |
| 32 |
Longest Valid Parentheses |
Python |
Hard |
| 33 |
Search in Rotated Sorted Array |
C++ Python |
Medium |
| 34 |
Find First and Last Position of Element in Sorted Array |
C++ Go |
Medium |
| 36 |
Valid Sudoku |
C++ |
Medium |
| 38 |
Count and Say |
Go |
Medium |
| 39 |
Combination Sum |
Go Python |
Medium |
| 40 |
Combination Sum II |
Go |
Medium |
| 41 |
First Missing Positive |
Python |
Hard |
| 42 |
Trapping Rain Water |
Go Python |
Hard |
| 45 |
Jump Game II |
Go Python |
Hard |
| 46 |
Permutations |
Python |
Medium |
| 48 |
Rotate Image |
C++ Python |
Medium |
| 49 |
Group Anagrams |
C++ Go Python |
Medium |
| 50 |
Pow(x, n) |
Python |
Medium |
| 51 |
N-Queens |
Go |
Hard |
| 52 |
N-Queens II |
Go Python |
Hard |
| 53 |
Maximum Subarray |
Go Python |
Easy |
| 54 |
Spiral Matrix |
C++ Go |
Medium |
| 55 |
Jump Game |
Go Python |
Medium |
| 56 |
Merge Intervals |
C++ Python |
Medium |
| 57 |
Insert Interval |
C++ |
Medium |
| 58 |
Length of Last Word |
Python |
Easy |
| 59 |
Spiral Matrix II |
Go |
Medium |
| 61 |
Rotate List |
C++ |
Medium |
| 62 |
Unique Paths |
Go Python |
Medium |
| 63 |
Unique Paths II |
Go |
Medium |
| 64 |
Minimum Path Sum |
Go Python |
Medium |
| 68 |
Text Justification |
Python |
Hard |
| 69 |
Sqrt(x) |
Python |
Easy |
| 70 |
Climbing Stairs |
Go Python |
Easy |
| 71 |
Simplify Path |
C++ |
Medium |
| 72 |
Edit Distance |
Go Python |
Hard |
| 73 |
Set Matrix Zeroes |
C++ Go |
Medium |
| 75 |
Sort Colors |
Go Python |
Medium |
| 76 |
Minimum Window Substring |
C++ |
Hard |
| 77 |
Letter Combinations |
Python |
Medium |
| 78 |
Subsets |
Go Python |
Medium |
| 79 |
Word Search |
Python |
Medium |
| 80 |
Remove Duplicates from Sorted Array II |
Python |
Medium |
| 82 |
Remove Duplicates from Sorted List II |
C++ |
Medium |
| 84 |
Largest Rectangle in Histogram |
Python |
Hard |
| 85 |
Maximal Rectangle |
Python |
Hard |
| 86 |
Partition List |
C++ Go |
Medium |
| 88 |
Merge Sorted Array |
Go Python |
Easy |
| 91 |
Decode Ways |
Go |
Medium |
| 92 |
Reverse Linked List II |
C++ Go |
Medium |
| 94 |
Binary Tree Inorder Traversal |
Python |
Medium |
| 95 |
Unique Binary Search Trees II |
Go |
Medium |
| 96 |
Unique Binary Search Trees |
Go Python |
Medium |
| 97 |
Interleaving String |
Go |
Medium |
| 98 |
Validate Binary Search Tree |
Go Python |
Medium |
| 100 |
Same Tree |
Python |
Easy |
| 101 |
Symmetric Tree |
Python |
Easy |
| 102 |
Binary Tree Level Order Traversal |
Go Python |
Medium |
| 103 |
Binary Tree Zigzag Level Order Traversal |
Python |
Medium |
| 104 |
Maximum Depth of Binary Tree |
Go Python |
Easy |
| 105 |
Construct Binary Tree from Preorder and Inorder Traversal |
Go Python |
Medium |
| 106 |
Construct Binary Tree from Inorder and Postorder Traversal |
Python |
Medium |
| 108 |
Convert Sorted Array to Binary Search Tree |
Go |
Easy |
| 112 |
Path Sum |
Python |
Easy |
| 114 |
Flatten Binary Tree to Linked List |
Go Python |
Medium |
| 117 |
Populating Next Right Pointers in Each Node II |
Python |
Medium |
| 118 |
Pascal's Triangle |
Go |
Easy |
| 119 |
Pascal's Triangle II |
Go |
Easy |
| 120 |
Triangle |
Go |
Medium |
| 121 |
Best Time to Buy and Sell Stock |
Go Python |
Easy |
| 122 |
Best Time to Buy and Sell Stock II |
Go Python |
Medium |
| 123 |
Best Time to Buy and Sell Stock III |
Python |
Hard |
| 124 |
Binary Tree Maximum Path Sum |
Python |
Hard |
| 125 |
Populating Next Right Pointers in Each Node II |
Python |
Easy |
| 126 |
Word Ladder II |
Go |
Hard |
| 127 |
Word Ladder |
Python |
Hard |
| 128 |
Longest Consecutive Sequence |
C++ Go |
Medium |
| 129 |
Sum Root to Leaf Numbers |
Python |
Medium |
| 134 |
Gas Station |
Python |
Medium |
| 135 |
Candy |
Go Python |
Hard |
| 137 |
Single Number II |
Go |
Medium |
| 138 |
Copy List with Random Pointer |
C++ |
Medium |
| 139 |
Word Break |
Go |
Medium |
| 141 |
Linked List Cycle |
C++ |
Easy |
| 150 |
Evaluate Reverse Polish Notation |
C++ |
Medium |
| 151 |
Reverse Words in a String |
Python |
Medium |
| 152 |
Maximum Product Subarray |
Go |
Medium |
| 155 |
Min Stack |
C++ |
Medium |
| 160 |
Intersection of Two Linked Lists |
Go |
Easy |
| 165 |
Compare Version Numbers |
Go |
Medium |
| 167 |
Two Sum II - Input Array Is Sorted |
Go Python |
Medium |
| 169 |
Majority Element |
Python |
Easy |
| 173 |
Binary Search Tree Iterator |
Python |
Medium |
| 188 |
Best Time to Buy and Sell Stock IV |
Python |
Hard |
| 189 |
Rotate Array |
Python |
Medium |
| 191 |
Number of 1 Bits |
C++ Go |
Easy |
| 198 |
House Robber |
Go |
Medium |
| 199 |
Binary Tree Right Side View |
Go Python |
Medium |
| 200 |
Number of Islands |
Go |
Medium |
| 202 |
Happy Number |
C++ Go |
Easy |
| 205 |
Isomorphic Strings |
C++ |
Easy |
| 206 |
Reverse Linked List |
Go |
Easy |
| 207 |
Course Schedule |
Go |
Medium |
| 208 |
Implement Trie (Prefix Tree) |
Go |
Medium |
| 209 |
Minimum Size Subarray Sum |
C++ |
Medium |
| 210 |
Course Schedule II |
Go |
Medium |
| 213 |
House Robber II |
Go |
Medium |
| 215 |
Kth Largest Element in an Array |
C++ Go |
Medium |
| 216 |
Combination Sum III |
Go |
Medium |
| 217 |
Contains Duplicate |
Go |
Easy |
| 219 |
Contains Duplicate II |
C++ |
Easy |
| 221 |
Maximal Square |
Go |
Medium |
| 222 |
Count Complete Tree Nodes |
Python |
Easy |
| 226 |
Invert Binary Tree |
Python |
Easy |
| 227 |
Basic Calculator II |
C++ |
Medium |
| 228 |
Summary Ranges |
C++ |
Easy |
| 231 |
Power of Two |
C++ |
Easy |
| 232 |
Implement Queue using Stacks |
Go |
Easy |
| 235 |
Lowest Common Ancestor of a Binary Search Tree |
Go |
Easy |
| 236 |
Lowest Common Ancestor of a Binary Tree |
Go Python |
Medium |
| 237 |
Delete Node in a Linked List |
Go |
Medium |
| 238 |
Product of Array Except Self |
Python |
Medium |
| 240 |
Search a 2D Matrix II |
Go |
Medium |
| 242 |
Valid Anagram |
C++ Go |
Easy |
| 244 |
Basic Calculator |
C++ |
Hard |
| 255 |
Verify Preorder Sequence in Binary Search Tree |
Go |
Medium |
| 263 |
Ugly Number |
Go |
Easy |
| 264 |
Ugly Number |
Go |
Easy |
| 268 |
Missing Number |
Go |
Easy |
| 272 |
Closest Binary Search Tree Value II |
Go |
Hard |
| 273 |
Integer to English Words |
Go |
Hard |
| 274 |
H-Index |
Python |
Medium |
| 279 |
Perfect Squares |
Go |
Medium |
| 283 |
Move Zeroes |
Go |
Easy |
| 285 |
Inorder Successor in BST |
Go |
Medium |
| 289 |
Game of Life |
C++ |
Medium |
| 290 |
Word Pattern |
C++ |
Easy |
| 300 |
Longest Increasing Subsequence |
Go |
Medium |
| 302 |
Smallest Rectangle Enclosing Black Pixels |
Go |
Hard |
| 303 |
Range Sum Query - Immutable |
Go |
Easy |
| 304 |
Range Sum Query 2D - Immutable |
Go |
Medium |
| 307 |
Range Sum Query - Immutable |
Go |
Easy |
| 309 |
Best Time to Buy and Sell Stock with Cooldown |
Go |
Medium |
| 311 |
Sparse Matrix Multiplication |
Go |
Medium |
| 314 |
Binary Tree Vertical Order Traversal |
C++ |
Medium |
| 315 |
Count of Smaller Numbers After Self |
Go |
Hard |
| 317 |
Shortest Distance from All Buildings |
Go |
Hard |
| 318 |
Maximum Product of Word Lengths |
Go |
Easy |
| 322 |
Coin Change |
Go |
Medium |
| 323 |
Number of Connected Components in an Undirected Graph |
Go |
Medium |
| 325 |
Maximum Size Subarray Sum Equals k |
Go |
Medium |
| 326 |
Power of Three |
Go |
Easy |
| 333 |
Largest BST Subtree |
Go |
Medium |
| 343 |
Integer Break |
Go |
Medium |
| 353 |
Design Snake Game |
Go |
Medium |
| 359 |
Logger Rate Limiter |
Go |
Easy |
| 361 |
Bomb Enemy |
Go |
Medium |
| 368 |
Largest Divisible Subset |
Go |
Medium |
| 376 |
Wiggle Subsequence |
Go |
Medium |
| 377 |
Combination Sum IV |
Go |
Medium |
| 378 |
Kth Smallest Element in a Sorted Matrix |
Go |
Medium |
| 380 |
Insert Delete GetRandom O(1) |
C++ Go Python |
Medium |
| 381 |
Insert Delete GetRandom O(1) - Duplicates allowed |
C++ |
Hard |
| 383 |
Ransom Note |
C++ Go |
Easy |
| 386 |
Lexicographical Numbers |
Go |
Medium |
| 387 |
Roman to Integer |
Go |
Easy |
| 389 |
Find the Difference |
Go |
Easy |
| 392 |
Is Subsequence |
Go Python |
Easy |
| 404 |
Sum of Left Leaves |
Go |
Easy |
| 406 |
Queue Reconstruction by Height |
Go |
Medium |
| 407 |
Trapping Rain Water II |
Go Python |
Medium |
| 413 |
Arithmetic Slices |
Go |
Medium |
| 416 |
Partition Equal Subset Sum |
Go |
Medium |
| 425 |
Word Squares |
Go |
Hard |
| 426 |
Convert Binary Search Tree to Sorted Doubly Linked List |
Go |
Medium |
| 433 |
Minimum Genetic Mutation |
Python |
Medium |
| 440 |
K-th Smallest in Lexicographical Order |
Go |
Hard |
| 452 |
Minimum Number of Arrows to Burst Balloons |
C++ |
Medium |
| 458 |
Poor Pigs |
Go |
Hard |
| 462 |
Minimum Moves to Equal Array Elements II |
Go |
Medium |
| 473 |
Matchsticks to Square |
Go |
Medium |
| 494 |
Target Sum |
Go |
Medium |
| 496 |
Next Greater Element I |
Go |
Easy |
| 506 |
Relative Ranks |
Go |
Easy |
| 509 |
Fibonacci Number |
Go |
Easy |
| 515 |
Find Largest Value in Each Tree Row |
Go |
Medium |
| 516 |
Longest Palindromic Subsequence |
Go |
Medium |
| 518 |
Coin Change 2 |
Go |
Medium |
| 527 |
Word Abbreviation |
Go |
Hard |
| 530 |
Minimum Absolute Difference in BST |
Python |
Easy |
| 566 |
Reshape the Matrix |
Go |
Easy |
| 576 |
Out of Boundary Paths |
Go |
Medium |
| 583 |
Delete Operation for Two Strings |
Go |
Medium |
| 589 |
N-ary Tree Preorder Traversal |
Go |
Easy |
| 594 |
Longest Harmonious Subsequence |
Go |
Easy |
| 629 |
K Inverse Pairs Array |
Go |
Hard |
| 630 |
Course Schedule III |
Go |
Hard |
| 633 |
Sum of Square Numbers |
Go |
Medium |
| 637 |
Average of Levels in Binary Tree |
Python |
Easy |
| 641 |
Design Circular Deque |
C++ |
Medium |
| 663 |
Equal Tree Partition |
Go |
Medium |
| 665 |
Non-decreasing Array |
Go |
Medium |
| 683 |
K Empty Slots |
Go |
Hard |
| 684 |
Redundant Connection |
Go |
Medium |
| 689 |
Maximum Sum of 3 Non-Overlapping Subarrays |
Go |
Hard |
| 695 |
Max Area of Island |
Go |
Medium |
| 707 |
Design Linked List |
C++ |
Medium |
| 709 |
To Lower Case |
Go |
Easy |
| 714 |
Best Time to Buy and Sell Stock with Transaction Fee |
Go |
Medium |
| 722 |
Basic Calculator III |
C++ |
Hard |
| 729 |
My Calendar I |
Go |
Medium |
| 740 |
Delete and Earn |
Go |
Medium |
| 745 |
Prefix and Suffix Search |
Go |
Hard |
| 746 |
Min Cost Climbing Stairs |
Go |
Easy |
| 763 |
Partition Labels |
Go |
Medium |
| 769 |
Max Chunks To Make Sorted |
Go |
Medium |
| 781 |
Rabbits in Forest |
Go |
Medium |
| 790 |
Domino and Tromino Tiling |
Go |
Medium |
| 792 |
Number of Matching Subsequences |
Go |
Medium |
| 802 |
Find Eventual Safe States |
Go |
Medium |
| 804 |
Unique Morse Code Words |
Go |
Easy |
| 808 |
Soup Servings |
C++ |
Medium |
| 820 |
Short Encoding of Words |
Go |
Medium |
| 823 |
Binary Trees With Factors |
Go |
Medium |
| 827 |
Making A Large Island |
Go |
Hard |
| 834 |
Sum of Distances in Tree |
Go |
Hard |
| 838 |
Push Dominoes |
Go |
Medium |
| 848 |
Shifting Letters |
Go |
Medium |
| 858 |
Mirror Reflection |
Go |
Medium |
| 867 |
Transpose Matrix |
Go Python |
Easy |
| 869 |
Reordered Power of 2 |
C++ |
Medium |
| 873 |
Length of Longest Fibonacci Subsequence |
Go |
Medium |
| 876 |
Middle of the Linked List |
Go |
Easy |
| 881 |
Boats to Save People |
Go |
Medium |
| 884 |
Uncommon Words from Two Sentences |
Go |
Easy |
| 885 |
Spiral Matrix III |
Go |
Medium |
| 889 |
Construct Binary Tree from Preorder and Postorder Traversal |
Go |
Medium |
| 890 |
Find and Replace Pattern |
Go |
Medium |
| 898 |
Bitwise ORs of Subarrays |
Go |
Medium |
| 904 |
Fruit Into Baskets |
C++ |
Medium |
| 909 |
Snakes and Ladders |
Go |
Medium |
| 916 |
Word Subsets |
Go |
Medium |
| 918 |
Maximum Sum Circular Subarray |
Go |
Medium |
| 931 |
Minimum Falling Path Sum |
Go |
Medium |
| 945 |
Minimum Increment to Make Array Unique |
Go |
Medium |
| 953 |
Verifying an Alien Dictionary |
Go |
Easy |
| 959 |
Regions Cut By Slashes |
Go |
Medium |
| 968 |
Binary Tree Cameras |
Go |
Hard |
| 975 |
Odd Even Jump |
Go |
Hard |
| 976 |
Largest Perimeter Triangle |
Go |
Easy |
| 983 |
Minimum Cost For Tickets |
Go |
Medium |
| 1007 |
Minimum Domino Rotations For Equal Row |
Go |
Medium |
| 1014 |
Best Sightseeing Pair |
Go |
Medium |
| 1026 |
Determine if String Halves Are Alike |
Go |
Medium |
| 1028 |
Recover a Tree From Preorder Traversal |
Go |
Hard |
| 1048 |
Longest String Chain |
Go |
Medium |
| 1055 |
Shortest Way to Form String |
Go |
Medium |
| 1061 |
Lexicographically Smallest Equivalent String |
Go |
Medium |
| 1074 |
Number of Submatrices That Sum to Target |
Go |
Hard |
| 1079 |
Letter Tile Possibilities |
Go |
Medium |
| 1092 |
Shortest Common Supersequence |
Go |
Hard |
| 1122 |
Relative Sort Array |
Go |
Easy |
| 1123 |
Lowest Common Ancestor of Deepest Leaves |
Go |
Medium |
| 1128 |
Number of Equivalent Domino Pairs |
Go |
Easy |
| 1137 |
N-th Tribonacci Number |
Go |
Easy |
| 1143 |
Longest Common Subsequence |
Go |
Medium |
| 1198 |
Find Smallest Common Element in All Rows |
C++ |
Medium |
| 1207 |
Unique Number of Occurrences |
Go |
Easy |
| 1220 |
Count Vowels Permutation |
Go |
Hard |
| 1232 |
Check If It Is a Straight Line |
Go |
Easy |
| 1233 |
Remove Sub-Folders from the Filesystem |
Go |
Medium |
| 1255 |
Maximum Score Words Formed by Letters |
Go |
Hard |
| 1261 |
Find Elements in a Contaminated Binary Tree |
Go |
Medium |
| 1267 |
Count Servers that Communicate |
Go |
Medium |
| 1268 |
Search Suggestions System |
Go |
Medium |
| 1281 |
Subtract the Product and Sum of Digits of an Integer |
Go |
Easy |
| 1289 |
Minimum Falling Path Sum II |
Go |
Hard |
| 1290 |
Convert Binary Number in a Linked List to Integer |
Go |
Easy |
| 1295 |
Find Numbers with Even Number of Digits |
Go |
Easy |
| 1298 |
Maximum Candies You Can Get from Boxes |
Go |
Hard |
| 1309 |
Decrypt String from Alphabet to Integer Mapping |
Go |
Easy |
| 1314 |
Matrix Block Sum |
Go |
Medium |
| 1332 |
Remove Palindromic Subsequences |
Go |
Easy |
| 1338 |
Reduce Array Size to The Half |
Go |
Medium |
| 1342 |
Number of Steps to Reduce a Number to Zero |
C++ Go |
Easy |
| 1346 |
Check If N and Its Double Exist |
Go |
Easy |
| 1347 |
Minimum Number of Steps to Make Two Strings Anagram |
Go |
Medium |
| 1352 |
Product of the Last K Numbers |
Go |
Medium |
| 1353 |
Maximum Number of Events That Can Be Attended |
Go |
Medium |
| 1354 |
Construct Target Array With Multiple Sums |
Go |
Hard |
| 1356 |
Sort Integers by The Number of 1 Bits |
Go |
Easy |
| 1358 |
Number of Substrings Containing All Three Characters |
Go |
Medium |
| 1368 |
Minimum Cost to Make at Least One Valid Path in a Grid |
Go |
Hard |
| 1394 |
Find Lucky Integer in an Array |
Go |
Easy |
| 1399 |
Count Largest Group |
Go |
Easy |
| 1400 |
Construct K Palindrome Strings |
Go |
Medium |
| 1405 |
Longest Happy String |
Go |
Medium |
| 1408 |
String Matching in an Array |
Go |
Easy |
| 1415 |
The k-th Lexicographical String of All Happy Strings of Length n |
Go |
Medium |
| 1422 |
Maximum Score After Splitting a String |
Go |
Easy |
| 1423 |
Maximum Points You Can Obtain from Cards |
Go |
Medium |
| 1429 |
First Unique Number |
Go |
Medium |
| 1432 |
Max Difference You Can Get From Changing an Integer |
Go |
Medium |
| 1438 |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
Go |
Medium |
| 1455 |
Check If a Word Occurs As a Prefix of Any Word in a Sentence |
Go |
Easy |
| 1460 |
Make Two Arrays Equal by Reversing Subarrays |
Go |
Easy |
| 1461 |
Check If a String Contains All Binary Codes of Size K |
Go |
Medium |
| 1462 |
Course Schedule IV |
Go |
Medium |
| 1465 |
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
Go |
Medium |
| 1473 |
Paint House III |
Go |
Hard |
| 1474 |
Delete N Nodes After M Nodes of a Linked List |
Go |
Easy |
| 1475 |
Final Prices With a Special Discount in a Shop |
Go |
Easy |
| 1480 |
Running Sum of 1d Array |
Go |
Easy |
| 1491 |
Average Salary Excluding the Minimum and Maximum Salary |
Go |
Easy |
| 1498 |
Number of Subsequences That Satisfy the Given Sum Condition |
Go |
Medium |
| 1502 |
Can Make Arithmetic Progression From Sequence |
Go |
Easy |
| 1508 |
Range Sum of Sorted Subarray Sums |
Go |
Medium |
| 1509 |
Minimum Difference Between Largest and Smallest Value in Three Moves |
Go |
Medium |
| 1523 |
Count Odd Numbers in an Interval Range |
Go |
Easy |
| 1524 |
Number of Sub-arrays With Odd Sum |
Go |
Medium |
| 1534 |
Count Good Triplets |
Go |
Easy |
| 1550 |
Three Consecutive Odds |
Go |
Easy |
| 1567 |
Maximum Length of Subarray With Positive Product |
Go |
Medium |
| 1572 |
Matrix Diagonal Sum |
Go |
Easy |
| 1588 |
Sum of All Odd Length Subarrays |
Go |
Easy |
| 1593 |
// Split a String Into the Max Number of Unique Substrings |
Go |
Medium |
| 1603 |
Design Parking System |
Go |
Easy |
| 1639 |
Number of Ways to Form a Target String Given a Dictionary |
Go |
Hard |
| 1642 |
Furthest Building You Can Reach |
Go |
Medium |
| 1647 |
Minimum Deletions to Make Character Frequencies Unique |
Go |
Medium |
| 1653 |
Minimum Deletions to Make String Balanced |
Go |
Medium |
| 1657 |
Determine if Two Strings Are Close |
Go |
Medium |
| 1658 |
Minimum Operations to Reduce X to Zero |
Go |
Medium |
| 1672 |
Richest Customer Wealth |
Go |
Easy |
| 1678 |
Goal Parser Interpretation |
Go |
Easy |
| 1689 |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
Go |
Medium |
| 1695 |
Maximum Erasure Value |
Go |
Medium |
| 1696 |
Jump Game VI |
Go |
Medium |
| 1704 |
Determine if String Halves Are Alike |
Go |
Easy |
| 1710 |
Maximum Units on a Truck |
Go |
Easy |
| 1717 |
Maximum Score From Removing Substrings |
Go |
Medium |
| 1718 |
Construct the Lexicographically Largest Valid Sequence |
Go |
Medium |
| 1726 |
Tuple with Same Product |
Go |
Medium |
| 1749 |
Maximum Absolute Sum of Any Subarray |
Go |
Medium |
| 1751 |
Maximum Number of Events That Can Be Attended II |
Go |
Medium |
| 1752 |
Check if Array Is Sorted and Rotated |
Go |
Easy |
| 1760 |
Minimum Limit of Balls in a Bag |
Go |
Medium |
| 1765 |
Map of Highest Peak |
Go |
Medium |
| 1768 |
Merge Strings Alternately |
Go |
Easy |
| 1769 |
Minimum Number of Operations to Move All Balls to Each Box |
Go |
Medium |
| 1779 |
Find Nearest Point That Has the Same X or Y Coordinate |
Go |
Easy |
| 1780 |
Check if Number is a Sum of Powers of Three |
Go |
Medium |
| 1790 |
Check if One String Swap Can Make Strings Equal |
Go |
Easy |
| 1792 |
Maximum Average Pass Ratio |
Go |
Medium |
| 1800 |
Maximum Ascending Subarray Sum |
Go |
Easy |
| 1822 |
Sign of the Product of an Array |
Go |
Easy |
| 1857 |
Largest Color Value in a Directed Graph |
Go |
Hard |
| 1863 |
Sum of All Subset XOR Totals |
Go |
Easy |
| 1865 |
Finding Pairs With a Certain Sum |
Go |
Medium |
| 1900 |
The Earliest and Latest Rounds Where Players Compete |
Go |
Hard |
| 1910 |
Remove All Occurrences of a Substring |
Go |
Medium |
| 1915 |
Number of Wonderful Substrings |
Go |
Medium |
| 1920 |
Build Array from Permutation |
Go |
Easy |
| 1922 |
Count Good Numbers |
Go |
Medium |
| 1930 |
Unique Length-3 Palindromic Subsequences |
Go |
Medium |
| 1931 |
Painting a Grid With Three Different Colors |
Go |
Hard |
| 1948 |
Delete Duplicate Folders in System |
Go |
Hard |
| 1957 |
Delete Characters to Make Fancy String |
Go |
Easy |
| 1976 |
Number of Ways to Arrive at Destination |
Go |
Medium |
| 1980 |
Find Unique Binary String |
Go |
Medium |
| 2000 |
Reverse Prefix of Word |
Go |
Easy |
| 2014 |
Longest Subsequence Repeated k Times |
Go |
Hard |
| 2016 |
Maximum Difference Between Increasing Elements |
Go |
Easy |
| 2017 |
Grid Game |
Go |
Medium |
| 2033 |
Minimum Operations to Make a Uni-Value Grid |
Go |
Medium |
| 2037 |
Minimum Number of Moves to Seat Everyone |
Go |
Easy |
| 2040 |
Kth Smallest Product of Two Sorted Arrays |
Go |
Hard |
| 2044 |
Count Number of Maximum Bitwise-OR Subsets |
Go |
Medium |
| 2054 |
Two Best Non-Overlapping Events |
Go |
Medium |
| 2071 |
Maximum Number of Tasks You Can Assign |
Go |
Hard |
| 2081 |
Sum of k-Mirror Numbers |
Go |
Hard |
| 2094 |
Finding 3-Digit Even Numbers |
Go |
Easy |
| 2099 |
Find Subsequence of Length K With the Largest Sum |
Go |
Easy |
| 2106 |
Maximum Fruits Harvested After at Most K Steps |
C++ |
Hard |
| 2109 |
Adding Spaces to a String |
Go |
Medium |
| 2115 |
Find All Possible Recipes from Given Supplies |
Go |
Medium |
| 2116 |
Check if a Parentheses String Can Be Valid |
Go |
Medium |
| 2125 |
Number of Laser Beams in a Bank |
Go |
Medium |
| 2127 |
Maximum Employees to Be Invited to a Meeting |
Go |
Hard |
| 2131 |
Longest Palindrome by Concatenating Two Letter Words |
Go |
Medium |
| 2134 |
Minimum Swaps to Group All 1's Together II |
Go |
Medium |
| 2138 |
Divide a String Into Groups of Size k |
Go |
Easy |
| 2140 |
Solving Questions With Brainpower |
Go |
Medium |
| 2145 |
Count the Hidden Sequences |
Go |
Medium |
| 2161 |
Partition Array According to Given Pivot |
Go |
Easy |
| 2163 |
Minimum Difference in Sums After Removal of Elements |
Go |
Hard |
| 2176 |
Count Equal and Divisible Pairs in an Array |
Go |
Easy |
| 2179 |
Count Good Triplets in an Array |
Go |
Hard |
| 2181 |
Merge Nodes in Between Zeros |
Go |
Medium |
| 2182 |
Construct String With Repeat Limit |
Go |
Medium |
| 2185 |
Counting Words With a Given Prefix |
Go |
Easy |
| 2200 |
Find All K-Distant Indices in an Array |
Go |
Easy |
| 2206 |
Divide Array Into Equal Pairs |
Go |
Easy |
| 2210 |
Count Hills and Valleys in an Array |
Go |
Easy |
| 2225 |
Find Players With Zero or One Losses |
Go |
Medium |
| 2266 |
Maximum Candies Allocated to K Children |
Go |
Medium |
| 2270 |
Number of Ways to Split Array |
Go |
Medium |
| 2294 |
Partition Array Such That Maximum Difference Is K |
Go |
Medium |
| 2302 |
Count Subarrays With Score Less Than K |
Go |
Hard |
| 2311 |
Longest Binary Subsequence Less Than or Equal to K |
Go |
Medium |
| 2319 |
Check if Matrix Is X-Matrix |
Go |
Easy |
| 2320 |
Count Number of Ways to Place Houses |
Go |
Medium |
| 2321 |
Maximum Score Of Spliced Array |
Go |
Hard |
| 2322 |
Minimum Score After Removals on a Tree |
Go |
Hard |
| 2326 |
Spiral Matrix IV |
Go |
Medium |
| 2331 |
Evaluate Boolean Binary Tree |
Go |
Easy |
| 2337 |
Move Pieces to Obtain a String |
Go |
Medium |
| 2338 |
Count the Number of Ideal Arrays |
Go |
Hard |
| 2342 |
Max Sum of a Pair With Equal Sum of Digits |
Go |
Medium |
| 2349 |
Design a Number Container System |
Go |
Medium |
| 2364 |
Count Number of Bad Pairs |
Go |
Medium |
| 2375 |
Construct Smallest Number From DI String |
Go |
Medium |
| 2379 |
Minimum Recolors to Get K Consecutive Black Blocks |
Go |
Easy |
| 2381 |
Shifting Letters II |
Go |
Medium |
| 2401 |
Longest Nice Subarray |
Go |
Medium |
| 2402 |
Meeting Rooms III |
Go |
Hard |
| 2410 |
Maximum Matching of Players With Trainers |
Go |
Medium |
| 2411 |
Smallest Subarrays With Maximum Bitwise OR |
Go |
Medium |
| 2415 |
Reverse Odd Levels of Binary Tree |
Go |
Medium |
| 2419 |
Longest Subarray With Maximum Bitwise AND |
Go |
Medium |
| 2425 |
Bitwise XOR of All Pairings |
Go |
Medium |
| 2429 |
Minimize XOR |
Go |
Medium |
| 2434 |
Using a Robot to Print the Lexicographically Smallest String |
Go |
Medium |
| 2441 |
Largest Positive Integer That Exists With Its Negative |
Go |
Easy |
| 2444 |
Count Subarrays With Fixed Bounds |
Go |
Hard |
| 2460 |
Apply Operations to an Array |
Go |
Easy |
| 2466 |
Count Ways To Build Good Strings |
Go |
Medium |
| 2467 |
Most Profitable Path in a Tree |
Go |
Medium |
| 2471 |
Minimum Number of Operations to Sort a Binary Tree by Level |
Go |
Medium |
| 2487 |
Remove Nodes From Linked List |
Go |
Medium |
| 2493 |
Divide Nodes Into the Maximum Number of Groups |
Go |
Hard |
| 2503 |
Maximum Number of Points From Grid Queries |
Go |
Hard |
| 2523 |
Closest Prime Numbers in Range |
Go |
Medium |
| 2529 |
Maximum Count of Positive Integer and Negative Integer |
Go |
Easy |
| 2537 |
Count the Number of Good Subarrays |
Go |
Medium |
| 2551 |
Put Marbles in Bags |
Go |
Hard |
| 2554 |
Maximum Number of Integers to Choose From a Range I |
Go |
Medium |
| 2558 |
Take Gifts From the Richest Pile |
Go |
Easy |
| 2559 |
Count Vowel Strings in Ranges |
Go |
Medium |
| 2560 |
House Robber IV |
Go |
Medium |
| 2561 |
Rearranging Fruits |
C++ |
Hard |
| 2563 |
Count the Number of Fair Pairs |
Go |
Medium |
| 2566 |
Maximum Difference by Remapping a Digit |
Go |
Easy |
| 2570 |
Merge Two 2D Arrays by Summing Values |
Go |
Easy |
| 2579 |
Count Total Number of Colored Cells |
Go |
Medium |
| 2593 |
Find Score of an Array After Marking All Elements |
Go |
Medium |
| 2594 |
Minimum Time to Repair Cars |
Go |
Medium |
| 2616 |
Minimize the Maximum Difference of Pairs |
Go |
Medium |
| 2657 |
Find the Prefix Common Array of Two Arrays |
Go |
Medium |
| 2658 |
Maximum Number of Fish in a Grid |
Go |
Medium |
| 2661 |
First Completely Painted Row or Column |
Go Python |
Medium |
| 2683 |
Neighboring Bitwise XOR |
Go |
Medium |
| 2685 |
Count the Number of Complete Components |
Go |
Medium |
| 2698 |
Find the Punishment Number of an Integer |
Go |
Medium |
| 2762 |
Continuous Subarrays |
Go |
Medium |
| 2779 |
Maximum Beauty of an Array After Applying Operation |
Go |
Medium |
| 2780 |
Minimum Index of a Valid Split |
Go |
Medium |
| 2799 |
Count Complete Subarrays in an Array |
Go |
Medium |
| 2816 |
Double a Number Represented as a Linked List |
Go |
Medium |
| 2818 |
Apply Operations to Maximize Score |
Go |
Medium |
| 2825 |
Make String a Subsequence Using Cyclic Increments |
Go |
Medium |
| 2845 |
Count of Interesting Subarrays |
Go |
Medium |
| 2870 |
Minimum Number of Operations to Make Array Empty |
Go |
Medium |
| 2872 |
Maximum Number of K-Divisible Components |
Go |
Hard |
| 2873 |
Maximum Value of an Ordered Triplet I |
Go |
Easy |
| 2874 |
Maximum Value of an Ordered Triplet II |
Go |
Medium |
| 2894 |
Divisible and Non-divisible Sums Difference |
Go |
Easy |
| 2900 |
Longest Unequal Adjacent Groups Subsequence I |
Go |
Easy |
| 2901 |
Longest Unequal Adjacent Groups Subsequence II |
Go |
Medium |
| 2918 |
Minimum Equal Sum of Two Arrays After Replacing Zeros |
Go |
Medium |
| 2927 |
Distribute Candies Among Children III |
Go |
Hard |
| 2928 |
Distribute Candies Among Children I |
Go |
Easy |
| 2929 |
Distribute Candies Among Children II |
Go |
Medium |
| 2938 |
Separate Black and White Balls |
Go |
Medium |
| 2940 |
Find Building Where Alice and Bob Can Meet |
Go |
Hard |
| 2942 |
Find Words Containing Character |
Go |
Easy |
| 2943 |
Count Symmetric Integers |
Go |
Easy |
| 2948 |
Make Lexicographically Smallest Array by Swapping Elements |
Go |
Medium |
| 2962 |
Count Subarrays Where Max Element Appears at Least K Times |
Go |
Medium |
| 2965 |
Find Missing and Repeated Values |
Go |
Medium |
| 2966 |
Divide Array Into Arrays With Max Difference |
Go |
Medium |
| 2981 |
Find Longest Special Substring That Occurs Thrice I |
Go |
Medium |
| 2997 |
Minimum Number of Operations to Make Array XOR Equal to K |
Go |
Medium |
| 2999 |
Count the Number of Powerful Integers |
Go |
Hard |
| 3016 |
Minimum Number of Pushes to Type Word II |
Go |
Medium |
| 3024 |
Type of Triangle |
Go |
Easy |
| 3042 |
Count Prefix and Suffix Pairs I |
Go |
Easy |
| 3066 |
Minimum Operations to Exceed Threshold Value II |
Go |
Medium |
| 3068 |
Find the Maximum Sum of Node Values |
Go |
Medium |
| 3075 |
Maximize Happiness of Selected Children |
Go |
Medium |
| 3085 |
Minimum Deletions to Make String K-Special |
Go |
Medium |
| 3105 |
Longest Strictly Increasing or Strictly Decreasing Subarray |
Go |
Easy |
| 3108 |
Minimum Cost Walk in Weighted Graph |
Go |
Hard |
| 3136 |
Valid Word |
Go |
Easy |
| 3151 |
Special Array I |
Go |
Easy |
| 3152 |
Special Array II |
Go |
Medium |
| 3160 |
Find the Number of Distinct Colors Among the Balls |
Go |
Medium |
| 3169 |
Count Days Without Meetings |
Go |
Medium |
| 3170 |
Lexicographically Minimum String After Removing Stars |
Go |
Medium |
| 3174 |
Clear Digits |
Go |
Easy |
| 3191 |
Minimum Operations to Make Binary Array Elements Equal to One I |
Go |
Medium |
| 3201 |
Find the Maximum Length of Valid Subsequence I |
Go |
Medium |
| 3202 |
Find the Maximum Length of Valid Subsequence II |
Go |
Medium |
| 3203 |
Find Minimum Diameter After Merging Two Trees |
Go |
Hard |
| 3208 |
Alternating Groups II |
Go |
Medium |
| 3223 |
Minimum Length of String After Operations |
Go |
Medium |
| 3264 |
Final Array State After K Multiplication Operations I |
Go |
Easy |
| 3272 |
Find the Count of Good Integers |
Go |
Hard |
| 3304 |
Find the K-th Character in String Game I |
Go |
Easy |
| 3306 |
Count of Substrings Containing Every Vowel and K Consonants II |
Go |
Medium |
| 3307 |
Find the K-th Character in String Game II |
Go |
Hard |
| 3330 |
Find the Original Typed String I |
Go |
Easy |
| 3333 |
Find the Original Typed String II |
Go |
Easy |
| 3335 |
Zero Array Transformation I |
Go |
Medium |
| 3337 |
Total Characters in String After Transformations II |
Go |
Hard |
| 3341 |
Find Minimum Time to Reach Last Room I |
Go |
Medium |
| 3342 |
Find Minimum Time to Reach Last Room II |
Go |
Medium |
| 3343 |
Count Number of Balanced Permutations |
Go |
Hard |
| 3355 |
Total Characters in String After Transformations I |
Go |
Medium |
| 3356 |
Zero Array Transformation II |
Go |
Medium |
| 3359 |
Find Closest Node to Given Two Nodes |
Go |
Medium |
| 3362 |
Zero Array Transformation III |
Go |
Medium |
| 3363 |
Find the Maximum Number of Fruits Collected |
C++ |
Hard |
| 3372 |
Maximize the Number of Target Nodes After Connecting Trees I |
Go |
Medium |
| 3373 |
Maximize the Number of Target Nodes After Connecting Trees II |
Go |
Medium |
| 3375 |
Minimum Operations to Make Array Values Equal to K |
Go |
Medium |
| 3392 |
Count Subarrays of Length Three With a Condition |
Go |
Easy |
| 3394 |
Check if Grid can be Cut into Sections |
Go |
Medium |
| 3396 |
Minimum Number of Operations to Make Elements in Array Distinct |
Go |
Easy |
| 3403 |
Find the Lexicographically Largest String From the Box I |
Go |
Medium |
| 3405 |
Count the Number of Arrays with K Matching Adjacent Elements |
Go |
Hard |
| 3423 |
Maximum Difference Between Adjacent Elements in a Circular Array |
Go |
Easy |
| 3439 |
Reschedule Meetings for Maximum Free Time I |
Go |
Medium |
| 3440 |
Reschedule Meetings for Maximum Free Time II |
Go |
Medium |
| 3442 |
Maximum Difference Between Even and Odd Frequency I |
Go |
Easy |
| 3443 |
Maximum Manhattan Distance After K Changes |
Go |
Medium |
| 3445 |
Maximum Difference Between Even and Odd Frequency II |
Go |
Hard |
| 3477 |
Fruits Into Baskets II |
C++ |
Easy |
| 3479 |
Fruits Into Baskets III |
C++ |
Medium |
| 3480 |
Maximize Subarrays After Removing One Conflicting Pair |
Go |
Hard |
| 3487 |
Maximum Unique Subarray Sum After Deletion |
Go |
Easy |