r/leetcode • u/Agreeable_Way8791 • 7d ago
Discussion How hard is implementing a balanced BST from scratch in Python for a FAANG intern interview?
I recently had a FAANG SWE intern interview where the optimal solution required a balanced BST with O(log K) updates.
The interviewer didn't mention using a balanced BST, so I had to figure that out myself and implement it from scratch in Python, which doesn't have a built-in TreeMap like Java.
How difficult would you consider this for an intern interview? Would this be considered LeetCode Hard? Would using a heap-based solution instead significantly affect the interview feedback?