InterviewBit Problems
N max pair combinations : Solved
About the N max pair combinations : Solved category
(1)
Method Explained for N max(CODE THIS ON YOUR OWN)
(1)
C++ Using Max Heap
(2)
DIfferent Logic - C++ Solution - O(nlog(n)) time without maps and priority queues
(2)
C++ Much easier solution (IMO) using MinHeap
(6)
Python solution in O(nlog(n)) time
(3)
Complex C++ Soln ...Not for the faint hearted ^_^
(1)
C++ easy solution using MinHeap
(1)
C++ simple and easy code using pqiroty_queue
(1)
Same approach on JAVA gives TLE
(3)
A more clear C++ solution
(2)
Help with a test case - sol correct in custom input Run Time Error on Submission
(1)
CPP soln using Priority queue,set and tuples
(1)
C++11 Solution Using Map + Priority Queue (Max Heap)
(2)
Solution by using Min heap, sorting and without Sets
(1)
Solution using sorting and min heap
(1)
Easy to understand solution C++!
(1)
Klklklkklklklkmm,mnjnuh ubgygygkj,b
(1)
What is the need of using set?
(4)
What is the expected time complexity
(2)
Solution using Max Heap and Set in C++
(1)
Easier and more understandable approach
(1)
The tests accept wrong solution
(1)
Proof of Correctness, think in 2d grid
(1)
Problem with a particular test case
(1)
next page →