Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso NetApp (Wichita, KS) nel mese di mar 2015
Colloquio
I talked to NetApp briefly at my college's career fair and this led to a couple phone interviews. The first was a standard HR call, the second and third were light technical interviews Basically talked about C/C++, OOP, and my own development history. The questions were fairly easy, just needed enough information to cover the basics. For the technical interviews were with two of the engineers I would be working with and were basically just gauging by skill level and interest in the project.
Domande di colloquio [1]
Domanda 1
What are the basic considerations and potentials pitfalls in designing multi-threaded applications?
Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso NetApp (Bengaluru) nel mese di apr 2026
Colloquio
First round was general discussion on kubernetes, current job work, asked a fan in scenario in go. DSA was asked only to explain the approach, about 2 linked list chained to a common list get intersection node without using hash
Second round was supposed to be design, but was asked managerial and behavioral type questions.
Post that over a weeks, no reply. Then update in portal.
The interview process included screening, a technical manager round, and two technical interviews. Questions focused on matrix rotation and trees. Overall performance was average, with challenges in problem-solving and optimization.
Domande di colloquio [1]
Domanda 1
Leetcode problems was asked focusing on trees and arrays
First round is the online assessment where there will be 3 coding questions and mcqs
mcqs on core cs concepts and then the interview rounds vary based on you performance
As when it came to our campus they didn't mention the role. The provided jd mentioned there are mutliple roles
And so the rounds based on your fit to different roles
Domande di colloquio [1]
Domanda 1
The OA questions were easy
The first question was on array
