Type of Questions
Though we are not allowed to disclose the coding questions, it consisted of 3 coding questions. More precisely, they were classified as 1 easy, 1 medium, and 1 hard. The easy question was based on arithmetic understanding and recursion. The medium one was partially dependent on the greedy algorithm, and the hard question was related to the tree data structure. One of my friends got a dynamic programming problem as his hard question.
I would not say it was an easy round, but it is also a fact that they were tricky rather than tough. One having a good command over core concepts of DSA can attempt at least 1.5 to 2 questions in 3 hours. I was able to do 2 out of 3. I’ve observed and heard that generally, the cutoff goes to 2 questions with an optimized solution.