Merge k Sorted Lists at Netskope

Problem Description

You are given an array of `k` linked-lists `lists`, each linked-list is sorted in ascending order. _Merge all the linked-lists into one sorted linked-list and return it._

Topics

Also asked at 52 companies