Merge Sort Based Practice Problems Last Updated : 15 Nov, 2024 Summarize Suggest changes Share Like Article Like Report Problems Based on Merge of Merge SortMerge Two Sorted ArraysMerge Two Sorted Arrays with O(1) SpaceUnion of Two Sorted ArraysIntersection of Two Sorted ArraysMerge Two Sorted Linked ListsProblems based on Merge SortSort when two Halves are SortedCounting InversionsClosest Pair of PointsSurpasser Counts in an ArrayIterative Merge SortMerge Sort on Linked ListMerge Two BSTsSubstrings with more 1s than 0sMerge K Sorted ArraysExternal Sorting Advertise with us Next Article Intuit Interview | Set 2 (On-Campus) K kartik Follow Similar Reads Merge Sort Interview Questions and Answers Merge sort is defined as a sorting algorithm that works by dividing an array into smaller subarrays, sorting each subarray, and then merging the sorted subarrays back together to form the final sorted array. Let us discuss some of the interview questions asked about Merge Sort: 1. Is Merge sort In P 4 min read Merge details of students (Merging Details) Bob, a teacher of St. Joseph School given a task by his principal to merge the details of the students where each element details[i] is a list of strings, where the first element details[i][0] is a name of the student, and the rest of the elements are emails representing emails of the student. Two d 9 min read Can we improve the performance of a merge sort algorithm? The merge sort, in essence, is a divide-and-conquer algorithm. It breaks down a problem into multiple sub-problems, solves each individually, and finally combines these sub-problems solutions to form the final solution. The key operation in merge sort is the merging step. This step is where the algo 9 min read Intuit Interview | Set 2 (On-Campus) Round One (Written round, 60 minutes): 1. Given an unsorted linked list, remove all duplicates without using temporary buffers. 2. A number starting from 1 can be got by either multiplying 3 or adding 5 to it. Given a number, find the sequence of operations to get it or say it's not possible. e.g: 1 3 min read Accolite Interview Experience | Set 6 (On-Campus) Round 1(Written): There was a technical online test in the first round. 20 questions were to be done in 30 minutes.Questions were basically from data structures, DBMS, operating systems. There was a negative marking of 0.5. After this, 10 students were shortlisted. Round 2(Technical) (2 hours): 1. I 2 min read Accolite Interview Experience | Set 10 (On-Campus) Accolite Software visited our campus. Firstly, they presented a pre-placement-talk where they talked about their work culture, their biggest clients, their intra, fests, etc. The work life aspect was discussed too. Following this, they conducted Online test for 30 min that included MCQ questions fro 6 min read Article Tags : Sorting DSA Arrays Merge Sort array-merge +1 More Practice Tags : ArraysMerge SortSorting Like