| Two Sum | Easy | 57.1% | 100.0% |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 85.1% |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 84.8% |
| Invalid Transactions | Medium | 32.1% | 79.1% |
| Majority Element | Easy | 66.1% | 76.3% |
| Valid Anagram | Easy | 67.8% | 74.8% |
| LRU Cache | Medium | 46.8% | 72.2% |
| Roman to Integer | Easy | 66.3% | 72.2% |
| Subarray Sum Equals K | Medium | 46.8% | 71.9% |
| Design Underground System | Medium | 74.4% | 71.9% |
| Longest Consecutive Sequence | Medium | 47.0% | 71.9% |
| Group Anagrams | Medium | 72.2% | 69.7% |
| First Unique Character in a String | Easy | 65.1% | 67.6% |
| Word Break II | Hard | 55.1% | 63.7% |
| Longest Repeating Character Replacement | Medium | 59.1% | 62.5% |
| Contains Duplicate | Easy | 64.1% | 62.0% |
| Word Break | Medium | 49.1% | 59.3% |
| Remove Letter To Equalize Frequency | Easy | 19.2% | 58.2% |
| Design an Ordered Stream | Easy | 82.6% | 57.7% |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 57.1% |
| Set Matrix Zeroes | Medium | 62.5% | 56.6% |
| Next Greater Element I | Easy | 75.8% | 56.6% |
| Copy List with Random Pointer | Medium | 62.4% | 55.4% |
| Linked List Cycle | Easy | 53.9% | 55.4% |
| Isomorphic Strings | Easy | 48.1% | 54.8% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 54.8% |
| Contains Duplicate II | Easy | 50.8% | 53.5% |
| Valid Sudoku | Medium | 64.2% | 53.5% |
| Letter Combinations of a Phone Number | Medium | 65.5% | 53.5% |
| Missing Number | Easy | 71.7% | 53.5% |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% | 52.8% |
| Intersection of Two Arrays | Easy | 77.5% | 52.1% |
| Design A Leaderboard | Medium | 68.1% | 52.1% |
| Top K Frequent Elements | Medium | 65.9% | 52.1% |
| Word Ladder | Hard | 44.9% | 51.3% |
| Integer to Roman | Medium | 70.5% | 50.5% |
| Happy Number | Easy | 59.3% | 48.9% |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 48.0% |
| Top K Frequent Words | Medium | 60.0% | 46.1% |
| Minimum Number of Steps to Make Two Strings Anagram | Medium | 82.5% | 46.1% |
| Intersection of Two Linked Lists | Easy | 63.2% | 46.1% |
| Majority Element II | Medium | 55.8% | 45.1% |
| Sudoku Solver | Hard | 65.4% | 45.1% |
| Find Missing and Repeated Values | Easy | 83.3% | 45.1% |
| Fruit Into Baskets | Medium | 50.5% | 44.0% |
| Implement Magic Dictionary | Medium | 57.7% | 42.9% |
| Sort Characters By Frequency | Medium | 75.1% | 41.7% |
| Binary Subarrays With Sum | Medium | 68.3% | 41.7% |
| Minimum Window Substring | Hard | 47.0% | 41.7% |
| Permutation in String | Medium | 48.5% | 40.4% |
| First Missing Positive | Hard | 42.5% | 40.4% |
| Sort Array by Increasing Frequency | Easy | 80.7% | 40.4% |
| Kill Process | Medium | 70.3% | 40.4% |
| Accounts Merge | Medium | 60.9% | 39.0% |
| Ransom Note | Easy | 65.7% | 39.0% |
| Contiguous Array | Medium | 50.8% | 39.0% |
| Linked List Cycle II | Medium | 57.3% | 39.0% |
| Find All Anagrams in a String | Medium | 53.3% | 37.5% |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% | 37.5% |
| Subarray Sums Divisible by K | Medium | 56.1% | 37.5% |
| Reordered Power of 2 | Medium | 66.0% | 37.5% |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 35.9% |
| Substring with Concatenation of All Words | Hard | 34.0% | 34.1% |
| Find the Difference | Easy | 60.1% | 34.1% |
| Repeated DNA Sequences | Medium | 52.9% | 34.1% |
| Unique Number of Occurrences | Easy | 78.6% | 34.1% |
| Sparse Matrix Multiplication | Medium | 69.2% | 34.1% |
| Palindrome Permutation | Easy | 68.6% | 34.1% |
| Check if All the Integers in a Range Are Covered | Easy | 50.8% | 34.1% |
| Set Mismatch | Easy | 44.2% | 32.2% |
| Continuous Subarray Sum | Medium | 31.2% | 32.2% |
| Subarrays with K Different Integers | Hard | 67.6% | 32.2% |
| How Many Numbers Are Smaller Than the Current Number | Easy | 87.4% | 32.2% |
| Jewels and Stones | Easy | 89.5% | 32.2% |
| Number of Substrings Containing All Three Characters | Medium | 73.5% | 32.2% |
| Letter Tile Possibilities | Medium | 83.5% | 32.2% |
| Reorganize String | Medium | 56.8% | 30.0% |
| Find All Numbers Disappeared in an Array | Easy | 63.8% | 30.0% |
| Word Pattern | Easy | 43.8% | 30.0% |
| Number of Good Pairs | Easy | 89.8% | 30.0% |
| Find All Duplicates in an Array | Medium | 76.8% | 27.6% |
| Tuple with Same Product | Medium | 70.1% | 27.6% |
| Max Sum of a Pair With Equal Sum of Digits | Medium | 66.0% | 27.6% |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 27.6% |
| Finding 3-Digit Even Numbers | Easy | 78.8% | 27.6% |
| Word Ladder II | Hard | 27.5% | 27.6% |
| Clone Graph | Medium | 64.7% | 27.6% |
| Check if the Sentence Is Pangram | Easy | 84.1% | 27.6% |
| Time Based Key-Value Store | Medium | 49.7% | 24.9% |
| Longest Palindrome | Easy | 55.8% | 24.9% |
| Ugly Number II | Medium | 49.5% | 24.9% |
| Rank Transform of an Array | Easy | 70.8% | 24.9% |
| Rabbits in Forest | Medium | 58.1% | 24.9% |
| Check If N and Its Double Exist | Easy | 41.7% | 24.9% |
| Unique Length-3 Palindromic Subsequences | Medium | 73.8% | 24.9% |
| Check if All Characters Have Equal Number of Occurrences | Easy | 79.4% | 24.9% |
| Task Scheduler | Medium | 62.7% | 24.9% |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 24.9% |
| Two Sum IV - Input is a BST | Easy | 63.0% | 24.9% |
| Find Winner on a Tic Tac Toe Game | Easy | 54.5% | 24.9% |
| Next Greater Numerically Balanced Number | Medium | 63.0% | 24.9% |
| Bus Routes | Hard | 47.1% | 24.9% |
| Find the Prefix Common Array of Two Arrays | Medium | 87.0% | 21.7% |
| Delete Nodes From Linked List Present in Array | Medium | 69.5% | 21.7% |
| Intersection of Two Arrays II | Easy | 59.7% | 21.7% |
| Maximum Subarray Sum With Length Divisible by K | Medium | 49.6% | 21.7% |
| Sum of Beauty of All Substrings | Medium | 73.6% | 21.7% |
| Number of Matching Subsequences | Medium | 50.6% | 21.7% |
| Count Number of Nice Subarrays | Medium | 74.8% | 21.7% |
| Max Number of K-Sum Pairs | Medium | 56.9% | 21.7% |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 21.7% |
| Longest Harmonious Subsequence | Easy | 64.4% | 21.7% |
| Find Subsequence of Length K With the Largest Sum | Easy | 57.4% | 21.7% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 21.7% |
| Find Root of N-Ary Tree | Medium | 78.6% | 21.7% |
| Longest Balanced Subarray I | Medium | 65.7% | 21.7% |
| Create Binary Tree From Descriptions | Medium | 81.7% | 18.0% |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 18.0% |
| Magic Squares In Grid | Medium | 55.1% | 18.0% |
| Minimum Operations to Convert All Elements to Zero | Medium | 53.0% | 18.0% |
| K-diff Pairs in an Array | Medium | 45.6% | 18.0% |
| Distribute Candies | Easy | 70.8% | 18.0% |
| All O`one Data Structure | Hard | 44.2% | 18.0% |
| Find Common Characters | Easy | 74.7% | 18.0% |
| Minimum Genetic Mutation | Medium | 56.4% | 18.0% |
| Partition Labels | Medium | 81.8% | 18.0% |
| Find the Longest Substring Containing Vowels in Even Counts | Medium | 75.7% | 18.0% |
| Divide Array Into Equal Pairs | Easy | 79.2% | 18.0% |
| Minimum Number of Operations to Make Elements in Array Distinct | Easy | 71.3% | 18.0% |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 18.0% |
| Open the Lock | Medium | 61.2% | 18.0% |
| Find the Number of Distinct Colors Among the Balls | Medium | 54.2% | 18.0% |
| Count Elements With Maximum Frequency | Easy | 79.8% | 18.0% |
| Count Special Triplets | Medium | 47.1% | 18.0% |
| Vowel Spellchecker | Medium | 61.4% | 18.0% |
| Design Task Manager | Medium | 49.1% | 18.0% |
| Max Points on a Line | Hard | 30.3% | 18.0% |
| Delete and Earn | Medium | 57.1% | 18.0% |
| Find the Town Judge | Easy | 50.5% | 18.0% |
| Longest String Chain | Medium | 62.8% | 18.0% |
| Hand of Straights | Medium | 57.8% | 18.0% |
| Design a Todo List | Medium | 59.8% | 18.0% |
| Find Common Elements Between Two Arrays | Easy | 84.4% | 18.0% |
| Maximum Score Words Formed by Letters | Hard | 81.5% | 18.0% |
| Maximum Manhattan Distance After K Changes | Medium | 54.2% | 18.0% |
| Maximum XOR of Two Numbers in an Array | Medium | 53.4% | 18.0% |
| Count the Number of Consistent Strings | Easy | 88.5% | 18.0% |
| Minimum Pair Removal to Sort Array I | Easy | 65.3% | 18.0% |
| Rank Teams by Votes | Medium | 60.0% | 18.0% |
| Closest Equal Element Queries | Medium | 32.8% | 13.6% |
| Bulls and Cows | Medium | 52.2% | 13.6% |
| Longest Balanced Substring II | Medium | 42.0% | 13.6% |
| N-Repeated Element in Size 2N Array | Easy | 79.8% | 13.6% |
| Design Twitter | Medium | 44.2% | 13.6% |
| Find Duplicate Subtrees | Medium | 60.6% | 13.6% |
| Relative Sort Array | Easy | 75.1% | 13.6% |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 13.6% |
| Custom Sort String | Medium | 72.3% | 13.6% |
| The Number of the Smallest Unoccupied Chair | Medium | 60.4% | 13.6% |
| Minimum Length of String After Operations | Medium | 75.0% | 13.6% |
| Count Vowel Substrings of a String | Easy | 72.9% | 13.6% |
| Longest Nice Substring | Easy | 63.8% | 13.6% |
| Minimum Index Sum of Two Lists | Easy | 59.5% | 13.6% |
| Minimum Operations to Make Array Values Equal to K | Easy | 73.3% | 13.6% |
| Find Score of an Array After Marking All Elements | Medium | 64.5% | 13.6% |
| Sort the People | Easy | 84.8% | 13.6% |
| Length of Longest Fibonacci Subsequence | Medium | 57.5% | 13.6% |
| Construct K Palindrome Strings | Medium | 68.6% | 13.6% |
| Minimum Deletions to Make String K-Special | Medium | 67.2% | 13.6% |
| Maximum Erasure Value | Medium | 64.1% | 13.6% |
| Count of Substrings Containing Every Vowel and K Consonants II | Medium | 40.6% | 13.6% |
| Construct Binary Tree from Preorder and Postorder Traversal | Medium | 78.1% | 13.6% |
| Longest Palindrome by Concatenating Two Letter Words | Medium | 53.5% | 13.6% |
| Verifying an Alien Dictionary | Easy | 55.9% | 13.6% |
| Most Frequent Even Element | Easy | 53.3% | 13.6% |
| Design HashSet | Easy | 67.8% | 13.6% |
| Maximum Unique Subarray Sum After Deletion | Easy | 40.5% | 13.6% |
| Find Lucky Integer in an Array | Easy | 75.5% | 13.6% |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 13.6% |
| Maximum Square Area by Removing Fences From a Field | Medium | 49.4% | 13.6% |
| LFU Cache | Hard | 48.6% | 13.6% |
| Avoid Flood in The City | Medium | 39.0% | 13.6% |
| Simple Bank System | Medium | 69.8% | 13.6% |
| Fair Candy Swap | Easy | 64.6% | 13.6% |
| Find X-Sum of All K-Long Subarrays I | Easy | 76.1% | 13.6% |
| Maximum Frequency Stack | Hard | 66.6% | 13.6% |
| Brick Wall | Medium | 56.0% | 13.6% |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.1% | 13.6% |
| Find the Difference of Two Arrays | Easy | 81.3% | 13.6% |
| Lowest Common Ancestor of Deepest Leaves | Medium | 79.4% | 13.6% |
| Count Largest Group | Easy | 74.7% | 13.6% |
| Finding Pairs With a Certain Sum | Medium | 61.6% | 13.6% |
| Smallest Subtree with all the Deepest Nodes | Medium | 77.5% | 13.6% |
| Determine if Two Strings Are Close | Medium | 54.2% | 13.6% |
| Longest Balanced Substring I | Medium | 69.7% | 13.6% |
| Take K of Each Character From Left and Right | Medium | 51.5% | 13.6% |
| Longest Substring with At Least K Repeating Characters | Medium | 46.1% | 13.6% |
| Online Election | Medium | 52.7% | 13.6% |
| Number of Distinct Islands | Medium | 62.7% | 13.6% |
| Maximum Number of Balloons | Easy | 60.0% | 8.4% |
| Employee Importance | Medium | 69.3% | 8.4% |
| Group the People Given the Group Size They Belong To | Medium | 87.5% | 8.4% |
| Most Frequent Subtree Sum | Medium | 68.9% | 8.4% |
| Find Resultant Array After Removing Anagrams | Easy | 69.9% | 8.4% |
| Degree of an Array | Easy | 58.2% | 8.4% |
| Regions Cut By Slashes | Medium | 77.5% | 8.4% |
| Split a String Into the Max Number of Unique Substrings | Medium | 68.6% | 8.4% |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 8.4% |
| Count Special Subsequences | Medium | 29.8% | 8.4% |
| Divide Players Into Teams of Equal Skill | Medium | 68.9% | 8.4% |
| Find Original Array From Doubled Array | Medium | 40.7% | 8.4% |
| Flip Columns For Maximum Number of Equal Rows | Medium | 78.6% | 8.4% |
| Sliding Window Median | Hard | 38.9% | 8.4% |
| Word Subsets | Medium | 55.9% | 8.4% |
| First Completely Painted Row or Column | Medium | 63.9% | 8.4% |
| Number of Equivalent Domino Pairs | Easy | 60.6% | 8.4% |
| Find Unique Binary String | Medium | 79.4% | 8.4% |
| Maximum Palindromes After Operations | Medium | 45.6% | 8.4% |
| Count Number of Bad Pairs | Medium | 54.2% | 8.4% |
| Count of Interesting Subarrays | Medium | 58.0% | 8.4% |
| Equal Row and Column Pairs | Medium | 70.8% | 8.4% |
| Find Maximum Number of Non Intersecting Substrings | Medium | 30.4% | 8.4% |
| Merge Two 2D Arrays by Summing Values | Easy | 81.7% | 8.4% |
| Minimum Moves to Clean the Classroom | Medium | 26.5% | 8.4% |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% | 8.4% |
| Keep Multiplying Found Values by Two | Easy | 75.1% | 8.4% |
| Minimum Operations to Make the Array Alternating | Medium | 35.4% | 8.4% |
| Longest Arithmetic Subsequence | Medium | 49.9% | 8.4% |
| The Number of Beautiful Subsets | Medium | 50.9% | 8.4% |
| Find Subarrays With Equal Sum | Easy | 66.9% | 8.4% |
| Circular Array Loop | Medium | 37.0% | 8.4% |
| Make Two Arrays Equal by Reversing Subarrays | Easy | 75.8% | 8.4% |
| Rearranging Fruits | Hard | 57.5% | 8.4% |
| Delete Duplicate Folders in System | Hard | 77.7% | 8.4% |
| Minimum Number of People to Teach | Medium | 67.7% | 8.4% |
| Linked List Components | Medium | 57.8% | 8.4% |
| Smallest Integer Divisible by K | Medium | 54.3% | 8.4% |
| Smallest String With Swaps | Medium | 60.4% | 8.4% |
| Minimum Number of Operations to Make Array Continuous | Hard | 52.1% | 8.4% |
| Fraction to Recurring Decimal | Medium | 30.6% | 8.4% |
| Maximum Frequency After Subarray Operation | Medium | 30.9% | 8.4% |
| Smallest Number in Infinite Set | Medium | 70.6% | 8.4% |
| Design Tic-Tac-Toe | Medium | 58.7% | 8.4% |
| Find X-Sum of All K-Long Subarrays II | Hard | 41.1% | 8.4% |
| Make Sum Divisible by P | Medium | 42.6% | 8.4% |
| Cinema Seat Allocation | Medium | 43.6% | 8.4% |
| Count Number of Trapezoids I | Medium | 48.0% | 8.4% |
| Design Spreadsheet | Medium | 74.3% | 8.4% |
| Meeting Rooms III | Hard | 51.6% | 8.4% |
| Number of Good Paths | Hard | 56.3% | 8.4% |
| Largest Positive Integer That Exists With Its Negative | Easy | 74.5% | 8.4% |
| Check if Array is Good | Easy | 48.7% | 8.4% |
| Sum of Unique Elements | Easy | 79.8% | 8.4% |
| Minimum Common Value | Easy | 58.0% | 8.4% |
| Find Missing Elements | Easy | 82.9% | 8.4% |
| Minimize String Length | Easy | 78.9% | 8.4% |
| Find Words That Can Be Formed by Characters | Easy | 71.5% | 8.4% |
| Find And Replace in String | Medium | 50.9% | 8.4% |
| Find the Largest Almost Missing Integer | Easy | 37.1% | 8.4% |
| Substrings of Size Three with Distinct Characters | Easy | 76.6% | 8.4% |
| Design Snake Game | Medium | 40.0% | 8.4% |
| Number of Boomerangs | Medium | 57.3% | 8.4% |
| Check If Array Pairs Are Divisible by k | Medium | 46.2% | 8.4% |
| Minimum Jumps to Reach Home | Medium | 30.6% | 8.4% |
| Stock Price Fluctuation | Medium | 48.9% | 8.4% |
