Question

Write a C++ code to insert the following numbers in two Linked Lists. Insert numbers of first list in Linked List#1, and numbers of second list in Linked List#2. Do not insert both lists in a single Linked List.

List#1.

5, 78, 45, 23, 11, 89, 10, 78, 6, 99, 876, 5, 67, 13

List#2.

5, 89, 688, 52, 557, 953, 5, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 6, 2, 45, 12, 7, 6, 94, 93, 99, 67

1. After inserting numbers in linked lists. Write a function to print only those numbers that appear in List#1 and more than 2 times in List#2.

2. For example, the number “5” appears in List#1 and 3 times in List#2. So your code should print “5” and similar other numbers.

Answer 1

    it is very Program in c++. i upload full code with output and output screenshot,so just read carefully.Thank You.

    ----------------------------------------------------------------------
   Program Code:

#include<iostream>
using namespace std;
void createList1();
void createList2();
void displayList1();
void displayList2();
void findWords();
struct Node{

    int data;

    Node *next;

};
Node *head1,*head2;

int main()
{

head1 = NULL ;
head2 = NULL ;
createList1();//here we create list 1

createList2();//here we create list 2

displayList1();//display all elements in the list 1
displayList2();//display all elements in the list 2

findWords();
}

void createList1()
{

/*in this function we create list one using given data*/
Node *newNode, *last;
last = head1;

int listData[]={5, 78, 45, 23, 11, 89, 10, 78, 6, 99, 876, 5, 67, 13};

for (int i = 0; i < sizeof(listData)/sizeof(listData[0]); i++)
{
    /*here we create newnode and add to list*/
      newNode = new Node;
      newNode->data=listData[i];
      newNode->next = NULL;
      if(head1 == NULL)
      {
        head1 = newNode;
        last = newNode;
        /*add newnode to head because list is empty*/

      }
      else
      {
        /*move last to newnode*/
       last->next = newNode;
       last = newNode;
     }   
}

}

void createList2()
{

/*in this function we create list two using given data*/
Node *newNode, *last;
last = head2;

int listData[]={5, 89, 688, 52, 557, 953, 5, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 6, 2, 45, 12, 7, 6, 94, 93, 99, 67};

for (int i = 0; i < sizeof(listData)/sizeof(listData[0]); i++)
{
    /*here we create newnode and add to list*/
      newNode = new Node;
      newNode->data=listData[i];
      newNode->next = NULL;
      if(head2 == NULL)
      {
        head2 = newNode;
        last = newNode;
        /*add newnode to head because list is empty*/

      }
      else
      {
        /*move last to newnode*/
       last->next = newNode;
       last = newNode;
     }   
}

}
void displayList1()
{
/*
In this method we just display link list 1 until it empty
*/
Node *newnode;
newnode = head1;
cout<<"\n**Display list 1**\n";

    while(newnode != NULL)
    {
      cout<<newnode->data<<" ";
      newnode = newnode->next;
    }
        cout<<"\n";

}

void displayList2()
{
/*
In this method we just display link list 2 until it empty
*/
Node *newnode;
newnode = head2;
cout<<"\n**Display list 2**\n";

    while(newnode != NULL)
    {
      cout<<newnode->data<<" ";
      newnode = newnode->next;
    }
        cout<<"\n";

}


void findWords()
{

/*
this function find and print only those number have present in list 1 and also more than
2 times in list2*/
Node *node1,*node2;
node1 = head1;
node2 = head2;

int numarr[50];
int k=0,i,j,k1,numcount=0;

cout<<"\n**The number appear in List#1 and more than 2 times in List#2 =\n";
while(node1 != NULL)
    {
      numcount=0;
        while (node2 != NULL)
          {
              /*here we iterate full list 2
              for each number in list 1*/

              if (node2->data==node1->data)
                  numcount++;
            
              node2 = node2->next;
          }
          if(numcount>2)
            numarr[k++]=node1->data;
            /*added such number in array*/     

         
    
      node1 = node1->next;
       node2 = head2;
       /*here we set list2 at the begining*/
     }

/*here we remove the duplicate element in numarr
i.e in our question there is two time 5 in list 1
so that it will print two times in output so we remove such element here*/

for(i = 0; i < k; i++)
    {
      for(j = i+1; j < k; )
        {
          if(numarr[j] == numarr[i])
            {
                for(k1 = j; k1 < k; k1++)
                {
                    numarr[k1] = numarr[k1+1];
                }
                k--;
            }
            else
            {
                j++;
            }
        }
    }

/*here we print final array*/
    for (i = 0; i < k; ++i)
    {
     cout<<numarr[i]<<" ";
    }

    cout<<"\n";
}

/*
----------------------OUTPUT--------------------
**Display list 1**
5 78 45 23 11 89 10 78 6 99 876 5 67 13

**Display list 2**
5 89 688 52 557 953 5 7 55 35 89 99 99 6 557 89 5 99 6 2 45 12 7 6 94 93 99 67

**The number appear in List#1 and more than 2 times in List#2 =
5 89 6 99

*/

    -----------------------OUTPUT SCREENSHOT-----------------------

en Activities Terminal Sun 4:36 AM nawale@Nawale-HP: -/Chegg/C and C++ File Edit View Search Terminal Help nawale@Nawale-HP:-/Chegg/C and C++$ g++ Linklistexample.cpp nawale@Nawale-HP:-/Chegg/C and C++$ ./a.out **Display list 1** 5 78 45 23 11 89 10 78 6 99 876 5 67 13 **Display list 2** 5 89 688 52 557 953 5 7 55 35 89 99 99 6 557 89 5 99 6 2 45 12 7 6 94 93 99 67 **The number appear in List#1 and more than 2 times in List#2 = 5 89 6 99 nawale@Nawale-HP:-/Chegg/c and C++$ |

    ------------------------------------------------------------------------

    Still you have any doubt related these question then please Feel free and ask question in Comment Section Otherwise Please Like Answer,Thank You........!