Although I didn\'t really want to move to Seattle, still tried its OA after convinced by the recuiter.\n\nSo, basically a simple hashmap + sorting easy problem, and another DFS or Union Find problem. Passed all test cases and explained the approach and time complexicity. But got the feedback from the recruiter that it failed.\n\nI have no idea how this could fail. Does anybody have the same experience?\n\nThe only potential problems that I can think of:\n* tried to copy/past several texts from the problem description on the left panel to add to the code comments, then got a browser warning of "no copy/paste"\n* didn\'t explain what n means in the big O notation in time complexicity\n\nOther than the above, anything else could fail OA?

Although I didn\'t really want to move to Seattle, still tried its OA after convinced by the recuiter.\n\nSo, basically a simple hashmap + sorting easy problem,