Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started

Trie for Library Search

Medium
CodingHash TablesStringsTreesAsked 1 times

Problem

Implement a prefix tree (Trie) for a library search by title. The Add() and Search() operations should be O(n) time complexity. Maps are not allowed.

You are practicing as a guest. Sign up free to get your answer graded with AI feedback. Your draft stays right here.

Sign up freeI have an account
Sign up to unlock solutions
ByteDance DevOps Engineer Interview Questions
Next questions
Trie for Library SearchMedium22nd Century TechnologiesTrie for Prefix SearchHardDidi ChuxingTrie Prefix TreeMedium
0 / ~200 words