SDE - 1

You have been given a square array 'VEC' of integers of size 'N' rows and 'N' columns. Your task is to find the minimum sum of a falling path through the square array. The number of rows and columns in the given array will be the same.

A falling path starts at any element in the first row and chooses one element from each row. The next row's choice must be in a column that is different from the previous row's column by at most one.

Example:

VEC[][]= {{5, 10}, {25, 15}}      

All the rectangles denote the possible falling paths. The rectangle with red filler is the minimum falling path with the minimum falling path sum of 20 (5+15). 

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.

For example:

[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.

There are 'N' balls arranged in a row from left to right. Each of the balls has a colour that can be represented by a number between 1 and 10^9.

For each 'i' = 0, 1, 2.. 'N-1', the colour of the 'i-th' ball from the left is Colour 'Ai'.

Ninja can choose 'K' consecutive balls from this row. That is, he can choose an integer 'i' such that 0 <= i <= 'N - K' and get the balls 'i', 'i+1', 'i+2' … '(i+k-1)' from the left. Additionally, he can choose at most one of those 'K' balls and repaint it to a colour of his choice.

Ninja wants to get the maximum variety in colours in the selected 'K' consecutive balls, and for this, he will choose some optimal 'i'. Return the maximum possible number of distinct colours in balls he can get.

Example :

‘N’ = '6'
'K' = '3'
The next line contains 'Ai', the colour of the 'ith' ball from the left,
1 2 1 3 2 3

Assuming 0-based indexing, If Ninja gets the balls from index 2 to 4, i.e., the contiguous set {1,3,2} he will have 3 different coloured balls, which is the maximum possible answer.
He can also get the balls from index 1 to 3, i.e., the set  {2,1,3}.

You are given an array of positive integers. Find the GCD(Greatest Common Divisor) of a pair of elements such that it is maximum among all possible pairs. GCD(a, b) is the maximum number x such that both a and b are divisible by x.

For example: 
If the given array is {1, 5, 2, 3, 4}, the output will be 2 (which is GCD of 2 and 4, all other pairs have a GCD of 1)

You have been given two integers ‘NUM1’ and ‘NUM2’ as a string. Your task is to print the sum of both the numbers.

Tell me something about your projects?
Difference between SQL and NO-SQL Database?
Real life examples where we will prefer using SQL and NO-SQL Database?
How will you handle 1 million requests on your application?
Difference between http and https?
What are web sockets?
Software Development Methodologies?
Software Development Life Cycle?
Which is more important development or testing and why?
What are Deadlocks?
Necessary conditions for deadlock? Given a printer and a scanner when can deadlock occur?
Deadlock handling techniques? Which technique is used by windows OS?
How to best maintain a sorted list from a stream of integers?

At last, he asked whether I had any questions for him.

The interviewer was very friendly. He gave his introduction first and asked my introduction.
He went through my resume and asked about RazorPay API which I had used in one of my project.
What will you do if outage happens in Razorpay API?
What will you do in a situation where your colleague is taking credit of the work done by you?
How will you find the cvv of a Debit card? Basically we have to use all 3-digit numbers and check for correctness.
The interview also gave another solution and asked me to give points why my solution is better than his.
How will I create a doubly-linked list? A real life use of doubly-linked list?
Then we had a short discussion on LRU as I told him we use doubly-linked list in it.
Do you have any questions for me?