Nvidia Coding & Algorithms Interview Questions
Master your tech interview with our curated database of real questions from top companies.
Find Top K Frequent Elements
Question LeetCode 347. Top K Frequent Elements – given an integer array nums, return the k most frequent elements. Initial requirement: return the top...
Optimize CUDA GEMM with tiling and coalescing
CUDA Execution Model, Memory Hierarchy, and GEMM Kernel Design Part 1: Concepts Explain: - CUDA execution model: grid, blocks, warps, threads (SIMT). ...
Design and secure a REST inference API
Design a REST API for Image Inference with Grad-CAM You are designing a public REST API for an image-inference service that accepts large images and r...
Reverse linked lists, including k-group
Singly Linked List Reversal — Variants and Edge Cases You are given a standard singly linked list with nodes of the form: - Node fields: value, next -...
Design and explain robust web APIs for ML inference
Design an HTTP API for Image-Based Model Predictions Context: Design an HTTP REST API that serves predictions for image inputs (e.g., classification, ...
Implement CUDA-tiled matrix multiplication and explain architecture
CUDA FP32 GEMM Design Task Implement a high-performance CUDA kernel for matrix multiplication C = A · B where: - A is m×k, B is k×n, C is m×n - Data t...
Reverse a singly linked list robustly
Reverse a Singly Linked List In-Place Context: You are given the head of a standard singly linked list (each node has value and next). Implement and e...
Explain a shader compiler pipeline
Describe the architecture of a shader compiler that ingests GLSL/HLSL and outputs SPIR-V or ISA. Cover lexical analysis, parsing to AST, conversion to...
Design an IR for test workflows
Design an intermediate representation (IR) for a graphics testing workflow as a DAG. Define node/edge types, metadata, and side-effect modeling. Expla...
Design algorithms for test scheduling
You have tens of thousands of graphics test cases with inter-test dependencies and hardware/driver constraints. Model this as a graph and design algor...
Implement core graph algorithms for graphics
Given a scene or dependency graph, implement topological sort, BFS/DFS, and shortest path (Dijkstra). Discuss time/space complexity, memory layouts (C...
Apply sliding window techniques
Explain the sliding window technique and apply it to solve: ( 1) Given an array of positive integers and a target S, return the minimal length of a co...
Construct tree from inorder & postorder
Question LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal – Given the inorder and postorder traversal arrays of a binary tree,...
Reconstruct tree from inorder and postorder
Given two arrays representing the inorder and postorder traversals of a binary tree with unique values, reconstruct the original binary tree and retur...
Solve unique triplets summing to target
Implement a function that, given an integer array nums and an integer target T, returns all unique triplets [x, y, z] from nums such that x + y + z = ...