Envié una solicitud electrónica. El proceso duró 3 semanas. Acudí a una entrevista en NetApp (San Jose, CA) en jun 2021
Entrevista
4 Round of interview 1: Phone screen 2: Onsite with 4 rounds(2 technical, 1 System design and 1 manager which is also technical) The interview was on zoom and the people were nice. The questions were easy and all the rounds were 1 hour long. I felt a bit strange since no one actually opened their cameras while interviewing but overall everyone was nice.
Preguntas de entrevista [1]
Pregunta 1
1: Alien Dictionary problem. I coulent give an optimum solution but progressed to the next round 2: Square a sorted list(standard two pointer solution) 3: Design a multilevel parking system(API design, database, server space, writes and reads) 4: find longest leaf to leaf sum in a tree. 5: Creat Queues using stack and vice versa 6: Design hash map and questions around it
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
