title: Find A Triplet That Sum To A Given Value
signature: func findATripletThatSumToAGivenValue(a []int, arr_size int, sum int) bool {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual bool, expected bool) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(a []int, arr_size int, sum int, expected bool) string {
      if validateSolution(PLACEHOLDER_FN_NAME(a, arr_size, sum),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{15, 18, 38, 47, 75, 88}, 
  	5, 
  	4, false)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{28, -2, 62, 38, 86, -86, 56, 58, 96, 6, -28, 8, 68, -16, -80, -4, 98, -92, 4, -4, 58, -62, 46, 64}, 
  	22, 
  	18, true)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	27, 
  	23, false)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{19, 77, 17, 91, 6, 35, 22, 4, 30, 23, 97, 56, 78, 16, 22, 23, 95, 57, 43, 27, 47, 44, 23, 10, 3, 94, 55, 22, 93, 32, 89, 28, 64, 22, 13, 24, 38, 44, 6, 1, 80}, 
  	22, 
  	29, true)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-98, -98, -94, -88, -80, -74, -68, -68, -64, -44, -36, -24, -10, -8, -8, 0, 4, 6, 8, 8, 12, 14, 16, 38, 50, 52, 54, 56, 66, 68, 76, 88}, 
  	18, 
  	19, false)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{1, 1, 0, 0, 1, 0, 1, 1}, 
  	4, 
  	5, false)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{7, 22, 24, 30, 42, 44, 49, 49, 65, 70, 70, 74, 74, 75, 90, 95, 96}, 
  	8, 
  	13, false)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{40, -76, -68, -86, -14, 82, -20, 54, -26, 56, -24, -44, 44, 60, 52, -20, 80, -24, -90, -30, -2}, 
  	11, 
  	18, true)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	15, 
  	17, false)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{33, 92, 6, 99, 83, 97, 49, 97, 85, 52}, 
  	6, 
  	7, false)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def find_a_triplet_that_sum_to_a_given_value(A, arr_size, sum):
      for i in range(0, (arr_size - 2)):
          for j in range((i + 1), (arr_size - 1)):
              for k in range((j + 1), arr_size):
                  if (((A[i] + A[j]) + A[k]) == sum):
                      print('Triplet is', A[i], ', ', A[j], ', ', A[k])
                      return True
      return False
source_cpp: bool find_a_triplet_that_sum_to_a_given_value(vector<int> A, int arr_size, int sum) {
    int l, r;
    for ( int i = 0;
    i < arr_size - 2;
    i ++ ) {
      for ( int j = i + 1;
      j < arr_size - 1;
      j ++ ) {
        for ( int k = j + 1;
        k < arr_size;
        k ++ ) {
          if ( A [ i ] + A [ j ] + A [ k ] == sum ) {
            return true;
          }
        }
      }
    }
    return false;
  }