SDE - 1

You are given an N x N matrix 'MAT' of positive integers, where every row and column is sorted in non-decreasing order.

Your task is to return a list containing all elements of the matrix in sorted order.

For example :

If the matrix is:

10 20 30 40
15 20 35 42
27 29 37 46
32 33 38 49

The output will be the elements of matrix in sorted order:
10 15 20 20 27 29 30 32 33 35 37 38 40 42 46 49

Follow Up:

Can you solve this in O((N ^ 2) * log(N)) time and O(N) space complexity?

Spider Man needs to retrieve a secret file stored in the computer of Dr. Octavius. He finds a clue to the password, but since he is running short on time, he asks you for help. Following is the clue provided-

Given ‘N’ DIGITS valued from 0 to 9, the password is the minimum possible sum of two numbers formed by using all the DIGITS only once.

For example - For DIGITS = [4, 3, 2, 7, 1, 9], the minimum sum is 385 which is obtained by adding numbers 137 and 249.

Can you help Spider Man find the password?

Note - The number of DIGITS is always greater than or equal to 2. Hence, the answer will always exist.

There are two jugs, each of 4 and 3 liters respectively, without any measuring marks. How many minimum steps are required to have 2 liters of water into the 4 litre jug? (the jugs can be filled any number of times with water, and they can be emptied any number of times).

1. Which sorting algorithm do you like and explain it

2. What’s the difference between merge sort and quick sort and their use cases?

What is thread in OS?

Is the node multithreaded? 

What is IPC? What are the different IPC mechanisms?

What is virtual memory?

What are your strengths and weaknesses?

How to tackle pressure during work?

Why should we hire you?