Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en NetApp (Vellore) en jul 2017
Entrevista
1st round was aptitude, technical related questions on algorithms, operating system, network systems and you need to clear all the sections with some minimum criteria.
Once you clear this you will have 3 TECHNICAL INTERVIEWS and 1 HR.
The selection process could be defined only a luck because it is based on the panels you are going to get interviewed if you even speak and discuss well they may reject you. It is all dependent on your interviewer point. It would be bit tiring process because you will not be given much time between the interviews.
Preguntas de entrevista [1]
Pregunta 1
Linked list concepts, operating system basics and write test cases on semaphores, starvations, file system operations and etc.. I pretty sure even the TR doesn't know how to write TC for those concepts.
Puzzles would be asked and all those would from geeks for geeks.
Envié una solicitud electrónica. El proceso duró 1 semana. Acudí a una entrevista en NetApp (Bengaluru) en abr 2026
Entrevista
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
Preguntas de entrevista [1]
Pregunta 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.
Preguntas de entrevista [1]
Pregunta 1
Leetcode problems was asked focusing on trees and arrays
