There were only two rounds.

The first round was an online assessment with two Data Structures and Algorithms (easy-medium) questions.

The second round was a technical interview. The interviewer asked two questions.

First, they asked to update each node in a Binary Search Tree (BST) with the sum of all nodes greater than that node.

The second question was a hard one, especially given the 30-minute time limit 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 operation at most k times, return the resulting value of the most frequently occurring number. If there is more than one solution, pick the smallest possible number.

The first task was to update each node with the sum of the nodes greater than that node in a BST.

You are given a list of integers nums and an integer k. Consider an operation where you can 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.