Associate Software Engineer

You’re given an array 'arr' of size 'n' and an integer 'k'.

Your task is to split 'arr' into 'k' sub-arrays such that the maximum sum achieved from the 'k' subarrays formed must be the minimum possible.

A subarray is a contiguous part of the array.

Return the minimum possible value of the maximum sum obtained after splitting the array into 'k' partitions.

Example:

Input: ‘arr’ = [1, 1, 2] and ‘k’ = 2 

Output: 2

Explanation: If we want to make two subarrays, there are two possibilities: [[1], [1, 2]] and [[1, 1], [2]]. We can see that the maximum sum of any subarray is minimized in the second case. Hence, the answer is 2, which is the maximum sum of any subarray in [[1, 1], [2]].

A robot can move along the x-axis, it starts from the origin and wants to reach the ‘X’ coordinate. Find the number of moves it requires to complete the task.

In each move, it has to exactly move some units to the left/right of its current position. The number of units it moves in a move is equal to the move number. That is: it moves exactly one unit in move - 1, exactly two units in move - 2 and exactly ten units in move - 10. Find the minimum number of moves required to reach the ‘X’ coordinate. Print ‘-1’ if it is not possible to reach the location.

For Example :

If X = 6

If all three moves are taken to the right then the robot will end up at 1 + 2 + 3 = 6, so a minimum of three moves are needed.

You are given a preorder traversal of a binary search tree. Your task is to find the postorder from the preorder.

Return the root of the BST constructed from the given preorder. The driver code will then use this root to print the post-order traversal.

For example:

You are given preOrder = [10, 5, 1, 7, 40, 50], the binary search tree from the given preorder traversal is 

Hence the answer is [1, 7, 5, 50, 40, 10].

Difference between process and thread.
Scheduling Algorithms.
Deadlocks.
Semaphore and Mutex.
Static and Dynamic Binding
Page fault and Demand Paging.

Normalization and its types.
Transactions.
ACID properties of DBMS.

Given an array of numbers, find the maximum sum of any contiguous subarray of the array.

For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.

Given the array [-5, -1, -8, -9], the maximum sum would be -1.

Follow up: Do this in O(N) time.

Given a binary search tree and an integer ‘K’. Your task is to find the ‘K-th’ smallest element in the given BST( binary search tree).

BST ( binary search tree) -

If all the smallest nodes on the left side and all the greater nodes on the right side of the node current node.

Example -

Order of elements in increasing order in the given BST is - { 2, 3, 4, 5, 6, 7, 8, 10 }

Suppose given ‘K = 3’ then 3rd smallest element is ‘4’.

Suppose given ‘K = 8’ then 8th smallest element is ‘10’.

Note:

1. You are not required to print the output explicitly, it has already been taken care of. Just implement the function and return the ‘K-th’ smallest element of BST.
2. You don’t need to return ‘K-th’ smallest node, return just value of that node. 
3. If ‘K-th’ smallest element is not present in BST then return -1.

The interviewer greeted me and asked me how was my day.
It was more like a discussion rather than an Interview.
she started with the standard question, Tell me about yourself.
I had already prepared answers for 2-3 types of HR round introduction and Behavioral questions. So I was able to give him a short, precise, and to-the-point Introduction of mine.
She also asked me how much I am aware of the company like what the company does etc.
Then she moved on to the Projects that I had mentioned on my resume,
I told about 1-2 Projects which I did until now and briefly explained all of them.
Then she asked me if I had any questions for him.
I asked a few questions, and she was happy to answer.