There were only 2 rounds. First One was an online round, with only 2 DSA (easy-medium) questions. The second round was a technical interview. He asked 2 questions. First was to update each node with the sum of the nodes greater than that node in a BST. Second questions was a hard question (given the time limit of 30 minutes and the pressure). The question is as follows You are given a list of integers nums and an integer k. Consider an operation where you increment any one element once. Given that you can perform this at most k times, return the resulting value of the most frequently occurring number. If there's more than one solution, pick the smallest possible number.