| Two Sum | Easy | 57.1% | 100.0% |
| LRU Cache | Medium | 46.8% | 88.7% |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 83.8% |
| Group Anagrams | Medium | 72.2% | 80.1% |
| Reorganize String | Medium | 56.8% | 78.9% |
| Subarray Sum Equals K | Medium | 46.8% | 73.0% |
| Top K Frequent Elements | Medium | 65.9% | 71.2% |
| Longest Consecutive Sequence | Medium | 47.0% | 70.6% |
| Copy List with Random Pointer | Medium | 62.4% | 70.3% |
| Word Ladder | Hard | 44.9% | 69.2% |
| Majority Element | Easy | 66.1% | 69.0% |
| Letter Combinations of a Phone Number | Medium | 65.5% | 66.4% |
| Valid Anagram | Easy | 67.8% | 64.5% |
| Analyze User Website Visit Pattern | Medium | 44.2% | 63.8% |
| Task Scheduler | Medium | 62.7% | 63.3% |
| Roman to Integer | Easy | 66.3% | 62.1% |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 61.2% |
| Word Break | Medium | 49.1% | 60.8% |
| First Missing Positive | Hard | 42.5% | 60.4% |
| Longest Repeating Character Replacement | Medium | 59.1% | 59.5% |
| Fruit Into Baskets | Medium | 50.5% | 59.3% |
| Minimum Window Substring | Hard | 47.0% | 59.1% |
| Valid Sudoku | Medium | 64.2% | 58.9% |
| Identify the Largest Outlier in an Array | Medium | 36.2% | 58.7% |
| LFU Cache | Hard | 48.6% | 56.6% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 56.3% |
| Set Matrix Zeroes | Medium | 62.5% | 56.1% |
| Contains Duplicate | Easy | 64.1% | 55.8% |
| First Unique Character in a String | Easy | 65.1% | 54.7% |
| Missing Number | Easy | 71.7% | 54.7% |
| Integer to Roman | Medium | 70.5% | 53.3% |
| Next Greater Element I | Easy | 75.8% | 53.0% |
| Linked List Cycle | Easy | 53.9% | 52.0% |
| Word Break II | Hard | 55.1% | 51.7% |
| Intersection of Two Arrays | Easy | 77.5% | 50.7% |
| Happy Number | Easy | 59.3% | 50.3% |
| Contains Duplicate II | Easy | 50.8% | 49.9% |
| Sudoku Solver | Hard | 65.4% | 49.2% |
| Maximum Frequency After Subarray Operation | Medium | 30.9% | 49.2% |
| Time Based Key-Value Store | Medium | 49.7% | 48.4% |
| Isomorphic Strings | Easy | 48.1% | 48.0% |
| Make Array Zero by Subtracting Equal Amounts | Easy | 73.7% | 47.6% |
| Intersection of Two Linked Lists | Easy | 63.2% | 47.2% |
| Subarrays with K Different Integers | Hard | 67.6% | 47.2% |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% | 46.7% |
| Find All Anagrams in a String | Medium | 53.3% | 46.7% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 46.3% |
| Word Ladder II | Hard | 27.5% | 46.3% |
| Permutation in String | Medium | 48.5% | 45.8% |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 45.3% |
| Linked List Cycle II | Medium | 57.3% | 44.4% |
| Top K Frequent Words | Medium | 60.0% | 44.4% |
| Partition Labels | Medium | 81.8% | 43.9% |
| Sort Characters By Frequency | Medium | 75.1% | 43.3% |
| Majority Element II | Medium | 55.8% | 42.2% |
| Set Mismatch | Easy | 44.2% | 41.6% |
| Contiguous Array | Medium | 50.8% | 41.6% |
| Open the Lock | Medium | 61.2% | 40.4% |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 40.4% |
| Design HashMap | Easy | 66.4% | 39.8% |
| Accounts Merge | Medium | 60.9% | 39.8% |
| Design Twitter | Medium | 44.2% | 39.8% |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 39.1% |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% | 39.1% |
| Design Tic-Tac-Toe | Medium | 58.7% | 38.4% |
| Find Missing and Repeated Values | Easy | 83.3% | 37.7% |
| Ransom Note | Easy | 65.7% | 37.7% |
| Clone Graph | Medium | 64.7% | 37.7% |
| Unique Number of Occurrences | Easy | 78.6% | 37.7% |
| Design In-Memory File System | Hard | 48.4% | 37.7% |
| Number of Distinct Islands | Medium | 62.7% | 37.7% |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 36.9% |
| First Unique Number | Medium | 57.0% | 36.9% |
| Bus Routes | Hard | 47.1% | 36.1% |
| Jewels and Stones | Easy | 89.5% | 35.3% |
| Find Longest Self-Contained Substring | Hard | 58.8% | 35.3% |
| Substring with Concatenation of All Words | Hard | 34.0% | 34.4% |
| Find All Numbers Disappeared in an Array | Easy | 63.8% | 34.4% |
| Binary Subarrays With Sum | Medium | 68.3% | 33.5% |
| Make Sum Divisible by P | Medium | 42.6% | 33.5% |
| Minimum Number of Pushes to Type Word II | Medium | 80.0% | 33.5% |
| Substring With Largest Variance | Hard | 46.0% | 32.5% |
| Longest Substring with At Least K Repeating Characters | Medium | 46.1% | 32.5% |
| Two Sum IV - Input is a BST | Easy | 63.0% | 32.5% |
| Using a Robot to Print the Lexicographically Smallest String | Medium | 62.5% | 32.5% |
| Sum of Beauty of All Substrings | Medium | 73.6% | 31.5% |
| Custom Sort String | Medium | 72.3% | 31.5% |
| Path Crossing | Easy | 62.6% | 31.5% |
| Count Number of Rectangles Containing Each Point | Medium | 37.4% | 31.5% |
| Best Poker Hand | Easy | 61.6% | 31.5% |
| Number of Equivalent Domino Pairs | Easy | 60.6% | 31.5% |
| Max Sum of a Pair With Equal Sum of Digits | Medium | 66.0% | 31.5% |
| Find All Duplicates in an Array | Medium | 76.8% | 30.4% |
| The Number of the Smallest Unoccupied Chair | Medium | 60.4% | 30.4% |
| Cousins in Binary Tree II | Medium | 75.8% | 30.4% |
| Count the Number of Special Characters I | Easy | 66.7% | 29.3% |
| Total Appeal of A String | Hard | 56.4% | 29.3% |
| Count Subarrays With Median K | Hard | 47.7% | 29.3% |
| Find the Difference | Easy | 60.1% | 29.3% |
| Meeting Rooms III | Hard | 51.6% | 29.3% |
| Minimum Swaps to Avoid Forbidden Values | Hard | 30.2% | 29.3% |
| Design Memory Allocator | Medium | 49.7% | 29.3% |
| All O`one Data Structure | Hard | 44.2% | 29.3% |
| Count Number of Pairs With Absolute Difference K | Easy | 85.3% | 29.3% |
| Minimum Operations to Make the Array Alternating | Medium | 35.4% | 29.3% |
| Lowest Common Ancestor of a Binary Tree IV | Medium | 79.5% | 29.3% |
| Smallest Number in Infinite Set | Medium | 70.6% | 29.3% |
| Minimum Rounds to Complete All Tasks | Medium | 63.2% | 29.3% |
| Clone Binary Tree With Random Pointer | Medium | 80.9% | 29.3% |
| Most Frequent Subtree Sum | Medium | 68.9% | 29.3% |
| Optimal Partition of String | Medium | 78.4% | 28.0% |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 28.0% |
| Repeated DNA Sequences | Medium | 52.9% | 28.0% |
| Continuous Subarray Sum | Medium | 31.2% | 28.0% |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 28.0% |
| Maximum Erasure Value | Medium | 64.1% | 28.0% |
| Unique Length-3 Palindromic Subsequences | Medium | 73.8% | 28.0% |
| K-diff Pairs in an Array | Medium | 45.6% | 28.0% |
| Most Common Word | Easy | 45.0% | 28.0% |
| Count Beautiful Substrings I | Medium | 61.0% | 28.0% |
| Number of Distinct Islands II | Hard | 55.3% | 28.0% |
| Encode and Decode TinyURL | Medium | 86.6% | 28.0% |
| Maximum Score Words Formed by Letters | Hard | 81.5% | 28.0% |
| Logger Rate Limiter | Easy | 76.8% | 26.7% |
| Minimum Genetic Mutation | Medium | 56.4% | 26.7% |
| Max Number of K-Sum Pairs | Medium | 56.9% | 26.7% |
| Max Points on a Line | Hard | 30.3% | 26.7% |
| Design File System | Medium | 65.1% | 26.7% |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 26.7% |
| Check If Array Pairs Are Divisible by k | Medium | 46.2% | 26.7% |
| Count Zero Request Servers | Medium | 35.6% | 26.7% |
| Minimum Number of Operations to Make Elements in Array Distinct | Easy | 71.3% | 26.7% |
| Count Covered Buildings | Medium | 58.8% | 26.7% |
| Longest Palindrome | Easy | 55.8% | 26.7% |
| Subarray Sums Divisible by K | Medium | 56.1% | 26.7% |
| How Many Numbers Are Smaller Than the Current Number | Easy | 87.4% | 26.7% |
| Design a Food Rating System | Medium | 52.9% | 26.7% |
| Minimum Number of Operations to Make Array Empty | Medium | 62.1% | 26.7% |
| K Divisible Elements Subarrays | Medium | 54.8% | 26.7% |
| High Five | Easy | 74.2% | 26.7% |
| Distant Barcodes | Medium | 48.6% | 26.7% |
| Find and Replace Pattern | Medium | 77.0% | 26.7% |
| Maximize the Profit as the Salesman | Medium | 38.0% | 26.7% |
| Most Frequent IDs | Medium | 42.5% | 26.7% |
| Count Number of Texts | Medium | 49.9% | 26.7% |
| Get Watched Videos by Your Friends | Medium | 52.1% | 26.7% |
| Minimum Operations to Reduce X to Zero | Medium | 40.4% | 25.3% |
| Maximum Frequency Stack | Hard | 66.6% | 25.3% |
| Delete and Earn | Medium | 57.1% | 25.3% |
| Design an Array Statistics Tracker | Hard | 35.7% | 25.3% |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 25.3% |
| Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values | Medium | 63.2% | 25.3% |
| Prison Cells After N Days | Medium | 39.1% | 25.3% |
| Maximum Number of Non-Overlapping Substrings | Hard | 41.5% | 25.3% |
| Minimum Number of Keypresses | Medium | 71.4% | 25.3% |
| Length of the Longest Valid Substring | Hard | 38.2% | 25.3% |
| Kth Distinct String in an Array | Easy | 82.1% | 25.3% |
| Find Distance in a Binary Tree | Medium | 74.3% | 25.3% |
| Replace Question Marks in String to Minimize Its Value | Medium | 29.0% | 25.3% |
| Design SQL | Medium | 64.6% | 25.3% |
| Find Words That Can Be Formed by Characters | Easy | 71.5% | 25.3% |
| Replace Elements in an Array | Medium | 59.6% | 25.3% |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 23.7% |
| Bulls and Cows | Medium | 52.2% | 23.7% |
| Word Pattern | Easy | 43.8% | 23.7% |
| Magic Squares In Grid | Medium | 55.1% | 23.7% |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.1% | 23.7% |
| Snapshot Array | Medium | 36.7% | 23.7% |
| Lexicographically Maximum MEX Array | Hard | | 23.7% |
| Number of Substrings Containing All Three Characters | Medium | 73.5% | 23.7% |
| Number of Submatrices That Sum to Target | Hard | 74.6% | 23.7% |
| Longest Square Streak in an Array | Medium | 53.1% | 23.7% |
| Find the Substring With Maximum Cost | Medium | 57.8% | 23.7% |
| Relocate Marbles | Medium | 51.2% | 23.7% |
| Number of Distinct Averages | Easy | 58.9% | 23.7% |
| Find K-Length Substrings With No Repeated Characters | Medium | 76.5% | 23.7% |
| Subarrays Distinct Element Sum of Squares II | Hard | 22.8% | 23.7% |
| Largest Unique Number | Easy | 71.3% | 23.7% |
| Clone N-ary Tree | Medium | 83.1% | 23.7% |
| Maximum Linear Stock Score | Medium | 61.4% | 23.7% |
| Count Beautiful Substrings II | Hard | 26.8% | 23.7% |
| Find the Maximum Number of Elements in Subset | Medium | 26.8% | 23.7% |
| Count Numbers With Unique Digits II | Easy | 87.0% | 23.7% |
| Rearrange Characters to Make Target String | Easy | 61.1% | 23.7% |
| Count the Number of Special Characters II | Medium | 43.3% | 23.7% |
| Count Pairs Of Nodes | Hard | 42.5% | 23.7% |
| Sort Features by Popularity | Medium | 66.4% | 23.7% |
| Maximum Sum of Almost Unique Subarray | Medium | 40.8% | 23.7% |
| Maximize the Beauty of the Garden | Hard | 64.6% | 23.7% |
| Distinct Numbers in Each Subarray | Medium | 77.3% | 23.7% |
| Find the Prefix Common Array of Two Arrays | Medium | 87.0% | 22.0% |
| Minimum Number of Groups to Create a Valid Assignment | Medium | 24.8% | 22.0% |
| Count Elements With Maximum Frequency | Easy | 79.8% | 22.0% |
| Pairs of Songs With Total Durations Divisible by 60 | Medium | 53.4% | 22.0% |
| Find the Town Judge | Easy | 50.5% | 22.0% |
| Find the Difference of Two Arrays | Easy | 81.3% | 22.0% |
| Find the Median of the Uniqueness Array | Hard | 29.9% | 22.0% |
| Delete Nodes From Linked List Present in Array | Medium | 69.5% | 22.0% |
| Avoid Flood in The City | Medium | 39.0% | 22.0% |
| Longest Harmonious Subsequence | Easy | 64.4% | 22.0% |
| Find Winner on a Tic Tac Toe Game | Easy | 54.5% | 22.0% |
| Minimize Array Sum Using Divisible Replacements | Medium | | 22.0% |
| Create Binary Tree From Descriptions | Medium | 81.7% | 20.2% |
| Find Common Characters | Easy | 74.7% | 20.2% |
| Intersection of Two Arrays II | Easy | 59.7% | 20.2% |
| Number of Good Pairs | Easy | 89.8% | 20.2% |
| Sort Array by Increasing Frequency | Easy | 80.7% | 20.2% |
| Ugly Number II | Medium | 49.5% | 20.2% |
| Count Number of Bad Pairs | Medium | 54.2% | 20.2% |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% | 20.2% |
| Find Duplicate Subtrees | Medium | 60.6% | 20.2% |
| Threshold Majority Queries | Hard | 21.7% | 20.2% |
| Walking Robot Simulation | Medium | 58.4% | 18.1% |
| Longest Balanced Substring I | Medium | 69.7% | 18.1% |
| Number of Atoms | Hard | 65.1% | 18.1% |
| Count Number of Nice Subarrays | Medium | 74.8% | 18.1% |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 18.1% |
| Reordered Power of 2 | Medium | 66.0% | 18.1% |
| Word Subsets | Medium | 55.9% | 18.1% |
| Finding 3-Digit Even Numbers | Easy | 78.8% | 18.1% |
| Total Characters in String After Transformations I | Medium | 45.7% | 18.1% |
| Vowel Spellchecker | Medium | 61.4% | 18.1% |
| Sliding Window Median | Hard | 38.9% | 18.1% |
| Check If N and Its Double Exist | Easy | 41.7% | 18.1% |
| Unique 3-Digit Even Numbers | Easy | 69.2% | 18.1% |
| Lexicographically Smallest Permutation Greater Than Target | Medium | 26.5% | 18.1% |
| Minimum Moves to Make Array Complementary | Medium | 43.3% | 15.8% |
| Jump Game IV | Hard | 46.2% | 15.8% |
| Minimum Pair Removal to Sort Array II | Hard | 39.2% | 15.8% |
| Find Resultant Array After Removing Anagrams | Easy | 69.9% | 15.8% |
| Design Task Manager | Medium | 49.1% | 15.8% |
| Rabbits in Forest | Medium | 58.1% | 15.8% |
| Regions Cut By Slashes | Medium | 77.5% | 15.8% |
| Invalid Transactions | Medium | 32.1% | 15.8% |
| Maximum Difference Between Even and Odd Frequency I | Easy | 60.7% | 15.8% |
| Length of Longest Fibonacci Subsequence | Medium | 57.5% | 15.8% |
| Maximum Subarray Sum With Length Divisible by K | Medium | 49.6% | 15.8% |
| Hand of Straights | Medium | 57.8% | 15.8% |
| Sum of Unique Elements | Easy | 79.8% | 15.8% |
| Design Snake Game | Medium | 40.0% | 15.8% |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 15.8% |
| Maximum Good Subarray Sum | Medium | 21.4% | 13.3% |
| Buddy Strings | Easy | 33.9% | 13.3% |
| N-Repeated Element in Size 2N Array | Easy | 79.8% | 13.3% |
| Minimum Index Sum of Two Lists | Easy | 59.5% | 13.3% |
| Check If a String Contains All Binary Codes of Size K | Medium | 61.5% | 13.3% |
| Longest Balanced Subarray I | Medium | 65.7% | 13.3% |
| Longest Balanced Substring II | Medium | 42.0% | 13.3% |
| Find Score of an Array After Marking All Elements | Medium | 64.5% | 13.3% |
| Check if the Sentence Is Pangram | Easy | 84.1% | 13.3% |
| Fraction to Recurring Decimal | Medium | 30.6% | 13.3% |
| Number of Matching Subsequences | Medium | 50.6% | 13.3% |
| Relative Sort Array | Easy | 75.1% | 13.3% |
| Extra Characters in a String | Medium | 57.3% | 13.3% |
| Count Complete Subarrays in an Array | Medium | 75.9% | 13.3% |
| Divide Players Into Teams of Equal Skill | Medium | 68.9% | 13.3% |
| Find the Longest Substring Containing Vowels in Even Counts | Medium | 75.7% | 13.3% |
| Rank Transform of an Array | Easy | 70.8% | 13.3% |
| Task Scheduler II | Medium | 54.7% | 13.3% |
| Rearrange String k Distance Apart | Hard | 39.9% | 13.3% |
| Find Duplicate File in System | Medium | 67.6% | 13.3% |
| Kill Process | Medium | 70.3% | 13.3% |
| Fair Candy Swap | Easy | 64.6% | 13.3% |
| Verifying an Alien Dictionary | Easy | 55.9% | 13.3% |
| Find Subsequence of Length K With the Largest Sum | Easy | 57.4% | 13.3% |
| Take K of Each Character From Left and Right | Medium | 51.5% | 13.3% |
| Count Vowel Substrings of a String | Easy | 72.9% | 13.3% |
| Minimum Pair Removal to Sort Array I | Easy | 65.3% | 13.3% |
| Smallest Missing Non-negative Integer After Operations | Medium | 55.9% | 13.3% |
| Pyramid Transition Matrix | Medium | 60.6% | 13.3% |
| Maximum Number of Balloons | Easy | 60.0% | 10.4% |
| Largest Palindromic Number | Medium | 37.0% | 10.4% |
| First Completely Painted Row or Column | Medium | 63.9% | 10.4% |
| Minimum Absolute Distance Between Mirror Pairs | Medium | | 10.4% |
| Brick Wall | Medium | 56.0% | 10.4% |
| Sort the People | Easy | 84.8% | 10.4% |
| Number of Islands II | Hard | 40.4% | 10.4% |
| Find Unique Binary String | Medium | 79.4% | 10.4% |
| Sum of Distances | Medium | 32.5% | 10.4% |
| Longest Arithmetic Subsequence | Medium | 49.9% | 10.4% |
| Rearranging Fruits | Hard | 57.5% | 10.4% |
| Linked List Components | Medium | 57.8% | 10.4% |
| Sliding Subarray Beauty | Medium | 36.4% | 10.4% |
| Delete Nodes And Return Forest | Medium | 72.5% | 10.4% |
| Palindrome Pairs | Hard | 37.0% | 10.4% |
| Design A Leaderboard | Medium | 68.1% | 10.4% |
| Group the People Given the Group Size They Belong To | Medium | 87.5% | 10.4% |
| Design Underground System | Medium | 74.4% | 10.4% |
| Least Number of Unique Integers after K Removals | Medium | 63.7% | 10.4% |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 10.4% |
| Check if One String Swap Can Make Strings Equal | Easy | 49.5% | 10.4% |
| Decode the Message | Easy | 85.8% | 10.4% |
| 4Sum II | Medium | 57.8% | 10.4% |
| Largest Combination With Bitwise AND Greater Than Zero | Medium | 80.8% | 10.4% |
| Design Log Storage System | Medium | 59.3% | 10.4% |
| Design Excel Sum Formula | Hard | 39.9% | 10.4% |
| Minimum Deletions to Make Character Frequencies Unique | Medium | 61.4% | 10.4% |
| Minimum Operations to Convert All Elements to Zero | Medium | 53.0% | 10.4% |
| Maximum Unique Subarray Sum After Deletion | Easy | 40.5% | 10.4% |
| Find X-Sum of All K-Long Subarrays I | Easy | 76.1% | 10.4% |
| Largest Positive Integer That Exists With Its Negative | Easy | 74.5% | 10.4% |
| Substrings of Size Three with Distinct Characters | Easy | 76.6% | 10.4% |
| Stock Price Fluctuation | Medium | 48.9% | 10.4% |
| Number of Good Ways to Split a String | Medium | 68.4% | 10.4% |
| Finding the Users Active Minutes | Medium | 80.8% | 10.4% |
| Minimum Number of People to Teach | Medium | 67.7% | 10.4% |
| Detect Squares | Medium | 52.3% | 10.4% |
| Closest Equal Element Queries | Medium | 32.8% | 7.2% |
| Minimum Jumps to Reach End via Prime Teleportation | Medium | 31.8% | 7.2% |
| Divide an Array Into Subarrays With Minimum Cost II | Hard | 54.7% | 7.2% |
| Longest Balanced Subarray II | Hard | 33.8% | 7.2% |
| Perfect Rectangle | Hard | 37.3% | 7.2% |
| Merge BSTs to Create Single BST | Hard | 38.0% | 7.2% |
| Maximum Size Subarray Sum Equals k | Medium | 50.8% | 7.2% |
| Random Pick Index | Medium | 65.0% | 7.2% |
| Keyboard Row | Easy | 73.6% | 7.2% |
| Design HashSet | Easy | 67.8% | 7.2% |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 7.2% |
| Minimum Number of Steps to Make Two Strings Anagram | Medium | 82.5% | 7.2% |
| Destination City | Easy | 79.5% | 7.2% |
| Determine if Two Strings Are Close | Medium | 54.2% | 7.2% |
| Count the Number of Good Subarrays | Medium | 65.9% | 7.2% |
| Degree of an Array | Easy | 58.2% | 7.2% |
| Find Occurrences of an Element in an Array | Medium | 73.3% | 7.2% |
| HTML Entity Parser | Medium | 50.3% | 7.2% |
| Dinner Plate Stacks | Hard | 33.5% | 7.2% |
| Uncommon Words from Two Sentences | Easy | 75.6% | 7.2% |
| Split a String Into the Max Number of Unique Substrings | Medium | 68.6% | 7.2% |
| Construct K Palindrome Strings | Medium | 68.6% | 7.2% |
| Flip Columns For Maximum Number of Equal Rows | Medium | 78.6% | 7.2% |
| Minimum Operations to Make a Subsequence | Hard | 49.6% | 7.2% |
| Circular Array Loop | Medium | 37.0% | 7.2% |
| Tuple with Same Product | Medium | 70.1% | 7.2% |
| Employee Importance | Medium | 69.3% | 7.2% |
| Data Stream as Disjoint Intervals | Hard | 60.0% | 7.2% |
| Number of Pairs of Interchangeable Rectangles | Medium | 52.4% | 7.2% |
| Count of Substrings Containing Every Vowel and K Consonants II | Medium | 40.6% | 7.2% |
| Find the Number of Distinct Colors Among the Balls | Medium | 54.2% | 7.2% |
| Sentence Similarity II | Medium | 51.1% | 7.2% |
| Count Unique Characters of All Substrings of a Given String | Hard | 53.5% | 7.2% |
| Divide Array Into Equal Pairs | Easy | 79.2% | 7.2% |
| Finding Pairs With a Certain Sum | Medium | 61.6% | 7.2% |
| Maximum Number of Words You Can Type | Easy | 82.9% | 7.2% |
| Max Pair Sum in an Array | Easy | 60.4% | 7.2% |
| The Two Sneaky Numbers of Digitville | Easy | 89.9% | 7.2% |
| Check if All the Integers in a Range Are Covered | Easy | 50.8% | 7.2% |
| Check if All Characters Have Equal Number of Occurrences | Easy | 79.4% | 7.2% |
| Maximum XOR of Two Numbers in an Array | Medium | 53.4% | 7.2% |
| Find Most Frequent Vowel and Consonant | Easy | 89.3% | 7.2% |
| Longest String Chain | Medium | 62.8% | 7.2% |
| Count Largest Group | Easy | 74.7% | 7.2% |
| Power Grid Maintenance | Medium | 56.3% | 7.2% |
| Minimum Time to Collect All Apples in a Tree | Medium | 63.6% | 7.2% |
| Longest Nice Substring | Easy | 63.8% | 7.2% |
| Escape a Large Maze | Hard | 36.3% | 7.2% |
| Smallest Integer Divisible by K | Medium | 54.3% | 7.2% |
| Minimize Malware Spread | Hard | 43.0% | 7.2% |
| Split Array With Same Average | Hard | 26.8% | 7.2% |
| Rank Teams by Votes | Medium | 60.0% | 7.2% |
| Maximum Number of Occurrences of a Substring | Medium | 54.3% | 7.2% |
| Unique Email Addresses | Easy | 67.8% | 7.2% |
| Number of Good Paths | Hard | 56.3% | 7.2% |
| Minimum Subarray Length With Distinct Sum At Least K | Medium | | 5.0% |
| Check if Strings Can be Made Equal With Operations II | Medium | 56.1% | 5.0% |
| Minimum Distance Between Three Equal Elements I | Easy | | 5.0% |
| K-Similar Strings | Hard | 40.6% | 5.0% |
| Construct Binary Tree from Preorder and Postorder Traversal | Medium | 78.1% | 5.0% |
| Equal Row and Column Pairs | Medium | 70.8% | 5.0% |
| Length of Longest Subarray With at Most K Frequency | Medium | 56.4% | 5.0% |
| The Number of Beautiful Subsets | Medium | 50.9% | 5.0% |
| Find Elements in a Contaminated Binary Tree | Medium | 84.1% | 5.0% |
| Find the Number of Good Pairs II | Medium | 26.6% | 5.0% |
| Find Longest Special Substring That Occurs Thrice I | Medium | 61.9% | 5.0% |
| Make Two Arrays Equal by Reversing Subarrays | Easy | 75.8% | 5.0% |
| Two Sum III - Data structure design | Easy | 39.1% | 5.0% |
| Word Pattern II | Medium | 48.8% | 5.0% |
| Random Pick with Blacklist | Hard | 34.6% | 5.0% |
| Simple Bank System | Medium | 69.8% | 5.0% |
| Minimum Length of String After Operations | Medium | 75.0% | 5.0% |
| Describe the Painting | Medium | 52.0% | 5.0% |
| Select K Disjoint Special Substrings | Medium | 19.1% | 5.0% |
| Increasing Decreasing String | Easy | 77.2% | 5.0% |
| Merge Two 2D Arrays by Summing Values | Easy | 81.7% | 5.0% |
| Find Common Elements Between Two Arrays | Easy | 84.4% | 5.0% |
| Minimum Index of a Valid Split | Medium | 75.5% | 5.0% |
| Two-Letter Card Game | Medium | 12.2% | 5.0% |
| Longest Substring with At Most Two Distinct Characters | Medium | 57.0% | 5.0% |
| Find Smallest Common Element in All Rows | Medium | 76.8% | 5.0% |
| Longest Subsequence Repeated k Times | Hard | 71.3% | 5.0% |
| Find Lucky Integer in an Array | Easy | 75.5% | 5.0% |
| Delete Duplicate Folders in System | Hard | 77.7% | 5.0% |
| Stable Subarrays With Equal Boundary and Interior Sum | Medium | 25.9% | 5.0% |
| Lowest Common Ancestor of Deepest Leaves | Medium | 79.4% | 5.0% |
| Find Valid Pair of Adjacent Digits in String | Easy | 60.6% | 5.0% |
| Remove Duplicates From an Unsorted Linked List | Medium | 75.7% | 5.0% |
| Count Substrings That Can Be Rearranged to Contain a String I | Medium | 42.7% | 5.0% |
| Maximum Size of a Set After Removals | Medium | 46.1% | 5.0% |
| Minimum Operations to Write the Letter Y on a Grid | Medium | 64.3% | 5.0% |
| Sum of Perfect Square Ancestors | Hard | 42.5% | 5.0% |
| Non-decreasing Subsequences | Medium | 62.5% | 5.0% |
| Encrypt and Decrypt Strings | Hard | 38.1% | 5.0% |
| Longest Word in Dictionary | Medium | 54.5% | 5.0% |
| Minimum Seconds to Equalize a Circular Array | Medium | 28.5% | 5.0% |
| Smallest Subtree with all the Deepest Nodes | Medium | 77.5% | 5.0% |
| Operations on Tree | Medium | 45.0% | 5.0% |
| Implement Router | Medium | 39.1% | 5.0% |
| Count Good Meals | Medium | 32.6% | 5.0% |
| Design Movie Rental System | Hard | 62.6% | 5.0% |
| Similar String Groups | Hard | 56.1% | 5.0% |
| Sparse Matrix Multiplication | Medium | 69.2% | 5.0% |
| Restore the Array From Adjacent Pairs | Medium | 75.1% | 5.0% |
| Find Original Array From Doubled Array | Medium | 40.7% | 5.0% |
| Implement Trie II (Prefix Tree) | Medium | 63.3% | 5.0% |
| Design Spreadsheet | Medium | 74.3% | 5.0% |
| 3Sum With Multiplicity | Medium | 46.2% | 5.0% |
| Unique Morse Code Words | Easy | 83.6% | 5.0% |
| Longest Palindrome by Concatenating Two Letter Words | Medium | 53.5% | 5.0% |
| Grid Teleportation Traversal | Medium | 23.2% | 5.0% |
| Minimum Distance Between Three Equal Elements II | Medium | | 5.0% |
| Properties Graph | Medium | | 5.0% |
| Largest Color Value in a Directed Graph | Hard | 57.3% | 5.0% |
| Find the Distinct Difference Array | Easy | | 5.0% |
| Binary Trees With Factors | Medium | 53.1% | 5.0% |
| Find Mirror Score of a String | Medium | 35.4% | 5.0% |
