There were 4 rounds of interviews:

• HackerRank Test: You can easily crack it if you practice for a month on HackerRank. (Difficulty: Easy)
• Technical F2F: General discussion, Data Structures, Algorithms, and code pairs on HackerRank. (Difficulty: Medium)
• Technical F2F: Data Structures, Algorithms, and code pairs on HackerRank. (Difficulty: Medium)
• HR: I did not participate in this round.

I was rejected after the 3rd round. HR does not provide feedback on rejection reasons.

Following topics were covered: Binary Tree, LinkedList, Array, DP.

Nth Smallest Number in Array

Check if the Binary Tree is Binary Search Tree