Watto and Mechanism WA

Revision en1, by myaw, 2017-04-15 15:56:28

I'm trying to solve this problem 514C, in simple terms you are given n strings and m queries, each query consist of a string s, can you find an equal string in the given n strings by changing only one character in s, (all strings consist only of 'a','b', and 'c')

My solution is brute force based: for each query change each character and try to find if it exist in the given strings using a HashSet, but I got a WA in pretest 6 can any one tell me what I'm doing wrong.


Tags strings, brute force, wa


  Rev. Lang. By When Δ Comment
en1 English myaw 2017-04-15 15:56:28 613 Initial revision (published)