Nvidia Interview Questions — 100 DSA Problems

94 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Nvidia LeetCode questions for software engineering interviews.

• Last Stone Weight (EASY) — Array, Heap (Priority Queue)
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Minimum Operations to Reduce an Integer to 0 (MEDIUM) — Dynamic Programming, Greedy, Bit Manipulation
• Special Binary String (HARD) — String, Recursion
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Two Sum (EASY) — Array, Hash Table
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Add Two Numbers (MEDIUM) — Linked List, Math, Recursion
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Maximum Number of Visible Points (HARD) — Array, Math, Geometry, Sliding Window, Sorting
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Reverse Bits (EASY) — Divide and Conquer, Bit Manipulation
• Dot Product of Two Sparse Vectors (MEDIUM) — Array, Hash Table, Two Pointers, Design
• Valid Parentheses (EASY) — String, Stack
• Missing Number (EASY) — Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• Merge Intervals (MEDIUM) — Array, Sorting
• Move Zeroes (EASY) — Array, Two Pointers
• Task Scheduler II (MEDIUM) — Array, Hash Table, Simulation
• Fibonacci Number (EASY) — Math, Dynamic Programming, Recursion, Memoization
• Copy List with Random Pointer (MEDIUM) — Hash Table, Linked List
• Find Median from Data Stream (HARD) — Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream
• Rotate Image (MEDIUM) — Array, Math, Matrix
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Rectangle Area (MEDIUM) — Math, Geometry
• String to Integer (atoi) (MEDIUM) — String
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Find the Duplicate Number (MEDIUM) — Array, Two Pointers, Binary Search, Bit Manipulation
• Climbing Stairs (EASY) — Math, Dynamic Programming, Memoization
• Break a Palindrome (MEDIUM) — String, Greedy
• Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree
• Snapshot Array (MEDIUM) — Array, Hash Table, Binary Search, Design
• Delete Duplicate Folders in System (HARD) — Array, Hash Table, String, Trie, Hash Function
• Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
• Sliding Puzzle (HARD) — Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix
• H-Index (MEDIUM) — Array, Sorting, Counting Sort
• Single Element in a Sorted Array (MEDIUM) — Array, Binary Search
• Maximal Square (MEDIUM) — Array, Dynamic Programming, Matrix
• Reverse Linked List II (MEDIUM) — Linked List
• Validate Binary Search Tree (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Intersection of Two Linked Lists (EASY) — Hash Table, Linked List, Two Pointers
• Longest Common Prefix (EASY) — String, Trie
• Ways to Make a Fair Array (MEDIUM) — Array, Prefix Sum
• Find Peak Element (MEDIUM) — Array, Binary Search
• Implement Trie (Prefix Tree) (MEDIUM) — Hash Table, String, Design, Trie
• Double a Number Represented as a Linked List (MEDIUM) — Linked List, Math, Stack