Skip to main content
All Questions

Given daily prices and an integer k, find the maximum profit from at most k buy-then-sell transactions, then cut the extra memory as far as you can.

Unlock detailed company stats for this questionUpgrade
Given an array of daily prices and an integer k, find the maximum profit from at most k buy-then-sell transactions, holding at most one share at a time. Then reduce the extra memory your solution uses as far as you can.

Community answers

No answers contributed by the community yet.

Related questions

Given an array of daily prices, find the maximum profit from at most two buy-then-sell transactions, holding at most one share at a time.Given an array of daily prices, find the maximum profit from one buy followed by one sell.

Related courses

Course

SQL Interview Prep Course

Prepare for SQL interviews with lessons on joins, aggregations, and window functions, then practice real SQL interview questions in an interactive editor with expert solutions.

Course

Data Science Interview Prep

Land your dream data science role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates. Practice statistics, experimentation, coding, SQL, machine learning, behavioral interviews, and more.