There were 2 rounds. The first round was mostly based on DSA. I was asked two questions- 1. Check is the number is a power of two. 2. Given a array, find the maximum sum of the array such that adjacent elements are not picked in the sum. Second round was core + technical. First asked some basic questions of javascript. Then what is thread, context switch, polymorphism. I was asked 1 DSA question Given a number n, find the number of BST that can be formed using numbers from 1 to n.