Online coding test was conducted. 10 MCQ questions, and 2 coding problems in 75 min. Questions are of leetcode medium difficulty level. One question was, to find the first node inside a loop in singly linked list
2
Moeilijk sollicitatiegesprek
Sollicitatie
Ik heb gesolliciteerd bij NVIDIA
Sollicitatiegesprek
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.
Ik heb online gesolliciteerd. Ik heb gesolliciteerd bij NVIDIA (Haifa) in jun 2026
Sollicitatiegesprek
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.
Sollicitatievragen [1]
Vraag 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.
Ik heb online gesolliciteerd. Ik heb gesolliciteerd bij NVIDIA (Santa Clara, CA) in jun 2026
Sollicitatiegesprek
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.
Sollicitatievragen [1]
Vraag 1
What is the difference between a const pointer int vs a pointer const int?