LeetCode Solution: 121. Best Time to Buy and Sell Stock

Mastering LeetCode 121: The Easiest Stock Problem You'll Ever Solve! 💰 Hey there, future coding rockstars! 👋 Vansh here, back with another LeetCode breakdown designed to make you say, "Aha! I got this!" Today, we're diving into a classic problem that's often a gateway to more complex dynamic programming challenges: 121. Best Time to Buy and Sell Stock . Don't let the "stock market" theme scare you. This problem is super beginner-friendly and perfect for honing your greedy algorithm skills. Let's make some virtual profit! The Problem: When to Buy, When to Sell? 📈 You're given an array called prices , where prices[i] represents the price of a stock on the i -th day. Your mission, should you choose to accept it, is to figure out how to maximize your profit. Here's the catch: You can only perform one transaction : buy one stock, then sell it later. You must buy before you sell . No time travel allowed! If you can't make any profit (meaning all prices after your buy day are lower), you shou