First round - Online Test

• Technical Questions - OS, DBMS, CN
• Math Aptitude Questions
• Coding questions

Second round - Interviews

• 2 Technical Interviews
• 1 Managerial Round:
  • Tell me about yourself.
  • Do you have any plans for higher studies?
  • What is that quality which will drive you to come to work daily?
  • What would your friends tell about you?
  • Have you contributed any code on GitHub, etc.?
  • Your hobbies.
  • Your strengths.
  • Your weaknesses.
  • What do you know about the company, etc.?
• 1 HR round

Post-order, In-order, and Pre-order traversals: What are they, and code snippets.

Difference between a Binary tree and a Binary Search tree.

Code for inserting a node into a Binary Search tree.

Efficient way to check if a string is a palindrome or not. Efficient way to check if a number is a palindrome or not.

Stacks, Queues, and Linked Lists: What are they?

Write code to check if parentheses are balanced.

Since I am a chess player, a coding question was based on that.

Given a list of numbers, write code to find all pairs of numbers that add up to give 10.