Round1: Design a validate() function for every chess piece move. It's a design question, and the interviewer is interested in how I declared classes and virtual functions to call validate() for every piece.

Round2: https://leetcode.com/problems/top-k-frequent-elements/

Round3: LP questions

Round4: Find second largest value in an array in O(n) complexity.
ex: 1,2,3,4 -> 3
1,1 -> 1 (if there are only two values and both are same, then return that value)
1,1,0 -> 0

LP questions are asked in every round.