This was a written round with 40 question and no negative marking.
There were 3 sections:
C/C++ output(quite tough)
He asked about my project in detailed and focused on how I implemented the functionality of few key things. Gave to write a proper c code of
first, I gave a O(n^2) approach then he said to optimize it. then I gave O(nlogn) approach by sorting the array and then using binary search for finding(arr[i] – k) where k is the given sum.
From some this round was HR and for some it was tech. for me it was tech.
asked few c++ questions and difference between c/c++/java and few puzzles.
Total of 11 students were selected and I was one of them.
- Nvidia Software Interview Experience | Internship
- MathWorks Interview Experience (EDG, Oncampus)
- ServiceNow Interview Experience Oncampus
- UHG Interview Experience | OnCampus- 2019
- InfoEdge Interview Experience | OnCampus-2019
- SAP Labs Interview Experience for 2 Months Internship
- SAP Labs Interview Experience | Set 36 (For 2 Months Internship)
- BuyHatke interview experience (On-campus for 6 months internship)
- SAP labs Interview Experience(6 months internship)
- SAP Labs Interview Experience | For 2 Months Internship
- Fidelity Interview Experience for 2 months Summer Internship
- Amazon Interview Experience | 6-months Internship (Off-Campus)
- Amazon Interview Experience | 6-months SDE Internship (2020)
- Amazon Interview Experience | 2 months Internship
- Amazon Interview Experience for SDE-1 FTE/6 Months Internship – AmazeWow
- Amazon Interview Experience for FTE/6 months SDE-1 Internship - AmazeWow
- Amazon On-Campus - 6 months Internship (SDE)
- Amazon SDE-1 FTE/6 Months Internship Experience - AmazeWow 2021
- Nvidia Interview | Set 1
- Nvidia Interview | Set 2 (On Campus for R & D Team, Pune)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.