LeetCode - Best Time to Buy and Sell Stock Solution - The Coding Shala

Home >> LeetCode >> Best Time to Buy and Sell Stock

 In this post, we will learn how to solve LeetCode's Best Time to Buy and Sell Stock problem and will implement its solution in Java.

Best Time to Buy and Sell Stock Problem

You are given an array of prices where prices[i] is the price of a given stock on an ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Example 1:
Input: prices = [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Practice this problem on LeetCode.

LeetCode - Best Time to Buy and Sell Stock Java Solution

Approach 1

Straight forward solution.

Java Program: 

class Solution {
    public int maxProfit(int[] prices) {
        int maxProfit = 0;
        int buy = prices[0];
        for (int i = 1; i < prices.length; i++) {
            int curr = prices[i];
            // check if its lower then bought stock
            if (curr < buy) {
                buy = curr;
            maxProfit = Math.max(maxProfit, (curr - buy));
        return maxProfit;

Other Posts You May Like
Please leave a comment below if you like this post or found some errors, it will help me to improve my content.


Popular Posts from this Blog

Shell Script to find sum, product and average of given numbers - The Coding Shala

Shell Script to Create a Simple Calculator - The Coding Shala

Add two numbers in Scala - The Coding Shala

New Year Chaos Solution - The Coding Shala

Richest Customer Wealth LeetCode Solution - The Coding Shala