Divide And Conquer Interview Questions

Array Divide and Conquer Sorting Heap (Priority Queue)Quickselect

Rank

#772MediumFrequency: 87%

Construct Quad Tree

Asked at Uber

Array Divide and Conquer Tree Matrix

Rank

#347MediumFrequency: 81.3%

Top K Frequent Elements

Array Hash Table Divide and Conquer Sorting Heap (Priority Queue)Bucket Sort Counting Quickselect

Rank

#53MediumFrequency: 81.1%

Maximum Subarray

Array Divide and Conquer Dynamic Programming

Rank

#1014MediumFrequency: 77.1%

K Closest Points to Origin

Array Math Divide and Conquer Geometry Sorting Heap (Priority Queue)Quickselect K-D Tree

Rank

#4HardFrequency: 76.8%

Median of Two Sorted Arrays

Array Binary Search Divide and Conquer

Rank

#23HardFrequency: 75.1%

Merge k Sorted Lists

Linked List Divide and Conquer Heap (Priority Queue)Merge Sort Tournament Sort

Rank

#169EasyFrequency: 70.4%

Majority Element

Array Hash Table Divide and Conquer Sorting Counting Boyer–Moore Majority Vote Algorithm

Rank

#108EasyFrequency: 65.5%

Convert Sorted Array to Binary Search Tree

Asked at Airbnb

Array Divide and Conquer Tree Binary Search Tree Binary Tree

Rank

#190EasyFrequency: 65.5%

Reverse Bits

Asked at Airbnb

Divide and Conquer Bit Manipulation

#10

Rank

#3423HardFrequency: 62.5%

Maximum Sum of Subsequence With Non-adjacent Elements

Array Divide and Conquer Dynamic Programming Segment Tree

#11

Rank

#3974MediumFrequency: 62.5%

XOR After Range Multiplication Queries I

Array Divide and Conquer Simulation Prefix Sum

#12

Rank

#3975HardFrequency: 62.5%

XOR After Range Multiplication Queries II

Array Divide and Conquer Prefix Sum

#13

Rank

#105MediumFrequency: 59.3%

Construct Binary Tree from Preorder and Inorder Traversal

Asked at TikTok

Array Hash Table Divide and Conquer Tree Binary Tree

#14

Rank

#763HardFrequency: 57.5%

Special Binary String

Asked at Salesforce

String Divide and Conquer Sorting

#15

Rank

#240MediumFrequency: 56.8%

Search a 2D Matrix II

Asked at Apple

Array Binary Search Divide and Conquer Matrix

#16

Rank

#191EasyFrequency: 55%

Number of 1 Bits

Asked at Apple

Divide and Conquer Bit Manipulation

#17

Rank

#395MediumFrequency: 51.4%

Longest Substring with At Least K Repeating Characters

Asked at TikTok

Hash Table String Divide and Conquer Sliding Window

#18

Rank

#948MediumFrequency: 46.7%

Sort an Array

Array Divide and Conquer Sorting Heap (Priority Queue)Merge Sort Bucket Sort Radix Sort Counting Sort

#19

Rank

#148MediumFrequency: 46%

Sort List

Linked List Two Pointers Divide and Conquer Sorting Merge Sort

#20

Rank

#493HardFrequency: 44.6%

Reverse Pairs

Array Binary Search Divide and Conquer Binary Indexed Tree Segment Tree Merge Sort Ordered Set Treap

#21

Rank

#954MediumFrequency: 40.2%

Maximum Sum Circular Subarray

Array Divide and Conquer Dynamic Programming Queue Monotonic Queue

#22

Rank

#106MediumFrequency: 38.2%

Construct Binary Tree from Inorder and Postorder Traversal

Array Hash Table Divide and Conquer Tree Binary Tree

#23

Rank

#218HardFrequency: 37.9%

The Skyline Problem

Asked at Uber

Array Divide and Conquer Binary Indexed Tree Segment Tree Sweep Line Sorting Heap (Priority Queue)Ordered Set

#24

Rank

#1873EasyFrequency: 34.3%

Longest Nice Substring

Hash Table String Divide and Conquer Bit Manipulation Sliding Window

#25

Rank

#315HardFrequency: 33.1%

Count of Smaller Numbers After Self

Array Binary Search Divide and Conquer Binary Indexed Tree Segment Tree Merge Sort Ordered Set Treap

#26

Rank

#327HardFrequency: 31.3%

Count of Range Sum

Array Binary Search Divide and Conquer Binary Indexed Tree Segment Tree Merge Sort Ordered Set Treap

#27

Rank

#324MediumFrequency: 28.1%

Wiggle Sort II

