Search⌘ K
AI Features

DIY: Best Time to Buy and Sell Stock

Explore how to determine the best time to buy and sell a single stock to maximize profit. This lesson guides you through implementing a function that processes an array of stock prices and calculates the maximum possible gain from one transaction, helping you apply problem-solving skills used in coding interviews.

We'll cover the following...

Problem statement

You have an array for which the ith element is the price of a given stock on day i.

If you are only permitted to complete one transaction at most (e.g, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note: You cannot sell a stock before you buy one. ...

Input

[7,1,5,3,6,4]