A stock trading algorithm problem in the style of standard LeetCode stock trading questions. Candidates are given a series of stock prices over time and must compute the maximum profit achievable under certain constraints (e.g., at most one…
The rest of the problem statement — full requirements, constraints, and edge cases
Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Palantir catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Palantir question.