Ik heb via een werknemersdoorverwijzing gesolliciteerd. De procedure duurde 2 weken. Ik heb gesolliciteerd bij NetApp (Bengaluru) in aug 2010
Sollicitatiegesprek
Initial communication will be handled by HR and a telephonic round will be there. This will be done either by manager or some engineer in the team. There will be usual questions on resume and projects done. There will be questions on C, Unix, Storage or some team specific questions. Once its cleared HR will call for a F2F interview. There will be 3 to 4 rounds of technical and one managerial round.
Sollicitatievragen [1]
Vraag 1
Subject specific and team specific questions at a senior level.
Ik heb online gesolliciteerd. De procedure duurde 2 dagen. Ik heb gesolliciteerd bij NetApp in sep 2018
Sollicitatiegesprek
This was for a MTS-4 for a distributed computing product.
First was a phone round, after I cleared that, got an onsite interview.
Folks were on time, the interviewers were pretty young, less than my experience. Asked pretty usual questions, but I got a feeling that they were clueless how to judge me.
However, except for the lunch interview (the guy was just odd, with absolutely no clue about distributed computing knowledge), everything went well.
However, the HR was surprisingly lax about interview feedback.
Ik heb via een werknemersdoorverwijzing gesolliciteerd. De procedure duurde 2 weken. Ik heb gesolliciteerd bij NetApp (Bengaluru) in sep 2014
Sollicitatiegesprek
1 telephonic interview, got the result back on the same day.
On-site interview consisted of 3 technical rounds related to Operating System, Data structures and algorithms. The final interview was with the hiring manager which was a general discussion on past experience and some puzzles.
Overall the interview process was very smooth and the offer came within a week. People during interview process were cordial and helpful.
Sollicitatievragen [1]
Vraag 1
1. Design a dictionary where we have a list of words, and there will be multiple queries and you have to optimize the average query time.
2. Given an array, implement N stacks within the same array such that we optimize the overall space.