DEV Community: Dhanashree Rugi

Length of Linked List.

Dhanashree Rugi — Wed, 17 Aug 2022 13:20:55 +0000

For more such blogs visit " www.coderlogs.com "

For a given linked list, you are supposed to write a function that finds the length of that linked list.

Example 1 :

Input : Linked List : 4 6 8 2
Output : Length of List : 4

Example 2 :

Input : Linked List : 1 3 1 2 1
Output : Length of List : 5

Steps :

Declare and initialise a temporary pointer temp as the head node of the linked list.
Initialise an integer variable count as zero(0).
Traverse the linked list using temp and increment the variable count by one until temp becomes NULL i.e.,

while(temp != NULL)
{
   count++;
   temp = temp->next;
 }

Return or print the variable count which gives the length of the list.

C program that finds the length of the given linked list.

#include <stdio.h>
#include <stdlib.h> 
#include <limits.h>

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

void displayLL(struct node * head)
{
    struct node * temp;
    temp = head;
    temp=head;
    while(temp!=0)
    {
       printf("%d ",temp->data);
       temp = temp->next;
    }
}

void length(struct node *head)
{
    struct node *temp = head;
    int count = 0;

    while(temp != NULL)
    {
        count++;
        temp = temp->next;
    }
    printf("\n--------------------------------\n");
    printf("Length of linked list : %d", count);
}
int main()
{
   struct node *head = 0, *newnode, *temp; 
   int n, choice, newdata;

// Create Linked List // 

   printf("Enter the number of nodes in the list : ");
   scanf("%d", &n);

   if(n == 0)
   {
      printf("--------------------------------\n");
      printf("Linked list cannot be empty");
      exit(0);
    } 

 for(int i = 1; i<=n; i++)
 {
   newnode = (struct node *)malloc(sizeof(struct node));
   printf("Enter the data%d : ", i);
   scanf("%d", &newnode->data);
   newnode->next = 0;
   if(head == 0)
     {
        head = temp = newnode;
     } 
   else
     { 
        temp->next = newnode;
        temp = newnode;
      }
  }
   printf("--------------------------------\n");
   printf("Original linked list : ");
   displayLL(head);
   length(head);
}

Move Largest Number to the End of Linked List.

Dhanashree Rugi — Tue, 26 Jul 2022 07:18:07 +0000

For a given linked list, you are supposed to write a function that moves the largest number to the end of the list.

Example 1:
Input : 4 6 2 8 1
Output : 4 6 2 1 8

Example 2:
Input : 9 5 1 8 2
Output : 5 1 8 2 9

Steps:

To move the largest number to the end, first you need to write the function that returns the largest number. Store that largest(maximum) number in an integer variable max.
Write the base case :

If only one node is present in the linked list , then return head.
If no node, then print an error message.

Initialise two pointers : prevnode to point the previous node in the list and temp to point the head node of the list. Both the pointers are of type struct node.
Compare the value of max with each number(data) of the linked list.
If the value of max is equal to the first data of the linked list :

Separate the head node from the list, make temp to point second node and make prevnode to point head node.
Now, make second node as the head node of the list by head = temp.
Traverse the linked list until last node and connect the detached node(to which pointer prevnode is pointing) to the last node which contains the largest number of the linked list.

If the value of max equals to other than first data in the list :

Traverse the linked list until number is found equal to value of max . If found, then detach that node from the linked list by prevnode->next = temp->next.
Create a new node pointing to by pointer newnode and store the value of max into that node using structure member data and store NULL into its address part using structure member next i.e., newnode->data = max; newnode->next = NULL;
Traverse the linked list until last node and connect the newnode to the last node which contains the largest number of the linked list.

Finally display the new linked list with the largest number at the end.

C program that moves the largest number to the end of linked list.

#include <stdio.h>
#include <stdlib.h> 
#include <limits.h>

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

void displayLL(struct node * head)
{
    struct node * temp;
    temp = head;
    temp=head;
    while(temp!=0)
    {
       printf("%d ",temp->data);
       temp = temp->next;
    }
}

int large(struct node *head)
{
   struct node *temp = head;
   int max;
   max = INT_MIN;

   while(temp != NULL)
   {
       if(max < temp->data)
       {
           max = temp->data;
       }
       temp = temp->next;
   }
   return max;
}

