Citadel Securities–styleQuant 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).
Build Your Approach
State the assumptions, try a simple case, then work toward a general solution. Check the result and explain how it changes if an assumption changes.
Try the free diagnostic with worked solutions →Get Free Interview Prep Resources
More Citadel Securities–Style 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?
Practice the Reasoning Behind the Answer
Bring your target roles and interview timeline to a free quant consult. Discuss your preparation priorities and how Quant Blueprint’s lessons, practice and mock interviews can help.
Book a Free Quant ConsultYour goals · your preparation · your next steps