Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
It was in the afternoon. I got the test link by mail from a senior post holder in the company.






A binary search tree is a binary tree data structure, with the following properties :
a. The left subtree of any node contains nodes with a value less than the node’s value.
b. The right subtree of any node contains nodes with a value equal to or greater than the node’s value.
c. Right, and left subtrees are also binary search trees.
It is guaranteed that,
d. All nodes in the given tree are distinct positive integers.
e. The given BST does not contain any node with a given integer value.


Some questions related to the OOPS concepts and one coding question was asked in this round.


What is a data abstraction?
What is data encapsulation?
What are the advantages of inheritance?
How the multiple inheritance is done in Java?
Why do you want to work for us or our company
Do you know anyone who works for us?
Why should we hire you?
What do you know about the work ethics here in Techwave?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?