Author name: Amlendra

In this article, I will discuss how to rotate a linked list by its n node. That means if an existing linked list is 1->2->3->4->5 and a user-entered 2 then the linked list should be modified to 3->4->5->1->2. Note: The value of n should be less than the length of the linked-list. Steps to rotate […]

In C language, we can also create a generic linked list using the void pointer. Generic linked list means that it can store any data type as per the requirements. The most important thing about the void pointer, it can store the address of any data type. Means that the programmer can store the address

Like C++, in C language we cannot create a member function in the structure but with the help of a pointer to a function, we can provide the facility to the user to store the address of the function. A user can use this structure to store the address of a function using the function

In this article, we will see how to reverse a linked list in C. For Example, Input : 10->20->30->NULL Output : 30->20->10->NULL   We can reverse the linked list using two approaches. Iterative method Recursive method Iterative method This is the simplest way to reverse  linked list, in which we iterate a loop throughout the linked list

In my previous article, I have discussed the introduction of linked list and linked list insertion. In this article, we will see how to delete a node from the existing linked list. Delete a Node: There are three ways to delete a node from the linked list. It depends on the user requirements. Delete a

In my previous article, I explained the basic concepts of a linked list along with its advantages and disadvantages. In this article, I will show you how to insert a new node into an existing linked list. Earlier, I shared an example where I created a linked list with four nodes. While that example was

A linked list in C is an example of a linear data structure that stores data dynamically using structures and pointers. It allows data to be stored at runtime by dynamically creating new memory locations. Unlike arrays, linked lists do not require a contiguous block of memory. Instead, nodes are connected using pointers. In simpler

In the C function pointer is used to resolve the run time-binding. A function pointer is a pointer that stores the address of the function and invokes the function whenever required. I have already written an article that explains how is the function pointer work in C programming. If you are the then it is

We can find the largest and second largest number of an integers array using the c language. This question is also important and asks by the interviewer in an interview. Let’s take an example, suppose there are an integer array iaData of 5 integers. int iaData[5] = {3, 5, 123, 6, 1}; Here the largest

We can find the smallest and second smallest element of an integers array using the c language. This question is also important and asks by the interviewer in an interview. Let’s take an example, suppose there are an integer array iaData of 5 integers. int iaData[5] = {3, 5, 123, 6, 1}; Here the smallest