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.
First round is coding test which contains 2 questions. We have to answer any one of the questions.



String 'S' is NOT case sensitive.
Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
In the recursive approach, we will traverse the string from [0, N/2], where N is the length of the string.
While traversing, we will check if S[i] == S[N-i-1], and if it is equal, then we will continue with recursion calls. Else, we will return false.
If the output of the recursive function is true, then we will print "YES"; else, we will print "NO."



We iterate from 2 to N.
For each number num, we check if it is prime or not. We use the following optimized approach to check if a given number is prime.
We loop through all numbers from 2 to (num)^½.
For every number in the loop, we check if it divides num.
If we find any number that divides num, we can say num is not prime.
If num is prime, we store it in the result vector/list.
Finally, we return the result vector/list.
This was the first technical round. Questions based on OOPS and Automata were asked.
Are Normal forms really needed?
Validate a phone number with finite automata.
What is the use of virtual keyword?
What are friend functions?

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