NVIDIA Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 838 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at NVIDIA.
NVIDIA
Tools Development Engineer
Senior Average Negative experience No offer 2 rounds
Interview process
Recruiter call Technical screen
Interview formats
Technical Coding
I applied online through their job portal. A few weeks later I got a call from a recruiter who set up a first round virtual interview. The interview was supposed to be one hour but it went on for almost two hours. The interviewer never checked if I was okay with going over the scheduled time, he just kept asking question after question. What really bothered me was he only got to the real coding questions almost 90 minutes into the interview, when my brain was already fried. The interviewer couldn’t figure out how to copy the coding questions into the whiteboarding tool we were using. On top of that, his internet connection was really bad, and I could barely understand what he was saying half the time. Overall, this was not the kind of experience I expected from a company like NVidia.
Confirmed questions1 question
- no questions listed
NVIDIA
Software Engineer
Mid Difficult Neutral experience No offer 2 rounds
Interview process
Take home Onsite
Interview formats
Coding Technical
I went through the interview process for a software engineering role. The first step was a take-home test on HackerRank that had three coding problems. The on-site interview day was really stressful. I ended up waiting almost three hours before I finally met the interviewer. During the interview, I introduced myself, but there weren’t any questions about my projects or past work. The interviewer gave a very disorganized verbal coding question about implementing a data structure that supports O(1) init, get, set, and reset operations, and it felt rushed because of the time constraints. The on-site interview day was quite stressful. I had to wait nearly three hours before meeting the interviewer. During the interview, I presented myself, but there were no questions about my projects or past work. The interviewer asked a very disorganized verbal coding question about implementing a data structure that supports O(1) init, get, set, and reset operations, and it felt rushed due to time pressure.
Confirmed questions2 questions
- determine if a given string is a palindrome
- Reordering a playlist under certain rules (arranging songs by artist frequency while making sure there are no consecutive songs from the same artist).
NVIDIA
Software Engineer
Intern Average Positive experience No offer 2 rounds About 2 days
Interview process
Technical screen Technical screen
Interview formats
Technical
I had two interview rounds with different interviewers. They mostly focused on the research projects I’ve done so far. I picked one of my projects, and they did a deep dive by asking detailed follow-up questions. They also talked about what they’re currently working on and asked me about my background in GPU architecture and software pipelining.
Confirmed questions2 questions
- Can you explain what software pipelining is?
- Can you describe what warp specialization is?
NVIDIA Software Engineer Interview Questions
Quoted word for word from NVIDIA interview reports.
“Find the number of valid subStrings in a given string, for example in "011001010" valid subStrings are 01,1100,10,01,10,01,10 where groups of zeros and ones are valid, but 1010 is invalid even though it has same occurrence of 0,1 since they are not grouped together.”
Read reports →“Find if string s is divisible by string t, otherwise return integer -1, for example: if string s = "abcdabcdabcdabcd" and string t = "abcdabcd" then t can divide s so return length of string u which divides t i.e., 4 which is length of u = "abcd"; if s = "abdabdabd" and t = "abdabd" return -1 since t doesn't divide s.”
Read reports →“Given head, which is the head of a linked list, check if the linked list contains a cycle. A cycle exists if some node can be reached again by continuously following next pointers. pos internally represents the index of the node that tail’s next points to, but is not passed in. Return true if the linked list has a cycle, otherwise return false.”
Read reports →“given n pairs of numbers and one extra number in an array (size 2n + 1) how can you figure out in O(n) with a single pass which number does not have a pair”
Read reports →“Given a 2D matrix, for every cell that has a "0", you need to set all the cells in the same row and column to zero.”
Read report →“there are 15 horses and 5 can race at once. how many races to find the fastest? and the 3 fastest?”
Read report →“implement bracket validation on a string, and how would you make it more optimal if you knew there was only one kind of parentheses in the string”
Read report →“Given a matrix that has numbers and some zeros, make an algorithm that sets zeros on all rows and columns where there is a zero at the beginning.”
Read report →“What is the difference between std::map and std::unordered_map, and what happens if many objects share the same hash value?”
Read report →Formats, difficulty and experience
Across all 838 NVIDIA interview reports.