J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez NetApp (Pittsburgh, PA) en oct. 2012
Entretien
This is an onsite which drives us to their location at Pittsburgh. First is an introduction of their company and there's some pizza and drinks available. The interview consists of four rounds---first two of which are behavioral questions and the other two are real coding ones. Behavioral questions goes in an endless detail. The interviewers ask a lot of detail implementation of the projects you lists on the resume. And they also ask if you have any questions regarding NetApp.
Interview Questions: given an array and you are only allowed to go through them once. Then remove the array from the end one by one, find each of the minimum value among the numbers left in the array.
Exactly the same question on Crack.
Questions d'entretien [1]
Question 1
Such a lot of detail implementation regarding my projects
J'ai postulé en ligne. Le processus a pris 1 semaine. J'ai passé un entretien chez NetApp (Bengaluru) en avr. 2026
Entretien
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.
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
Questions d'entretien [1]
Question 1
The OA questions were easy
The first question was on array
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.
Questions d'entretien [1]
Question 1
Leetcode problems was asked focusing on trees and arrays
