← Sliding Window

Micro-Drill #102 — Track min price, max profit

Sliding Window Target: 10s

Single-pass tracking of running minimum and maximum profit. Classic greedy O(n) solution.

mn = float('inf')
mx = 0
for p in prices:
    mn = min(mn, p)
    mx = max(mx, p - mn)

Type it from memory. Go.

Practice Problems

• 121. Best Time to Buy and Sell Stock
• 122. Best Time to Buy and Sell Stock II

Related Coding Drills

• Drill #3 — Max subarray sum (Kadane's) Medium
• Drill #56 — Min in rotated sorted array Medium
• Drill #7 — Sliding window max sum of k elements Easy