← Amazon questions

Best Time to Buy and Sell Stock II

Filed under Amazon · Also reported at Groww, Navi, Realpage, Zepto

Say you have an array prices for which the i-th element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.