def check_triplet(A, n, sum, count):
    if A is None or n < 3:
        return False

    arr = list(A[:n])
    arr.sort()

    for i in range(n - 2):
        left = i + 1
        right = n - 1
        while left < right:
            s = arr[i] + arr[left] + arr[right]
            if s == sum:
                return True
            if s < sum:
                left += 1
            else:
                right -= 1
    return False