OptiverSoftware EngineerSoftware EngineerQuestion #40
Given an array of stock prices for n days, return the maximum profit achievable using at most k transactions. Complete the function int stock(int* prices, int k, int n).
Unlock the Full Solution
Enter your email to get the detailed step-by-step solution to this Optiver interview question, plus access to free interview prep resources.
We'll also send you a free HFT mock interview video.
More Optiver Software Engineer Questions
How much memory is required to store a linked list with 1,000 elements?Design and implement a queue data structure.Design a class diagram for a mock trading system.Complete a function that takes in a seqId (int) and a character (from 'a' to 'z' or '-'), where seqIds may arrive out of order. When the collected characters, sorted by seqId, form a complete message in the format '-FullMessage-', the function should print the message immediately using the provided OnComplete(msg) function.Implement a queue class without being able to resize memory.
Get All 120+ Optiver Questions with Solutions
Plus 16+ hours of video lectures, resume tailoring, and 1:1 mentorship from quants.
Schedule a Call