Technical Round (1 hr):
- Print a binary tree in vertical order.
- The intersection of two Linked List:
- k largest element in an array.https://www.geeksforgeeks.org/k-largestor-smallest-elements-in-an-array/
I answered all question, they were mainly focusing on your logic, code quality, and complexity. Make sure whatever logic you tell, you should be able to come up with optimized code for that.
Technical Round (45 mins):
This round was basically to test your core mathematical logic and system design.
- Probability question ( 12th std level)
- Discuss on one of my ML project and some mathematical discussion on probability distribution as per my project.
- Design a lift. Generalize it for an apartment where 2 or more lifts are running.
- One puzzle. (Interviewer showed me a pic and asked me to answer some 8 questions. That was just to check my thinking and awareness about things).
Make sure while answering the design question you are making use of OOPS concepts.
Managerial Round(1.15 hr):
It was the toughest round of all. The manager basically wanted to check logical thinking, OOPS concept, DB knowledge and real-time problem-solving approach which involves architecture and technology used and why.
- Given a DB table, 1000 readers and 2 writers. The first guy read the data at 5:15 pm and starts processing, the second guy updates the data at 5:20 pm(the first guy is still processing), now the first guy come and update the data at 5:25 pm. So data updated by the second guy got lost. How do you prevent this?
- There is a parent class A whose all functions are public. Class B and class C inherit Class A. certain function of class A should not be accessible in class B ( i.e when you create an object obj of class B and do obj.fn(), it should throw an error). How do you achieve that? (It shouldn’t be language specific).
- He asked me one algo question which I don’t remember now. It was something to do in place in an array.
He told me to answer at least two questions then he will ask one real-time problem else you can go home. I answered two questions somehow and got the chance to solve the real-time problem. The problem statement was:
Some companies store their employee data in excel sheet. We are going to give them a solution so that they can view their data in a dashboard designed by our company. Whenever any member of a company logs in, you should populate the data relevant to that particular company. Now address the following problems:
- How will different company gives us the excel sheet data and store it in our DB directly and also which technology will you use and why?
- The architecture of the system.
- DB Schema of the system.
Gave him all solution for all the problems above and he seemed happy. And he welcomed me in his team :D.
HR Round(15 min):
Normal discussion on salary and HR queries.
Finally got the offer letter 🙂
- Amazon Interview Experience Offcampus for SDE-1
- Amazon Interview Experience | SDE-1 offcampus
- Goibibo Interview Experience
- Goibibo Interview Experience | Set 3
- Goibibo Interview Experience
- GoIbibo interview experience | Set 2 (On-Campus)
- GoIbibo Interview Experience (On-Campus)
- Microsoft Interview Experience (Full Time 2018 Washington DC - with 2.5 years of experience)
- TIAA Interview Experience -Java Back Backend Developer (3+ years Experience)
- Goldman Sachs Interview Experience | Set 23 (2+ years Experience for Java Developer Role)
- Arcesium Interview Experience - Senior Software Engineer (3 years experience)
- Arcesium Interview Experience | Set 5 (3+ years experience - Developer profile)
- Nutanix Interview Experience for MTS - QA (4+ year experience) [ Language - Python ]
- Arcesium Interview Experience Software Engineer (1+ year experience)
- Nagarro Interview Experience for Xamarin Developer | 3 Years Experience
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.