| Trapping Rain Water | Hard | 66.8% | 100.0% | ArrayTwo PointersDynamic Programming+2 |
| Median of Two Sorted Arrays | Hard | 46.0% | 80.4% | ArrayBinary SearchDivide and Conquer |
| First Unique Character in a String | Easy | 65.1% | 78.0% | Hash TableStringQueue+1 |
| Fraction to Recurring Decimal | Medium | 30.6% | 77.1% | Hash TableMathString |
| High Five | Easy | 74.2% | 76.2% | ArrayHash TableSorting+1 |
| Minimum Path Sum | Medium | 67.8% | 67.1% | ArrayDynamic ProgrammingMatrix |
| LRU Cache | Medium | 46.8% | 64.8% | Hash TableLinked ListDesign+1 |
| Container With Most Water | Medium | 59.6% | 64.8% | ArrayTwo PointersGreedy |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 63.6% | Hash TableStringSliding Window |
| String Compression | Medium | 59.6% | 62.2% | Two PointersString |
| Find the Winner of the Circular Game | Medium | 82.2% | 59.9% | ArrayMathRecursion+2 |
| Merge Intervals | Medium | 51.2% | 59.9% | ArraySorting |
| Robot Bounded In Circle | Medium | 56.5% | 59.9% | MathStringSimulation |
| Group Anagrams | Medium | 72.2% | 58.2% | ArrayHash TableString+1 |
| Decode Ways | Medium | 37.6% | 58.2% | StringDynamic Programming |
| Number of Islands | Medium | 63.8% | 57.2% | ArrayDepth-First SearchBreadth-First Search+2 |
| Search in Rotated Sorted Array | Medium | 44.1% | 57.2% | ArrayBinary Search |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 55.2% | ArrayDynamic Programming |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 55.2% | ArrayBinary Search |
| Better Compression of String | Medium | 75.3% | 55.2% | Hash TableStringSorting+1 |
| Knight Probability in Chessboard | Medium | 56.9% | 55.2% | Dynamic Programming |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 52.9% | ArrayDynamic ProgrammingGreedy |
| Two Sum | Easy | 57.1% | 52.9% | ArrayHash Table |
| Pairs of Songs With Total Durations Divisible by 60 | Medium | 53.4% | 52.9% | ArrayHash TableCounting |
| Robot Return to Origin | Easy | 76.5% | 51.6% | StringSimulation |
| Valid Arrangement of Pairs | Hard | 66.5% | 51.6% | ArrayDepth-First SearchGraph Theory+1 |
| Design HashMap | Easy | 66.4% | 50.3% | ArrayHash TableLinked List+2 |
| Minimum Moves to Capture The Queen | Medium | 22.3% | 50.3% | MathEnumeration |
| Corporate Flight Bookings | Medium | 66.5% | 50.3% | ArrayPrefix Sum |
| Minimum Length of String After Deleting Similar Ends | Medium | 56.1% | 50.3% | Two PointersString |
| Maximum Subarray | Medium | 53.0% | 48.8% | ArrayDivide and ConquerDynamic Programming |
| Find the Minimum Amount of Time to Brew Potions | Medium | 62.7% | 48.8% | ArraySimulationPrefix Sum |
| Shortest Subarray with Sum at Least K | Hard | 32.6% | 48.8% | ArrayBinary SearchQueue+4 |
| Range Product Queries of Powers | Medium | 61.4% | 48.8% | ArrayBit ManipulationPrefix Sum |
| Minimum Cost Homecoming of a Robot in a Grid | Medium | 51.6% | 48.8% | ArrayGreedy |
| Top K Frequent Elements | Medium | 65.9% | 47.1% | ArrayHash TableDivide and Conquer+5 |
| Pascal's Triangle | Easy | 78.7% | 47.1% | ArrayDynamic Programming |
| Kth Largest Element in an Array | Medium | 68.8% | 47.1% | ArrayDivide and ConquerSorting+2 |
| Permutations III | Medium | 86.9% | 47.1% | ArrayBacktracking |
| Count Palindromic Subsequences | Hard | 41.0% | 47.1% | StringDynamic Programming |
| Print Zero Even Odd | Medium | 65.3% | 47.1% | Concurrency |
| Perform String Shifts | Easy | 56.0% | 47.1% | ArrayMathString |
| Keep Multiplying Found Values by Two | Easy | 75.1% | 47.1% | ArrayHash TableSorting+1 |
| Successful Pairs of Spells and Potions | Medium | 49.5% | 47.1% | ArrayTwo PointersBinary Search+1 |
| Minimum Number of Chairs in a Waiting Room | Easy | 79.2% | 47.1% | StringSimulation |
| Minimum Falling Path Sum | Medium | 60.8% | 47.1% | ArrayDynamic ProgrammingMatrix |
| Find All Good Indices | Medium | 40.7% | 47.1% | ArrayDynamic ProgrammingPrefix Sum |
| Maximize Palindrome Length From Subsequences | Hard | 38.2% | 47.1% | StringDynamic Programming |
| Determine if Two Events Have Conflict | Easy | 53.1% | 47.1% | ArrayString |
| Count Number of Texts | Medium | 49.9% | 47.1% | Hash TableMathString+1 |
| Sort the Jumbled Numbers | Medium | 60.0% | 47.1% | ArraySorting |
| Count Collisions of Monkeys on a Polygon | Medium | 30.0% | 47.1% | MathRecursion |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 45.3% | StringStack |
| Optimal Account Balancing | Hard | 50.3% | 45.3% | ArrayDynamic ProgrammingBacktracking+2 |
| Car Pooling | Medium | 56.2% | 45.3% | ArraySortingHeap (Priority Queue)+2 |
| Product of Array Except Self | Medium | 68.6% | 43.3% | ArrayPrefix Sum |
| Sliding Window Maximum | Hard | 48.5% | 43.3% | ArrayQueueSliding Window+2 |
| Construct Smallest Number From DI String | Medium | 85.6% | 43.3% | StringBacktrackingStack+1 |
| Palindromic Substrings | Medium | 72.6% | 43.3% | Two PointersStringDynamic Programming |
| Backspace String Compare | Easy | 49.8% | 43.3% | Two PointersStringStack+1 |
| Longest Repeating Character Replacement | Medium | 59.1% | 43.3% | Hash TableStringSliding Window |
| Coin Change | Medium | 48.0% | 43.3% | ArrayDynamic ProgrammingBreadth-First Search |
| Jump Game | Medium | 40.5% | 43.3% | ArrayDynamic ProgrammingGreedy |
| Allocate Mailboxes | Hard | 56.5% | 43.3% | ArrayMathDynamic Programming+1 |
| Number of Perfect Pairs | Medium | 33.4% | 43.3% | ArrayMathTwo Pointers+1 |
| Design Event Manager | Medium | | 43.3% | ArrayHash TableDesign+2 |
| 3Sum | Medium | 38.6% | 41.0% | ArrayTwo PointersSorting |
| Sqrt(x) | Easy | 41.4% | 41.0% | MathBinary Search |
| N-Queens | Hard | 75.0% | 41.0% | ArrayBacktracking |
| Check if the Sentence Is Pangram | Easy | 84.1% | 41.0% | Hash TableString |
| Subarray Sum Equals K | Medium | 46.8% | 41.0% | ArrayHash TablePrefix Sum |
| Integer to English Words | Hard | 34.8% | 41.0% | MathStringRecursion |
| Longest Palindromic Substring | Medium | 37.4% | 41.0% | Two PointersStringDynamic Programming |
| Daily Temperatures | Medium | 68.4% | 38.4% | ArrayStackMonotonic Stack |
| Unique Paths | Medium | 66.6% | 38.4% | MathDynamic ProgrammingCombinatorics |
| String to Integer (atoi) | Medium | 20.6% | 38.4% | String |
| Valid Parentheses | Easy | 43.7% | 38.4% | StringStack |
| House Robber | Medium | 52.9% | 38.4% | ArrayDynamic Programming |
| Asteroid Collision | Medium | 47.2% | 38.4% | ArrayStackSimulation |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 38.4% | ArrayBinary SearchDynamic Programming+1 |
| Generate Parentheses | Medium | 78.3% | 38.4% | StringDynamic ProgrammingBacktracking |
| Open the Lock | Medium | 61.2% | 38.4% | ArrayHash TableString+1 |
| Consecutive Characters | Easy | 60.3% | 38.4% | String |
| Binary Tree Cameras | Hard | 47.6% | 38.4% | Dynamic ProgrammingTreeDepth-First Search+1 |
| The Skyline Problem | Hard | 45.0% | 38.4% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Move Zeroes | Easy | 63.6% | 38.4% | ArrayTwo Pointers |
| Minimum Initial Energy to Finish Tasks | Hard | 60.7% | 35.3% | ArrayGreedySorting |
| Max Area of Island | Medium | 73.8% | 35.3% | ArrayDepth-First SearchBreadth-First Search+2 |
| Roman to Integer | Easy | 66.3% | 35.3% | Hash TableMathString |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 35.3% | ArrayBinary Search |
| Search a 2D Matrix | Medium | 53.6% | 35.3% | ArrayBinary SearchMatrix |
| Find Peak Element | Medium | 46.8% | 35.3% | ArrayBinary Search |
| Find Median from Data Stream | Hard | 54.2% | 35.3% | Two PointersDesignSorting+2 |
| Minimum Value to Get Positive Step by Step Sum | Easy | 64.6% | 35.3% | ArrayPrefix Sum |
| Reverse Linked List | Easy | 80.3% | 35.3% | Linked ListRecursion |
| Longest Consecutive Sequence | Medium | 47.0% | 35.3% | ArrayHash TableUnion-Find |
| Maximal Rectangle | Hard | 58.1% | 35.3% | ArrayDynamic ProgrammingStack+2 |
| Spiral Matrix | Medium | 56.2% | 35.3% | ArrayMatrixSimulation |
| Pow(x, n) | Medium | 38.3% | 35.3% | MathRecursion |
| Candy | Hard | 48.0% | 35.3% | ArrayGreedy |
| Design Circular Deque | Medium | 64.4% | 35.3% | ArrayLinked ListDesign+1 |
| Circular Array Loop | Medium | 37.0% | 35.3% | ArrayHash TableTwo Pointers |
| Course Schedule II | Medium | 55.0% | 35.3% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Minimum Window Substring | Hard | 47.0% | 31.5% | Hash TableStringSliding Window |
| Climbing Stairs | Easy | 53.9% | 31.5% | MathDynamic ProgrammingMemoization |
| Linked List Cycle | Easy | 53.9% | 31.5% | Hash TableLinked ListTwo Pointers |
| Minimum Size Subarray Sum | Medium | 51.1% | 31.5% | ArrayBinary SearchSliding Window+1 |
| Power of Three | Easy | 50.7% | 31.5% | MathRecursion |
| Reaching Points | Hard | 34.2% | 31.5% | Math |
| Rotting Oranges | Medium | 58.2% | 31.5% | ArrayBreadth-First SearchMatrix |
| Maximum Product Subarray | Medium | 36.0% | 31.5% | ArrayDynamic Programming |
| Add Two Numbers | Medium | 48.0% | 31.5% | Linked ListMathRecursion |
| Merge k Sorted Lists | Hard | 58.9% | 31.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Identify the Largest Outlier in an Array | Medium | 36.2% | 31.5% | ArrayHash TableCounting+1 |
| Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | 72.3% | 31.5% | ArraySliding Window |
| Russian Doll Envelopes | Hard | 37.7% | 31.5% | ArrayBinary SearchDynamic Programming+1 |
| Reverse Nodes in k-Group | Hard | 65.4% | 31.5% | Linked ListRecursion |
| Valid Triangle Number | Medium | 56.7% | 31.5% | ArrayTwo PointersBinary Search+2 |
| Task Scheduler | Medium | 62.7% | 31.5% | ArrayHash TableGreedy+3 |
| Merge Sorted Array | Easy | 54.4% | 31.5% | ArrayTwo PointersSorting |
| Maximum XOR of Two Numbers in an Array | Medium | 53.4% | 31.5% | ArrayHash TableBit Manipulation+1 |
| Third Maximum Number | Easy | 38.9% | 31.5% | ArraySorting |
| Path with Maximum Gold | Medium | 68.3% | 31.5% | ArrayBacktrackingMatrix |
| Koko Eating Bananas | Medium | 49.7% | 31.5% | ArrayBinary Search |
| Largest Rectangle in Histogram | Hard | 49.4% | 31.5% | ArrayStackMonotonic Stack |
| Gas Station | Medium | 47.5% | 31.5% | ArrayGreedy |
| Letter Combinations of a Phone Number | Medium | 65.5% | 26.7% | Hash TableStringBacktracking |
| Next Permutation | Medium | 44.8% | 26.7% | ArrayTwo Pointers |
| First Missing Positive | Hard | 42.5% | 26.7% | ArrayHash Table |
| Word Search | Medium | 46.9% | 26.7% | ArrayStringBacktracking+2 |
| Intersection of Two Linked Lists | Easy | 63.2% | 26.7% | Hash TableLinked ListTwo Pointers |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 26.7% | ArrayDynamic Programming |
| Maximal Square | Medium | 50.0% | 26.7% | ArrayDynamic ProgrammingMatrix |
| Decode String | Medium | 62.3% | 26.7% | StringStackRecursion |
| Design Underground System | Medium | 74.4% | 26.7% | Hash TableStringDesign |
| Minimum Number of Arrows to Burst Balloons | Medium | 61.2% | 26.7% | ArrayGreedySorting |
| Count Number of Teams | Medium | 70.2% | 26.7% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Set Matrix Zeroes | Medium | 62.5% | 26.7% | ArrayHash TableMatrix |
| Max Consecutive Ones III | Medium | 67.3% | 26.7% | ArrayBinary SearchSliding Window+1 |
| Validate Binary Search Tree | Medium | 35.4% | 26.7% | TreeDepth-First SearchBinary Search Tree+1 |
| Game of Life | Medium | 72.4% | 26.7% | ArrayMatrixSimulation |
| Find the Closest Palindrome | Hard | 31.8% | 26.7% | MathString |
| Maximum Size Subarray Sum Equals k | Medium | 50.8% | 26.7% | ArrayHash TablePrefix Sum |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 26.7% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Snakes and Ladders | Medium | 48.0% | 26.7% | ArrayBreadth-First SearchMatrix |
| Partition Equal Subset Sum | Medium | 49.2% | 26.7% | ArrayDynamic Programming |
| Spiral Matrix II | Medium | 74.7% | 26.7% | ArrayMatrixSimulation |
| Frequency of the Most Frequent Element | Medium | 44.6% | 26.7% | ArrayBinary SearchGreedy+3 |
| Path Sum | Easy | 54.5% | 26.7% | TreeDepth-First SearchBreadth-First Search+1 |
| Palindrome Pairs | Hard | 37.0% | 26.7% | ArrayHash TableString+2 |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 26.7% | ArrayDynamic Programming |
| Count Primes | Medium | 35.8% | 26.7% | ArrayMathEnumeration+1 |
| Greatest Sum Divisible by Three | Medium | 57.1% | 26.7% | ArrayDynamic ProgrammingGreedy+1 |
| Distribute Coins in Binary Tree | Medium | 77.3% | 26.7% | TreeDepth-First SearchBinary Tree |
| Find First and Last Position of Element in Sorted Array | Medium | 48.4% | 26.7% | ArrayBinary Search |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% | 26.7% | ArrayTwo PointersBinary Search+2 |
| Magnetic Force Between Two Balls | Medium | 71.9% | 26.7% | ArrayBinary SearchSorting |
| Majority Element | Easy | 66.1% | 26.7% | ArrayHash TableDivide and Conquer+2 |
| Kth Largest Element in a Stream | Easy | 60.7% | 26.7% | TreeDesignBinary Search Tree+3 |
| Reverse String | Easy | 80.6% | 26.7% | Two PointersString |
| Sort Colors | Medium | 69.2% | 26.7% | ArrayTwo PointersSorting |
| Rotate Image | Medium | 79.4% | 26.7% | ArrayMathMatrix |
| Minimum Number of Refueling Stops | Hard | 41.1% | 26.7% | ArrayDynamic ProgrammingGreedy+1 |
| 132 Pattern | Medium | 34.5% | 26.7% | ArrayBinary SearchStack+2 |
| Implement Stack using Queues | Easy | 69.4% | 26.7% | StackDesignQueue |
| Binary Tree Level Order Traversal | Medium | 72.2% | 26.7% | TreeBreadth-First SearchBinary Tree |
| Single Element in a Sorted Array | Medium | 59.2% | 26.7% | ArrayBinary Search |
| Valid Sudoku | Medium | 64.2% | 26.7% | ArrayHash TableMatrix |
| Jump Game II | Medium | 42.5% | 26.7% | ArrayDynamic ProgrammingGreedy |
| Minimum Number of Moves to Make Palindrome | Hard | 52.6% | 26.7% | Two PointersStringGreedy+1 |
| Valid Parenthesis String | Medium | 39.8% | 26.7% | StringDynamic ProgrammingStack+1 |
| Minimum Increment to Make Array Unique | Medium | 60.6% | 26.7% | ArrayGreedySorting+1 |
| Find the Winner of an Array Game | Medium | 56.8% | 20.2% | ArraySimulation |
| Shortest Bridge | Medium | 59.3% | 20.2% | ArrayDepth-First SearchBreadth-First Search+1 |
| Pascal's Triangle II | Easy | 67.1% | 20.2% | ArrayDynamic Programming |
| Missing Number | Easy | 71.7% | 20.2% | ArrayHash TableMath+3 |
| Find the Duplicate Number | Medium | 64.0% | 20.2% | ArrayTwo PointersBinary Search+1 |
| Longest Increasing Subsequence | Medium | 59.1% | 20.2% | ArrayBinary SearchDynamic Programming |
| Next Greater Element I | Easy | 75.8% | 20.2% | ArrayHash TableStack+1 |
| Count of Integers | Hard | 38.2% | 20.2% | MathStringDynamic Programming |
| Integer to Roman | Medium | 70.5% | 20.2% | Hash TableMathString |
| Reorder List | Medium | 64.6% | 20.2% | Linked ListTwo PointersStack+1 |
| Merge Two Sorted Lists | Easy | 68.0% | 20.2% | Linked ListRecursion |
| Word Break | Medium | 49.1% | 20.2% | ArrayHash TableString+3 |
| Basic Calculator II | Medium | 46.7% | 20.2% | MathStringStack |
| Sudoku Solver | Hard | 65.4% | 20.2% | ArrayHash TableBacktracking+1 |
| Ugly Number II | Medium | 49.5% | 20.2% | Hash TableMathDynamic Programming+1 |
| Restore IP Addresses | Medium | 55.3% | 20.2% | StringBacktracking |
| Flood Fill | Easy | 67.9% | 20.2% | ArrayDepth-First SearchBreadth-First Search+1 |
| LFU Cache | Hard | 48.6% | 20.2% | Hash TableLinked ListDesign+1 |
| Subsets | Medium | 82.1% | 20.2% | ArrayBacktrackingBit Manipulation |
| Excel Sheet Column Number | Easy | 67.3% | 20.2% | MathString |
| Maximum Sum Circular Subarray | Medium | 49.5% | 20.2% | ArrayDivide and ConquerDynamic Programming+2 |
| Remove One Element to Make the Array Strictly Increasing | Easy | 29.6% | 20.2% | Array |
| Simple Bank System | Medium | 69.8% | 20.2% | ArrayHash TableDesign+1 |
| Remove All Occurrences of a Substring | Medium | 78.4% | 20.2% | StringStackSimulation |
| Isomorphic Strings | Easy | 48.1% | 20.2% | Hash TableString |
| Two Sum IV - Input is a BST | Easy | 63.0% | 20.2% | Hash TableTwo PointersTree+4 |
| Count Good Nodes in Binary Tree | Medium | 73.8% | 20.2% | TreeDepth-First SearchBreadth-First Search+1 |
| Next Greater Element II | Medium | 67.9% | 20.2% | ArrayStackMonotonic Stack |
| K-th Symbol in Grammar | Medium | 48.1% | 20.2% | MathBit ManipulationRecursion |
| Meeting Rooms III | Hard | 51.6% | 20.2% | ArrayHash TableSorting+2 |
| Design Circular Queue | Medium | 54.0% | 20.2% | ArrayLinked ListDesign+1 |
| Lexicographically Smallest String After Substring Operation | Medium | 34.5% | 20.2% | StringGreedy |
| Shortest Path in Binary Matrix | Medium | 51.1% | 20.2% | ArrayBreadth-First SearchMatrix |
| Find the Celebrity | Medium | 48.9% | 20.2% | Two PointersGraph TheoryInteractive |
| Triangle | Medium | 59.9% | 20.2% | ArrayDynamic Programming |
| Bus Routes | Hard | 47.1% | 20.2% | ArrayHash TableBreadth-First Search |
| Symmetric Tree | Easy | 60.8% | 20.2% | TreeDepth-First SearchBreadth-First Search+1 |
| Burst Balloons | Hard | 63.0% | 20.2% | ArrayDynamic Programming |
| Fizz Buzz | Easy | 75.3% | 20.2% | MathStringSimulation |
| Non-overlapping Intervals | Medium | 56.7% | 20.2% | ArrayDynamic ProgrammingGreedy+1 |
| Text Justification | Hard | 50.5% | 20.2% | ArrayStringSimulation |
| Length of Longest Fibonacci Subsequence | Medium | 57.5% | 20.2% | ArrayHash TableDynamic Programming |
| Reorganize String | Medium | 56.8% | 20.2% | Hash TableStringGreedy+3 |
| Longest Palindromic Subsequence | Medium | 65.1% | 20.2% | StringDynamic Programming |
| Word Ladder | Hard | 44.9% | 20.2% | Hash TableStringBreadth-First Search |
| Find Original Array From Doubled Array | Medium | 40.7% | 20.2% | ArrayHash TableGreedy+1 |
| Cherry Pickup | Hard | 39.1% | 20.2% | ArrayDynamic ProgrammingMatrix |
| Unique Paths III | Hard | 82.8% | 20.2% | ArrayBacktrackingBit Manipulation+1 |
| Delete the Middle Node of a Linked List | Medium | 59.5% | 20.2% | Linked ListTwo Pointers |
| Find Pivot Index | Easy | 62.1% | 20.2% | ArrayPrefix Sum |
| Snapshot Array | Medium | 36.7% | 20.2% | ArrayHash TableBinary Search+1 |
| Maximum Average Subarray I | Easy | 47.1% | 20.2% | ArraySliding Window |
| Permutations II | Medium | 63.0% | 20.2% | ArrayBacktrackingSorting |
| Perfect Squares | Medium | 56.3% | 20.2% | MathDynamic ProgrammingBreadth-First Search |
| Longest Duplicate Substring | Hard | 31.1% | 20.2% | StringBinary SearchSliding Window+3 |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 20.2% | TreeBreadth-First SearchBinary Tree |
| Power of Two | Easy | 49.9% | 20.2% | MathBit ManipulationRecursion |
| Parsing A Boolean Expression | Hard | 69.8% | 20.2% | StringStackRecursion |
| Find Shortest Path with K Hops | Hard | 68.7% | 20.2% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Tree Diameter | Medium | 61.3% | 20.2% | TreeDepth-First SearchBreadth-First Search+2 |
| Minimum Swaps to Make Strings Equal | Medium | 65.3% | 20.2% | MathStringGreedy |
| Car Fleet | Medium | 54.8% | 20.2% | ArrayStackSorting+1 |
| Evaluate Division | Medium | 64.0% | 20.2% | ArrayStringDepth-First Search+4 |
| Odd Even Linked List | Medium | 62.3% | 20.2% | Linked List |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 20.2% | Hash TableTreeDepth-First Search+2 |
| Single-Threaded CPU | Medium | 47.4% | 20.2% | ArraySortingHeap (Priority Queue) |
| Reverse Words in a String | Medium | 55.6% | 20.2% | Two PointersString |
| Minimum Cost to Reach City With Discounts | Medium | 60.2% | 20.2% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Diameter of N-Ary Tree | Medium | 75.4% | 20.2% | TreeDepth-First Search |
| Largest Number | Medium | 42.6% | 20.2% | ArrayStringGreedy+1 |
| K Closest Points to Origin | Medium | 68.8% | 20.2% | ArrayMathDivide and Conquer+4 |
| Count Square Submatrices with All Ones | Medium | 80.7% | 20.2% | ArrayDynamic ProgrammingMatrix |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 20.2% | Hash TableStringSliding Window |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 20.2% | Hash TableStringDesign+1 |
| Evaluate Reverse Polish Notation | Medium | 57.1% | 20.2% | ArrayMathStack |
| Search a 2D Matrix II | Medium | 56.9% | 20.2% | ArrayBinary SearchDivide and Conquer+1 |
| Permutations | Medium | 81.7% | 20.2% | ArrayBacktracking |
| Remove Duplicates from Sorted Array | Easy | 62.3% | 20.2% | ArrayTwo Pointers |
| Find the Longest Substring Containing Vowels in Even Counts | Medium | 75.7% | 20.2% | Hash TableStringBit Manipulation+1 |
| Minimum Insertion Steps to Make a String Palindrome | Hard | 73.7% | 20.2% | StringDynamic Programming |
| Design Browser History | Medium | 78.2% | 20.2% | ArrayLinked ListStack+3 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 20.2% | TreeDepth-First SearchBinary Tree |
| Valid Anagram | Easy | 67.8% | 20.2% | Hash TableStringSorting |
| Top K Frequent Words | Medium | 60.0% | 20.2% | ArrayHash TableString+5 |
| Is Subsequence | Easy | 48.9% | 20.2% | Two PointersStringDynamic Programming |
| Accounts Merge | Medium | 60.9% | 20.2% | ArrayHash TableString+4 |
| Kth Ancestor of a Tree Node | Hard | 37.2% | 20.2% | Binary SearchDynamic ProgrammingBit Manipulation+4 |
| Split Array Largest Sum | Hard | 59.9% | 20.2% | ArrayBinary SearchDynamic Programming+2 |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 20.2% | ArrayGreedySorting+1 |