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.
No need of any complicated structure, just create a map with each of the possible substrings, and counters that increment for each new contact. My solution in C++ (in Python doing the same is straightforward):
Tries: Contacts
You are viewing a single comment's thread. Return to all comments →
No need of any complicated structure, just create a map with each of the possible substrings, and counters that increment for each new contact. My solution in C++ (in Python doing the same is straightforward):