Developed a radix-tree based router for the denoland/std repository, focusing on efficient routing for static, parametric, and wildcard paths. The solution introduced a new routeRadix function with O(segments) dispatch, while maintaining backward compatibility by exposing the original linear scan as a separate export and preserving the route alias. Benchmarks demonstrated 1.5–9x performance improvements on core routing paths with minimal overhead for complex patterns. The implementation ensured deterministic routing by maintaining insertion order semantics, even with overlapping routes. This work leveraged TypeScript and backend development skills, strengthening routing performance and laying the foundation for future optimizations in API design.