Asked about Trees, graphs and the rest
How do you find the top k elements efficiently?
An answer that works
Keep a heap of size k rather than sorting everything. That is n log k rather than n log n, and it works on a stream where you cannot hold all the data at once.
Reading an answer is not being able to give one. The section that teaches this is Trees, graphs and the rest, 16 hours of Data structures & algorithms.
Learn this properlyAlso asked about Data structures & algorithms
Do AI engineering roles still ask algorithm questions?How do you decide how much algorithm preparation to do?When do you reach for a hash map?How do you recognise a sliding window problem?What is binary search on the answer?What is a monotonic stack for?When would you use BFS rather than DFS?What does topological sort solve?
All 13 questions on Data structures & algorithms