Software Engineer

You are given two Singly Linked Lists of integers, which may have an intersection point.

Your task is to return the first intersection node. If there is no intersection, return NULL.

Example:-

The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

It was a virtual interview. This interview lasted for 45 min. The Interview started with a brief introduction from the interviewer, and then he asked me to introduce myself in brief. Then the following questions were asked:
Tell me about your project.
Tell me about your internship and the tech stack you worked on.
Asked me my favorite subjects. I answered OS and DBMS and then he asked me questions related to them.
He asked me the basics of Stack and queue.

They asked me to Introduce myself, reallocation, family background, and what Tech stack I was interested in. 

He even asked me about my internship project and whether I have a PAN card or not. 

I explained both the project to the interviewer It was a very friendly Conversation.