Divide and Conquer Problems
42 Divide and Conquer LeetCode problems · Solve with AI-powered hints & step-by-step explanations.
Learn the coding interview patterns behind these problems.
Start with these
4 Median of Two Sorted Arrays Hard23 Merge k Sorted Lists Hard53 Maximum Subarray Medium105 Construct Binary Tree from Preorder and Inorder Traversal Medium169 Majority Element Easy190 Reverse Bits Easy191 Number of 1 Bits Easy215 Kth Largest Element in an Array Medium347 Top K Frequent Elements Medium1763 Longest Nice Substring Easy
All Divide and Conquer problems
4 Median of Two Sorted Arrays Hard23 Merge k Sorted Lists Hard53 Maximum Subarray Medium105 Construct Binary Tree from Preorder and Inorder Traversal Medium106 Construct Binary Tree from Inorder and Postorder Traversal Medium108 Convert Sorted Array to Binary Search Tree Easy109 Convert Sorted List to Binary Search Tree Medium148 Sort List Medium169 Majority Element Easy190 Reverse Bits Easy191 Number of 1 Bits Easy215 Kth Largest Element in an Array Medium218 The Skyline Problem Hard240 Search a 2D Matrix II Medium315 Count of Smaller Numbers After Self Hard324 Wiggle Sort II Medium327 Count of Range Sum Hard347 Top K Frequent Elements Medium372 Super Pow Medium395 Longest Substring with At Least K Repeating Characters Medium427 Construct Quad Tree Medium493 Reverse Pairs Hard558 Logical OR of Two Binary Grids Represented as Quad-Trees Medium654 Maximum Binary Tree Medium889 Construct Binary Tree from Preorder and Postorder Traversal Medium912 Sort an Array Medium918 Maximum Sum Circular Subarray Medium932 Beautiful Array Medium973 K Closest Points to Origin Medium1382 Balance a Binary Search Tree Medium1569 Number of Ways to Reorder Array to Get Same BST Hard1649 Create Sorted Array through Instructions Hard1738 Find Kth Largest XOR Coordinate Value Medium1763 Longest Nice Substring Easy1982 Find Array Given Subset Sums Hard1985 Find the Kth Largest Integer in the Array Medium2179 Count Good Triplets in an Array Hard2343 Query Kth Smallest Trimmed Number Medium2407 Longest Increasing Subsequence II Hard2426 Number of Pairs Satisfying Inequality Hard3165 Maximum Sum of Subsequence With Non-adjacent Elements Hard3537 Fill a Special Grid Medium