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

    A = sorted(A[:n])

    for i in range(n - 2):
        left = i + 1
        right = n - 1

        while left < right:
            current_sum = A[i] + A[left] + A[right]

            if current_sum == sum:
                return True
            if current_sum < sum:
                left += 1
            else:
                right -= 1

    return False