| Check If Array Pairs Are Divisible by k | Medium | 46.2% |
| Subarray Sum Equals K | Medium | 46.8% |
| Two Sum | Easy | 57.1% |
| Longest Substring Without Repeating Characters | Medium | 38.5% |
| Happy Number | Easy | 59.3% |
| Delete and Earn | Medium | 57.1% |
| Majority Element | Easy | 66.1% |
| Letter Combinations of a Phone Number | Medium | 65.5% |
| Roman to Integer | Easy | 66.3% |
| Contains Duplicate | Easy | 64.1% |
| Intersection of Two Arrays | Easy | 77.5% |
| Valid Anagram | Easy | 67.8% |
| Permutation Difference between Two Strings | Easy | 87.8% |
| Sort Characters By Frequency | Medium | 75.1% |
| Next Greater Element I | Easy | 75.8% |
| Sort Array by Increasing Frequency | Easy | 80.7% |
| Find Subsequence of Length K With the Largest Sum | Easy | 57.4% |
| Number of Good Pairs | Easy | 89.8% |
| Integer to Roman | Medium | 70.5% |
| Find All Anagrams in a String | Medium | 53.3% |
| Maximum Number of Balls in a Box | Easy | 74.7% |
| Contains Duplicate II | Easy | 50.8% |
| Find the Difference | Easy | 60.1% |
| Longest Palindrome | Easy | 55.8% |
| First Unique Character in a String | Easy | 65.1% |
| Find the Difference of Two Arrays | Easy | 81.3% |
| Linked List Cycle | Easy | 53.9% |
| Contiguous Array | Medium | 50.8% |
| Minimum Number of Operations to Have Distinct Elements | Medium | 42.0% |
| Group Anagrams | Medium | 72.2% |
| Minimum Jumps to Reach Home | Medium | 30.6% |
| Number of Divisible Triplet Sums | Medium | 67.5% |
| LRU Cache | Medium | 46.8% |
| Minimum Window Substring | Hard | 47.0% |
| Top K Frequent Elements | Medium | 65.9% |
| Top K Frequent Words | Medium | 60.0% |
| Fruit Into Baskets | Medium | 50.5% |
| Count Pairs Of Similar Strings | Easy | 73.6% |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% |
| Word Ladder | Hard | 44.9% |
| Longest Consecutive Sequence | Medium | 47.0% |
| Missing Number | Easy | 71.7% |
| Longest Repeating Character Replacement | Medium | 59.1% |
| Permutation in String | Medium | 48.5% |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% |
| Split the Array | Easy | 60.9% |
| Design Twitter | Medium | 44.2% |
| Largest Combination With Bitwise AND Greater Than Zero | Medium | 80.8% |
| Threshold Majority Queries | Hard | 21.7% |
| Insert Delete GetRandom O(1) | Medium | 55.3% |
| Shortest Uncommon Substring in an Array | Medium | 50.0% |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% |
| Parse Lisp Expression | Hard | 53.5% |
| Number of Atoms | Hard | 65.1% |
| Rank Transform of an Array | Easy | 70.8% |
| Longest String Chain | Medium | 62.8% |
| Reorganize String | Medium | 56.8% |
| Design Excel Sum Formula | Hard | 39.9% |
| Accounts Merge | Medium | 60.9% |
| Smallest Common Region | Medium | 68.3% |
| Intersection of Two Linked Lists | Easy | 63.2% |
| Palindrome Pairs | Hard | 37.0% |
| Simple Bank System | Medium | 69.8% |
| Design Tic-Tac-Toe | Medium | 58.7% |
| All O`one Data Structure | Hard | 44.2% |
| Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | Hard | 72.4% |
| Strings Differ by One Character | Medium | 40.1% |
| Design File System | Medium | 65.1% |
| Pyramid Transition Matrix | Medium | 60.6% |
| Time Based Key-Value Store | Medium | 49.7% |
| Minimum Array Changes to Make Differences Equal | Medium | 24.3% |
| Find the Number of Good Pairs II | Medium | 26.6% |
| Find the Number of Good Pairs I | Easy | 86.3% |
| N-Repeated Element in Size 2N Array | Easy | 79.8% |
| Can Make Palindrome from Substring | Medium | 41.3% |
| Increasing Decreasing String | Easy | 77.2% |
| Map Sum Pairs | Medium | 57.1% |
| Reduce Array Size to The Half | Medium | 69.3% |
| Path Sum IV | Medium | 62.8% |
| Split Array with Equal Sum | Hard | 50.1% |
| Maximum Number of Pairs in Array | Easy | 76.0% |
| Create Binary Tree From Descriptions | Medium | 81.7% |
| Open the Lock | Medium | 61.2% |
| First Missing Positive | Hard | 42.5% |
| Majority Element II | Medium | 55.8% |
| Find Missing and Repeated Values | Easy | 83.3% |
| Maximum Number of Balloons | Easy | 60.0% |
| Copy List with Random Pointer | Medium | 62.4% |
| Isomorphic Strings | Easy | 48.1% |
| Set Matrix Zeroes | Medium | 62.5% |
| Optimal Partition of String | Medium | 78.4% |
| Design HashMap | Easy | 66.4% |
| Task Scheduler | Medium | 62.7% |
| Linked List Cycle II | Medium | 57.3% |
| Word Break | Medium | 49.1% |
| Ransom Note | Easy | 65.7% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% |
| Largest Palindromic Number | Medium | 37.0% |
| Minimum Moves to Make Array Complementary | Medium | 43.3% |
| Valid Sudoku | Medium | 64.2% |