Merge K Sorted Lists (LeetCode) | Interview Question Explained

preview_player
Показать описание
Link to the Code:

Time Complexity: n * log(k)

Timestamps:
00:00 - Problem Introduction
02:56 - Merging 2 Sorted Lists
07:10 - Adapting Our Previous Knowledge to the Problem
10:19 - Using a Heap for optimization
16:46 - Coding Walkthrough
_______________________________________
Some great channels to learn more:
Рекомендации по теме
Комментарии
Автор

Your presentation skills have improved drastically.
Visual Explanations are superb.
21:35 = Small diagrams to visualizes the logic behind the code is an awesome idea.

kunal_chand
welcome to shbcf.ru