Greedy

2 problems using this pattern

About this pattern:

Make locally optimal choices hoping to find a global optimum.

Often used with: Math Proportional Allocation Two Pointers

Complexity Range

Time Complexity

O(n) (1 problem)
O(n log n) (1 problem)

Space Complexity

O(1) (1 problem)
O(n) (1 problem)

Problems Using Greedy

Best Time to Buy and Sell Stock

Find maximum profit from buying and selling stock once.

Easy LeetCode
Time: O(n)
Space: O(1)
Example: [7,1,5,3,6,4] → 5 (buy at 1, sell at 6)
Two Pointers Greedy
View Solution →

Payroll Distribution

Distribute payroll funds proportionally when insufficient, handling remainders fairly.

Hard
Time: O(n log n)
Space: O(n)
Example: amount=30, {a:10,b:5,c:10,d:8} → {a:9,b:5,c:9,d:7}
Math Proportional Allocation Greedy
View Solution →
← Back to All Patterns
View All Categories