Skip to main content
All Questions

Given a list of words and a searchWord, for each prefix of searchWord find the first three lexicographically matching words with the prefix

Unlock detailed company stats for this questionUpgrade

Interview experiences

1 shared
Anduril · a year ago
"I felt this was a hard interview to prepare for. there are not a lot of question banks out there for Anduril. I also only encountered new problems."
Software Engineer · Senior / L5

Community answers

No answers contributed by the community yet.

Related questions

Given a list of words, find the number of prefix pairs, i.e. pairs i, j where words[i] == words[j] or words[i].startswith(words[j]) or words[j].startswith(words[i]).Given a list of Nodes, each with a unique string id and a list of subnodes it depends on, find the maximum depth of the dependencies.

Related courses

Course

Software Engineering Interview Prep

Land your dream software engineering role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates—practice data structures, algorithms, system design, people management, behavioral interviews, and more.

Course

System Design Interviews

Learn how to answer the latest system design questions across product, infrastructure, and AI domains. Features in-depth video examples, written breakdowns, and helpful reference patterns. Watch senior engineers and managers answer these questions in mock interview videos.