Find K Pairs with Smallest Sums | Leetcode daily challenge | Leetcode Medium | Heap

preview_player
Показать описание
Here in this video we have discussed the approach to solve "373. Find K Pairs with Smallest Sums" of leetcode in hindi.

Please like, Subscribe and share channel for more amazing content :) Also press 👍 and🔔 icon to get notified quickly.

My name is Pankaj Kumar, ASDE1 @Publics Sapient
Thanks Everyone😊
----------------------------------------------------------------------------------------------------------------------------------------
Question and Solution Link 👇
----------------------------------------------------------------------------------------------------------------------------------------
Other Link 👇

🔔 Join discord channel for doubts and discussions:

----------------------------------------------------------------------------------------------------------------------------------------
Important Playlist
----------------------------------------------------------------------------------------------------------------------------------------
#leetcode
#binary_magic
#competitive_programming
----------------------------------------------------------------------------------------------------------------------------------------
Find K Pairs with Smallest Sums
Find K Pairs with Smallest Sums leetcode
Find K Pairs with Smallest Sums c++
Find K Pairs with Smallest Sums leetcode solution
Find K Pairs with Smallest Sums leetcode medium
leetcode 373
leetcode daily challenge
leetcode solution video
leetcode contest c++ solution
leetcode heap
Рекомендации по теме
Комментарии
Автор

if sum is greater than heap's top element, we are only breaking the inner loop (which loops over the 2nd array), we still continue with the outer loop if there are still smaller pairs possible with the next value of i.

vishalkhanna
Автор

I HAVE SEEN OTHER EXPLANATIONS, BUT YOURS WERE THE BEST... SIMPLE AND EASY

tusharsingh
Автор

what is the time comple for this code??

akshatjain
welcome to shbcf.ru