reduce time complexity to O(klogk) - Githubissues

NITIN23329 / LeetCode

This repo contains several problems solved at leetcode

MIT License

1 stars 0 forks source link

reduce time complexity to O(klogk) #30

Closed NITIN23329 closed 3 years ago

NITIN23329 commented 3 years ago

solution link : https://github.com/NITIN23329/LeetCode/blob/e45dc8129c84c5ee720dabea1dfa351c471386a8/Heap/FindKPairsWithSmallestSums.java#L1

NITIN23329 commented 3 years ago

problem link : https://leetcode.com/problems/find-k-pairs-with-smallest-sums/

NITIN23329 commented 3 years ago

Solved 👍 https://github.com/NITIN23329/LeetCode/blob/8745d5ae54327179050eb18148f89eef6585dee6/Heap/FindKPairsWithSmallestSums.java#L22