(Aug, 2018): Insight: It was on-campus, students from ME and BE computer science were only eligible. The cgpa cut off was 8.5, but later they reduced to seven. There were two profiles Server Technology group (ST group) and Apps Development (Apps group).
Cumulative of A and B were taken.
Multiple choice questions as well as some fill in the blanks type questions were there. The test covers topics comprises of Quantitative, Reasoning, some C program (find output) and Java program – all of them are graph and tree based, English comprehensive. Each section has 15-20 min which was further divided into fix 5-7 min.
You have to be very quick to solve. However, you don’t require separate preparation.
I performed poorly.
Next day coding round was there. Two questions were asked.
1. Find the maximum length distinct substring in a given a string,
e.g. S = “abbaacdekdfjjk” o/p: acdek
2. A cricket player has to score N runs, with condition he can take either 1 or 2 runs only and consecutive one should not be 2. Find all the possible combination he can take
e.g. N = 4, o/p = 3 (1+1+1+1, 1+2+1, 2+1+1, 1+1+2)
Solved both problems.
Total 66 sits in the first round, 22 shortlisted for ST profile (who performed overall better in round 1 as well as all who solved both coding problems) and 24 shortlisted for Apps profile.
This round was mainly problem discussion.
P-1: I was asked to optimize my code that I submitted round 1, part B first problem.
P-2: Given a singly linked list, find kth element from the right end. Space complexity has to be O(1) and TC has to be O(n).
P-3: Discussed a project that I mentioned in my resume. He was particularly interested whether the outcome of the project is some product or not. It has to be challenging.
P-4: Asked a puzzle, Given 7 min, 4 min sand timers, How can we calculate 9 min ?
P-1: Given n array with different sizes, all sorted, you’ve to merge all these into single sorted array.
He asked whether I know Java, SQL. I said no. Then, he asked me to design data base storage system. Then, for 30-40 min, we discussed pros and cons of my design as well as improvement.
Then, we discussed some random topics related to Big data industry (casual).
Usually, everyone has three rounds and one HR. But I had another tech round. As I was good in data structure and coding, but not very good and neither have any prior knowledge of data base. Therefore, they took another round. They asked my favorite topics, replied files ystem.
He asked me questions from the Unix file system and Google file system (in details).
This was normal hr round as supposed to be. Three people were on waiting list including me.
- MathWorks Interview Experience (EDG, Oncampus)
- ServiceNow Interview Experience Oncampus
- UHG Interview Experience | OnCampus- 2019
- InfoEdge Interview Experience | OnCampus-2019
- Oracle Interview Experience | Set 20 (On-Campus for Oracle Financial Services Software)
- Oracle Interview Experience | Set 22 (On-Campus for Oracle Financial Services Software)
- Oracle Interview Experience | Set 36 (Application Developer for OFSS)
- Oracle Interview Experience | Set 13 (On-Campus)
- Oracle Interview Experience | Set 14 (On-Campus for Server Tech)
- Oracle Interview Experience | Set 15 (On-Campus)
- Oracle Interview Experience | Set 16 (On-Campus for GBU Developer Profile)
- Oracle Interview Experience | Set 17 (On-Campus)
- Oracle Interview Experience | Set 18 (On-Campus for GBU App Development)
- Oracle Interview Experience | Set 19 (On-Campus for App Development)
- Oracle Interview Experience | Set 21 (On-Campus for Application Developer)
- Oracle Interview Experience | Set 23 (On-Campus)
- Oracle Interview Experience | Set 24 (On-Campus for Global Business Unit)
- Oracle Interview Experience | Set 25 (On-Campus)
- Oracle Interview Experience | Set 26 (On-Campus for ST Full Time)
- Oracle Interview Experience | Set 27 (On-Campus)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.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.