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:
words.length
words[i].length
All
words[i]
consist of lowercase English letters.
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.