HELP trie policy based data structure
My solution click to this hackerrank problem click
I use trie policy data structure but it is tle since distance operator is O(n) ... any help how to implement using it or it is not possible?
ICPC NA North Central and South Division