InterviewBit Problems   Maximum Consecutive Gap : Unsolved


About the Maximum Consecutive Gap : Unsolved category (1)
Accepted solution for O(NlogN) solution (1)
Code runs on local machine with correct output biut here it gives runtime error (1)
Main thing is to make copy of const vector (3)
Guys use HEAP don't sort (6)
Guys if you are stuck watch this .THis dude is simply awesome love him (1)
MLE error for using set (1)
Why I am getting TLE for O(n) solution (1)
Problem definition is unclear (1)
Easy solution in java8 (1)
5 line code using priority_queue and it uses build heap which takes O(n) time (3)
Wrong solution code (1)
Warning for everyone! you won't be happy after seeing editorial solution. Leave it as this question is not worth it! (3)
What's the point of building a heap than using sort? Building a heap takes O(nlgn) time too (2)
Java array solution (1)
Very good blog source for this problem using Pigeonhole principle (5)
Use priority_queue instead of multiset as multiset will give MLE (1)
Why using map gives memory limit and nlogn or heap is accepted (1)
It accepting nlog(n) solution (2)
Set vs 2 vectors (6)
Wrong output in a particular test case (2)
Please help, what is wrong with my code? (1)
Team InterviewBit (2)
Why did formula for gap change? (3)
Use heaps instead (4)
Memory Limit Hit (1)
O(n) space still memory limit exceeded! (1)
Why is the below code showing an error? (1)
A more pythonic solution (3)
Correctness but segmentation fault (1)