You are given a sequence of integers terminated with a -1. The -1 isnot part of the input sequence.  Next, you are given a positive number N. You have to create a linked list with the input sequence of integersas entries. You can use the following structure.  struct node{  int data;struct node *next; };  Now, you have to delete all but the last N elements from the linkedlist, and print the resulting list. (i.e. The resulting list willconsist of only the last N elements from the list.)  If N is longer than the length of the linked list, you must print -1. While printing, the entries of the list must be separated by a singlespace.  Sample Input3 4 5 6 -11 Sample Output6

The problem is asking to implement a linked list using the given sequence of integers. After creating the linked list, we need to delete all but the last N elements from the list and print the resulting list. If N is longer than the length of the linked list, we should print -1.

Here is a step-by-step solution in C++:

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

struct node{
    int data;
    struct node *next;
};

node* createNode(int data){
    node* newNode = new node();
    if (!newNode) {
        cout << "Memory error\n";
        return NULL;
    }
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}

node* insertNode(node* head, int data){
    node* newNode = createNode(data);
    if (head == NULL) {
        head = newNode;
    } else {
        node* temp = head;
        while (temp->next != NULL) {
            temp = temp->next;
        }
        temp->next = newNode;
    }
    return head;
}

void deleteNodes(node* &head, int N){
    if (head == NULL)
        return;
    node* temp = head;
    int count = 0;
    while (temp != NULL) {
        count++;
        temp = temp->next;
    }
    if (count < N) {
        cout << "-1";
        return;
    }
    temp = head;
    for (int i = 1; i < count-N+1; i++) {
        node* next = temp->next;
        free(temp);
        temp = next;
    }
    head = temp;
}

void printList(node* head){
    while (head != NULL) {
        cout << head->data << " ";
        head = head->next;
    }
}

int main(){
    node* head = NULL;
    int data;
    while (cin >> data && data != -1) {
        head = insertNode(head, data);
    }
    int N;
    cin >> N;
    deleteNodes(head, N);
    printList(head);
    return 0;
}

This program first creates a linked list from the input sequence. Then it counts the number of nodes in the list. If the count is less than N, it prints -1. Otherwise, it deletes the first count-N nodes from the list. Finally, it prints the remaining nodes in the list.