RadixTree Prefix Matching

Implement edge splitting, insertion and longest-prefix matching in a compressed radix tree. A free ML coding interview task on NudgeCode: write it in Python and check it with tests in your browser. Hard · Prefix Cache, Radix Tree · from Scheduling & Prefix Caching.

Implement edge splitting, insertion and longest-prefix matching in a compressed radix tree.