Challenge: Find All Words Stored in Trie

Try to solve the Find All Words Stored in Trie problem.

We'll cover the following

Statement

Given a trie data structure representing a list of words, implement a function that finds and returns all words stored in the trie.

Constraints:

  • 0≤0\leq words.length ≤103\leq 10^3

  • 1≤ 1\leq words[i].length ≤102\leq10^2

  • All words[i] consist of lowercase English letters.

Examples

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy