It's highly recommend trying to solve it before looking at the solution.

Brute-Force Approach

Algorithm

To sort a given linked list, we can simply create an array of all the elements of the linked list. Now, we can sort this array using any sorting technique and reassign the values of the sorted array to our linked list. This modified linked list will have all the elements in sorted order.

Create an empty array to store the node values. Iterate the linked list using a temporary pointer to the head and push the value of temporary node into the array.
Sort the array containing node values in ascending order.
Convert the sorted array back to a linked list reassigning the values from the sorted array and overwriting them sequentially according to their order in the array.