IMC TradingSoftware EngineerSoftware DeveloperQuestion #75
Given a binary tree, return all nodes whose value is greater than that of all their ancestors (i.e., nodes that are visible from the root along any path).
Unlock the Full Solution
Enter your email to get the detailed step-by-step solution to this IMC Trading interview question, plus access to free interview prep resources.
We'll also send you a free HFT mock interview video.
More IMC Trading Software Engineer Questions
Implement a Tic-Tac-Toe game.What is a hashmap?What is the difference between threading and multiprocessing?Complete the function findValuation that returns the expected price of a house using linear interpolation, given arrays of historic house areas and prices. The function should round the result to the nearest integer. Function signature: findValuation(reqArea: int, area: list of int, price: list of int) -> int, where reqArea is the area of the candidate house, area[i] is the area of the ith house sold, and price[i] is its price. Constraints: 500 < reqArea < 10^5, 500 < area[i] < 10^5 for all i.Is the total number of distinct unsigned 32-bit integers different from the total number of signed 32-bit integers?
Get All 94+ IMC Trading Questions with Solutions
Plus 16+ hours of video lectures, resume tailoring, and 1:1 mentorship from quants.
Schedule a Call