Question Details
You are given an integer array prices where prices[i] is the price of a given stock on the ith day. Design an algorithm to find the maximum profit. You may complete at most k transactions. Not
Full Details
🔒
Unlock all Lyft questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a lyft interview for a swe role during the coding round.
It covers the following topics: Arrays .
Topics
More Lyft Interview Questions
1p3a
lyft data science onsite interview overview for software engineer position
1p3a
preparing for lyft software engineer phone interview: limited prep time
LeetCode
Lyft | Software Engineer (L4) | SF | January 2021 [Offer]
LeetCode
Lyft Taxi Scheduling
LeetCode
Lyft | Virtual Onsite | Design bots to download wikipedia