In 620C - Жемчужинки I watch some source code of other people. Most of them used map. They iterate for n times and count the element of the array using map when they find that the value of current element in the map is 2 then they clear the whole map.. For that I am bit confused about that solution. I will be pleasure if anyone tell me what is the actual complexity of that solution :)