You are viewing a single comment's thread. Return to all comments →
Yes, will store 2 at the node H Also,
children.putIfAbsent(ch, new TrieNode());
the putIfAbsent() will avoid storing duplicates, so there will only be 1 H node
HackerRank solutions.
Seems like cookies are disabled on this browser, please enable them to open this website
Contacts
You are viewing a single comment's thread. Return to all comments →
Yes, will store 2 at the node H Also,
the putIfAbsent() will avoid storing duplicates, so there will only be 1 H node
HackerRank solutions.