Best Time to Buy and Sell Stock III at Tekion
Hard53.1% acceptance
This problem has 75.0% frequency at Tekion.
Problem Description
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. You may complete **at most two transactions**. **Note:** You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you b...
Read full problem and hintsTopics
Also asked at 14 companies
More Tekion Questions
Count the Number of Infection SequencesHardTrapping Rain WaterHardProduct of Array Except SelfMediumSplit Array Largest SumHardTwo SumEasy
View all Tekion questions