I applied through an employee referral. The process took 1 week. I interviewed at NVIDIA (Yoqne`am `Illit) in Jul 2025
Interview
I interviewed at Nvidia at Yokneam, Israel.
The interview itself was fairly difficult and contained non-standard or trivial questions, including one that seemed more like a riddle than anything else. The interviewers themselves were either disinterested or highly critical. One was quiet almost the entire time, and the other was very judgmental and dismissive and wanted to control the pace of things. When a question was answered correctly, he would not openly acknowledge it and move on instead, and he was not above throwing fairly snide and unkind remarks and constant critisims over minutiae that were not really related to anything that were not really related to the content of what I was doing (e.g. He went on a random tangent about compilers for no apparent reason) and was prone to prolonged silences. Midway through the interview I was stumbling through implementation details despite having done everything correctly purely because I was recieving no positive feedback at any point and in fact did not know that my solution was optimal or even on the right track until after I finished things there and checked stuff on my way back home.
I felt that not only was the interview itself not easy, but the interviewers made it harder than it needed to be. By the time I left the interview, I felt crushed and my confidence was shaken, which is not something that happened to me before.
Interview questions [2]
Question 1
Implement in C some kind of routine that works such that you can, via a function, provide it with a time T and a void* callback, such that in T time from now, the callback will be automatically called. Specifically, optimize the solution to the first 256 units of time since most schedueling will be done for them. To somewhat rephrase things, the system simulates several timers at once using its single internal clock, optimized around a specific time (i.e. the worst case can still be O(log(n)) but the most common/average case of times between 0 and 256 need to be O(1)
The second question was more like a riddle,
You have 1000 wine bottles. Exactly one bottle is poisoned.
A rat that drinks the poisoned wine will die within 1 hour.
(Assume rats can each sip any number of samples once at the start.)
Determine the minimum number of rats needed to identify which single bottle is poisoned in 1 hour.
I applied through an employee referral. The process took 7 weeks. I interviewed at NVIDIA in Apr 2026
Interview
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....
I applied online. I interviewed at NVIDIA (Yoqne`am `Illit) in Dec 2025
Interview
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
Interview questions [1]
Question 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