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.
This was a Group discussion round. At 9.30 Am in the morning i went to the company. Around 200 students came. First round was GD and they given the topic on social networking. We have discussed for 10 minutes.
The topic given was Social networking.
I spoke about the pros and cons of social networking.
Out of 20 students in my batch 6 students go for next round. Aptitude test consists of 10 quant, 5 logical, 10 c programming, 10 english. approximately 50 members had written the aptitude test. around 20 got eliminated.
A man fell in a 50m deep well. He climbs 4 meters up and slips 3 meters down in one day. How many days would it take for him to come out of the well?
47 days
Technical round with 2 coding questions.



Consider if ‘N’ = 4, the Factorial of 4 will be the product of all numbers from 1 to 4, which is 1 * 2 * 3 * 4 = 24. Hence, the answer is 24.
We will calculate the factorial of the given number and store it in the form of an array of digits named digits. To do this, we will define a function multiply(digits, x) that will multiply the number corresponding to the digits array with x and update the digits array with the product’s value.
We will initialize the digits array with 1 and multiply it with all numbers from 2 to N using the multiply function. At last, we will print the digits array.



Both the strings have only lowercase English alphabets.
There may be more than one correct solution, you have to return any one of the possible solutions.
The idea is to follow the order in which the characters occur in string Y. We have to run two nested loops on strings Y and X respectively and if Yi is the same as Xj then pick this character and add it to the answer string.
For the remaining characters of X that are not in the string Y, we have to just add those characters in our answer string. To find those remaining characters we can create a vector of visited characters or a hash set.

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