void largeToEnd(struct node *head)
{
    struct node *prevnode, *newnode;
    struct node *temp;
    int max;
    temp = head;

    if(head->next == NULL)
    {
        printf("\n--------------------------------\n");
        printf("Linked list with largest number at end : ");
        displayLL(head);
        exit(0);
    }
    max = large(head);  

   if(head->data == max)
    {
        temp = temp->next;
        head->next = NULL;
        prevnode = head;
        head = temp;
        while(temp->next != NULL )
        {
            temp = temp->next;
        }
        temp->next = prevnode;
        printf("\n--------------------------------\n");
        printf("Linked list with largest number at end : ");
        displayLL(head);
        exit(0);
    }
    while(temp->data != max)
    {
        prevnode = temp;
        temp = temp->next;
    }

    prevnode->next = temp->next;

    newnode = (struct node *)malloc(sizeof(struct node));
    newnode->data = max;
    newnode->next = NULL;

    temp = head;

    while(temp->next != NULL)
     {
        temp = temp->next;
     }
    temp->next = newnode;

    printf("\n--------------------------------\n");
    printf("Linked list with largest number at end : ");
    displayLL(head);
}    

int main()
{
   struct node *head = 0, *newnode, *temp; 
   int n, choice, newdata, max;

// Create Linked List // 

   printf("Enter the number of nodes in the list : ");
   scanf("%d", &n);

   if(n == 0)
   {
      printf("--------------------------------\n");
      printf("Linked list cannot be empty");
      exit(0);
   }
   for(int i = 1; i<=n; i++)
   {
     newnode = (struct node *)malloc(sizeof(struct node));
     printf("Enter the data%d : ", i);
     scanf("%d", &newnode->data);
     newnode->next = 0;
     if(head == 0)
     {
        head = temp = newnode;
     } 
     else
       { 
        temp->next = newnode;
        temp = newnode;
       }
    }
   printf("--------------------------------\n");
   printf("Linked list : ");
   displayLL(head);
   max = large(head);
   printf("\n--------------------------------\n");
   printf("Largest number of linked list : %d", max);
   largeToEnd(head);
}

I own a website www.coderlogs.com where in I write similar blogs so do visit the website for more such blog posts.

Align attribute in HTML

Dhanashree Rugi — Fri, 15 Jul 2022 14:37:55 +0000

An important information to the beginners!

While designing my first HTML website I came across that HTML5 does not support align(centre, left, right) attribute as it is removed from the HTML5 document.

<p align = "centre"> Coderlogs </p>   // not supported format //

You can use the CSS text-align property to centre any text or object or form in HTML.

Stay tuned!

Create a Copy of a Linked List

Dhanashree Rugi — Wed, 13 Jul 2022 09:21:14 +0000

For a given linked list, you are supposed to write a function that creates a copy of the already created linked list.

Example 1:
Input : Linked List : 4 6 2 8 1
Output : Copy of linked list : 4 6 2 8 1

Example 2:
Input : Linked List : 4 5 9 8 2
Output : Copy of linked list : 4 5 9 8 2

Explanation:

Logic behind this is just create a new node of structure and copy the every existing node to new node.
Process will continue until the existing list leads to null(recursively).

C program that creates the copy of linked list:

#include <stdio.h>
#include <stdlib.h> 
#include <limits.h>

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

void displayLL(struct node * head)
{
    struct node * temp;
    temp = head;
    temp=head;
    while(temp!=0)
    {
       printf("%d ",temp->data);
       temp = temp->next;
    }
}

void copy(struct node *head)
{
    struct node *temp = head;
    struct node *temp1, *temp2, *head1;

    temp1 = (struct node *)malloc(sizeof(struct node));
    temp1->next = NULL;
    temp1->data = temp->data;
    head1 = temp1;
    temp1->next = NULL;
    temp = temp->next;

    while(temp != NULL)
    {
       temp2 = (struct node *)malloc(sizeof(struct node));
       temp2->data = temp->data;
       temp1->next = temp2;
       temp1 = temp2;
       temp = temp->next;
    }
    printf("\n--------------------------------\n");
    printf("Copy of original linked list : ");
    displayLL(head1);
}

