Implement Trie (Prefix Tree) at Arista Networks

Problem Description

A [**trie**](<https://en.wikipedia.org/wiki/Trie>) (pronounced as "try") or **prefix tree** is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker. Implement the Trie...

Topics

Also asked at 23 companies