133 curated coding interview questions directly asked in Nvidia technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | 3m |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 100.0% | 6m |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 87.5% | 3m |
| 234 | Palindrome Linked List | Easy | Strings; Linked List | Hashing / Sliding Window; Two Pointers | 58.0% | 87.5% | 3m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 87.5% | 6m |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 87.5% | 6m |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 87.5% | 6m |
| 761 | Special Binary String | Hard | Strings | Hashing / Sliding Window | 79.3% | 75.0% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | 6m |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 75.0% | 6m |
| 287 | Find the Duplicate Number | Medium | Arrays | Sorting / Prefix / Scan | 64.3% | 75.0% | 6m |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 75.0% | 6m |
| 1200 | Minimum Absolute Difference | Easy | Arrays | Sorting / Prefix / Scan | 75.1% | 75.0% | 6m |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 75.0% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 75.0% | all |
| 1046 | Last Stone Weight | Easy | Core DSA | Implementation / Reasoning | 66.5% | 75.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 75.0% | all |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium | Arrays | Sorting / Prefix / Scan | 62.4% | 75.0% | all |
| 1610 | Maximum Number of Visible Points | Hard | Arrays | Sorting / Prefix / Scan | 38.2% | 75.0% | all |
| 2592 | Maximize Greatness of an Array | Medium | Arrays | Sorting / Prefix / Scan | 61.7% | 75.0% | all |
| 412 | Fizz Buzz | Easy | Core DSA | Implementation / Reasoning | 75.5% | 62.5% | 6m |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | 6m |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 62.5% | 6m |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | 6m |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 62.5% | 6m |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 62.5% | 6m |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 62.5% | 6m |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | 6m |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 62.5% | 6m |
| 204 | Count Primes | Medium | Core DSA | Implementation / Reasoning | 36.1% | 62.5% | 6m |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | 6m |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 62.5% | 6m |
| 2502 | Design Memory Allocator | Medium | Design | Data Structure Design | 50.1% | 62.5% | 6m |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 62.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 190 | Reverse Bits | Easy | Core DSA | Implementation / Reasoning | 68.4% | 62.5% | all |
| 268 | Missing Number | Easy | Arrays | Sorting / Prefix / Scan | 72.0% | 62.5% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 62.5% | all |
| 1570 | Dot Product of Two Sparse Vectors | Medium | Arrays | Sorting / Prefix / Scan | 89.9% | 62.5% | all |
| 509 | Fibonacci Number | Easy | Core DSA | Implementation / Reasoning | 74.1% | 62.5% | all |
| 2365 | Task Scheduler II | Medium | Greedy | Greedy | 54.8% | 62.5% | all |
| 8 | String to Integer (atoi) | Medium | Strings | Hashing / Sliding Window | 21.0% | 62.5% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 62.5% | all |
| 151 | Reverse Words in a String | Medium | Strings | Hashing / Sliding Window | 56.4% | 62.5% | all |
| 63 | Unique Paths II | Medium | Core DSA | Implementation / Reasoning | 44.5% | 62.5% | all |
| 18 | 4Sum | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 62.5% | all |
| 2342 | Max Sum of a Pair With Equal Sum of Digits | Medium | Arrays | Sorting / Prefix / Scan | 65.9% | 62.5% | all |
| 61 | Rotate List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 42.6% | 62.5% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 62.5% | all |
| 2433 | Find The Original Array of Prefix Xor | Medium | Arrays | Sorting / Prefix / Scan | 88.4% | 62.5% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 50.0% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 50.0% | all |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 50.0% | all |
| 92 | Reverse Linked List II | Medium | Linked List | Two Pointers | 51.5% | 50.0% | all |
| 138 | Copy List with Random Pointer | Medium | Linked List | Two Pointers | 62.9% | 50.0% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 50.0% | all |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 50.0% | all |
| 1328 | Break a Palindrome | Medium | Strings | Hashing / Sliding Window | 51.6% | 50.0% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 50.0% | all |
| 338 | Counting Bits | Easy | Core DSA | Implementation / Reasoning | 80.6% | 50.0% | all |
| 382 | Linked List Random Node | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 64.8% | 50.0% | all |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | Arrays | Sorting / Prefix / Scan | 43.0% | 50.0% | all |
| 223 | Rectangle Area | Medium | Core DSA | Implementation / Reasoning | 49.6% | 50.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 50.0% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 50.0% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 50.0% | all |
| 83 | Remove Duplicates from Sorted List | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 56.7% | 50.0% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 50.0% | all |
| 2539 | Count the Number of Good Subsequences | Medium | Core DSA | Implementation / Reasoning | 48.6% | 50.0% | all |
| 1962 | Remove Stones to Minimize the Total | Medium | Core DSA | Implementation / Reasoning | 65.7% | 50.0% | all |
| 64 | Minimum Path Sum | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 68.2% | 50.0% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 50.0% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 50.0% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 50.0% | all |
| 231 | Power of Two | Easy | Core DSA | Implementation / Reasoning | 50.1% | 50.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 50.0% | all |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 50.0% | all |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 50.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 50.0% | all |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | Arrays | Sorting / Prefix / Scan | 39.0% | 50.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 50.0% | all |
| 277 | Find the Celebrity | Medium | Core DSA | Implementation / Reasoning | 49.0% | 50.0% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 50.0% | all |
| 1197 | Minimum Knight Moves | Medium | Arrays | Sorting / Prefix / Scan | 42.0% | 37.5% | all |
| 149 | Max Points on a Line | Hard | Core DSA | Implementation / Reasoning | 30.7% | 37.5% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 37.5% | all |
| 237 | Delete Node in a Linked List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 83.9% | 37.5% | all |
| 274 | H-Index | Medium | Core DSA | Implementation / Reasoning | 41.4% | 37.5% | all |
| 349 | Intersection of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 77.8% | 37.5% | all |
| 773 | Sliding Puzzle | Hard | Core DSA | Implementation / Reasoning | 74.4% | 37.5% | all |
| 894 | All Possible Full Binary Trees | Medium | Trees | DFS / BFS | 82.8% | 37.5% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 37.5% | all |
| 209 | Minimum Size Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 37.5% | all |
| 1948 | Delete Duplicate Folders in System | Hard | Arrays | Sorting / Prefix / Scan | 77.4% | 37.5% | all |
| 344 | Reverse String | Easy | Strings | Hashing / Sliding Window | 80.8% | 37.5% | all |
| 191 | Number of 1 Bits | Easy | Core DSA | Implementation / Reasoning | 76.8% | 37.5% | all |
| 1669 | Merge In Between Linked Lists | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 83.0% | 37.5% | all |
| 490 | The Maze | Medium | Core DSA | Implementation / Reasoning | 60.4% | 37.5% | all |
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 37.5% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 37.5% | all |
| 82 | Remove Duplicates from Sorted List II | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 51.8% | 37.5% | all |
| 179 | Largest Number | Medium | Core DSA | Implementation / Reasoning | 43.1% | 37.5% | all |
| 133 | Clone Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.3% | 37.5% | all |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 37.5% | all |
| 876 | Middle of the Linked List | Easy | Linked List | Two Pointers | 81.8% | 37.5% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 37.5% | all |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 37.5% | all |
| 143 | Reorder List | Medium | Linked List | Two Pointers | 65.3% | 37.5% | all |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 37.5% | all |
| 2270 | Number of Ways to Split Array | Medium | Arrays | Sorting / Prefix / Scan | 55.9% | 37.5% | all |
| 50 | Pow(x, n) | Medium | Core DSA | Implementation / Reasoning | 38.7% | 37.5% | all |
| 1535 | Find the Winner of an Array Game | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 37.5% | all |
| 628 | Maximum Product of Three Numbers | Easy | Arrays | Sorting / Prefix / Scan | 45.9% | 37.5% | all |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 37.5% | all |
| 62 | Unique Paths | Medium | Core DSA | Implementation / Reasoning | 66.8% | 37.5% | all |
| 71 | Simplify Path | Medium | Core DSA | Implementation / Reasoning | 50.6% | 37.5% | all |
| 290 | Word Pattern | Easy | Strings | Hashing / Sliding Window | 44.1% | 37.5% | all |
| 218 | The Skyline Problem | Hard | Core DSA | Implementation / Reasoning | 45.4% | 37.5% | all |
| 658 | Find K Closest Elements | Medium | Core DSA | Implementation / Reasoning | 49.7% | 37.5% | all |
| 414 | Third Maximum Number | Easy | Arrays | Sorting / Prefix / Scan | 39.4% | 37.5% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 37.5% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 37.5% | all |
| 806 | Number of Lines To Write String | Easy | Strings | Hashing / Sliding Window | 72.6% | 37.5% | all |
| 384 | Shuffle an Array | Medium | Arrays | Sorting / Prefix / Scan | 59.7% | 37.5% | all |
| 503 | Next Greater Element II | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.4% | 37.5% | all |
| 543 | Diameter of Binary Tree | Easy | Trees | DFS / BFS | 65.5% | 37.5% | all |
| 165 | Compare Version Numbers | Medium | Core DSA | Implementation / Reasoning | 46.4% | 37.5% | all |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 37.5% | all |
| 1944 | Number of Visible People in a Queue | Hard | Stack / Queue | Monotonic Stack / Simulation | 73.1% | 37.5% | all |
| 863 | All Nodes Distance K in Binary Tree | Medium | Trees | DFS / BFS | 67.7% | 37.5% | all |
| 445 | Add Two Numbers II | Medium | Core DSA | Implementation / Reasoning | 62.6% | 37.5% | all |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 37.5% | all |