Nvidia LeetCode interview questions

Explore Nvidia questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

131

Solved

0 / 131

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Special Binary String String Divide and Conquer Sorting HARD	Hard	100.0%	0.8%
LRU Cache Hash Table Linked List Design +1 MEDIUM	Medium	93.3%	0.5%
Best Time to Buy and Sell Stock Array Dynamic Programming EASY	Easy	86.9%	0.6%
Two Sum Array Hash Table EASY	Easy	85.4%	0.6%
Longest Substring Without Repeating Characters Hash Table String Sliding Window MEDIUM	Medium	85.4%	0.4%
Merge k Sorted Lists Linked List Divide and Conquer Heap (Priority Queue) +2 HARD	Hard	82.1%	0.6%
Group Anagrams Array Hash Table String +1 MEDIUM	Medium	82.1%	0.7%
Valid Parentheses String Stack Bracket Sequences EASY	Easy	78.1%	0.5%
Restore IP Addresses String Backtracking MEDIUM	Medium	78.1%	0.6%
Last Stone Weight Array Heap (Priority Queue) EASY	Easy	75.9%	0.7%
Maximize Greatness of an Array Array Two Pointers Greedy +1 MEDIUM	Medium	75.9%	0.6%
Search in Rotated Sorted Array Array Binary Search MEDIUM	Medium	73.5%	0.5%
Maximum Subarray Array Divide and Conquer Dynamic Programming MEDIUM	Medium	73.5%	0.5%
Number of Islands Array Depth-First Search Breadth-First Search +2 MEDIUM	Medium	73.5%	0.7%
Minimum Operations to Reduce an Integer to 0 Dynamic Programming Greedy Bit Manipulation MEDIUM	Medium	73.5%	0.6%
Fizz Buzz Math String Simulation EASY	Easy	73.5%	0.8%
Trapping Rain Water Array Two Pointers Dynamic Programming +2 HARD	Hard	70.7%	0.7%
Maximum Number of Visible Points Array Math Geometry +2 HARD	Hard	70.7%	0.4%
Container With Most Water Array Two Pointers Greedy MEDIUM	Medium	70.7%	0.6%
Reverse Bits Divide and Conquer Bit Manipulation EASY	Easy	67.6%	0.7%

Showing 1–20 of 131 matching problems · All Problems

Nvidia LeetCode Interview Questions | Grind Practice