int main()
{
   struct node *head = 0, *newnode, *temp; 
   int n, choice, newdata;

// Create Linked List // 

   printf("Enter the number of nodes in the list : ");
   scanf("%d", &n);

   if(n == 0)
   {
      printf("--------------------------------\n");
      printf("Linked list cannot be empty");
      exit(0);
    } 

   for(int i = 1; i<=n; i++)
   {
     newnode = (struct node *)malloc(sizeof(struct node));
     printf("Enter the data%d : ", i);
     scanf("%d", &newnode->data);
     newnode->next = 0;
     if(head == 0)
     {
        head = temp = newnode;
     } 
     else
       { 
        temp->next = newnode;
        temp = newnode;
       }
    }
   printf("--------------------------------\n");
   printf("Original linked list : ");
   displayLL(head);
   copy(head);
}

Output:

Enter the number of nodes in the list : 4
Enter the data1 : 3
Enter the data2 : 7
Enter the data3 : 3
Enter the data4 : 8
--------------------------------
Original linked list : 3 7 3 8 
--------------------------------
Copy of original linked list : 3 7 3 8

Find Largest And Smallest Number in a Linked List.

Dhanashree Rugi — Tue, 05 Jul 2022 12:52:12 +0000

For a given linked list, you are supposed to write two separate functions that finds the largest and the smallest number in a linked list and print both the numbers.

Example 1:
Input: 4 6 2 8 1
Output: Largest Number: 8
Output: Smallest Number: 1

Example 2:
Input: 4 5 9 8 2
Output: Largest Number: 9
Output: Smallest Number: 2

Steps to find Largest number:

Initialise an integer variable max to INT_MIN.
Using temporary pointer temp start traversing the linked list and compare each data element in the linked list with the variable max until the end of linked list.
If the current node’s data is greater than value of max, then store the value of the current node’s data into max.
Finally, print the value of variable max which contains the largest number of the linked list.

Steps to find Smallest number:

Initialise an integer variable min to INT_MAX.
Using temporary pointer temp start traversing the linked list and compare each data element in the linked list with the variable min until the end of linked list.
If the current node’s data is lesser than the value of min, then store the value of the current node’s data into min.
Finally, print the value of variable min which contains the smallest number of the linked list.

Note : We are using INT_MAX because all the data elements are lesser than this and INT_MIN because all the data elements are greater than this. Using these two macros our findings become very easy.

C program that finds the largest and the smallest number in the linked list.

#include <stdio.h>
#include <stdlib.h> 
#include <limits.h>

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

void displayLL(struct node * head)
{
    struct node * temp;
    temp = head;
    temp=head;
    while(temp!=0)
    {
       printf("%d ",temp->data);
       temp = temp->next;
    }
}
void small(struct node *head)
{
   struct node *temp = head;
   int min;
   min = INT_MAX;

   while(temp != NULL)
   {
       if(min > temp->data)
       {
           min = temp->data;
       }
       temp = temp->next;
   }
   printf("\n--------------------------------\n");
   printf("Smallest number of linked list : %d", min);
}

void large(struct node *head)
{
   struct node *temp = head;
   int max;
   max = INT_MIN;

   while(temp != NULL)
   {
       if(max < temp->data)
       {
           max = temp->data;
       }
       temp = temp->next;
   }
   printf("\n--------------------------------\n");
   printf("Largest number of linked list : %d", max);
}

int main()
{
   struct node *head = 0, *newnode, *temp; 
   int n, choice, newdata;

// Create Linked List // 

   printf("Enter the number of nodes in the list : ");
   scanf("%d", &n);

   if(n == 0)
    {
      printf("--------------------------------\n");
      printf("Linked list cannot be empty");
      exit(0);
    }

   for(int i = 1; i<=n; i++)
   {
     newnode = (struct node *)malloc(sizeof(struct node));
     printf("Enter the data%d : ", i);
     scanf("%d", &newnode->data);
     newnode->next = 0;
     if(head == 0)
     {
        head = temp = newnode;
     } 
     else
       { 
        temp->next = newnode;
        temp = newnode;
       }
    }
   printf("--------------------------------\n");
   printf("Linked list : ");
   displayLL(head);
   small(head);
   large(head);
}

