Nvidia
Systems-flavored loops where memory hierarchy, parallelism, and performance questions show up next to standard algorithms, tuned to the team.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Onsite: coding plus architecture and performance rounds
- 4Team-specific domain round
- 5Hiring-manager conversation
Questions
Callback's practice questions and the LeetCode questions Nvidia has been asking, filtered together.
Asked on LeetCode
136 questions · all time
- H-IndexmediumArraySortingCounting Sortfrequency 37.0
- Largest NumbermediumArrayStringGreedySortingfrequency 37.0
- Letter Combinations of a Phone NumbermediumHash TableStringBacktrackingfrequency 37.0
- Linked List Random NodemediumLinked ListMathReservoir SamplingRandomizedfrequency 37.0
- Longest Common PrefixeasyArrayStringTriefrequency 37.0
- Longest Cycle in a GraphhardDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+2frequency 37.0
- Longest Palindromic SubstringmediumTwo PointersStringDynamic ProgrammingManacherfrequency 37.0
- Max Points on a LinehardArrayHash TableMathGeometry+2frequency 37.0
- Maximum Product SubarraymediumArrayDynamic Programmingfrequency 37.0
- Maximum Product of Three NumberseasyArrayMathSortingfrequency 37.0
- Median of Two Sorted ArrayshardArrayBinary SearchDivide and Conquerfrequency 37.0
- Merge In Between Linked ListsmediumLinked Listfrequency 37.0
- Merge Two Sorted ListseasyLinked ListRecursionfrequency 37.0
- Middle of the Linked ListeasyLinked ListTwo Pointersfrequency 37.0
- Minimum Knight MovesmediumBreadth-First SearchHeuristic SearchBidirectional SearchA* Searchfrequency 37.0
- Minimum Size Subarray SummediumArrayBinary SearchSliding WindowPrefix Sumfrequency 37.0
- Network Delay TimemediumDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)+2frequency 37.0
- Next Greater Element IImediumArrayStackMonotonic Stackfrequency 37.0
- Number of 1 BitseasyDivide and ConquerBit Manipulationfrequency 37.0
- Number of Lines To Write StringeasyArrayStringfrequency 37.0
- Number of Visible People in a QueuehardArrayStackMonotonic Stackfrequency 37.0
- Number of Ways to Split ArraymediumArrayPrefix Sumfrequency 37.0
- Pow(x, n)mediumMathRecursionfrequency 37.0
- Previous Permutation With One SwapmediumArrayGreedyfrequency 37.0
- Random Pick IndexmediumHash TableMathReservoir SamplingRandomizedfrequency 37.0
- Remove Duplicates from Sorted ListeasyLinked Listfrequency 37.0
- Remove Duplicates from Sorted List IImediumLinked ListTwo Pointersfrequency 37.0
- Reverse StringeasyTwo PointersStringfrequency 37.0
- Serialize and Deserialize N-ary TreehardStringTreeDepth-First SearchBreadth-First Searchfrequency 37.0
- Simplify PathmediumStringStackfrequency 37.0
- Sqrt(x)easyMathBinary SearchNewton's Methodfrequency 37.0
- Task SchedulermediumArrayHash TableGreedySorting+2frequency 37.0
- The MazemediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 37.0
- Third Maximum NumbereasyArraySortingfrequency 37.0
- Top K Frequent WordsmediumArrayHash TableStringTrie+4frequency 37.0
- Word PatterneasyHash TableStringfrequency 37.0