There were 2 easy - medium DSA questions which I don't remember.
The interviewer asked 3 DSA questions of easy-medium-hard difficulty. Needed to write compilable code on a document (no test cases to be passed).
Question 1: Given a stream of integers with exactly a pair of duplicate integers, need to return the duplicate integer. I discussed various approaches including the most optimal using bitwise XOR operation. The interviewer was asking for in-depth properties of XOR because of which the solution holds true. I explained but the interviewer seemed not to be convinced.
Question 2: Classic House Robber question. I gave my recursive then memoized DP solution. He asked for dry run on test cases and DP table values for some cases.
Question 3: Classic N-Queens problem. The interviewer was vague on the requirements, what the method needs to return actually. Still went with the classic approach of backtracking. But the interviewer was not convinced with the code written (was incomplete dur to time constraints).
Verdict: Not selected.