Senior Software Engineer

You are given an integer array ‘ARR’ of size ‘N’, where ‘ARR[i]’ denotes the number of balls in the ‘i-th’ bag. You are also given an integer ‘M’, denoting the maximum number of operations you can perform on ‘ARR’ (the given collection of bags).

In each operation, you can do the following:

• Choose a bag from the collection and divide it into two new bags such that each bag contains a positive (non-zero) number of balls. Remove the chosen bag from the collection and add the new bags into the collection.

After performing the operations, let ‘X’ be the maximum number of balls in a bag. The task is to find the minimum possible value of ‘X’ and return it.

Example:

ARR = [5, 7], N = 2, M = 2

Perform the following two operations on ‘ARR’: 
1. Divide the bag with 7 balls into 3 and 4. New ARR = [3, 4, 5].
2. Divide the bag with 5 balls into 1 and 4. New ARR = [1, 3, 4, 4].

The bag with the maximum number of balls has 4 balls. Hence, the minimum possible value of ‘X’ is 4. Return 4 as the answer.

Note:

1. You can perform any number of operations between [0, M], both included.
2. Avoid using the 'Modulo' operator as it can cause Time Limit Exceeded.

1. What is immutability?
2. Is try with multiple catch allowed? Explain.
3. What is garbage collection?
4. Tell me a little about HashMaps.

I was asked to design a Vehicle parking managing app. This round revolved around designing database schemas. I was given around 20 minutes to identify the various entities involved in the system, establish the relationships between these entities and also identify the primary key - foreign key constraints. After 20 minutes, we had a good discussion on my findings and corrections with respect to certain attributes I may have missed out in my design. 
A few complex SQL queries were also asked related to the above schemas.

What has been your greatest failure?

What do you always regret?

How do you respond to change?

Your strengths and weaknesses