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.
Tip 3 : Focus on skills, projects and experiences more.
Students were shortlisted on the basis of a template based resume, followed by a technical round.



Two strings are said to be anagram if they contain the same characters, irrespective of the order of the characters.
If 'STR1' = “listen” and 'STR2' = “silent” then the output will be 1.
Both the strings contain the same set of characters.
The first and the foremost condition for two strings to be the permutations of each other is that the frequency of each element in both of them should be the same.
It can be proven by a very simple argument that we are only rearranging the letters, and not adding or deleting any character.
So we allocate an array of size 256 (that is the number of distinct ASCIIacharactersterst to store the frequency.
For the first string, we increase the frequency of each of the characters and for the second one, we decrease one for every character encountered.
In the end, we check that each of the elements of this frequency array is 0 (total additions by the first string are exactly nullified by the second string).
If it is not zero we return false else we return true.
What is a Trigger?
Describe SQL Joins.
There are 3 boxes. One contains just apples, one contains just oranges, and the last one contains apples and oranges. All three boxes have been mislabeled. Let’s say you approach one of the boxes and pull out just one fruit. Can you then identify the correct names of all the boxes? If yes, how?
HR round with questions on Puzzle and behavioural questions.
Introduce Yourself
Tell me something about yourself
There are 9 stones, and 1 is heavier than the rest. You have a balance (not a weighing machine). In how many measurements can you identify which stone is heavier?

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