---
date: '2026-07-16'
description: the role-weighted NVIDIA coding question shortlist
id: core
modified: 2026-07-16 13:15:50 GMT-04:00
tags:
  - cs
title: NVIDIA core coding set
created: '2026-07-16'
published: '2026-07-16'
pageLayout: default
slug: hinterland/prep/nv/core
permalink: https://aarnphm.xyz/hinterland/prep/nv/core.md
generator:
  quartz: v4.6.0
  hostedProvider: Cloudflare
  baseUrl: aarnphm.xyz
full: https://aarnphm.xyz/llms-full.txt
---
# core set

This is the shortest path through the evidence. Solve it before sampling the 136-question pool.

## tier 0: closest and repeated reports

Do these in C++17. The source pages are listed in [[hinterland/prep/nv/reported-questions|reported questions]].

- [ ] [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)
- [ ] [LRU Cache](https://leetcode.com/problems/lru-cache/)
- [ ] [Group Anagrams](https://leetcode.com/problems/group-anagrams/)
- [ ] [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/)
- [ ] [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)
- [ ] [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)
- [ ] [Course Schedule](https://leetcode.com/problems/course-schedule/)
- [ ] [Word Break II](https://leetcode.com/problems/word-break-ii/)
- [ ] [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)
- [ ] [Min Stack](https://leetcode.com/problems/min-stack/)
- [ ] [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)
- [ ] [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)
- [ ] [Sort Colors](https://leetcode.com/problems/sort-colors/)
- [ ] [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees/)
- [ ] [Maximize Greatness of an Array](https://leetcode.com/problems/maximize-greatness-of-an-array/)
- [ ] [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/)
- [ ] [Reverse Bits](https://leetcode.com/problems/reverse-bits/)
- [ ] [Two Sum](https://leetcode.com/problems/two-sum/)

## tier 1: inference systems shapes

These tagged problems map directly to caches, schedulers, execution graphs, streaming metrics, memory, and tensor layouts.

- [ ] [Design Memory Allocator](https://leetcode.com/problems/design-memory-allocator/)
- [ ] [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)
- [ ] [Fizz Buzz Multithreaded](https://leetcode.com/problems/fizz-buzz-multithreaded/)
- [ ] [Task Scheduler](https://leetcode.com/problems/task-scheduler/)
- [ ] [Task Scheduler II](https://leetcode.com/problems/task-scheduler-ii/)
- [ ] [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)
- [ ] [Clone Graph](https://leetcode.com/problems/clone-graph/)
- [ ] [Network Delay Time](https://leetcode.com/problems/network-delay-time/)
- [ ] [Longest Cycle in a Graph](https://leetcode.com/problems/longest-cycle-in-a-graph/)
- [ ] [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)
- [ ] [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)
- [ ] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)
- [ ] [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)
- [ ] [Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/)
- [ ] [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)
- [ ] [Rotate Image](https://leetcode.com/problems/rotate-image/)
- [ ] [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)
- [ ] [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)

## tier 2: general medium coverage

- [ ] [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)
- [ ] [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)
- [ ] [Number of Islands](https://leetcode.com/problems/number-of-islands/)
- [ ] [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)
- [ ] [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)
- [ ] [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)
- [ ] [Merge Intervals](https://leetcode.com/problems/merge-intervals/)
- [ ] [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/)
- [ ] [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)
- [ ] [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)
- [ ] [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/)
- [ ] [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/)
- [ ] [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/)
- [ ] [Decode String](https://leetcode.com/problems/decode-string/)
- [ ] [Find the Original Array of Prefix XOR](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/)
- [ ] [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)

## completion rule

For tier 0, require two clean C++ solves on different days. For tier 1, require one clean C++ solve and a role follow-up from [[hinterland/prep/nv/role-drills|role drills]]. For tier 2, one clean solve in either Python or C++ is enough unless the pattern remains weak in a mock.