Code
#include <bits/stdc++.h>
using namespace std;

// Node class represents a node in a linked list
class Node {
public:
    // Data stored in the node
    int data;

    // Pointer to the next node in the list
    Node* next;

    // Constructor with data and next pointer
    Node(int data1, Node* next1) {
        data = data1;
        next = next1;
    }

    // Constructor with only data
    Node(int data1) {
        data = data1;
        next = nullptr;
    }
};

class Solution {
public:
    // Function to delete the node with a given value
    Node* deleteNode(Node* head, int value) {
        // If list is empty, return null
        if (head == nullptr) return nullptr;

        // If head node itself holds the value
        if (head->data == value) {
            Node* temp = head;
            head = head->next;
            delete temp;
            return head;
        }

        // Pointer to traverse the list
        Node* temp = head;

        // Traverse until we find the value
        while (temp->next != nullptr && 
               temp->next->data != value) {
            temp = temp->next;
        }

        // If value found, delete the node
        if (temp->next != nullptr) {
            Node* nodeToDelete = temp->next;
            temp->next = temp->next->next;
            delete nodeToDelete;
        }

        // Return updated head
        return head;
    }
};

// Function to print linked list
void printLL(Node* head) {
    Node* temp = head;
    while (temp 