Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso NVIDIA (Israel) nel mese di nov 2025
Colloquio
It is a 3 round interview process, first 2 technical, and a last with hr. Every technical had 2 technicsl questions other than personal ones. I first met with the team leader and another one from the team, and in the second interview i met the head of firmware development as well as the head of firmware in the yokneam site.
Domande di colloquio [1]
Domanda 1
Return true if a given x is in the array, but you must only do an order of n (not 2n) comparisons due to some constraints.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 7 settimane. Ho sostenuto un colloquio presso NVIDIA nel mese di apr 2026
Colloquio
2 indoor interviews with team-lead and group-lead, went good overall, basic questions such as bit operations, mid level leet code, every interview ended in a positive mood, seemed the interviewers were pleased overall. I received a rejection by mail with no explanation or reason, after a week and a half. The overall process time was a month and a half since applying.
I guess Nvidia doesn't have the time or resources to explain what went wrong....
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso NVIDIA (Yoqne`am `Illit) nel mese di dic 2025
Colloquio
1st technical interview, junior position, they were two interviewers: the team lead and a senior.
I introduced myself and a project i did in university, they explained about the role and started asking questions.
first interview- tell me about yourself and projects during your education...,two technical questions, 1. given an array nums and int x, how can you check if x is in nums, after writing the code: how many comparisons does the code have and how can you minimize the number of comparisons in the code, 2. threads problem that requires writing a code with mutexes and locks
Domande di colloquio [1]
Domanda 1
1. given an array nums and int x, how can you check if x is in nums, after writing the code: how many comparisons does the code have and how can you minimize the number of comparisons in the code, 2. threads problem that requires writing a code with mutexes and locks
