Nvidia Interview Guide

Showing 3 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Nvidia. The higher the ranking, the more likely you'll encounter it in a Nvidia interview.

Question

Frequency

Difficulty

Last Stone Weight

You're given a pile of stones with different weights. In each turn, you smash the two heaviest stones together, and the goal is to find the weight of the last remaining stone (or zero if no stone remains).

ArraysGreedy AlgorithmsDynamic Programming

Very likely

If you have a Nvidia interview, it's very likely that you will get this question

Easy

#1. Last Stone Weight

Easy

ArraysGreedy AlgorithmsDynamic Programming

This question is very likely to be asked in your Nvidia interview

LRU Cache

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked ListsDynamic Programming

Very likely

If you have a Nvidia interview, it's very likely that you will get this question

Medium

#2. LRU Cache

Medium

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked ListsDynamic Programming

This question is very likely to be asked in your Nvidia interview

Group Anagrams

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

ArraysStringsDynamic Programming

Very likely

If you have a Nvidia interview, it's very likely that you will get this question

Medium

#3. Group Anagrams

Medium

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

ArraysStringsDynamic Programming