“Insert Node at the Beginning of the Linked List” is the very basic problem of linked list for beginners. Here, the new node of the linked list is added before the head of the linked list and the new node will then become new head of the linked list. Example:...
Both Linked list and Arrays are linear data structure used to store data. The major difference between array and linked list lies in the structure of the array and linked list and how data is stored in both of them. Related Posts: Introduction to Linked List Insert a New Node...
Introduction to Linked List: Linked list is a linear data structure used to store data. Each element of linked list is stored in the form of node. A node is a collection of two fields: data and a pointer. A data part is used to store data and a pointer...
“Sort an Array of 0s and 1s” is one of the favorite technical interview problem of array data structure. Here, we are given an array of size ‘n’ and our task is to sort this array. Array contains only 0s and 1s. Example: INPUT: Arr[5] = {1, 0, 1, 0,...
“Find mean of an Array” is a basic problem of array data structure. Here, we are given an array of size ‘n’ and our task is to find and print the mean of the array. Mean of an array = (sum of all the elements of the array) / n....
“Find Majority Element of an Array” is one of the most favorite technical interview problem based on array data structure. Here, we are given an array of size ‘n’ and our task is to find the majority element of the array. If there is no majority Element, print a message...
“Find Equilibrium Index of an Array” is one of the favourite technical interview problem based on array data structure. Here, we are given an array of size ‘n’ and our task is to find equilibrium index of an array. Equilibrium index of an array is that index of array where...
“Print Kth Smallest and Kth Largest Element of an Array” is again a basic problem of array data structure. Here, we are given an unsorted array of size ‘n’ and our task is to print kth smallest and kth largest element of an array, where k<=n. Example (Print Kth Smallest...
“Print all Subarray of Given Array” is an important problem to understand the concept of subarrays of arrays. Here, we are given an array of size ‘n’ and our task is to print all subarray of the given array. Example (Print all Subarray of Given Array): INPUT: Arr[4] = {11,...
“Swap Kth Element from Beginning with Kth element from end” is a basic problem of array data structure. Here, we are given an array of size ‘n’ and our task is to swap kth element from beginning with kth element from end, where (k<=n). Example (Swap Kth Element from Beginning...