Informatica Campus Hiring

Round 1: Online test with 45 MCQ questions for 30 mins. It was full of Data Structures, Operating System, DBMS, Algorithms.focuses mainly on sorting techniques, page address in OS, etc. Around 56 students were shortlisted for next Round.

Round 2: Coding test with 4 programs, 1)maximum sub-array, 2)given a number find the total number of substring divided by 11:-eg 1234(1, 12, 123, 1234, 2, 23, 234, 3, 34, 4)  question 3) given an array of number find the subset with minimum numbers that sum up to a value K. 4)Maximum no-continuous sum from array.

20 students were selected from this round

Round 3: delete a node in doubly Linked list-have all boundary conditions in mind, return the node which is deleted .question 2) given a matrix find the minimum cost required to travel from top left to bottom right (you can travel in 3 direction -Dynamic programing)

Round 4: Given a number in how many ways can we write it as a summation of 4 numbers eg: -5 means one way (1, 1, 1, 2).

Given a string with special characters reverse it but should not disturb the special characters in the string.

Round 5: Given an unsorted array find the k largest element without sorting all the elements. I Told Bubble sort but ans is max heap.
2)given a doubly linked list convert it to bst
3)given a bst use pruning method to delete all nodes greater than value K
4)Memory allocation in OS,
5)difference between process and thread in detail

4 were shortlisted and called for HR.

Round 6: Introduce about your family, why Informatica, Long term goals, all Hr Stuff, etc

Finally, 2 were hired.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.