Find K Pairs with Smallest Sums - Leetcode 373 - Python

preview_player
Показать описание
This video talks about solving a leetcode problem which is called Find K Pairs with Smallest Sums.

Like 👍
Share 📣
Comment 💬
Press the Bell icon🔔for updates

#python #leetcode #coding #programming
Рекомендации по теме
Комментарии
Автор

Hello Guys, DON'T FORGET To LIKE & Subscribe. Press the Bell icon🔔for notification :)

techerror
Автор

This reminds me of Dijkstra's: we are exploring the grid representing all combinations of nums1 and nums2 but in order of smallest sum.

firezdog
Автор

daamn is there a library for a heap. I dint knew this and was doing my own heap implementations in python

revanthmadasu
Автор

nice solution. By the way, what application do you use for drawing?

nearlyforced
Автор

Thanks for a clear explanation. I would like to know what time and space complexities for your algorithm.

li-yunwang
Автор

i don't understand, how the code run successfully if it has a typo? in line 19 the variable nums does not exist.

jhonathansantacana
Автор

I could see some solutions without visited set in discussion section, please make video on that and try to explain.

utkarshkumar