2-hour interview, 2 interviewers.
Both were very polite and friendly.
Two mathematical group theory questions and a short recursion problem.
Suppose there are 1000 bits and 1000 workers that can switch the bulbs.
The first worker turns on all the bits.
The second worker switches every bulb divisible by two.
The third worker switches every bulb divisible by three.
And so on...
What bulbs are left on after 1000 workers have done this?
The following metrics were computed from 1 interview experience for the Nvidia Junior Verification Engineer role in Tel Aviv-Yafo, Israel.
Nvidia's interview process for their Junior Verification Engineer roles in Tel Aviv-Yafo, Israel is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Nvidia's Junior Verification Engineer interview process in Tel Aviv-Yafo, Israel.