Citadel–styleSoftware EngineerSoftware EngineerQuestion #94
Given an array representing user events, find the length of the longest contiguous subarray where the most frequent user in that subarray has the same number of events as the least frequent user in the entire event log. Write an efficient function to solve this problem.
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 Citadel–Style Software Engineer Questions
Build a linked list in Java.Implement a balanced binary search tree from scratch and explain its time complexity. Additionally, optimize the tree to efficiently handle duplicate values.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?
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