Merge two Sort lists | Leeetcode 21 | Live coding session

preview_player
Показать описание
1) 0:00 Explaining the problem out loud
2) 1:02 Algorithm walkthrough
3) 4:00 Coding it up
4) 8:20 Time complexity

TC :O(n+m)
where n is the no elements in the list1, m is the no elements in the list2

Code Link

Рекомендации по теме
join shbcf.ru