Your question is Top-K Frequent N-grams. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Given a stream of text data, design an efficient algorithm to find the top K most frequent phrases of length N in real time.