Loading repovive.com/roadmaps/leetcode-hard-problem-solving
Roadmaps
LeetCode Hard Problem Solving
Premium
Binary Search
Problemset
Discussion
AI Helper
Getting Started
0/5
Binary Search
0/49
1
Introduction to Hard Binary Search
2
When to Use Binary Search
3
Problem - Median of Two Sorted Arrays
4
Median of Two Sorted Arrays - Why Naive Fails
5
Median of Two Sorted Arrays - Partition Logic
6
Median of Two Sorted Arrays - Implementation
7
Median of Two Sorted Arrays - Time and Space
8
Problem - Split Array Largest Sum
9
Split Array Largest Sum - Why Naive Fails
10
Split Array Largest Sum - Feasibility Check
11
Split Array Largest Sum - Implementation
12
Split Array Largest Sum - Time and Space
13
Problem - Find K-th Smallest Pair Distance
14
Find K-th Smallest Pair Distance - Why Naive Fails
15
Find K-th Smallest Pair Distance - Counting Pairs
16
Find K-th Smallest Pair Distance - Implementation
17
Find K-th Smallest Pair Distance - Time and Space
18
Problem - Kth Smallest Number in Multiplication Table
19
Kth Smallest in Multiplication Table - Counting Logic
20
Kth Smallest in Multiplication Table - Implementation
21
Kth Smallest in Multiplication Table - Time and Space
22
Problem - Super Egg Drop
23
Super Egg Drop - Why Naive Fails
24
Super Egg Drop - Binary Search Optimization
25
Super Egg Drop - Implementation
26
Super Egg Drop - Time and Space
27
Problem - Russian Doll Envelopes
28
Russian Doll Envelopes - Reduction to LIS
29
Russian Doll Envelopes - Implementation
30
Russian Doll Envelopes - Time and Space
31
Problem - Maximum Profit in Job Scheduling
32
Maximum Profit in Job Scheduling - DP Setup
33
Maximum Profit in Job Scheduling - Implementation
34
Maximum Profit in Job Scheduling - Time and Space
35
Problem - Maximum Running Time of N Computers
36
Maximum Running Time - Feasibility Check
37
Maximum Running Time - Implementation
38
Maximum Running Time - Time and Space
39
Problem - House Robber IV
40
House Robber IV - Feasibility Check
41
House Robber IV - Implementation
42
House Robber IV - Time and Space
43
Problem - Maximize the Minimum Powered City
44
Maximize Minimum Powered City - Feasibility Check
45
Maximize Minimum Powered City - Implementation
46
Maximize Minimum Powered City - Time and Space
47
Quiz: Binary Search Patterns
48
Common Mistakes in Binary Search
49
Section Recap
Backtracking
0/48
Greedy
0/45
Monotonic Stack
0/45
Hashmap
0/45
2.1
Introduction to Hard Binary Search
100%
Premium Roadmap
You're previewing free content. Unlock all units to continue learning.
Subscribe
Tasks
Read Unit