1 Maximum Points You Can Obtain from Cards Array Sliding Window Prefix Sum
Medium 100
0.6% 2 Minimum Number of Coins to be Added Array Greedy Sorting
Medium 84
0.6% 3 Design Movie Rental System Array Hash Table Design Heap (Priority Queue) Ordered Set
Hard 84
0.6% 4 The Score of Students Solving Math Expression Array Hash Table Math String Dynamic Programming Stack Memoization
Hard 82
0.3% 5 Minimum Cost to Reach City With Discounts Graph Theory Heap (Priority Queue) Shortest Path
Medium 82
0.6% 6 Numbers With Same Consecutive Differences Backtracking Breadth-First Search
Medium 82
0.6% 7 Triples with Bitwise AND Equal To Zero Array Hash Table Bit Manipulation
Hard 82
0.6% 8 Minimum Limit of Balls in a Bag Array Binary Search
Medium 82
0.7% 9 Rotting Oranges Array Breadth-First Search Matrix
Medium 82
0.6% 10 Transform Array to All Equal Elements Array Greedy
Medium 82
0.3% 11 Container With Most Water Array Two Pointers Greedy
Medium 80
0.6% 12 Trapping Rain Water Array Two Pointers Dynamic Programming Stack Monotonic Stack
Hard 77
0.7% 13 Koko Eating Bananas Array Binary Search
Medium 77
0.5% 14 Gas Station Array Greedy
Medium 77
0.5% 15 Find The Least Frequent Digit Array Hash Table Math Counting
Easy 77
0.7% 16 Two Sum Array Hash Table
Easy 70
0.6% 17 Largest Rectangle in Histogram Array Stack Monotonic Stack
Hard 70
0.5% 18 Search in Rotated Sorted Array Array Binary Search
Medium 65
0.5% 19 Kth Largest Element in an Array Array Divide and Conquer Sorting Heap (Priority Queue) Quickselect
Medium 60
0.7% 20 Create Maximum Number Array Two Pointers Stack Greedy Monotonic Stack
Hard 60
0.4% 21 Asteroid Collision Array Stack Simulation
Medium 60
0.5% 22 Cherry Pickup II Array Dynamic Programming Matrix
Hard 60
0.7% 23 Cut Off Trees for Golf Event Array Breadth-First Search Heap (Priority Queue) Matrix
Hard 60
0.4% 24 Find Median from Data Stream Two Pointers Design Sorting Heap (Priority Queue) Data Stream
Hard 60
0.5% 25 Reverse Substrings Between Each Pair of Parentheses String Stack
Medium 60
0.7% 26 Sum of Subarray Minimums Array Dynamic Programming Stack Monotonic Stack
Medium 60
0.4% 27 Next Permutation Array Two Pointers
Medium 60
0.5% 28 Unique Paths Math Dynamic Programming Combinatorics
Medium 60
0.7% 29 Rectangle Area II Array Segment Tree Sweep Line Ordered Set
Hard 60
0.6% 30 Contain Virus Array Depth-First Search Breadth-First Search Matrix Simulation
Hard 60
0.6% 31 Pacific Atlantic Water Flow Array Depth-First Search Breadth-First Search Matrix
Medium 60
0.6% 32 Edit Distance String Dynamic Programming
Medium 53
0.6% 33 Dungeon Game Array Dynamic Programming Matrix
Hard 53
0.4% 34 Course Schedule Depth-First Search Breadth-First Search Graph Theory Topological Sort
Medium 53
0.5% 35 Amount of Time for Binary Tree to Be Infected Hash Table Tree Depth-First Search Breadth-First Search Binary Tree
Medium 53
0.7% 36 Subarray Sum Equals K Array Hash Table Prefix Sum
Medium 53
0.5% 37 Maximum Width of Binary Tree Tree Depth-First Search Breadth-First Search Binary Tree
Medium 53
0.5% 38 Minimum Area Rectangle Array Hash Table Math Geometry Sorting
Medium 53
0.6% 39 Capacity To Ship Packages Within D Days Array Binary Search
Medium 53
0.7% 40 Candy Array Greedy
Hard 53
0.5% 41 Next Greater Element I Array Hash Table Stack Monotonic Stack
Easy 53
0.8% 42 Sort Colors Array Two Pointers Sorting
Medium 53
0.7% 43 Maximum Performance of a Team Array Greedy Sorting Heap (Priority Queue)
Hard 53
0.5% 44 Merge Intervals Array Sorting
Medium 53
0.5% 45 Rotate Image Array Math Matrix
Medium 53
0.8% 46 Evaluate Division Array String Depth-First Search Breadth-First Search Union-Find Graph Theory Shortest Path
Medium 53
0.6% 47 Generate Parentheses String Dynamic Programming Backtracking
Medium 53
0.8% 48 Critical Connections in a Network Depth-First Search Graph Theory Biconnected Component
Hard 53
0.6% 49 Cheapest Flights Within K Stops Dynamic Programming Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue) Shortest Path
Medium 53
0.4% 50 Trapping Rain Water II Array Breadth-First Search Heap (Priority Queue) Matrix
Hard 53
0.6% 51 Maximal Square Array Dynamic Programming Matrix
Medium 53
0.5% 52 Next Greater Element II Array Stack Monotonic Stack
Medium 53
0.7% 53 3Sum Array Two Pointers Sorting
Medium 53
0.4% 54 Merge k Sorted Lists Linked List Divide and Conquer Heap (Priority Queue) Merge Sort
Hard 53
0.6% 55 Longest Substring Without Repeating Characters Hash Table String Sliding Window
Medium 43
0.4% 56 Median of Two Sorted Arrays Array Binary Search Divide and Conquer
Hard 43
0.5% 57 First Missing Positive Array Hash Table
Hard 43
0.4% 58 Maximal Rectangle Array Dynamic Programming Stack Matrix Monotonic Stack
Hard 43
0.6% 59 Binary Tree Maximum Path Sum Dynamic Programming Tree Depth-First Search Binary Tree
Hard 43
0.4% 60 Number of Islands Array Depth-First Search Breadth-First Search Union-Find Matrix
Medium 43
0.6% 61 Product of Array Except Self Array Prefix Sum
Medium 43
0.7% 62 Partition Equal Subset Sum Array Dynamic Programming
Medium 43
0.5% 63 01 Matrix Array Dynamic Programming Breadth-First Search Matrix
Medium 43
0.5% 64 Smallest Range Covering Elements from K Lists Array Hash Table Greedy Sliding Window Sorting Heap (Priority Queue)
Hard 43
0.7% 65 Cherry Pickup Array Dynamic Programming Matrix
Hard 43
0.4% 66 Shortest Bridge Array Depth-First Search Breadth-First Search Matrix
Medium 43
0.6% 67 Car Pooling Array Sorting Heap (Priority Queue) Simulation Prefix Sum
Medium 43
0.6% 68 House Robber Array Dynamic Programming
Medium 43
0.5% 69 All Nodes Distance K in Binary Tree Hash Table Tree Depth-First Search Breadth-First Search Binary Tree
Medium 43
0.7% 70 Filling Bookcase Shelves Array Dynamic Programming
Medium 43
0.7% 71 Path Sum II Backtracking Tree Depth-First Search Binary Tree
Medium 43
0.6% 72 Reconstruct Itinerary Array String Depth-First Search Graph Theory Sorting Heap (Priority Queue) Eulerian Circuit
Hard 43
0.4% 73 Find Minimum in Rotated Sorted Array Array Binary Search
Medium 43
0.5% 74 Delete Node in a BST Tree Binary Search Tree Binary Tree
Medium 43
0.5% 75 Ways to Split Array Into Good Subarrays Array Math Dynamic Programming
Medium 43
0.4% 76 Minimum Number of Days to Make m Bouquets Array Binary Search
Medium 43
0.6% 77 3Sum Closest Array Two Pointers Sorting
Medium 43
0.5% 78 Find K Pairs with Smallest Sums Array Heap (Priority Queue)
Medium 43
0.4% 79 Course Schedule II Depth-First Search Breadth-First Search Graph Theory Topological Sort
Medium 43
0.6% 80 Maximum Frequency Stack Hash Table Stack Design Ordered Set
Hard 43
0.7% 81 Magnetic Force Between Two Balls Array Binary Search Sorting
Medium 43
0.7% 82 Robot Collisions Array Stack Sorting Simulation
Hard 43
0.6% 83 Word Ladder Hash Table String Breadth-First Search
Hard 43
0.5% 84 Sort Characters By Frequency Hash Table String Sorting Heap (Priority Queue) Bucket Sort Counting
Medium 43
0.8% 85 Boats to Save People Array Two Pointers Greedy Sorting
Medium 43
0.6% 86 Find Leaves of Binary Tree Tree Depth-First Search Binary Tree
Medium 43
0.8% 87 Find K Closest Elements Array Two Pointers Binary Search Sliding Window Sorting Heap (Priority Queue)
Medium 43
0.5% 88 Single Element in a Sorted Array Array Binary Search
Medium 43
0.6% 89 Number of Atoms Hash Table String Stack Sorting
Hard 43
0.7% 90 Serialize and Deserialize Binary Tree String Tree Depth-First Search Breadth-First Search Design Binary Tree
Hard 43
0.6% 91 Min Stack Stack Design
Medium 43
0.6% 92 Min Cost to Connect All Points Array Union-Find Graph Theory Minimum Spanning Tree
Medium 43
0.7% 93 Decode Ways String Dynamic Programming
Medium 43
0.4% 94 Find the Duplicate Number Array Two Pointers Binary Search Bit Manipulation
Medium 43
0.6% 95 Valid Parentheses String Stack
Easy 43
0.4% 96 Diameter of Binary Tree Tree Depth-First Search Binary Tree
Easy 43
0.7% 97 Best Time to Buy and Sell Stock Array Dynamic Programming
Easy 43
0.6% 98 Longest Palindromic Substring Two Pointers String Dynamic Programming
Medium 43
0.4% 99 Spiral Matrix Array Matrix Simulation
Medium 43
0.6% 100 LRU Cache Hash Table Linked List Design Doubly-Linked List
Medium 43
0.5% 101 Online Election Array Hash Table Binary Search Design
Medium 43
0.5% 102 Subsets Array Backtracking Bit Manipulation
Medium 43
0.8% 103 Map Sum Pairs Hash Table String Design Trie
Medium 43
0.6% 104 Majority Element Array Hash Table Divide and Conquer Sorting Counting
Easy 43
0.7% 105 Split Array Largest Sum Array Binary Search Dynamic Programming Greedy Prefix Sum
Hard 43
0.6%