Sum and Product of all Prime Nodes of a Singly Linked List

// C# implementation to find sum and 
// product of all of prime nodes of 
// the singly linked list 
using System;
    
class GFG 
{ 

// Node of the singly linked list 
public class Node 
{ 
    public int data; 
    public Node next; 
}; 

// Function to insert a node at the beginning 
// of the singly Linked List 
static Node push(Node head_ref, int new_data) 
{ 
    // allocate node 
    Node new_node =new Node(); 

    // put in the data 
    new_node.data = new_data; 

    // link the old list of the new node 
    new_node.next = (head_ref); 

    // move the head to point to the new node 
    (head_ref) = new_node; 
    return head_ref; 
} 

// Function to check if a number is prime 
static bool isPrime(int n) 
{ 
    // Corner cases 
    if (n <= 1) 
        return false; 
    if (n <= 3) 
        return true; 

    // This is checked so that we can skip 
    // middle five numbers in below loop 
    if (n % 2 == 0 || n % 3 == 0) 
        return false; 

    for (int i = 5; i * i <= n; i = i + 6) 
        if (n % i == 0 || n % (i + 2) == 0) 
            return false; 

    return true; 
} 

// Function to find sum and product of all 
// prime nodes of the singly linked list 
static void sumAndProduct(Node head_ref) 
{ 
    int prod = 1; 
    int sum = 0; 

    Node ptr = head_ref; 

    // Traverse the linked list 
    while (ptr != null) 
    { 
        // if current node is prime, 
        // Find sum and product 
        if (isPrime(ptr.data)) 
        { 
            prod *= ptr.data; 
            sum += ptr.data; 
        } 

        ptr = ptr.next; 
    } 

    Console.WriteLine("Sum = " + sum); 
    Console.WriteLine( "Product = " + prod); 
} 

// Driver code 
public static void Main(String []args) 
{ 
    // start with the empty list 
    Node head = null; 

    // create the linked list 
    // 15 . 16 . 7 . 6 . 17 
    head = push(head, 17); 
    head = push(head, 7); 
    head = push(head, 6); 
    head = push(head, 16); 
    head = push(head, 15); 

    sumAndProduct(head); 
} 
} 

// This code is contributed by 29AjayKumar

using System;

public class Node {
    public int data;
    public Node next;

    public Node(int data)
    {
        this.data = data;
        this.next = null;
    }
}

public class LinkedList {
    public Node head;

    // Function to insert a node at the beginning of the
    // singly Linked List
    public void Push(int new_data)
    {
        // Allocate a new node
        Node new_node = new Node(new_data);

        // Link the old list off the new node
        new_node.next = head;

        // Move the head to point to the new node
        head = new_node;
    }
}

public class Program {
    // Function to check if a number is prime
    public static bool IsPrime(int n)
    {
        // Corner cases
        if (n <= 1)
            return false;
        if (n <= 3)
            return true;

        // This is checked so that we can skip middle five
        // numbers in the below loop
        if (n % 2 == 0 || n % 3 == 0)
            return false;

        int i = 5;
        while (i * i <= n) {
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
            i += 6;
        }
        return true;
    }

    // Function to find sum and product of all prime nodes
    // of the singly linked list
    public static void
    SumAndProductUtil(Node node, ref int prod, ref int sum)
    {
        if (node == null)
            return;

        // Check if the current node is prime
        if (IsPrime(node.data)) {
            prod *= node.data;
            sum += node.data;
        }

        // Recursively call the function for the next node
        SumAndProductUtil(node.next, ref prod, ref sum);
    }

    // Wrapper function for the SumAndProductUtil function
    public static void SumAndProduct(LinkedList list)
    {
        int prod = 1;
        int sum = 0;
        SumAndProductUtil(list.head, ref prod, ref sum);
        Console.WriteLine("Sum = " + sum);
        Console.WriteLine("Product = " + prod);
    }

    public static void Main(string[] args)
    {
        // Start with an empty list
        LinkedList list = new LinkedList();

        // Create the linked list: 15 -> 16 -> 7 -> 6 -> 17
        list.Push(17);
        list.Push(7);
        list.Push(6);
        list.Push(16);
        list.Push(15);

        SumAndProduct(list);
    }
}