Best Time to Buy and Sell Stock: coding question

Problem

You get an array prices. The value prices[i] is the price of a stock on day i.

You can buy one stock on one day and sell it on a later day. You can do only one buy and one sell. The profit is the sell price minus the buy price.

Return the largest profit that you can make. If no trade gives a profit, return 0.

Input:: prices = [9,4,6,2,8,5]
Output:: 6
Explanation:: Buy on day 3 at the price 2. Sell on day 4 at the price 8. The profit is 6.

SysRound wrote this statement. A reference solution checks every example.

Continue with questions that share topics or the same question type.

Best Time to Buy and Sell Stock II
Coding · Array · Dynamic Programming · Greedy
Two Best Non-Overlapping Events
Coding · Array · Binary Search · Dynamic Programming
Beautiful Arrangement
Coding · Array · Backtracking · Bit Manipulation
Coin Change
Coding · Array · Breadth-First Search · Complete Knapsack

Sources · 3 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Glassdoor · 1 record

Hello Interview · 5 records

Problem

You get an array prices. The value prices[i] is the price of a stock on day i.

You can buy one stock on one day and sell it on a later day. You can do only one buy and one sell. The profit is the sell price minus the buy price.

Return the largest profit that you can make. If no trade gives a profit, return 0.

Input:: prices = [9,4,6,2,8,5]
Output:: 6
Explanation:: Buy on day 3 at the price 2. Sell on day 4 at the price 8. The profit is 6.

SysRound wrote this statement. A reference solution checks every example.