To understand merge sort completely you should be thorough about the concepts of recursion and the concept of divide and conquer. The basic idea is to divide the array into smaller segments recursively until there is only 1 element in each array segment.
I will list down some problems on the topic of linked lists that are commonly asked in interviews.
Important concepts to revise before trying out the problems:
Below are some of the problems based on stacks and queues. You will also find applications of stacks and queues in other sections such as Trees and Graphs.
Important Points to Remember