Nvidia Interview Questions

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).

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.

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

Find the minimum number of operations to reduce a given positive integer to 0. You can either subtract a power of 2 or add a power of 2 in each operation.

A special binary string has equal numbers of 0s and 1s, and any prefix has at least as many 1s as 0s. You need to recursively make the lexicographically largest special string possible from a given special binary string.

You're given daily stock prices. Find the maximum profit you can make by buying and selling the stock once. You must buy before you sell.

Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.

You are given two linked lists, each representing a non-negative integer. Add the two numbers and return the sum as a linked list.

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

Find the contiguous subarray within a given array of numbers which has the largest sum. Return the sum of this subarray.

You're given a sorted array that has been rotated, and a target value. Find the index of the target value in the rotated array, or return -1 if it's not present.

Imagine you're standing at a fixed location looking at points on a 2D plane. Determine the maximum number of points you can see within a given field of view by rotating your position.

Given a grid representing land and water, count the number of distinct islands. An island is formed by connected land cells.

You're given an integer; reverse the order of its bits. Treat the integer as an unsigned 32-bit number.

Given an array of numbers, rearrange it to maximize the number of indices where array[i] < rearranged_array[i]. Essentially, you want to maximize how many numbers in the array can be replaced by a strictly larger number from within the same array.

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

You're given an array of numbers from 0 to n, with one number missing. Find the missing number within the array.

Calculate the dot product of two sparse vectors. You'll need to efficiently handle vectors with many zero values.

You're given a linked list where each node has a regular 'next' pointer and a 'random' pointer. Create a deep copy of this list, preserving both the next and random pointer relationships.

You are given k sorted lists. Combine all of their elements into a single sorted list and return it.