Macro Vs Function

Dhanashree Rugi — Mon, 27 Jun 2022 07:38:03 +0000

Macro	Function
It is a fragment of code given a name macro and is defined by the preprocessor directive #define. In the program before compilation, the macro is replaced by its macro value (or text).	It is a set of instructions enclosed within a flower ({}) bracket. When a function is called, it performs the specific task and returns to the main program.
It is preprocessed.	It is compiled.
Macros makes the code lengthy if its value is large because macros will be replaced with its value before compilation.	The repeated call to function does not affect the code length as it is written only once.
The program execution time remains unaffected using macro	Here, the passing of parameters and returning of values takes some time and hence the program execution becomes slow.
In a program, if the macro is appearing at multiple places then it is always a better idea to change that macro into a function because macros will be replaced with its value which causes more memory consumption.	In a program, calling the same function repeatedly does not affect the memory consumption.
No type checking (like incompatible data type, operand etc.) is done during preprocessing hence more prone to error.	Type checking is done during compilation.

If you find any comparison other than these then please do suggest.

Puzzle-4

Dhanashree Rugi — Fri, 24 Jun 2022 12:13:38 +0000

Can you guess the output without the help of code editor ?

Comment the output in the below comment section.

#include <stdio.h>
void func(struct tag v);
int main()
{
    struct tag
    {
        int i;
        char c;
    };
    struct tag var = {2, 'd'};
    func(var);
}

void func(struct tag v)
{
    printf("%d\n %c", v.i, v.c);
}

Puzzle-3

Dhanashree Rugi — Wed, 22 Jun 2022 12:39:11 +0000

Can you guess the output without the help of code editor ?

Comment the output in the below comment section.

#include <stdio.h>
struct student {char name[20]; int age;};
int main()
{
    struct student stu1 = {"anita", 10}, stu2 = {"anita", 20};
    if(stu1 == stu2)
       printf("Same");
    else
       printf("Not same");
    return 0;
}

Puzzle-2

Dhanashree Rugi — Mon, 20 Jun 2022 09:36:11 +0000

Can you guess the output without the help of code editor ?

If yes, then comment the output in the below comment section.

#include <stdio.h>
#include <stdlib.h>
struct res
{
    char *name;
    int age;
}*ptr;

int main()
{
    char name[100] = "Dhanashree";
    ptr = (struct res *)malloc(sizeof(struct res));
    ptr->name = name;
    ptr->age = 28;
    printf("name = %s\n", ptr->name);
    printf("age = %d", ptr->age);
    return 0;
}

Puzzle-1

Dhanashree Rugi — Fri, 17 Jun 2022 09:19:58 +0000

Can you guess the output without the help of code editor ?

If yes, then comment the output in the below comment section.

#include <stdio.h>
struct result
{
    int marks;
    char grade;
};
int main()
{
    struct result a1, b1;
    a1.marks = 50; a1.grade = 'A';
    b1 = a1;
    printf("marks = %d\n", b1.marks);
    printf("grade = %c\n", b1.grade);
    return 0;
}

Remove Duplicates From Sorted Linked List.

Dhanashree Rugi — Thu, 16 Jun 2022 09:59:06 +0000

Suppose you are given a sorted linked list, you need to traverse a linked list, remove the duplicates from the list if exists and then print the resultant sorted linked list.

Example 1 :

Input : Linked List : 1, 2, 2, 3, 3, 4, 5
Output : Linked List after removing duplicates : 1, 2, 3, 4, 5

Example 2 :

Input : Linked List : 5, 5, 6, 7, 8, 8
Output : Linked List after removing duplicates : 5, 6, 7, 8

Steps :

Declare two pointers currentNode and nextNode of type struct node.
Make currentNode to point the head node of the linked list.
Keep iterating through the linked list until last node is reached.
Compare the data of current node with the data of next node.
If they are equal, then detach one of the node(which is considered as duplicate) from the list by saving its neighbour node's address into pointer nextNode i.e., nextNode = currentNode->next->next. Then break the link between current node and the duplicate node and attach the current node to the node pointing to by pointer nextNode i.e., currentNode->next = nextNode.
If not, then continue traversing the linked list.
Finally, print the linked list.

