Given an array and a target, find two indices that sum to the target — NVIDIA interview
Reported in NVIDIA USA engineering loops. Classic array + hash map problem testing optimal time–space trade-offs.
Interview atlas
Explore 28 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered NVIDIA ×
Reported in NVIDIA USA engineering loops. Classic array + hash map problem testing optimal time–space trade-offs.
Reported in NVIDIA USA engineering loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in NVIDIA USA engineering loops. Pointer manipulation staple for junior coding interviews.
Reported in NVIDIA USA engineering loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in NVIDIA USA engineering loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.
Reported in NVIDIA USA engineering loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in NVIDIA USA engineering loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in NVIDIA USA engineering loops. HR negotiation question requiring research and flexible framing.
Reported in NVIDIA USA engineering loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in NVIDIA USA engineering loops. Security and networking question covering encryption, certificates, and performance.
Reported in NVIDIA USA engineering loops. Recruiter or HR question about logistics, time zones, and loop structure.
Reported in NVIDIA interview loops. HR question testing judgment under pressure and planning discipline.
Reported in NVIDIA interview loops. Behavioral prompt for coachability and growth mindset.
Reported in NVIDIA interview loops. Language-level design trade-offs often asked in Java interviews.
Reported in NVIDIA interview loops. TypeScript interview topic focused on maintainable type composition.