|
EASY
|
Two Sum |
100.0 |
0.56 |
View Problem
|
Array, Hash Table |
|
EASY
|
Best Time to Buy and Sell Stock |
92.5 |
0.55 |
View Problem
|
Array, Dynamic Programming |
|
MEDIUM
|
LRU Cache |
92.5 |
0.45 |
View Problem
|
Hash Table, Linked List, Design, Doubly-Linked List |
|
MEDIUM
|
Number of Islands |
92.5 |
0.62 |
View Problem
|
Array, Depth-First Search, Breadth-First Search, Union Find, Matrix |
|
MEDIUM
|
Reorganize String |
92.5 |
0.56 |
View Problem
|
Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting |
|
MEDIUM
|
Maximum Frequency After Subarray Operation |
88.8 |
0.27 |
View Problem
|
Array, Hash Table, Dynamic Programming, Greedy, Enumeration, Prefix Sum |
|
MEDIUM
|
Longest Palindromic Substring |
86.7 |
0.36 |
View Problem
|
Two Pointers, String, Dynamic Programming |
|
MEDIUM
|
Add Two Numbers |
79.2 |
0.46 |
View Problem
|
Linked List, Math, Recursion |
|
MEDIUM
|
Koko Eating Bananas |
79.2 |
0.49 |
View Problem
|
Array, Binary Search |
|
MEDIUM
|
Longest Substring Without Repeating Characters |
79.2 |
0.37 |
View Problem
|
Hash Table, String, Sliding Window |
|
MEDIUM
|
Find First and Last Position of Element in Sorted Array |
79.2 |
0.47 |
View Problem
|
Array, Binary Search |
|
HARD
|
Trapping Rain Water |
79.2 |
0.65 |
View Problem
|
Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack |
|
MEDIUM
|
Top K Frequent Elements |
76.2 |
0.65 |
View Problem
|
Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect |
|
HARD
|
Merge k Sorted Lists |
72.7 |
0.57 |
View Problem
|
Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort |
|
MEDIUM
|
Jump Game II |
72.7 |
0.42 |
View Problem
|
Array, Dynamic Programming, Greedy |
|
MEDIUM
|
Merge Intervals |
72.7 |
0.49 |
View Problem
|
Array, Sorting |
|
MEDIUM
|
Group Anagrams |
72.7 |
0.71 |
View Problem
|
Array, Hash Table, String, Sorting |
|
MEDIUM
|
Lowest Common Ancestor of a Binary Tree |
72.7 |
0.67 |
View Problem
|
Tree, Depth-First Search, Binary Tree |
|
MEDIUM
|
Longest Repeating Character Replacement |
72.7 |
0.57 |
View Problem
|
Hash Table, String, Sliding Window |
|
HARD
|
Candy |
68.7 |
0.47 |
View Problem
|
Array, Greedy |
|
MEDIUM
|
Meeting Rooms II |
68.7 |
0.52 |
View Problem
|
Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum |
|
EASY
|
Valid Parentheses |
68.7 |
0.42 |
View Problem
|
String, Stack |
|
HARD
|
Minimum Window Substring |
68.7 |
0.45 |
View Problem
|
Hash Table, String, Sliding Window |
|
MEDIUM
|
House Robber |
68.7 |
0.52 |
View Problem
|
Array, Dynamic Programming |
|
HARD
|
Median of Two Sorted Arrays |
68.7 |
0.44 |
View Problem
|
Array, Binary Search, Divide and Conquer |
|
MEDIUM
|
Min Stack |
64.0 |
0.56 |
View Problem
|
Stack, Design |
|
MEDIUM
|
Rotate Image |
64.0 |
0.78 |
View Problem
|
Array, Math, Matrix |
|
MEDIUM
|
Best Time to Buy and Sell Stock II |
64.0 |
0.70 |
View Problem
|
Array, Dynamic Programming, Greedy |
|
HARD
|
Concatenated Words |
64.0 |
0.49 |
View Problem
|
Array, String, Dynamic Programming, Depth-First Search, Trie |
|
MEDIUM
|
Generate Parentheses |
64.0 |
0.77 |
View Problem
|
String, Dynamic Programming, Backtracking |
|
MEDIUM
|
Search a 2D Matrix |
64.0 |
0.52 |
View Problem
|
Array, Binary Search, Matrix |
|
MEDIUM
|
Coin Change |
64.0 |
0.46 |
View Problem
|
Array, Dynamic Programming, Breadth-First Search |
|
MEDIUM
|
Unique Paths |
64.0 |
0.66 |
View Problem
|
Math, Dynamic Programming, Combinatorics |
|
HARD
|
LFU Cache |
64.0 |
0.47 |
View Problem
|
Hash Table, Linked List, Design, Doubly-Linked List |
|
MEDIUM
|
Search in Rotated Sorted Array |
64.0 |
0.43 |
View Problem
|
Array, Binary Search |
|
MEDIUM
|
Next Permutation |
64.0 |
0.43 |
View Problem
|
Array, Two Pointers |
|
MEDIUM
|
Rotting Oranges |
64.0 |
0.57 |
View Problem
|
Array, Breadth-First Search, Matrix |
|
MEDIUM
|
Insert Delete GetRandom O(1) |
64.0 |
0.55 |
View Problem
|
Array, Hash Table, Math, Design, Randomized |
|
EASY
|
Flood Fill |
64.0 |
0.66 |
View Problem
|
Array, Depth-First Search, Breadth-First Search, Matrix |
|
EASY
|
Fizz Buzz |
64.0 |
0.74 |
View Problem
|
Math, String, Simulation |
|
MEDIUM
|
Top K Frequent Words |
58.2 |
0.59 |
View Problem
|
Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting |
|
MEDIUM
|
Integer to Roman |
58.2 |
0.69 |
View Problem
|
Hash Table, Math, String |
|
EASY
|
Invert Binary Tree |
58.2 |
0.79 |
View Problem
|
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
|
EASY
|
Move Zeroes |
58.2 |
0.63 |
View Problem
|
Array, Two Pointers |
|
HARD
|
Basic Calculator |
58.2 |
0.46 |
View Problem
|
Math, String, Stack, Recursion |
|
MEDIUM
|
Find All Possible Recipes from Given Supplies |
58.2 |
0.56 |
View Problem
|
Array, Hash Table, String, Graph, Topological Sort |
|
MEDIUM
|
String to Integer (atoi) |
58.2 |
0.19 |
View Problem
|
String |
|
MEDIUM
|
Capacity To Ship Packages Within D Days |
58.2 |
0.72 |
View Problem
|
Array, Binary Search |
|
EASY
|
Roman to Integer |
58.2 |
0.65 |
View Problem
|
Hash Table, Math, String |
|
EASY
|
Palindrome Number |
58.2 |
0.59 |
View Problem
|
Math |
|
MEDIUM
|
Maximum Subarray |
58.2 |
0.52 |
View Problem
|
Array, Divide and Conquer, Dynamic Programming |
|
MEDIUM
|
Word Search |
58.2 |
0.45 |
View Problem
|
Array, String, Backtracking, Depth-First Search, Matrix |
|
MEDIUM
|
Edit Distance |
58.2 |
0.59 |
View Problem
|
String, Dynamic Programming |
|
MEDIUM
|
Kth Largest Element in an Array |
58.2 |
0.68 |
View Problem
|
Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect |
|
MEDIUM
|
Minimum Equal Sum of Two Arrays After Replacing Zeros |
50.9 |
0.50 |
View Problem
|
Array, Greedy |
|
EASY
|
Majority Element |
50.9 |
0.66 |
View Problem
|
Array, Hash Table, Divide and Conquer, Sorting, Counting |
|
HARD
|
Maximum Profit in Job Scheduling |
50.9 |
0.54 |
View Problem
|
Array, Binary Search, Dynamic Programming, Sorting |
|
EASY
|
Contains Duplicate |
50.9 |
0.63 |
View Problem
|
Array, Hash Table, Sorting |
|
MEDIUM
|
Product of Array Except Self |
50.9 |
0.68 |
View Problem
|
Array, Prefix Sum |
|
MEDIUM
|
Combination Sum |
50.9 |
0.75 |
View Problem
|
Array, Backtracking |
|
MEDIUM
|
Container With Most Water |
50.9 |
0.58 |
View Problem
|
Array, Two Pointers, Greedy |
|
MEDIUM
|
Number of Provinces |
50.9 |
0.69 |
View Problem
|
Depth-First Search, Breadth-First Search, Union Find, Graph |
|
MEDIUM
|
Reverse Integer |
50.9 |
0.30 |
View Problem
|
Math |
|
EASY
|
Single Number |
50.9 |
0.76 |
View Problem
|
Array, Bit Manipulation |
|
EASY
|
Pascal's Triangle |
50.9 |
0.77 |
View Problem
|
Array, Dynamic Programming |
|
EASY
|
Min Cost Climbing Stairs |
50.9 |
0.67 |
View Problem
|
Array, Dynamic Programming |
|
HARD
|
Word Search II |
50.9 |
0.37 |
View Problem
|
Array, String, Backtracking, Trie, Matrix |
|
EASY
|
Next Greater Element I |
50.9 |
0.75 |
View Problem
|
Array, Hash Table, Stack, Monotonic Stack |
|
MEDIUM
|
Analyze User Website Visit Pattern |
50.9 |
0.44 |
View Problem
|
Array, Hash Table, Sorting |
|
HARD
|
Sliding Window Maximum |
50.9 |
0.48 |
View Problem
|
Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue |
|
HARD
|
Word Ladder |
50.9 |
0.43 |
View Problem
|
Hash Table, String, Breadth-First Search |
|
MEDIUM
|
Valid Sudoku |
50.9 |
0.62 |
View Problem
|
Array, Hash Table, Matrix |
|
HARD
|
Integer to English Words |
50.9 |
0.34 |
View Problem
|
Math, String, Recursion |
|
MEDIUM
|
Course Schedule II |
50.9 |
0.53 |
View Problem
|
Depth-First Search, Breadth-First Search, Graph, Topological Sort |
|
MEDIUM
|
Pacific Atlantic Water Flow |
50.9 |
0.58 |
View Problem
|
Array, Depth-First Search, Breadth-First Search, Matrix |
|
MEDIUM
|
Jump Game |
50.9 |
0.39 |
View Problem
|
Array, Dynamic Programming, Greedy |
|
MEDIUM
|
Validate Binary Search Tree |
50.9 |
0.34 |
View Problem
|
Tree, Depth-First Search, Binary Search Tree, Binary Tree |
|
HARD
|
Sudoku Solver |
50.9 |
0.64 |
View Problem
|
Array, Hash Table, Backtracking, Matrix |
|
MEDIUM
|
Find the Duplicate Number |
50.9 |
0.63 |
View Problem
|
Array, Two Pointers, Binary Search, Bit Manipulation |
|
MEDIUM
|
String Compression |
50.9 |
0.58 |
View Problem
|
Two Pointers, String |
|
MEDIUM
|
Course Schedule |
50.9 |
0.49 |
View Problem
|
Depth-First Search, Breadth-First Search, Graph, Topological Sort |
|
MEDIUM
|
Maximize Distance to Closest Person |
50.9 |
0.49 |
View Problem
|
Array |
|
MEDIUM
|
Spiral Matrix |
40.6 |
0.54 |
View Problem
|
Array, Matrix, Simulation |
|
MEDIUM
|
Magnetic Force Between Two Balls |
40.6 |
0.71 |
View Problem
|
Array, Binary Search, Sorting |
|
EASY
|
Happy Number |
40.6 |
0.58 |
View Problem
|
Hash Table, Math, Two Pointers |
|
EASY
|
Convert Sorted Array to Binary Search Tree |
40.6 |
0.74 |
View Problem
|
Array, Divide and Conquer, Tree, Binary Search Tree, Binary Tree |
|
MEDIUM
|
Distribute Candies Among Children II |
40.6 |
0.56 |
View Problem
|
Math, Combinatorics, Enumeration |
|
MEDIUM
|
Find Eventual Safe States |
40.6 |
0.69 |
View Problem
|
Depth-First Search, Breadth-First Search, Graph, Topological Sort |
|
MEDIUM
|
Combinations |
40.6 |
0.73 |
View Problem
|
Backtracking |
|
EASY
|
Design Parking System |
40.6 |
0.87 |
View Problem
|
Design, Simulation, Counting |
|
EASY
|
Divisible and Non-divisible Sums Difference |
40.6 |
0.91 |
View Problem
|
Math |
|
MEDIUM
|
Rotate List |
40.6 |
0.40 |
View Problem
|
Linked List, Two Pointers |
|
HARD
|
Largest Rectangle in Histogram |
40.6 |
0.47 |
View Problem
|
Array, Stack, Monotonic Stack |
|
HARD
|
Design In-Memory File System |
40.6 |
0.48 |
View Problem
|
Hash Table, String, Design, Trie, Sorting |
|
MEDIUM
|
Decode String |
40.6 |
0.61 |
View Problem
|
String, Stack, Recursion |
|
MEDIUM
|
Binary Tree Level Order Traversal |
40.6 |
0.71 |
View Problem
|
Tree, Breadth-First Search, Binary Tree |
|
MEDIUM
|
Subarray Sum Equals K |
40.6 |
0.45 |
View Problem
|
Array, Hash Table, Prefix Sum |
|
MEDIUM
|
Count Zero Request Servers |
40.6 |
0.34 |
View Problem
|
Array, Hash Table, Sliding Window, Sorting |
|
MEDIUM
|
K Closest Points to Origin |
40.6 |
0.68 |
View Problem
|
Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect |
|
MEDIUM
|
Evaluate Division |
40.6 |
0.63 |
View Problem
|
Array, String, Depth-First Search, Breadth-First Search, Union Find, Graph, Shortest Path |