Practice Google Coding Question | Real Coding Interviews | Hack2hire

NewDark mode is now available across the siteSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Segment an input string into tokens using a provided dictionary of key-value pairs.
Apply a greedy strategy that always selects the longest matching prefix at each step.
Unmatched characters are preserved and emitted as individual literal tokens.

What This Tests

Trie construction and efficient prefix matching
Greedy algorithm design and state management
Linear pass string segmentation
Handling overlapping or nested dictionary keys

Common Patterns

Trie

Greedy

Accepted

4.7k/14.7k

Acceptance Rate31.6%

Test Cases

Input

text =

dictionary =

Output

Expected