LeetCode
Question
·
Jun 2024
·
Seattle
Snap | Seattle | Phone
9 upvotes
606 views
5 replies
Question Details
Interviewed with Snapchat a few days ago
Phone Interview Given a list of strings find if the word is prefix of any word Example: [\'world\', \'word\', \'would\', \'wont\', \'which\', \'hello\'] prefix : \'wo\' I started...
Full Details
Interviewed with Snapchat a few days ago
**Phone Interview** Given a list of strings find if the word is prefix of any word
**Example**:
[\'world\', \'word\', \'would\', \'wont\', \'which\', \'hello\']
prefix : \'wo\'
I started with basic String matching, but interviewer mentioned to optimize time complexity.
Navigated me towards Trie.
He was looking for implementation for Trie.
Update : I was not able to clear phone round.
Free preview. Unlock all Snap questions →
About This Question
This is a reported interview question from a snap interview for a swe role during the phone screen round reported in 2024.
It covers the following topics: Binary Tree, Strings, Trie .
Difficulty rating: Easy