They asked a lot of questions about trees and the complexities. And one DSA question was also given it was as follows: In an array every element was repeating twice except one. Find that element. In the follow up he asked how would do it if the elements were appearing thrice.