Divide and Conquer Interview Questions
47 real interview questions test Divide and Conquer. Practice any of them in the code editor and get AI feedback on your solution.
- Junior11% (5)
- Mid/Senior51% (24)
- Staff38% (18)
Companies that ask Divide and Conquer the most
Questions
- Maximum Subarray66 companiesMid/Senior
- Merge k Sorted Lists53 companiesStaff
- Top K Frequent Elements52 companiesMid/Senior
- Median of Two Sorted Arrays47 companiesStaff
- Kth Largest Element in an Array42 companiesMid/Senior
- Majority Element22 companiesJunior
- Search a 2D Matrix II17 companiesMid/Senior
- K Closest Points to Origin17 companiesMid/Senior
- The Skyline Problem14 companiesStaff
- Special Binary String12 companiesStaff
- Sort an Array12 companiesMid/Senior
- Number of 1 Bits11 companiesJunior
- Reverse Bits10 companiesJunior
- Maximum Sum Circular Subarray10 companiesMid/Senior
- Construct Binary Tree from Preorder and Inorder Traversal9 companiesMid/Senior
- Convert Sorted Array to Binary Search Tree9 companiesJunior
- Convert Sorted List to Binary Search Tree9 companiesMid/Senior
- Sort List9 companiesMid/Senior
- Longest Substring with At Least K Repeating Characters9 companiesMid/Senior
- Reverse Pairs9 companiesStaff
- Construct Binary Tree from Inorder and Postorder Traversal7 companiesMid/Senior
- Construct Binary Tree from Preorder and Postorder Traversal6 companiesMid/Senior
- Count of Smaller Numbers After Self5 companiesStaff
- Wiggle Sort II5 companiesMid/Senior
- Super Pow5 companiesMid/Senior
- Beautiful Array5 companiesMid/Senior
- Balance a Binary Search Tree5 companiesMid/Senior
- Count of Range Sum4 companiesStaff
- Longest Nice Substring4 companiesJunior
- Threshold Majority Queries4 companiesStaff
- Longest Balanced Subarray I4 companiesMid/Senior
- Maximum Binary Tree3 companiesMid/Senior
- Count Good Triplets in an Array3 companiesStaff
- Number of Pairs Satisfying Inequality3 companiesStaff
- Maximum Sum of Subsequence With Non-adjacent Elements3 companiesStaff
- Number of Ways to Reorder Array to Get Same BST2 companiesStaff
- Create Sorted Array through Instructions2 companiesStaff
- Maximize Subarray Sum After Removing All Occurrences of One Element2 companiesStaff
- XOR After Range Multiplication Queries I2 companiesMid/Senior
- XOR After Range Multiplication Queries II2 companiesStaff
- Longest Balanced Subarray II2 companiesStaff
- Find Kth Largest XOR Coordinate Value1 companyMid/Senior
- Find the Kth Largest Integer in the Array1 companyMid/Senior
- Query Kth Smallest Trimmed Number1 companyMid/Senior
- Longest Increasing Subsequence II1 companyStaff
- Fill a Special Grid1 companyMid/Senior
- Minimum Cost to Partition a Binary String1 companyStaff