There were three questions in the coding test which was on the Hackerrank platform. The first question was straightforward. The second one was also easy and had to count the votes for each name and tell which person had the highest votes. The third question was a good one. In this question, we were given a tree, and we were to find the number of prime numbers in a given subtree rooted at a particular node.
Onsite interview: software design, basic assembly, etc.
- implement a simple stock buy/sell system. - what frameworks have you used? - tell me about your past projects.
can't disclose
Print the nodes of a complete binary tree in level order.
Some coding questions, gives test case and you write code to pass them.
To compare two words are reversed each other or not.
How does C# handle memory management ?
A leetcode medium question
What are your long term plans for your career, and how would this internship affect that?
Viewing 161 - 170 interview questions