PhantomCodeAI
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
PhantomCodeAI
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
Features
Mock Interview
Dashboard
Jobs
Pricing
Resources
Help
Home
LeetCode Problems
Divide and Conquer
Divide and Conquer
Problems
42 Divide and Conquer LeetCode problems · Solve with AI-powered hints & step-by-step explanations.
4
Median of Two Sorted Arrays
Hard
23
Merge k Sorted Lists
Hard
53
Maximum Subarray
Medium
105
Construct Binary Tree from Preorder and Inorder Traversal
Medium
106
Construct Binary Tree from Inorder and Postorder Traversal
Medium
108
Convert Sorted Array to Binary Search Tree
Easy
109
Convert Sorted List to Binary Search Tree
Medium
148
Sort List
Medium
169
Majority Element
Easy
190
Reverse Bits
Easy
191
Number of 1 Bits
Easy
215
Kth Largest Element in an Array
Medium
218
The Skyline Problem
Hard
240
Search a 2D Matrix II
Medium
315
Count of Smaller Numbers After Self
Hard
324
Wiggle Sort II
Medium
327
Count of Range Sum
Hard
347
Top K Frequent Elements
Medium
372
Super Pow
Medium
395
Longest Substring with At Least K Repeating Characters
Medium
427
Construct Quad Tree
Medium
493
Reverse Pairs
Hard
558
Logical OR of Two Binary Grids Represented as Quad-Trees
Medium
654
Maximum Binary Tree
Medium
889
Construct Binary Tree from Preorder and Postorder Traversal
Medium
912
Sort an Array
Medium
918
Maximum Sum Circular Subarray
Medium
932
Beautiful Array
Medium
973
K Closest Points to Origin
Medium
1382
Balance a Binary Search Tree
Medium
1569
Number of Ways to Reorder Array to Get Same BST
Hard
1649
Create Sorted Array through Instructions
Hard
1738
Find Kth Largest XOR Coordinate Value
Medium
1763
Longest Nice Substring
Easy
1982
Find Array Given Subset Sums
Hard
1985
Find the Kth Largest Integer in the Array
Medium
2179
Count Good Triplets in an Array
Hard
2343
Query Kth Smallest Trimmed Number
Medium
2407
Longest Increasing Subsequence II
Hard
2426
Number of Pairs Satisfying Inequality
Hard
3165
Maximum Sum of Subsequence With Non-adjacent Elements
Hard
3537
Fill a Special Grid
Medium
← Browse all LeetCode problems