Given the price of n stocks and their future prices, find the maximum return that can be achieved under a certain budget.
For example, if you have 4 dollars, 4 stocks are currently worth [1,1,1,4], and in the future, these 4 stocks will appreciate to [2,2,2,6]. At this time, if you buy the first three stocks, you spend 3 dollars to reach the maximum profit of 3 dollars (2-1) + (2-1) + (2-1).
n is limited to 1 to 300, and the budget is limited to 1 to 30000.
Check the validity of a pyramid of dominoes.
The following metrics were computed from 1 interview experience for the Jump Trading Software Engineer role in Taiwan.
Jump Trading's interview process for their Software Engineer roles in Taiwan is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Jump Trading's Software Engineer interview process in Taiwan.