LeetCode 121: Best Time to Buy and Sell Stock | C++ Solution | Easy | One Pass Approach

In this video, I solve LeetCode 121, Best Time to Buy and Sell Stock, using an efficient C++ approach. The goal is to find the maximum profit by buying a stock on one day and selling it on a different day in the future. If no profit is possible, we return 0. I explain the logic step by step, focusing on how to track the minimum stock price and calculate the maximum profit in a single pass through the array. Problem Link: https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/ Approach: One Pass Greedy Approach Time Complexity: O(n) Space Complexity: O(1) Topics Covered: Arrays, Greedy Algorithm, Stock Buy and Sell, Maximum Profit, C++, Data Structures and Algorithms, LeetCode Easy Problems. If you are preparing for coding interviews or improving your DSA skills, this problem is a great way to practice array traversal and greedy thinking. Like the video, share your thoughts in the comments, and subscribe for more LeetCode and GeeksforGeeks problem solutions. #LeetCode #LeetCode121 #BestTimeToBuyAndSellStock #CPP #DSA #GreedyAlgorithm #CodingInterview #ProblemSolving #LeetCodeSolutions #Programming

Added 17 Oct 2026