Nvidia Software Engineer 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...
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...
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...
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...
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...
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 = ...