--- date: '2026-07-16' description: deduplicated public NVIDIA coding interview reports id: reported-questions modified: 2026-07-16 13:15:50 GMT-04:00 tags: - cs title: reported NVIDIA coding questions created: '2026-07-16' published: '2026-07-16' pageLayout: default slug: hinterland/prep/nv/reported-questions permalink: https://aarnphm.xyz/hinterland/prep/nv/reported-questions.md generator: quartz: v4.6.0 hostedProvider: Cloudflare baseUrl: aarnphm.xyz full: https://aarnphm.xyz/llms-full.txt --- # reported questions No completed public report was found for JR2015076 itself as of July 16, 2026. This page records the closest inference, AI infrastructure, system software, compiler, and general software reports. The summaries are short on purpose. Open the source when you need the original context. Confidence measures the report, not the chance of getting the question. ## inference and AI systems roles | question or task | reported role | confidence | source | | --------------------------------------------------------------------------------------------------- | ------------------------------------------------- | ---------- | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | | Serialize and deserialize a binary tree, followed by CUDA optimization, vLLM, and serving questions | Deep Learning Software Engineer, Inference | high | [LeetCode report](https://leetcode.com/discuss/post/6809037/) | | Implement an LRU cache | Senior Software Engineer, Deep Learning Inference | high | [candidate follow-up](https://www.reddit.com/r/womenintech/comments/1nme839/how_to_prep_for_nvidia_senior_software_engineer/) | | Convert FP32 tensor values to INT8, then support asymmetric scale and zero point | Senior SDE, inference optimization | medium | [anonymous retelling](https://www.reddit.com/r/OfferEngineering/comments/1tsd80v/nvidia_senior_sde_interview_experience/) | | Transpose a 2D matrix in C++, then discuss row-major layout and locality | Senior SDE, inference optimization | medium | [anonymous retelling](https://www.reddit.com/r/OfferEngineering/comments/1tsd80v/nvidia_senior_sde_interview_experience/) | | Prune an operation tree to retain an optimal execution path | Senior SDE, inference optimization | medium | [anonymous retelling](https://www.reddit.com/r/OfferEngineering/comments/1tsd80v/nvidia_senior_sde_interview_experience/) | | Build a graph API and reject cycles or invalid dependency order | Senior SDE, inference optimization | medium | [anonymous retelling](https://www.reddit.com/r/OfferEngineering/comments/1tsd80v/nvidia_senior_sde_interview_experience/) | | Debug C++ logic, memory, and race bugs in a staged project | Senior SDE, inference optimization | medium | [anonymous retelling](https://www.reddit.com/r/OfferEngineering/comments/1tsd80v/nvidia_senior_sde_interview_experience/) | | Generate phonewords from phone digits | Senior Software Engineer, AI Infrastructure | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Interview-Questions-E7633.htm?filter.jobTitleExact=Senior+Software+Engineer%2C+AI+Infrastructure) | | Implement general non-maximum suppression | Senior Software Engineer, AI Infrastructure | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Interview-Questions-E7633.htm?filter.jobTitleExact=Senior+Software+Engineer%2C+AI+Infrastructure) | | Implement a discrete random-variable sampler equivalent to `scipy.stats.rv_discrete` | Applied Deep Learning Research Intern | medium | [Glassdoor report](https://www.glassdoor.com/Interview/deep-learning-software-engineer-interview-questions-SRCH_KO0%2C31.htm) | | Implement beam search and explain its complexity | LLM or AI software role | low | [secondary source](https://resumax.ai/interview-questions/nvidia) | ## recent general and compiler reports | question or task | reported role and date | confidence | source | | ----------------------------------------------------------------------------- | ---------------------------------------------------- | ---------- | ------------------------------------------------------------------------------------------------------------------------------------ | | Group anagrams with a hash map | Software Engineer, March 2026 | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Software-Engineer-Interview-Questions-EI_IE7633.0%2C6_KO7%2C24.htm) | | Kruskal’s minimum spanning tree, then optimize it | Software Compiler Verification Intern, November 2025 | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-ML-Software-Engineer-Interview-Questions-EI_IE7633.0%2C6_KO7%2C27.htm) | | Solve a sliding-window problem in C | Software Engineer Student, May 2026 | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Developer-Interview-Questions-EI_IE7633.0%2C6_KO7%2C16.htm) | | Sort an array in place with pointers and no extra storage | Software Engineer Student, May 2026 | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Developer-Interview-Questions-EI_IE7633.0%2C6_KO7%2C16.htm) | | Maximum product of three numbers | Software Engineer, May 2026 | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Developer-Interview-Questions-EI_IE7633.0%2C6_KO7%2C16.htm) | | Implement a producer-consumer ring buffer | Software Engineer, May 2026 | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Developer-Interview-Questions-EI_IE7633.0%2C6_KO7%2C16.htm) | | Find the point where the most intervals overlap | Compiler Intern, report updated July 2025 | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-compiler-intern-6-months/) | | Repair a C program that converts a binary tree to a spiral doubly linked list | Compiler Intern, report updated July 2025 | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-compiler-intern-6-months/) | | Print all permutations of a string | Compiler Engineer, September 2021 | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-compiler-engineer/) | | Merge-sort a linked list and analyze the cost | Compiler Engineer, September 2021 | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-compiler-engineer/) | | Implement a hash map and choose a hash function | Compiler Engineer, September 2021 | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-compiler-engineer/) | | Find the minimum value in a binary tree | Compiler Engineer, September 2021 | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-compiler-engineer/) | | Tokenize a sentence into a dynamically resized 2D C array | Compiler Engineer, September 2021 | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-compiler-engineer/) | | Maintain nine recent or ranked applications, clarified into LRU cache | Compiler Engineer, September 2021 | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-compiler-engineer/) | | Convert a tree to a sum tree in linear time | Compiler Engineer, September 2021 | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-compiler-engineer/) | ## software and system software reports | question or task | reported role | confidence | source | | ---------------------------------------------------------------------------- | ------------------------------- | ---------- | ----------------------------------------------------------------------------------------------------------------------------------------------------- | | Validate stack sequences | Software Engineer | high | [December 2021 report](https://leetcode.com/discuss/post/1632862/nvidia-software-engineer-10-dec-2021/) | | Search a matrix sorted by row and column | Software Engineer | high | [December 2021 report](https://leetcode.com/discuss/post/1632862/nvidia-software-engineer-10-dec-2021/) | | Detect a linked-list cycle | Software Engineer | high | [December 2021 report](https://leetcode.com/discuss/post/1632862/nvidia-software-engineer-10-dec-2021/) | | Print the top view of a binary tree | Software Engineer | high | [December 2021 report](https://leetcode.com/discuss/post/1632862/nvidia-software-engineer-10-dec-2021/) | | Write topological-sort pseudocode | Software Engineer | high | [December 2021 report](https://leetcode.com/discuss/post/1632862/nvidia-software-engineer-10-dec-2021/) | | Word Break II | Software Engineer | high | [December 2021 report](https://leetcode.com/discuss/post/1632862/nvidia-software-engineer-10-dec-2021/) | | Reverse bits in an inclusive bit-position range in constant time | System Software Engineer | high | [2023 report](https://leetcode.com/discuss/post/4032849/nvidia-interview-or-off-campus-or-2023/) | | Detect little-endian or big-endian host order | System Software Engineer | high | [2023 report](https://leetcode.com/discuss/post/4032849/nvidia-interview-or-off-campus-or-2023/) | | Reverse a linked list | System Software Engineer | high | [2023 report](https://leetcode.com/discuss/post/4032849/nvidia-interview-or-off-campus-or-2023/) | | Print `1` through `N` in order with `N` threads, then reduce synchronization | System Software Engineer | high | [2023 report](https://leetcode.com/discuss/post/4032849/nvidia-interview-or-off-campus-or-2023/) | | Min stack | System Software Engineer | high | [2023 report](https://leetcode.com/discuss/post/4032849/nvidia-interview-or-off-campus-or-2023/) | | Check whether a linked list is a palindrome | System Software Engineer | high | [2023 report](https://leetcode.com/discuss/post/4032849/nvidia-interview-or-off-campus-or-2023/) | | Iterative in-order traversal with a stack, then optimize it | System Software Engineer | high | [direct report](https://leetcode.com/discuss/post/4026331/nvidia-system-software-engineer-interview/) | | Implement 32-bit multiplication with only 16-bit multiplication | System Software Engineer | high | [direct report](https://leetcode.com/discuss/post/4026331/nvidia-system-software-engineer-interview/) | | Add two numbers represented as linked lists | Software Engineer | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-software-engineer/) | | Construct a tree and identify its root from parent-child pairs | Software Engineer | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-software-engineer/) | | Delete the kth node from the end of a linked list | System Software Engineer Intern | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-system-software-engineer-internshipon-campus/) | | Implement `memcpy` in C | System Software Engineer Intern | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-system-software-engineer-internshipon-campus/) | | Set, clear, or toggle a selected bit | System Software Engineer Intern | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-experience-for-system-software-engineer-internshipon-campus/) | | Maximize greatness of an array | System Software Engineer Intern | high | [2025 candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-system-software-engineer-intern-on-campus-drive-experience/) | | Find the maximum-frequency character, with follow-up variants | System Software Engineer Intern | high | [2025 candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-system-software-engineer-intern-on-campus-drive-experience/) | | Pair sum, starting quadratic and optimizing | Six-month intern | high | [candidate report](https://www.geeksforgeeks.org/interview-experiences/nvidia-interview-for-6-months-internship-on-campus/) | | Count palindromic substrings for each input string | Software Intern | high | [June 2021 report](https://leetcode.com/discuss/post/1299487/nvidia-software-intern-india/) | | Sort colors | Software Intern | high | [June 2021 report](https://leetcode.com/discuss/post/1299487/nvidia-software-intern-india/) | | Generate all possible full binary trees | Software Intern | high | [June 2021 report](https://leetcode.com/discuss/post/1299487/nvidia-software-intern-india/) | | Coordinate two persistent threads so one follows the other exactly `k` times | Software Intern | high | [June 2021 report](https://leetcode.com/discuss/post/1299487/nvidia-software-intern-india/) | | Parse health-check logs and report servers down for ten minutes | SDE-2 | high | [candidate report](https://medium.com/%40dadhichhardik26/nvidia-sde-2-interview-experience-offer-41d79116d478) | | Design `malloc` and `free` over a fixed buffer and return offsets | Senior System Software Engineer | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Interview-Questions-E7633.htm?filter.jobTitleExact=Senior+System-software+Engineer) | | Find an out-of-bounds access in a C or C++ loop | Senior System Software Engineer | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Interview-Questions-E7633.htm?filter.jobTitleExact=Senior+System-software+Engineer) | | Expose an allocated resource while preserving callee-controlled release | Senior System Software Engineer | medium | [Glassdoor report](https://www.glassdoor.com/Interview/NVIDIA-Interview-Questions-E7633.htm?filter.jobTitleExact=Senior+System-software+Engineer) | | Koko Eating Bananas variant | Senior Software Engineer | medium | [InterviewRecap report](https://www.interviewrecap.com/experiences/nvidia-senior-software-engineer-interview-experience-mev06g53-tq) | | Implement a cache and explain the data-structure tradeoffs | Senior Software Engineer | medium | [InterviewRecap report](https://www.interviewrecap.com/experiences/nvidia-senior-software-engineer-interview-experience-mev06g53-tq) | | Vertical-order traversal of a binary tree | Senior Software Engineer | medium | [InterviewRecap report](https://www.interviewrecap.com/experiences/nvidia-senior-software-engineer-interview-experience-mev06g53-tq) | ## evidence summary The recurring families are trees and graphs, arrays and matrices, caches and hash maps, linked lists, bits and memory, then concurrency. The inference-specific evidence is sparse and coherent: quantization, tensor transforms, execution graphs, beam search, cache policy, and performance-aware C++. Use [[hinterland/prep/nv/core|the core set]] for order. This page is an evidence ledger, not a command to solve every historical prompt.