🚀 LeetCode 121: Best Time to Buy and Sell Stock | Optimal O(n) Solution Explained

Описание: In this video, we solve LeetCode 121 - Best Time to Buy and Sell Stock using the most optimal approach.

✅ Understand the problem statement
✅ Learn the intuition behind the solution
✅ Dry run with examples
✅ Time Complexity: O(n)
✅ Space Complexity: O(1)
✅ TypeScript Implementation
✅ Interview Tips & Edge Cases

Problem Statement

You are given an array where prices[i] represents the stock price on the ith day. Find the maximum profit you can achieve by buying on one day and selling on a future day.