Loading repovive.com/roadmaps/leetcode-hard-problem-solving
Roadmaps
LeetCode Hard Problem Solving
Premium
Greedy
Problemset
Discussion
AI Helper
Getting Started
0/5
Binary Search
0/49
Backtracking
0/48
Greedy
0/45
1
Introduction to Hard Greedy
2
When to Use Greedy
3
Problem - Candy
4
Candy - Two-Pass Approach
5
Candy - Implementation
6
Candy - Time and Space
7
Problem - IPO
8
IPO - Greedy with Two Heaps
9
IPO - Implementation
10
IPO - Time and Space
11
Problem - Course Schedule III
12
Course Schedule III - Greedy with Exchange
13
Course Schedule III - Implementation
14
Course Schedule III - Time and Space
15
Problem - Minimum Number of Refueling Stops
16
Minimum Refueling Stops - Deferred Decision
17
Minimum Refueling Stops - Implementation
18
Minimum Refueling Stops - Time and Space
19
Problem - Patching Array
20
Patching Array - Coverage Extension
21
Patching Array - Implementation
22
Patching Array - Time and Space
23
Problem - Create Maximum Number
24
Create Maximum Number - Two Subproblems
25
Create Maximum Number - Implementation
26
Create Maximum Number - Time and Space
27
Problem - Binary Tree Cameras
28
Binary Tree Cameras - Bottom-Up Greedy
29
Binary Tree Cameras - Implementation
30
Binary Tree Cameras - Time and Space
31
Problem - Maximum Performance of a Team
32
Maximum Performance - Fix and Optimize
33
Maximum Performance - Implementation
34
Maximum Performance - Time and Space
35
Problem - Minimum Cost to Hire K Workers
36
Minimum Cost to Hire K Workers - Ratio Strategy
37
Minimum Cost to Hire K Workers - Implementation
38
Minimum Cost to Hire K Workers - Time and Space
39
Problem - Reducing Dishes
40
Reducing Dishes - Backwards Greedy
41
Reducing Dishes - Implementation
42
Reducing Dishes - Time and Space
43
Quiz: Greedy Patterns
44
Common Mistakes in Greedy
45
Section Recap
Monotonic Stack
0/45
Hashmap
0/45
4.1
Introduction to Hard Greedy
100%
Premium Roadmap
You're previewing free content. Unlock all units to continue learning.
Subscribe
Tasks
Read Unit