I applied online. I interviewed at NVIDIA (Santa Clara, CA) in Mar 2014
Interview
Recruiter call followed by a technical phone interview
Asked question on basic c concepts and string questions
The team actually wanted a experienced candidate and the interviewer gave a positive review that they are going to get back in a day and schedule onsite but the recruiter said they did not need anyone now and and interview was scheduled
Multiple steps, intro, team meet. Two coding sessions. Hard coding interview. Leet code style. Nice people. Took long time to schedule next. Felt that I was appreciated. Remote, people different parts over world.
I applied online. I interviewed at NVIDIA (Haifa) in Jun 2026
Interview
Online assessment consisting of 3 data structures and algorithms questions. First question an easy array question. Second was a hard heap question and the third was a medium 2D dynamic programming question.
Interview questions [1]
Question 1
DP problem: You are given several service options. For each option i, bandwidth[i] is the amount of bandwidth required, and request[i] is the number of requests that can be handled using that bandwidth.
Given a maximum bandwidth limit totalBandwidth, choose a subset of the options so that the total bandwidth used does not exceed totalBandwidth, while the total number of handled requests is as large as possible.
Return the maximum number of requests that can be handled.
I applied online. I interviewed at NVIDIA (Santa Clara, CA) in Jun 2026
Interview
I only made it to the screening round, which involves two technical rounds, I was interviewed by a director and a senior engineer. I could not answer the questions, but the interviewers were very professional and patient throughout the whole process.
Interview questions [1]
Question 1
What is the difference between a const pointer int vs a pointer const int?
