Tip 1 : Be perfect in all the coding languages, projects and internships that you have mentioned in your resume.
Tip 2 : Be confident in your answers
Tip 3 : Practice all the basic concepts of the subjects related to the applied role.
Tip 1 : Have some projects and internships
Tip 2 : Don't put everything which you are not confident in.
Tip 3 : Put the best stuff which you know well
This round consisted a multiple choice questions related to subject aptitude and coding as well. This round was medium ranged but the main thing we had to focus was on timing management. I didn't had choice of skipping but I could manage the the time with speed answering. The overall environment of the test was very good
This round was a technical round where all the concepts of coding, data structures, Analytical reasoning type was asked and even topics mentioned in my resume was asked including projects, internships.
Imagine that you are having a choice to enter a room which has 3 bulbs only once. Outside the room you can see the 3 switches of respective bulbs where you have a chance to switch on and off multiple times outside. Once you are allowed inside room how can you tell which bulb belongs to which switch particularly
The given linked list is 1 -> 2 -> 3 -> 2-> 1-> NULL.
It is a palindrome linked list because the given linked list has the same order of elements when traversed forwards and backward.
Can you solve the problem in O(N) time complexity and O(1) space complexity iteratively?
This round was a technical round where all the concepts of coding, data structures, Analytical reasoning type was asked and even topics mentioned in my resume was asked including projects, internships. Here even the coding task regarding MySQL was asked and problem analyzing regarding sales and marketing was asked
Write an SQL statements for the given situation and database table
This round was related to personal behavior, confidence checking one where they ask questions related to your experience in skills, your promising nature to the company, about relocation
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which array operation has O(n) worst-case time complexity?