Your question is T9 Prefixes With Digit Sequences. 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).
How would you implement a T9-style algorithm that returns matching words for a given digit sequence and also supports prefixes, including time and space complexity?