Question List Tips Acknowledgements
Contains Duplicate Arrays Easy
Missing Number Arrays Bit Manipulation Easy
Find All Numbers Arrays Easy
Disappeared in an Array
Single Number Arrays Bit Manipulation Easy
Climbing Stairs Dynamic Programming Easy
Best Time to Buy and Dynamic Programming Easy
Sell Stock
Maximum Subarray Dynamic Programming Easy
Range Sum Query - Dynamic Programming Easy
Immutable
Counting Bits Dynamic Programming Bit Manipulation Easy
Linked List Cycle Fast & Slow Pointers Easy
Middle of the Linked List Fast & Slow Pointers Easy
Palindrome Linked List Fast & Slow Pointers Easy
Remove Linked List Fast & Slow Pointers Easy
Elements
Remove Duplicates Fast & Slow Pointers Easy
from Sorted List
Reverse Linked List In-place reversal of a linked list Easy
Merge Two Sorted Lists T wo Pointers Easy
Meeting Rooms Intervals Easy
Binary Search Binary Search Easy
Find Smallest Letter Binary Search Easy
Greater Than Target
Peak Index in a Binary Search Easy
Mountain Array
Average of Levels in BFS Easy
Binary Tree
Minimum Depth of BFS DFS Easy
Binary Tree
Same Tree DFS Easy
Path Sum DFS Easy
Diameter of Binary Tree DFS Easy
Merge Two Binary DFS Easy
Trees
Maximum Depth of DFS Easy
Binary Tree
Lowest Common DFS Easy
Ancestor of a Binary
Search Tree
Subtree of Another Tree DFS Easy
Invert Binary Tree DFS Easy
Two Sum T wo Pointers Easy
Squares of a Sorted T wo Pointers Easy
Array
Backspace String T wo Pointers Easy
Compare
Index Pairs of a String T rie Easy
Majority Element Sorting Easy
Convert 1D Array Into Arrays Easy
2D Array
Product of Array Except Arrays Medium
Self
Find the Duplicate Arrays Binary Search T wo Pointers Medium
Number
Find All Duplicates in an Arrays Medium
Array
Set Matrix Zeroes Arrays Medium
Spiral Matrix Arrays Medium
Rotate Image Arrays Medium
Word Search Backtracking Medium
Longest Consecutive Arrays Medium
Sequence
Letter Case Permutation Backtracking Medium
Subsets Backtracking Medium
Subsets II Backtracking Medium
Permutations Backtracking Medium
Permutations II Backtracking Medium
Combinations Backtracking Medium
Combination Sum Backtracking Medium
Combination Sum II Backtracking Medium
Combination Sum III Backtracking Medium
Generate Parentheses Backtracking Medium
Target Sum DFS Dynamic Programming Medium
Palindrome Partitioning Backtracking Medium
Letter Combinations of Backtracking Medium
a Phone Number
Generalized Backtracking Medium
Abbreviation
House Robber Dynamic Programming Medium
House Robber II Dynamic Programming Medium
Coin Change Dynamic Programming Medium
Maximum Product Dynamic Programming Medium
Subarray
Longest Increasing Dynamic Programming Medium
Subsequence
Longest Palindromic Dynamic Programming Medium
Substring
Word Break Dynamic Programming Medium
Combination Sum IV Dynamic Programming Medium
Decode Ways Dynamic Programming Medium
Unique Paths Dynamic Programming Medium
Jump Game Dynamic Programming Greedy Medium
Palindromic Substrings Dynamic Programming Medium
Number of Longest Dynamic Programming Medium
Increasing Subsequence
Partition Equal Subset Dynamic Programming Medium
Sum
Partition to K Equal Sum Dynamic Programming Medium
Subsets
Best Time to Buy and Dynamic Programming Medium
Sell Stock with
Cooldown
Linked List Cycle II Fast & Slow Pointers Medium
Add Two Numbers Fast & Slow Pointers Medium
Remove Nth Node Fast & Slow Pointers Medium
From End Of List
Sort List Fast & Slow Pointers Medium
Reorder List Fast & Slow Pointers Medium
Clone Graph BFS DFS Graph Medium
Paci c Atlantic Water BFS DFS Medium
Flow
Number of Islands BFS DFS Union Find Medium
Graph Valid Tree BFS DFS Graph Union Find Medium
Number of BFS DFS Graph Union Find Medium
Connected Components
in an Undirected Graph
Reverse Linked List II In-place reversal of a linked list Medium
Rotate List In-place reversal of a linked list Medium
Swap Nodes in Pairs In-place reversal of a linked list Medium
Odd Even Linked List In-place reversal of a linked list Medium
Kth Smallest Element in Binary Search Heap Medium
a Sorted Matrix
Find K Pairs with Heap Medium
Smallest Sums
Merge Intervals Intervals Medium
Interval List Intervals Medium
Intersections
Non-overlapping Intervals Medium
Intervals
Meeting Rooms II Heap Intervals Medium
Task Scheduler Greedy Heap Medium
Minimum Number of Greedy Medium
Arrows to Burst
Balloons
Insert Interval Intervals Medium
Find Minimum in Binary Search Medium
Rotated Sorted Array
Find Peak Element Binary Search Medium
Search in Rotated Binary Search Medium
Sorted Array
Search in Rotated Binary Search Medium
Sorted Array II
Search a 2D Matrix Binary Search Medium
Search a 2D Matrix II Binary Search Medium
Find K Closest Elements Binary Search Medium
Minimum Size Subarray Sliding Window Medium
Sum
Fruit Into Baskets Sliding Window Medium
Permutation in String Sliding Window Medium
Longest Repeating Sliding Window Medium
Character Replacement
Longest Substring Sliding Window Medium
Without Repeating
Characters
Kth Smallest Element in DFS Medium
a BST
K Closest Points to Heap Medium
Origin
Top K Frequent Heap Medium
Elements
Sort Characters By Heap Medium
Frequency
Kth Largest Element in Heap QuickSelect Medium
an Array
Reorganize String Greedy Heap Medium
Course Schedule BFS DFS Graph T opological Sort Medium
Course Schedule II BFS DFS Graph T opological Sort Medium
Minimum Height Trees BFS Graph T opological Sort Medium
Sequence Graph T opological Sort Medium
Reconstruction
Binary Tree Level Order BFS Medium
Traversal II
Binary Tree Level Order BFS Medium
Traversal
Binary Tree Zigzag Level BFS Medium
Order Traversal
Populating Next Right BFS Medium
Pointers in Each Node
Populating Next Right BFS Medium
Pointers in Each Node II
Binary Tree Right Side BFS DFS Medium
View
All Nodes Distance K in BFS DFS Medium
Binary Tree
Path Sum II DFS Medium
Path Sum III DFS Medium
Lowest Common DFS Medium
Ancestor of a Binary
Tree
Maximum Binary Tree DFS Medium
Maximum Width of DFS Medium
Binary Tree
Construct Binary Tree DFS Medium
from Preorder and
Inorder Traversal
Validate Binary Search DFS Medium
Tree
Implement Trie (Pre x Design T rie Medium
Tree)
3 Sum T wo Pointers Medium
3 Sum Closest T wo Pointers Medium
Subarrays with Product T wo Pointers Medium
Less than K
Sort Colours T wo Pointers Medium
Container With Most T wo Pointers Medium
Water
Longest Word in T rie Medium
Dictionary
Maximum XOR of Two T rie Medium
Numbers in an Array
First Missing Positive Arrays Hard
Sudoku Solver Backtracking Hard
N-Queens Backtracking Hard
Reverse Nodes in k- In-place reversal of a linked list Hard
Group
Merge k Sorted Lists Heap Hard
T otal: 0/171
Easy: 0/36 Smallest Range Heap Hard
Medium: 0/105 Covering Elements from
Hard: 0/30 K Lists Show/Hide Patterns Di culty Companies
Reset Questions Solutions All All All
Employee Free Time Heap Greedy Hard
Count of Range Sum Binary Search Hard
Sliding Window Sliding Window Hard
Maximum
Minimum Number of K Sliding Window Hard
Consecutive Bit Flips
Count Unique Sliding Window Hard
Characters of All
Substrings of a Given
String
Minimum Window Sliding Window Hard
Substring
Substring with Sliding Window Hard
Concatenation of All
Words
Rearrange String k Greedy Heap Hard
Distance Apart
Course Schedule III Greedy Heap Hard
Maximum Frequency Bucket Sort Heap Hard
Stack
Alien Dictionary Graph T opological Sort Hard
Binary Tree Maximum DFS Hard
Path Sum
Serialize and Deserialize Design Hard
Binary Tree
T otal: 0/171
Easy: 0/36
Medium: 0/105 Word Search II DFS T rie Hard
Hard: 0/30 Show/Hide Patterns Di culty Companies
Reset Questions Solutions All All All
Find Median from Data Heap Hard
Stream
Sliding Window Median Heap Hard
Trapping Rain Water T wo Pointers Hard
Concatenated Words T rie Hard
Pre x and Su x Search T rie Hard
Palindrome Pairs T rie Hard
Design Search T rie Hard
Autocomplete System
Word Squares T rie Hard
Sort Items by Groups DFS Graph T opological Sort Hard
Respecting
Dependencies
Median of Two Sorted Binary Search Hard
Arrays
T otal: 0/171
Easy: 0/36
Medium: 0/105
Hard: 0/30 Show/Hide Patterns Di culty Companies
Reset Questions Solutions All All All
