comefrom: <garvit244>16_1.py
code: def threeSumClosest( nums, target):
      nums.sort()
      result, min_diff = 0, float('inf')
      
      for index in range(len(nums)-1):
          left = index + 1
          right = len(nums) - 1
      
          while left < right:
              currSum = nums[index] + nums[left] + nums[right]
              diff = abs(target - currSum)
      
              if diff == 0:
                  return target
              if diff < min_diff:
                  min_diff = diff
                  result = currSum
      
              if currSum < target:
                  left += 1
              else:
                  right -= 1
      return result
masked: def sample_funcname ( var_0 , var_1 ) :
      var_0.sort ( )
      var_4 , var_7 = 0 , float ( 'inf' )
      for var_11 in range ( len ( var_0 ) - 1 ) :
          var_12 = var_11 + 1
          var_13 = len ( var_0 ) - 1
          while var_12 < var_13 :
              var_14 = var_0 [ var_11 ] + var_0 [ var_12 ] + var_0 [ var_13 ]
              var_16 = abs ( var_1 - var_14 )
              if var_16 == 0 :
                  return var_1
              if var_16 < var_7 :
                  var_7 = var_16
                  var_4 = var_14
              if var_14 < var_1 :
                  var_12 += 1
              else :
                  var_13 -= 1
      return var_4
  