Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso NetApp (Bengaluru) nel mese di lug 2015
Colloquio
It was a normal interview, as it began in a casual manner with the manager asking me to tell me about myself. I replied as briefly as possible. Then began the technical stuff. He asked a lot of questions. Here are some : What happens at the back side when you enter a URL, say www.google.com in your browser? Then he asked the difference between http and https?
A puzzle followed. Then a whole lot of questions on Data Structures... The interview went on for more than half an hour. Unfortunately i wasn't selected for the next round.
Domande di colloquio [1]
Domanda 1
What happens at the back side when you enter a URL, say www.google.com in your browser? the difference between http and https?
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.
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
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
