Skip to main content
DevEval
Library
Practice
Problems
Divide and Conquer
Topic
Divide and Conquer problems
17 problems: 3 Easy, 8 Medium, 6 Hard.
Easy (3)
Kth Largest Element in a Stream
Find Kth Largest in Stream
Convert Sorted Array to BST
Medium (8)
Maximum Subarray
Kth Largest Element in an Array
Pow(x, n)
Find a Peak Element II (2D)
Sort List
Construct Quad Tree
Majority Element II
Count Inversions
Hard (6)
Median of Two Sorted Arrays
Merge k Sorted Lists
Burst Balloons
Count of Smaller Numbers After Self
Find Array Given Subset Sums
Merge Sorted Streams
Other topics
Array
414
Math
223
String
204
Dynamic Programming
142
Hash Table
125
SQL
116
Tree
93
Matrix
83
Sorting
83
Simulation
66
Greedy
65
Binary Search
61
Machine Learning
59
Two Pointers
57
Stack
50
Graph
49
Data Engineering
48
Bit Manipulation
47
Heap
47
Sliding Window
44
Prefix Sum
42
Aggregation
38
Design
37
Backtracking
32
Linked List
32
Breadth-First Search
30
Depth-First Search
27
Combinatorics
25
Statistics
25
Number Theory
24
Binary Search Tree
23
Intervals
23
Joins
18
Union Find
17
Geometry
16
Recursion
16
Backend Systems
12
String Matching
12
Data Integrity
11
Shortest Path
11
Queue
10
Subqueries
9
Topological Sort
9
Trie
7
Game Theory
6
Window Functions
6
API
3
Brainteaser
3
Probability
3
Reliability
3
Library
Practice
Create free account