Available question text
They asked me to implement a balanced binary search tree from scratch and explain its time complexity. They also wanted me to optimize it for handling duplicate values
Related questions
Continue with questions that share topics or the same question type.
- They asked me to design a memory-efficient algorithm to detect if a linked list contains a cycle, then optimize it for both time and space complexity. After solving it, they wanted me to explain how I'd test it and handle edge cases like empty lists or single-node lists. The interviewer really focused on my thought process and communication style throughout.
Coding
- Construct Binary Search Tree from Preorder Traversal
Coding
- Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand (e.g., [4,5,6,7,0,1,2]). Search for a target value and return its index, or -1 if not found. Required time complexity: O(log n).
Coding
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
Citadel
They asked me to implement a balanced binary search tree from scratch and explain its time complexity. They also wanted me to optimize it for handling duplicate values
Reported date not specified · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source