Help me out in this problem

#1



it is giving wa on leetcode

#2

@KartikKhariwal are u there ?

#3

yeah checking wait …

#4

Hey I think u are assuming diff is always positive ,correct me if I am wrong :slight_smile:

#5

So its not working because three elements cant have the same index, i.e i ,j and mid should be different but ur code is not taking care of that

#6

@Kartikkhariwal1 https://ide.codingblocks.com/s/361678
it is passing 112 test cases out of 121

#7

@Kartikkhariwal1 bro two for loop then third one i am implementing binary search in such a way that required difference is close to it

#8

Take this outside loops

           int mn=INT_MAX;

I think this is self explanatory :slight_smile:

#9

@Kartikkhariwal1 yes bro i always made this stupid mistake can you tell me ways to reduce it

#10

???/

urs is O(n^2 log n) u can do it in O(n^2) ,see the solutions page of the question .