Citadel SecuritiesQuant ResearcherQuantitative ResearcherQuestion #9
Given an array representing the price of a stock on each day, and an integer k, determine the maximum profit you can achieve by completing at most k buy-sell transactions (you must sell before buying again).
Unlock the Full Solution
Enter your email to get the detailed step-by-step solution to this Citadel Securities interview question, plus access to free interview prep resources.
We'll also send you a free HFT mock interview video.
More Citadel Securities Quant Researcher Questions
You regress X1 against Y and obtain an R-squared value of 0.1. Then, you regress X2 against Y and obtain an R-squared value of 0.2. What is the maximum possible R-squared when regressing both X1 and X2 against Y together?Given a string, return all possible permutations of its characters as a list. You may use recursive backtracking or any relevant Python packages.Starting at the origin on a grid, you can move either up/down or left/right at each step. After N steps, how far can you be from the origin? Additionally, if there are two boundaries, what is the probability that you reach one boundary before the other?If you toss a fair coin N times, what is the probability that you will get an even number of heads? Follow-up: Now, what if you have N - 1 fair coins, and the Nth coin is biased and lands on heads with probability p?What happens if two features are highly collinear in Lasso regression?
Get All 57+ Citadel Securities Questions with Solutions
Plus 16+ hours of video lectures, resume tailoring, and 1:1 mentorship from quants.
Schedule a Call