Meta Interview Question Leetcode 23 Merge k Sorted Lists
https://leetcode.com/problems/merge-k...
#python3 #leetcode #coding #interview #amazoninterviewpreparation #metainterview #google #python
00:00 Introduction
00:48 Brute Force
01:12 Python code of BF
03:14 Heap Approach
04:40 Python code of Heap Approach
Code link: https://leetcode.com/problems/merge-k...
Interview Companies:
Facebook
Amazon
Microsoft
Apple
Bloomberg
Oracle
Adobe
TikTok
Google
Yandex
Palantir Technologies
warnermedia
Time Complexity:
BF O(nlogn) for sorted function in Python
Heap O(nlogk) k means the number of list nodes in lists