C program that removes the duplicates from sorted linked list :

*******************************************************************************/
#include <stdio.h>
#include <stdlib.h> 

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

void displayLL(struct node * head)
{
    struct node * temp;
    temp = head;
    temp=head;
    while(temp!=0)
    {
       printf("%d ",temp->data);
       temp = temp->next;
    }
}

void removeDup(struct node *head)
{
    struct node *currentNode = head;
    struct node *nextNode;

    while(currentNode != NULL && currentNode->next != NULL)
  {
       if(currentNode->data == currentNode->next->data )
       {   
           nextNode = currentNode->next->next;
        if(nextNode == NULL)
           {
             currentNode->next = NULL;
             break;
           }
           currentNode->next = nextNode;
       }   
       if(currentNode->data != currentNode->next->data)
       {
           currentNode = currentNode->next;
       }
   }
    printf("\n--------------------------------\n");
    printf("Linked List after removing duplicates : ");
    displayLL(head);
}

int main()
{
   struct node *head = 0, *newnode, *temp; 
   int n, choice, newdata;

// Create Linked List // 

   printf("Enter the number of nodes in the list : ");
   scanf("%d", &n);
   for(int i = 1; i<=n; i++)
   {
     newnode = (struct node *)malloc(sizeof(struct node));
     printf("Enter the data%d : ", i);
     scanf("%d", &newnode->data);
     newnode->next = 0;
     if(head == 0)
     {
        head = temp = newnode;
     } 
     else
       { 
        temp->next = newnode;
        temp = newnode;
       }
    }
   printf("--------------------------------\n");
   printf("Linked list : ");

   displayLL(head);
   removeDup(head);
}

For more detail watch this video.

Occurrence of a Number in a Linked List.

Dhanashree Rugi — Tue, 14 Jun 2022 10:37:21 +0000

Let us write a function that prints the number of times a number has occurred in a given linked list.

Example 1 :

Linked list : 2 6 4 4 5
Occurrence of number 4 : 2

Example 2 :

Linked list : 3 5 2 7 1 9
Occurrence of number 8 : 0

Steps :

Declare an integer variable item to store a number whose occurrence has to be found.
Initialise an another integer variable count with zero(0) to store the number of times a number has occurred i.e., count = 0.
Declare a temporary pointer temp of type struct node for traversing a linked list.
Take the input(a number whose occurrence is to be found) from the user and initialise that user input to variable item.
Start traversing a linked list until a number equal to item is found.
If a number equal to the item is found , then update count by 1.
After reaching the end of linked list, print count and exit the function.

C program that finds the occurrence of number in a given linked list.

#include <stdio.h>
#include <stdlib.h> 

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

void displayLL(struct node * head)
{
   int num = 0;
   struct node * temp;
   temp = head;
   temp=head;
   while(temp!=0)
   {
       printf("%d ",temp->data);
       temp = temp->next;
       num++;
   }
}

void occurrence(struct node *head)
{
   struct node *temp = head;
   int item, count = 0;
   printf("\nEnter the number whose occurrence is to find : ");
   scanf("%d", &item);

   while(temp != NULL)
   {
       if(temp->data == item)
           count++;
           temp = temp->next;
   }
   printf("Occurrence of number  %d : %d", item, count);
}

int main()
{
   struct node *head = 0, *newnode, *temp, *slow; 
   int n, choice, newdata;

// Create Linked List //

   printf("Enter the number of nodes in the list : ");
   scanf("%d", &n);
   for(int i = 1; i<=n; i++)
   {
   newnode = (struct node *)malloc(sizeof(struct node));
   printf("Enter the data%d : ", i);
   scanf("%d", &newnode->data);
   newnode->next = 0;
   if(head == 0)
    {
        head = temp = newnode;
    } 
    else
       { 
        temp->next = newnode;
        temp = newnode;
       }
 }
   printf("--------------------------------\n");
   printf("Linked list : ");
   displayLL(head);
   occurrence(head);
}

I own a website www.coderlogs.com where in I write similar blogs so do visit the website for more such blog posts.