Envié una solicitud electrónica. Acudí a una entrevista en NVIDIA (Haifa) en jun 2026
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.
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.
Envié una solicitud electrónica. Acudí a una entrevista en NVIDIA (Santa Clara, CA) en jun 2026
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 1
What is the difference between a const pointer int vs a pointer const int?
A non technical phone interview with hiring manager
One onsite technical interview with hiring manager which included 2 technical questions.
One online technical interview took 2 hours with hiring team lead which included 3 technical questions
Preguntas de entrevista [1]
Pregunta 1
One logical question and one leetcode style quesiton
