Given an unsorted linked list, how to find the minimum element? Solution Solution : For finding the minimum element in an unsorted linked list various steps to be followed - Step 1 - Firstly from the unsorted linked list just remove all the duplicates. Step 2 - Secondly we can choose any method from which we can do sorting which are using loop or using simple sorting or using the hashing method. In using loop method, two loops will be presented in which first loop picks up the elements and second loop do comparison between the elements. In using simple sorting method, first removal of duplicates then sort the linked list using merge sort method. In using hashing method, Firstly traversing of elements wiil be made from head to the end . If the element is present in hash list then remove it other than this add the element to the list. Step 3 - Finally we can get a minimum element from linked list. .