How should I practice Add Word and Suffix Search?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Anduril onsite interview problems in FastPrep.

Is Add Word and Suffix Search associated with Anduril?

FastPrep tags this as a Anduril onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · String

Add Word and Suffix Search

Learn this problem

● Medium

AndurilFULLTIMEONSITE INTERVIEW

Problem statement

Process matching arrays operations and values from left to right. Each operation is one of:

add: store the lowercase word in the corresponding values entry. Adding a duplicate word does not change future answers.
search: append true to the result when at least one stored word ends with the complete queried suffix; otherwise append false.

An empty suffix matches exactly when at least one word has already been added. Return one Boolean for every search operation, in operation order.

Function

suffixSearch(operations: String[], values: String[]) → boolean[]

Examples

Example 1

operations = ["add","add","search","search","add","search"]values = ["apple","maple","ple","xyz","happy","py"]return = [true,false,true]

Both initial words end in ple, no stored word ends in xyz, and the later word happy ends in py.

Example 2

operations = ["search","add","search","add","search"]values = ["","code","","code","de"]return = [false,true,true]

The first empty-suffix query occurs before any add. After code is added, an empty suffix matches. Adding the duplicate changes nothing, and de still matches.

Constraints

operations.length == values.length.
1 <= operations.length <= 200000.
Every operation is "add" or "search".
Added words are non-empty lowercase English strings; suffixes are lowercase English strings and may be empty.
The sum of all word and suffix lengths is at most 500000.