Roots and longest word

Questions 1 to 5 of 8

1. 1. Using the replaceWords function from the roots lesson, this code runs: ``cpp std::cout << replaceWords({"ap", "apple"}, "apples banana applied apple") << '\n'; `` What does it print?

   apples banana applied appleap banana applied appleap banana ap apap banana ap apple
2. 2. Using the solve function from the longest-word lesson, this code runs: ``cpp std::cout << solve({"t", "to", "too", "tool", "tools", "toolkit"}) << '\n'; `` What does it print?

   toolkittoolstooltoo
3. 3. In the longest-buildable search, why does dfs enter a child only when that child's is_end flag is set?

   The flag makes the array use less memoryThe flag sorts the words in alphabetical orderMarked nodes are the only ones that have 26 slotsEntering only marked children stops the search below any prefix that is not a word, so every path it follows is a buildable word
4. 4. Roots ca and cat are stored in the trie, and the word is catalog. Which string does shortestRoot return?

   catcacatalogc
5. 5. The pile of words is yes, ye, y and yesterday. What is the answer to the longest-buildable search? Give the word without quotes.

   Type your answer.