I applied through a recruiter. I interviewed at NVIDIA in Apr 2024
Interview
I had a first technical interview where I was asked questions related to a digital systems course and C programming, and I was also asked a puzzle.
In the second interview, the content was similar, but I didn’t pass. Following that, the hiring manager wanted a more prestigious academic institution (he explicitly said this to me during the interview).
Interview questions [1]
Question 1
I was asked how to count how many bits with a logical ‘1’ are present in a 7-bit number, using only full adders (FA) and half adders (HA).
After that, I was asked how to sort four numbers given a component that can sort two numbers.
They asked about past experience, C++ leetcode, digital design, and computer architecture. It's pretty structural and flexible based on your ability. Different interviewers might have different question sets. Good luck!
Interview questions [1]
Question 1
Code swap function using C ++, and Fibonacci recursive function
I applied online. The process took 2 days. I interviewed at NVIDIA (Austin, TX) in Jan 2017
Interview
A series of phone screens (2) and an onsite interview based on the results of the phone screens. Typical process, HR was quick to respond with scheduling.
The first phone screen covered basic software concepts/questions with a few verification related questions, the interviewer was on time, introduced himself, what his role was within the company and overall seemed organized; asking meaningful, job related questions.
The second phone screen was the polar opposite. The interviewer was just under 10 minutes late, introduced himself, and asked "puzzle" type questions where the rules changed as we progressed. After asking the question, I could hear him typing in the background and at times respond "uh-huh..yeah"....even when I wasn't speaking. Very surprised given the reputation
Interview questions [1]
Question 1
Linked List traversal, Fibonacci algorithm (basic and recursive), the difference in complexity between the basic and recursive. Relatively straight forward.
Second phone screen: "A person on a stairway needs to get from the bottom of the stairs to the top in the minimum number of steps, no, how possible combinations of steps, no, I don't think I explained that well...what if they took could only take one step forward for every"...really? is this even a real question? somehow the answer was yet again a Fibonacci sequence question.
Next was reversing a singly linked list - oops, you can't use any references (!?), or another linked list..
Frustrating to have gotten the "B" team interviewer
