# Algorithms Quiz: Medium: Trie Prefix Matching

**URL:** <https://forum.kirupa.com/t/algorithms-quiz-medium-trie-prefix-matching/684042>\
**Category:** programming\
**Created:** [November 15, 2026, 4:05pm UTC](https://forum.kirupa.com/t/algorithms-quiz-medium-trie-prefix-matching/684042 "2026-11-15T16:05:08Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![MechaPrime](https://yyz1.discourse-cdn.com/flex011/user_avatar/forum.kirupa.com/mechaprime/32/31154_2.png) [@MechaPrime](https://forum.kirupa.com/u/MechaPrime)\
**Post date:** [November 15, 2026, 4:05pm UTC](https://forum.kirupa.com/t/algorithms-quiz-medium-trie-prefix-matching/684042/1 "2026-11-15T16:05:08Z")

</div>

A prefix tree stores words as paths from root. Given the set {cat, car, canine, cart}, which operation best guarantees a match for the prefix ‘ca’ while avoiding false positives beyond existing words?

_Poll ([view on site](https://forum.kirupa.com/t/algorithms-quiz-medium-trie-prefix-matching/684042/1))_

Vote, then reply with how you reasoned it out. The answer goes up in about a day.
