NVIDIA coding interviews evaluate a candidate's problem-solving ability, Data Structures & Algorithms (DSA), and coding skills through questions ranging from easy to hard difficulty levels. Practicing these frequently asked coding problems helps build confidence and prepares you for technical interview rounds.
- Covers the most frequently asked NVIDIA coding interview questions categorized into Easy, Medium, and Hard levels.
- Focuses on essential DSA topics such as Arrays, Strings, Trees, Graphs, Dynamic Programming, Sliding Window, and Binary Search commonly tested in NVIDIA interviews.
Arrays
- Two Sum
- 3Sum
- Maximum Subarray
- Best Time to Buy and Sell Stock
- Move Zeroes
- Missing Number
- Single Number
- Product of Array Except Self
- Kth Largest Element in an Array
- Find Duplicate Number
- Intersection of Two Arrays
- Maximum Product Subarray
- Container With Most Water
- Merge Intervals
- Find Peak Element
- Search in Rotated Sorted Array
- Minimum Size Subarray Sum
- Subarray Sum Equals K
- Maximum Sum of Distinct Subarrays of Length K
Strings
- Longest Substring Without Repeating Characters
- Group Anagrams
- Longest Common Prefix
- String to Integer (atoi)
- Reverse String
- Reverse Words in a String
- Valid Anagram
- First Unique Character in a String
- String Compression
- Longest Palindromic Substring
- Shortest Palindrome
- Largest Number
- Sort Characters by Frequency
Linked List
- Add Two Numbers
- Reverse Linked List
- Reverse Linked List II
- Merge Two Sorted Lists
- Remove Duplicates from Sorted List
- Remove Duplicates from Sorted List II
- Linked List Cycle
- Middle of the Linked List
- Copy List with Random Pointer
- Delete Node in a Linked List
- Rotate List
- Reorder List
- Palindrome Linked List
Stack & Queue
- Valid Parentheses
- Min Stack
- Daily Temperatures
- Next Greater Element II
- Sliding Window Maximum
- Largest Rectangle in Histogram
- Implement LRU Cache
- Find the Celebrity
- Number of Visible People in a Queue
Trees & BST
- Invert Binary Tree
- Symmetric Tree
- Diameter of Binary Tree
- Balanced Binary Tree
- Binary Tree Right Side View
- Binary Tree Level Order Traversal
- Sum Root to Leaf Numbers
- Lowest Common Ancestor of a BST
- Serialize and Deserialize Binary Tree
- Construct Binary Tree from Preorder and Inorder Traversal
- All Possible Full Binary Trees
- All Nodes Distance K in Binary Tree
- Validate Binary Search Tree
Graphs
- Clone Graph
- Number of Islands
- Course Schedule
- Course Schedule II
- Rotting Oranges
- Word Ladder
- Minimum Knight Moves
- The Maze
- Walls and Gates
Heap & Priority Queue
- Last Stone Weight
- Kth Largest Element in an Array
- Top K Frequent Elements
- Find Median from Data Stream
- Remove Stones to Minimize the Total
- Find Median in a Stream
- Sliding Window Maximum
- Maximum Number of Events That Can Be Attended
- K Closest Elements
Dynamic Programming
- Climbing Stairs
- House Robber
- Longest Increasing Subsequence
- Maximum Product Subarray
- Minimum Path Sum
- Unique Paths
- Unique Paths II
- Partition Equal Subset Sum
- Trapping Rain Water
- Best Time to Buy and Sell Stock III
- Regular Expression Matching
- Wildcard Matching
Binary Search
- Binary Search
- Search in Rotated Sorted Array
- Find Peak Element
- Median of Two Sorted Arrays
- Find K Closest Elements
- Sqrt(x)
- Find Minimum in Rotated Sorted Array
Matrix
- Rotate Image
- Spiral Matrix
- Set Matrix Zeroes
- Number of Islands
- Maximal Square
- Maximal Rectangle
- Minimum Path Sum
- Word Search
Greedy
- Jump Game
- Task Scheduler
- Gas Station
- Remove Stones to Minimize the Total
- Container With Most Water
- Merge Intervals
- Maximum Number of Visible Points
Bit Manipulation
- Reverse Bits
- Number of 1 Bits
- Single Number
- Minimum Operations to Reduce an Integer to 0
- Find Original Array from Prefix XOR
- Maximum OR
- Sum of Bit Differences
