|
|
MEDIUM
|
String Compression III |
100.0 |
0.67 |
View Problem
|
String |
|
|
HARD
|
Maximum Number of Ones |
97.6 |
0.69 |
View Problem
|
Math, Greedy, Sorting, Heap (Priority Queue) |
|
|
EASY
|
Reverse Linked List |
91.9 |
0.79 |
View Problem
|
Linked List, Recursion |
|
|
MEDIUM
|
Remove Nth Node From End of List |
74.2 |
0.49 |
View Problem
|
Linked List, Two Pointers |
|
|
MEDIUM
|
Rotate Image |
74.2 |
0.78 |
View Problem
|
Array, Math, Matrix |
|
|
MEDIUM
|
LRU Cache |
74.2 |
0.45 |
View Problem
|
Hash Table, Linked List, Design, Doubly-Linked List |
|
|
MEDIUM
|
Number of Islands |
74.2 |
0.62 |
View Problem
|
Array, Depth-First Search, Breadth-First Search, Union Find, Matrix |
|
|
EASY
|
Reverse Bits |
74.2 |
0.63 |
View Problem
|
Divide and Conquer, Bit Manipulation |
|
|
EASY
|
Middle of the Linked List |
74.2 |
0.81 |
View Problem
|
Linked List, Two Pointers |
|
|
MEDIUM
|
Design Memory Allocator |
66.9 |
0.48 |
View Problem
|
Array, Hash Table, Design, Simulation |
|
|
EASY
|
Majority Element |
66.9 |
0.66 |
View Problem
|
Array, Hash Table, Divide and Conquer, Sorting, Counting |
|
|
EASY
|
Merge Sorted Array |
66.9 |
0.53 |
View Problem
|
Array, Two Pointers, Sorting |
|
|
EASY
|
Two Sum |
66.9 |
0.56 |
View Problem
|
Array, Hash Table |
|
|
EASY
|
Valid Parentheses |
66.9 |
0.42 |
View Problem
|
String, Stack |
|
|
EASY
|
Implement Queue using Stacks |
66.9 |
0.68 |
View Problem
|
Stack, Design, Queue |
|
|
EASY
|
Palindrome Number |
66.9 |
0.59 |
View Problem
|
Math |
|
|
EASY
|
Climbing Stairs |
66.9 |
0.54 |
View Problem
|
Math, Dynamic Programming, Memoization |
|
|
EASY
|
Number of 1 Bits |
66.9 |
0.75 |
View Problem
|
Divide and Conquer, Bit Manipulation |
|
|
MEDIUM
|
Swap Nodes in Pairs |
66.9 |
0.67 |
View Problem
|
Linked List, Recursion |
|
|
MEDIUM
|
Design Circular Queue |
56.6 |
0.53 |
View Problem
|
Array, Linked List, Design, Queue |
|
|
MEDIUM
|
Permutations |
56.6 |
0.81 |
View Problem
|
Array, Backtracking |
|
|
EASY
|
Power of Four |
56.6 |
0.49 |
View Problem
|
Math, Bit Manipulation, Recursion |
|
|
HARD
|
Reverse Nodes in k-Group |
56.6 |
0.63 |
View Problem
|
Linked List, Recursion |
|
|
MEDIUM
|
Longest Substring Without Repeating Characters |
56.6 |
0.37 |
View Problem
|
Hash Table, String, Sliding Window |
|
|
EASY
|
First Unique Character in a String |
56.6 |
0.64 |
View Problem
|
Hash Table, String, Queue, Counting |
|
|
HARD
|
Serialize and Deserialize Binary Tree |
56.6 |
0.59 |
View Problem
|
String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree |
|
|
EASY
|
Is Subsequence |
56.6 |
0.48 |
View Problem
|
Two Pointers, String, Dynamic Programming |
|
|
EASY
|
Single Number |
56.6 |
0.76 |
View Problem
|
Array, Bit Manipulation |
|
|
EASY
|
Linked List Cycle |
56.6 |
0.53 |
View Problem
|
Hash Table, Linked List, Two Pointers |
|
|
MEDIUM
|
Count the Number of Fair Pairs |
56.6 |
0.53 |
View Problem
|
Array, Two Pointers, Binary Search, Sorting |
|
|
MEDIUM
|
Kth Largest Element in an Array |
56.6 |
0.68 |
View Problem
|
Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect |
|
|
HARD
|
Trapping Rain Water |
56.6 |
0.65 |
View Problem
|
Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack |
|
|
EASY
|
Rectangle Overlap |
56.6 |
0.46 |
View Problem
|
Math, Geometry |
|
|
MEDIUM
|
String to Integer (atoi) |
56.6 |
0.19 |
View Problem
|
String |
|
|
EASY
|
Find Winner on a Tic Tac Toe Game |
56.6 |
0.54 |
View Problem
|
Array, Hash Table, Matrix, Simulation |
|
|
MEDIUM
|
Course Schedule II |
56.6 |
0.53 |
View Problem
|
Depth-First Search, Breadth-First Search, Graph, Topological Sort |
|
|
MEDIUM
|
Reverse Integer |
56.6 |
0.30 |
View Problem
|
Math |
|
|
EASY
|
Maximum Depth of Binary Tree |
56.6 |
0.77 |
View Problem
|
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
|
|
MEDIUM
|
Two Sum II - Input Array Is Sorted |
56.6 |
0.63 |
View Problem
|
Array, Two Pointers, Binary Search |
|
|
MEDIUM
|
Maximum Subarray |
56.6 |
0.52 |
View Problem
|
Array, Divide and Conquer, Dynamic Programming |
|
|
MEDIUM
|
Pow(x, n) |
56.6 |
0.37 |
View Problem
|
Math, Recursion |
|
|
MEDIUM
|
Design Tic-Tac-Toe |
56.6 |
0.59 |
View Problem
|
Array, Hash Table, Design, Matrix, Simulation |
|
|
HARD
|
Trapping Rain Water II |
56.6 |
0.59 |
View Problem
|
Array, Breadth-First Search, Heap (Priority Queue), Matrix |
|
|
EASY
|
Power of Two |
56.6 |
0.48 |
View Problem
|
Math, Bit Manipulation, Recursion |
|
|
EASY
|
Remove Duplicates from Sorted Array |
56.6 |
0.60 |
View Problem
|
Array, Two Pointers |
|
|
EASY
|
Length of Last Word |
56.6 |
0.56 |
View Problem
|
String |
|
|
MEDIUM
|
Best Time to Buy and Sell Stock II |
56.6 |
0.70 |
View Problem
|
Array, Dynamic Programming, Greedy |
|
|
MEDIUM
|
Merge Intervals |
56.6 |
0.49 |
View Problem
|
Array, Sorting |