Array Divide and Conquer Greedy Sorting Quickselect

#28

Rank

#1285MediumFrequency: 27.8%

Balance a Binary Search Tree

Divide and Conquer Greedy Tree Depth-First Search Binary Search Tree Binary Tree

#29

Rank

#109MediumFrequency: 27.7%

Convert Sorted List to Binary Search Tree

Asked at Salesforce

Linked List Divide and Conquer Tree Binary Search Tree Binary Tree

#30

Rank

#654MediumFrequency: 27.3%

Maximum Binary Tree

Array Divide and Conquer Stack Tree Monotonic Stack Binary Tree Cartesian Tree

#31

Rank

#2526HardFrequency: 25.4%

Longest Increasing Subsequence II

Array Divide and Conquer Dynamic Programming Binary Indexed Tree Segment Tree Queue Monotonic Queue

#32

Rank

#925MediumFrequency: 24.4%

Construct Binary Tree from Preorder and Postorder Traversal

Array Hash Table Divide and Conquer Tree Binary Tree

#33

Rank

#3822MediumFrequency: 24.4%

Fill a Special Grid

Array Divide and Conquer Matrix

#34

Rank

#3955HardFrequency: 23.4%

Threshold Majority Queries

Array Hash Table Binary Search Divide and Conquer Counting Prefix Sum

#35

Rank

#968MediumFrequency: 22.1%

Beautiful Array

Array Math Divide and Conquer

#36

Rank

#4047HardFrequency: 22.1%

Longest Balanced Subarray II

Array Hash Table Divide and Conquer Segment Tree Prefix Sum

#37

Rank

#2658HardFrequency: 20%

Count the Number of K-Big Indices

Array Binary Search Divide and Conquer Binary Indexed Tree Segment Tree Merge Sort Ordered Set

#38

Rank

#4192HardFrequency: 20%

Minimum Cost to Partition a Binary String

String Divide and Conquer Prefix Sum

#39

Rank

#372MediumFrequency: 19.5%

Super Pow

Math Divide and Conquer Euler's Totient Function Euler's Theorem

#40

Rank

#4074MediumFrequency: 19.5%

Count Subarrays With Majority Element I

Array Hash Table Divide and Conquer Segment Tree Merge Sort Counting Prefix Sum

#41

Rank

#1692HardFrequency: 18%

Number of Ways to Reorder Array to Get Same BST

Array Math Divide and Conquer Dynamic Programming Tree Union-Find Binary Search Tree Memoization Combinatorics Binary Tree Fermat's Little Theorem

#42

Rank

#1860MediumFrequency: 18%

Find Kth Largest XOR Coordinate Value

Array Divide and Conquer Bit Manipulation Sorting Heap (Priority Queue)Matrix Prefix Sum Quickselect

#43

Rank

#2513HardFrequency: 18%

Number of Pairs Satisfying Inequality

Array Binary Search Divide and Conquer Binary Indexed Tree Segment Tree Merge Sort Ordered Set

#44

Rank

#510MediumFrequency: 16.4%

Count Subarrays With More Ones Than Zeros

Array Hash Table Binary Search Divide and Conquer Binary Indexed Tree Segment Tree Merge Sort Ordered Set

#45

Rank

#1903MediumFrequency: 16.4%

Design Most Recently Used Queue

Array Linked List Divide and Conquer Design Simulation Doubly-Linked List Sqrt Decomposition Treap Splay Tree

#46

Rank

#4045MediumFrequency: 13.2%

Longest Balanced Subarray I

Array Hash Table Divide and Conquer Segment Tree Prefix Sum

#47

Rank

#307MediumFrequency: 10.5%

Range Sum Query - Mutable

Array Divide and Conquer Design Binary Indexed Tree Segment Tree Sqrt Decomposition

#48

Rank

#3688HardFrequency: 10.5%

Maximize Subarray Sum After Removing All Occurrences of One Element

Array Hash Table Divide and Conquer Dynamic Programming Segment Tree Prefix Sum

#49

Rank

#2280HardFrequency: 10.5%

Count Good Triplets in an Array

Array Binary Search Divide and Conquer Binary Indexed Tree Segment Tree Merge Sort Ordered Set

#50

Rank

#4075HardFrequency: 7.3%

Count Subarrays With Majority Element II

Array Hash Table Divide and Conquer Segment Tree Merge Sort Prefix Sum

#51

Rank

#2113MediumFrequency: 5%

Find the Kth Largest Integer in the Array

Array String Divide and Conquer Sorting Heap (Priority Queue)Quickselect

#52

Rank

#4140HardFrequency: 5%

Evaluate Valid Expressions