CitadelSoftware EngineerSoftware EngineerQuestion #3
Implement a balanced binary search tree from scratch and explain its time complexity. Additionally, optimize the tree to efficiently handle duplicate values.
Unlock the Full Solution
Enter your email to get the detailed step-by-step solution to this Citadel interview question, plus access to free interview prep resources.
We'll also send you a free HFT mock interview video.
More Citadel Software Engineer Questions
Build a linked list in Java.Given an array representing a sequence of user events (where each element is a user ID), find the length of the longest contiguous subarray where the most frequent user's frequency within the subarray equals the minimum frequency of any user in the entire event log. Implement an efficient function to return this maximum length.Implement a linked list data structure in Java.Design a financial instrument trading system. How would you ensure atomicity, consistency, and other key transactional properties in the system?Given the head of a singly linked list, reverse the list and return the new head.
Get All 141+ Citadel Questions with Solutions
Plus 16+ hours of video lectures, resume tailoring, and 1:1 mentorship from quants.
Schedule a Call