Interview Experience
LeetCode #23: Merge k Sorted Lists. Difficulty: Hard. Topics: Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort. Asked at MongoDB in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a candidate experience report from a mongodb interview for a swe role during the coding round.
It covers the following topics: Divide And Conquer, Heap (Priority Queue), Merge Sort, Heap, Linked List, Queue, Recursion, Sorting .
Difficulty rating: Hard