SDE - 1

You are given a 2-D matrix with 'N' rows and 'M' columns, each row of the matrix is sorted in non-decreasing order and the first element of each row is greater than or equal to the last element of the previous row. You are also given an integer ‘X’, you are supposed to find whether 'X' is present in the given matrix or not.

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.

What are the advantages of Packages in Java?

How would you differentiate between a String, StringBuffer, and a StringBuilder?

What do you understand by load balancing? Why is it important in system design?

What is Sharding?

Differentiate between ArrayList and Vector in Java.

Differentiate between HashSet and TreeSet. When would you prefer TreeSet to HashSet?

What do you understand by Latency, throughput, and availability of a system?

Why Java is platform-independent and JVM platform-dependent?

Why are Java Strings immutable in nature?

1) Why should we hire you?
2) What are your expectations from the company?
3) How was your overall interview experience?
4) What are your strengths and weakness according to you?
5) Where do you see yourself in the next 5 years?