Hudson River Trading–styleSoftware Engineer InternSoftware Engineer InternQuestion #29
Implement a pool allocator in C++.
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 Hudson River Trading–Style Software Engineer Intern Questions
How does push_back work in C++? What are its time complexities and internal workings? What are the differences between a thread and a process?What is the difference between a hash map and a map?Find the k largest values in an array in average time O(n).1) A pretty number is a number in base 4 whose digits are all either 1 or 0. How many pretty numbers are there less than n? 2) Given a list of moves in Reversi, return the total number of pieces for each player at the end of the game. 3) Trees are given as lists of nodes, where each node is a list with data [key, value, *children], where the order of the children matters. Two trees must be merged (left and right). For a given merged node with the same key between left and right inputs, the merged value should come from the right tree. The list of the merged node's children should start with children from the left tree's child list, and then the leftover right tree's child list. Output (key1, value1, ...) in pre-order traversal.Given a person, what is the expected number of people you must observe before seeing someone taller than that person?
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