Interview Experience
LeetCode #23: Merge k Sorted Lists. Difficulty: Hard. Topics: Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort. Asked at Nvidia in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Divide And Conquer
Heap (Priority Queue)
Merge Sort
Heap
Linked List
Queue
Recursion
Sorting
More from NVIDIA
1p3a
Nvidia Senior Software Engineer Interview Report
Reddit
NVIDIA High-Performance LLM Training Engineer New Grad Interview
LeetCode
Nvidia | Siemens EDA | Avalara | [Rejected]
Reddit
Nvidia Interview Help
Reddit
What to expect in NVIDIA's 2-hour User Space Engineering Interview? Any tips or preparation advice?