LeetCode Experience

#23 Merge k Sorted Lists

SWE coding Hard

Interview Experience

LeetCode #23: Merge k Sorted Lists. Difficulty: Hard. Topics: Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort. Asked at Bloomberg 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 Bloomberg

Reddit What would you grind for Bloomberg? Reddit Bloomberg Tokyo Software Engineer Rejection after Five Rounds Reddit Bloomberg, senior C++ role – what to expect? 1p3a Bloomberg Fulltime SDE Interview Experience and Coding Challenges 1p3a Bloomberg SSE Bquant SF Interview Experience and Reject

← All Bloomberg questions Bloomberg Software Engineer Questions → All Linked List,Heap,Divide And Conquer,Sorting,Merge Sort Questions →