educative.io

Is the 'Merge k-sorted lists' with a min heap an alternative solution for the fetch top movies problem?

Courses
, ,
#1

Is the ‘Merge k-sorted lists’ with a min heap an alternative solution for the fetch top movies problem?

1 Like
#2

Hi Tony,

yes, you’re right.

We can implement this solution using min heap too.

Thank you!