|
HARD
|
Trapping Rain Water |
100.0 |
0.65 |
View Problem
|
Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack |
|
MEDIUM
|
Robot Bounded In Circle |
83.0 |
0.56 |
View Problem
|
Math, String, Simulation |
|
HARD
|
Median of Two Sorted Arrays |
79.0 |
0.44 |
View Problem
|
Array, Binary Search, Divide and Conquer |
|
MEDIUM
|
Fraction to Recurring Decimal |
76.4 |
0.26 |
View Problem
|
Hash Table, Math, String |
|
EASY
|
First Unique Character in a String |
76.4 |
0.64 |
View Problem
|
Hash Table, String, Queue, Counting |
|
EASY
|
High Five |
72.4 |
0.74 |
View Problem
|
Array, Hash Table, Sorting, Heap (Priority Queue) |
|
HARD
|
Reaching Points |
69.1 |
0.34 |
View Problem
|
Math |
|
EASY
|
Best Time to Buy and Sell Stock |
68.5 |
0.55 |
View Problem
|
Array, Dynamic Programming |
|
EASY
|
Backspace String Compare |
64.3 |
0.49 |
View Problem
|
Two Pointers, String, Stack, Simulation |
|
MEDIUM
|
Number of Islands |
63.5 |
0.62 |
View Problem
|
Array, Depth-First Search, Breadth-First Search, Union Find, Matrix |
|
EASY
|
Two Sum |
61.7 |
0.56 |
View Problem
|
Array, Hash Table |
|
MEDIUM
|
Group Anagrams |
60.8 |
0.71 |
View Problem
|
Array, Hash Table, String, Sorting |
|
MEDIUM
|
Find Minimum in Rotated Sorted Array |
59.8 |
0.53 |
View Problem
|
Array, Binary Search |
|
MEDIUM
|
Container With Most Water |
59.8 |
0.58 |
View Problem
|
Array, Two Pointers, Greedy |
|
MEDIUM
|
Palindromic Substrings |
58.7 |
0.72 |
View Problem
|
Two Pointers, String, Dynamic Programming |
|
MEDIUM
|
LRU Cache |
58.7 |
0.45 |
View Problem
|
Hash Table, Linked List, Design, Doubly-Linked List |
|
MEDIUM
|
String Compression |
58.7 |
0.58 |
View Problem
|
Two Pointers, String |
|
MEDIUM
|
Minimize the Maximum of Two Arrays |
58.7 |
0.31 |
View Problem
|
Math, Binary Search, Number Theory |
|
EASY
|
Reformat Date |
57.6 |
0.67 |
View Problem
|
String |
|
MEDIUM
|
Minimum Path Sum |
56.4 |
0.66 |
View Problem
|
Array, Dynamic Programming, Matrix |
|
MEDIUM
|
Decode Ways |
56.4 |
0.37 |
View Problem
|
String, Dynamic Programming |
|
MEDIUM
|
Longest Increasing Subsequence |
53.7 |
0.58 |
View Problem
|
Array, Binary Search, Dynamic Programming |
|
MEDIUM
|
Best Time to Buy and Sell Stock II |
53.7 |
0.70 |
View Problem
|
Array, Dynamic Programming, Greedy |
|
EASY
|
Design HashMap |
53.7 |
0.66 |
View Problem
|
Array, Hash Table, Linked List, Design, Hash Function |
|
MEDIUM
|
Longest Palindromic Substring |
52.2 |
0.36 |
View Problem
|
Two Pointers, String, Dynamic Programming |
|
MEDIUM
|
Search in Rotated Sorted Array |
52.2 |
0.43 |
View Problem
|
Array, Binary Search |
|
EASY
|
Power of Three |
50.5 |
0.48 |
View Problem
|
Math, Recursion |
|
MEDIUM
|
Jump Game |
50.5 |
0.39 |
View Problem
|
Array, Dynamic Programming, Greedy |
|
MEDIUM
|
Maximum Subarray |
50.5 |
0.52 |
View Problem
|
Array, Divide and Conquer, Dynamic Programming |
|
MEDIUM
|
Longest Substring Without Repeating Characters |
48.7 |
0.37 |
View Problem
|
Hash Table, String, Sliding Window |
|
MEDIUM
|
High-Access Employees |
48.7 |
0.46 |
View Problem
|
Array, Hash Table, String, Sorting |
|
HARD
|
Sliding Window Maximum |
48.7 |
0.48 |
View Problem
|
Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue |
|
MEDIUM
|
Asteroid Collision |
46.6 |
0.46 |
View Problem
|
Array, Stack, Simulation |
|
EASY
|
Valid Parentheses |
46.6 |
0.42 |
View Problem
|
String, Stack |
|
MEDIUM
|
Merge Intervals |
46.6 |
0.49 |
View Problem
|
Array, Sorting |
|
MEDIUM
|
Next Permutation |
44.3 |
0.43 |
View Problem
|
Array, Two Pointers |
|
MEDIUM
|
Construct Smallest Number From DI String |
44.3 |
0.86 |
View Problem
|
String, Backtracking, Stack, Greedy |
|
MEDIUM
|
Pairs of Songs With Total Durations Divisible by 60 |
44.3 |
0.53 |
View Problem
|
Array, Hash Table, Counting |
|
MEDIUM
|
Pow(x, n) |
44.3 |
0.37 |
View Problem
|
Math, Recursion |
|
MEDIUM
|
Product of Array Except Self |
41.6 |
0.68 |
View Problem
|
Array, Prefix Sum |
|
MEDIUM
|
Knight Probability in Chessboard |
41.6 |
0.57 |
View Problem
|
Dynamic Programming |
|
MEDIUM
|
Rotting Oranges |
41.6 |
0.57 |
View Problem
|
Array, Breadth-First Search, Matrix |
|
MEDIUM
|
Insert Delete GetRandom O(1) |
41.6 |
0.55 |
View Problem
|
Array, Hash Table, Math, Design, Randomized |
|
EASY
|
Robot Return to Origin |
41.6 |
0.76 |
View Problem
|
String, Simulation |
|
MEDIUM
|
House Robber |
41.6 |
0.52 |
View Problem
|
Array, Dynamic Programming |
|
MEDIUM
|
Search a 2D Matrix |
41.6 |
0.52 |
View Problem
|
Array, Binary Search, Matrix |
|
EASY
|
Climbing Stairs |
41.6 |
0.54 |
View Problem
|
Math, Dynamic Programming, Memoization |
|
MEDIUM
|
String to Integer (atoi) |
41.6 |
0.19 |
View Problem
|
String |
|
MEDIUM
|
Minimum Size Subarray Sum |
38.4 |
0.49 |
View Problem
|
Array, Binary Search, Sliding Window, Prefix Sum |
|
HARD
|
Valid Arrangement of Pairs |
38.4 |
0.66 |
View Problem
|
Depth-First Search, Graph, Eulerian Circuit |
|
EASY
|
Linked List Cycle |
38.4 |
0.53 |
View Problem
|
Hash Table, Linked List, Two Pointers |
|
EASY
|
Missing Number |
34.6 |
0.70 |
View Problem
|
Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting |
|
EASY
|
Count Number of Pairs With Absolute Difference K |
34.6 |
0.85 |
View Problem
|
Array, Hash Table, Counting |
|
EASY
|
Pascal's Triangle II |
34.6 |
0.66 |
View Problem
|
Array, Dynamic Programming |
|
MEDIUM
|
Gas Station |
34.6 |
0.46 |
View Problem
|
Array, Greedy |
|
HARD
|
N-Queens |
34.6 |
0.73 |
View Problem
|
Array, Backtracking |
|
MEDIUM
|
Design Underground System |
34.6 |
0.74 |
View Problem
|
Hash Table, String, Design |
|
MEDIUM
|
Find Peak Element |
34.6 |
0.47 |
View Problem
|
Array, Binary Search |
|
MEDIUM
|
Jump Game III |
34.6 |
0.66 |
View Problem
|
Array, Depth-First Search, Breadth-First Search |
|
EASY
|
Sort Integers by The Number of 1 Bits |
34.6 |
0.79 |
View Problem
|
Array, Bit Manipulation, Sorting, Counting |
|
MEDIUM
|
Word Search |
34.6 |
0.45 |
View Problem
|
Array, String, Backtracking, Depth-First Search, Matrix |
|
MEDIUM
|
3Sum |
29.7 |
0.37 |
View Problem
|
Array, Two Pointers, Sorting |
|
HARD
|
First Missing Positive |
29.7 |
0.41 |
View Problem
|
Array, Hash Table |
|
MEDIUM
|
Rotate Image |
29.7 |
0.78 |
View Problem
|
Array, Math, Matrix |
|
HARD
|
Super Egg Drop |
29.7 |
0.29 |
View Problem
|
Math, Binary Search, Dynamic Programming |
|
EASY
|
Pascal's Triangle |
29.7 |
0.77 |
View Problem
|
Array, Dynamic Programming |
|
EASY
|
Middle of the Linked List |
29.7 |
0.81 |
View Problem
|
Linked List, Two Pointers |
|
MEDIUM
|
Letter Combinations of a Phone Number |
29.7 |
0.64 |
View Problem
|
Hash Table, String, Backtracking |
|
MEDIUM
|
Permutations |
29.7 |
0.81 |
View Problem
|
Array, Backtracking |
|
MEDIUM
|
Spiral Matrix |
29.7 |
0.54 |
View Problem
|
Array, Matrix, Simulation |
|
MEDIUM
|
Remove All Adjacent Duplicates in String II |
29.7 |
0.60 |
View Problem
|
String, Stack |
|
MEDIUM
|
Daily Temperatures |
29.7 |
0.67 |
View Problem
|
Array, Stack, Monotonic Stack |
|
EASY
|
Sqrt(x) |
29.7 |
0.40 |
View Problem
|
Math, Binary Search |
|
MEDIUM
|
Rotate Array |
29.7 |
0.43 |
View Problem
|
Array, Math, Two Pointers |
|
MEDIUM
|
Fraction Addition and Subtraction |
29.7 |
0.66 |
View Problem
|
Math, String, Simulation |
|
HARD
|
Count Palindromic Subsequences |
29.7 |
0.39 |
View Problem
|
String, Dynamic Programming |
|
EASY
|
Next Greater Element I |
29.7 |
0.75 |
View Problem
|
Array, Hash Table, Stack, Monotonic Stack |
|
MEDIUM
|
Maximal Square |
29.7 |
0.49 |
View Problem
|
Array, Dynamic Programming, Matrix |
|
MEDIUM
|
Amount of Time for Binary Tree to Be Infected |
29.7 |
0.64 |
View Problem
|
Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree |
|
MEDIUM
|
Decode String |
29.7 |
0.61 |
View Problem
|
String, Stack, Recursion |
|
HARD
|
Candy |
29.7 |
0.47 |
View Problem
|
Array, Greedy |
|
MEDIUM
|
Largest Number |
29.7 |
0.41 |
View Problem
|
Array, String, Greedy, Sorting |
|
MEDIUM
|
Next Greater Element III |
29.7 |
0.35 |
View Problem
|
Math, Two Pointers, String |
|
MEDIUM
|
Find the Duplicate Number |
29.7 |
0.63 |
View Problem
|
Array, Two Pointers, Binary Search, Bit Manipulation |
|
HARD
|
Find Median from Data Stream |
29.7 |
0.53 |
View Problem
|
Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream |
|
EASY
|
Remove All Adjacent Duplicates In String |
23.0 |
0.72 |
View Problem
|
String, Stack |
|
EASY
|
Contains Duplicate II |
23.0 |
0.49 |
View Problem
|
Array, Hash Table, Sliding Window |
|
MEDIUM
|
Reverse Substrings Between Each Pair of Parentheses |
23.0 |
0.72 |
View Problem
|
String, Stack |
|
EASY
|
Valid Anagram |
23.0 |
0.67 |
View Problem
|
Hash Table, String, Sorting |
|
MEDIUM
|
Longest Common Subsequence |
23.0 |
0.58 |
View Problem
|
String, Dynamic Programming |
|
HARD
|
Best Time to Buy and Sell Stock IV |
23.0 |
0.47 |
View Problem
|
Array, Dynamic Programming |
|
MEDIUM
|
Valid Sudoku |
23.0 |
0.62 |
View Problem
|
Array, Hash Table, Matrix |
|
MEDIUM
|
Jump Game II |
23.0 |
0.42 |
View Problem
|
Array, Dynamic Programming, Greedy |
|
MEDIUM
|
Remove Duplicate Letters |
23.0 |
0.51 |
View Problem
|
String, Stack, Greedy, Monotonic Stack |
|
MEDIUM
|
Random Flip Matrix |
23.0 |
0.44 |
View Problem
|
Hash Table, Math, Reservoir Sampling, Randomized |
|
EASY
|
Reverse String |
23.0 |
0.80 |
View Problem
|
Two Pointers, String |
|
MEDIUM
|
Query Kth Smallest Trimmed Number |
23.0 |
0.46 |
View Problem
|
Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Radix Sort, Quickselect |
|
MEDIUM
|
Unique Paths |
23.0 |
0.66 |
View Problem
|
Math, Dynamic Programming, Combinatorics |
|
MEDIUM
|
Best Time to Buy and Sell Stock with Transaction Fee |
23.0 |
0.71 |
View Problem
|
Array, Dynamic Programming, Greedy |
|
EASY
|
Intersection of Two Linked Lists |
23.0 |
0.61 |
View Problem
|
Hash Table, Linked List, Two Pointers |