Nvidia coding interview

Round 3 of 7 · 16 questions reported

See the whole loop
Format
Live coding, often C++-leaning; each round usually opens with 10 to 15 minutes on your past work
They grade
Clarity, edge cases and systems detail more than algorithm tricks
AI use
Assume no AI unless the interviewer offers it
Heads-up
Reported tasks include a matrix transpose, finding bugs in C code, log parsing and duplicate detection in constant memory.

Questions Nvidia asks in this round 16

  • Streaming top-K frequent elements with O(1) updatesCodingElements arrive one at a time from an unbounded stream. Design a structure that can report, at any moment, the K elements seen most often so far. Clarify what K is and whether it…
    Last asked Sep 2026
  • Thread-safe reference-counted smart pointer in C++CodingImplement a reference-counted smart pointer class template in C++ from scratch, in the spirit of std::sharedptr. Several owners can share one object; it is destroyed exactly once…
    Last asked Sep 2026
  • Transpose a matrix and reason about memory layoutCodingTranspose a square or rectangular matrix, in place where possible. Then discuss row-major versus column-major storage, cache behaviour, and how to make the transpose fast for very…
    Last asked Apr 2026
  • 3SumCodingReturn every unique triple of values in an integer array that adds up to zero, with no duplicate triples in the answer. Aim for O(n^2) time after sorting.
    Last asked Oct 2025
  • Collect host metrics and post them to a serverCodingOn a Linux VM, gather CPU, memory and disk usage, send them as JSON in an HTTP POST to a given endpoint, and then flag any metric above a threshold.
    Last asked Oct 2026
  • Hardware design verification fundamentalsCodingDiscuss and sketch verification for common hardware blocks: a FIFO, a round-robin arbiter and a valid/ready handshake. Cover scoreboards and reference models, constrained random…
    Last asked Sep 2026
  • Merge sorted arrays, then sort files too large for memoryCoding1. Merge two sorted arrays of integers into one sorted array. 2. The two inputs are now huge files that don't fit in memory. Merge them with bounded memory and buffered reads and…
    Last asked Sep 2026
  • Can repeated pair additions reach a target pointCodingFrom a starting point (x, y) you may move to (x + y, y) or (x, x + y). Decide whether a target point is reachable, efficiently even for very large coordinates.
    Last asked Jul 2026
  • Build, validate and prune a computation graphCodingImplement a small graph of neural-network operations: add nodes and dependencies, check structural rules, detect cycles, and remove branches that do not contribute to the required…
    Last asked Feb 2026
  • Short systems utility tasks: spikes, logs and bracketsCodingSolve a few short utility problems: detect a sudden temperature spike in timestamped CPU readings, check that brackets in an expression balance, and aggregate log lines by status…
    Last asked Feb 2026
  • Optimize a small-string class in C++CodingBuild a high-performance C++ string class for a workload with very many strings, supporting operations such as compare, concatenate and substring. Short strings live in a…
    Last asked Dec 2025