codebytes: TAP2012D SPOJ (Trie with HashMaps) solution Java

codebytes: TAP2012D SPOJ (Trie with HashMaps) solution Java

TAP2012D SPOJ (Trie with HashMaps) solution Java You need to put all the names first and second team players in the same trie. If your logic involves putting the names of team1 into trie and then using team2 player names, you're likely to get WAs. For eg. changing the order of queries for team2 names will get you different answers in some cases. Check out these test cases:- 5 7 Check out my solution if you're still stuck. Source: import java.io.*; import java.util.*; class Node{ HashMap children; int first = 0; int second = 0; Node(){ children = new HashMap<>(); } void init(){ children.clear(); first = 0; second = 0; } } class TrieMap { static final int MAX = 500000; static int gIndex; static Node trie[]; static int count=0; public static void insert(String s, int type){ int cIndex = 0; for(int i=0;i

Read full article from codebytes: TAP2012D SPOJ (Trie with HashMaps) solution Java