Skip to content
Programming101
Programmingoneonone

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programmingoneonone

Learn everything about programming

Leetcode Best Time to Buy and Sell Stock problem solution

YASH PAL, 31 July 2024

In this Leetcode Best Time to Buy and Sell Stock problem solution, we have 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.

Leetcode Best Time to Buy and Sell Stock problem solution

Topics we are covering

Toggle
  • Problem solution in Python.
  • Problem solution in Java.
  • Problem solution in C++.
  • Problem solution in C.

Problem solution in Python.

class Solution(object):
    def maxProfit(self, prices):
        buy, profit = prices[0] if len(prices) else -1, 0
        for i in range(1, len(prices)):
            profit = max(profit, prices[i]-buy)
            buy = min(buy, prices[i])
        return profit

Problem solution in Java.

public class Solution {
    public int maxProfit(int[] prices) {
        int len = prices.length;
        if(len<=1) return 0;
        int max = 0;
        int low = prices[0];
        for(int i=1; i<len; i++){
            max = prices[i]-low>max?prices[i]-low:max;
            low = prices[i]<low?prices[i]:low;
        }
        return max;
    }
}

Problem solution in C++.

class Solution {
public:
    int maxProfit(vector<int>& prices) 
    {
        if(prices.size()==1 || prices.size()==0)
            return 0;
        int profit=0;
        int max=prices[prices.size()-1];
        for(int i=prices.size()-2;i>=0;--i)
        {
            if(max-prices[i]>=0 && max-prices[i]>profit)
            {
                profit=max-prices[i];
            }
            if(prices[i]>max)
                max=prices[i];
        }
        return profit;
    }
};

Problem solution in C.

int maxProfit(int* prices, int pricesSize){
    
    int profit = 0;
    int i;
    int p = prices[0];
    for(i=1; i < pricesSize; i++)
    {
        if((prices[i] - p) > profit)
            profit = prices[i] - p;
        p = prices[i] < p ? prices[i]:p;
    }
    return profit;
}

coding problems solutions

Post navigation

Previous post
Next post
  • Automating Image Format Conversion with Python: A Complete Guide
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
How to download udemy paid courses for free

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes