We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Its great to see how you've used Tries data structure approach in this one. I implemented this with HashMap, but that solution is not efficient becuase you have to maintain two hashmaps and compare the count of each character in both of them.
Strings: Making Anagrams
You are viewing a single comment's thread. Return to all comments →
Its great to see how you've used Tries data structure approach in this one. I implemented this with HashMap, but that solution is not efficient becuase you have to maintain two hashmaps and compare the count of each character in both of them.