Coding Ninjas Technical Assistant Interview Questions and Answers

MergeSort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.

• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves

To add one in a linked list, create a new node with the value 1 and add it to the end of the list.

• Create a new node with the value 1

• Traverse the linked list to reach the last node

• Set the next pointer of the last node to the new node