Jishan's Log

 Hackerrank Greedy So this problem is your basic problem. The Problem: We are given an array and we are to find the minimum absolute difference. The Solution: We will sort the array Create a storage variable to keep track of minimum difference We will take the initial abs difference between the first two pairs if it's 0, we return it else we iterate through the loop taking two pairs  if we find their difference is 0, return it else compare if it is smaller than what we had stored Finally, we return that storage variable The Code: #include   < bits/stdc++.h >   using   namespace   std ; int   min ( int   a ,   int   b )   {      return   a   <   b   ?   a   :   b ; } int   minimumAbsoluteDifference ( vector < int >   arr )   {      sort ( arr . begin (),   arr . end ());           int ...