← Flipkart questions

Stock span / max profit problem

Filed under Flipkart

Say you have an array for which the i-th element is the price of a given stock on day i. Design an algorithm to find the maximum profit by choosing a single day to buy one stock and choosing a…

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 Flipkart questions

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