Loading the journal
LeetCode (121)Track the Minimum
12 recent
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
Step 1
Know these before you start
Tick what you already know
Concept videoStep 2
Try it on paper
5–10 minutes, no code yet
Community-reported · source · updated 2026-10-08. ● asked in the last 6 months.
You are given an array prices where prices[i] is the price of a stock on day i. Choose one day to buy and a later day to sell for maximum profit. Return the maximum profit (0 if no profit is possible).
Imported 2026-10-09 from NeetCode auto-sync (reviewed; List import added).
Input: prices = [7,1,5,3,6,4]
Output: 5
Explanation: buy at 1, sell at 6 → profit 5
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code · optimal solution