Best Time to Buy and Sell Stock
easy
Points: 100
Problem Statement
You are given an array prices where prices[i] is the price of a given stock on the ith day. Find the maximum profit you can achieve.
Constraints
- 1 ≤ n ≤ 105
- Input is a list of integers
Examples
Input: [2, 7, 11, 15], target = 9 Output: [0, 1]
Need Help?
Connect with expert programmers on CodeConnect for real-time collaborative coding, video meetings, and whiteboard sessions.