arrow_back Back to Challenges

#121 Best Time to Buy and Sell Stock

Easy Acceptance 0%
description

Problem Description

You are given an array `prices` where `prices[i]` is the price of a given stock on the `i`th 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`.

checklist Constraints

1 <= prices.length <= 10^5
0 <= prices[i] <= 10^4

science Examples

Case #1

In: prices = [7,1,5,3,6,4]
Out: 5

Case #2

In: prices = [7,6,4,3,1]
Out: 0

Mastery Tags

Arrays Dynamic Programming

Hiring Companies

Amazon Google Meta
code

Integrated IDE

code_blocks
Coding
psychology
Aptitude