https://shio-chan-dev.github.io/jeanblog/tags/leetcode-121/Recent content in LeetCode 121 on Jeanphilo BlogHugo -- 0.163.3en-usFri, 03 Jul 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/121-best-time-to-buy-and-sell-stock/Fri, 03 Jul 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/121-best-time-to-buy-and-sell-stock/Solve LeetCode 121 in Python by deriving the one-transaction greedy idea from the buy-before-sell constraint, an O(n^2) baseline, and the historical minimum price.