Associate Software Engineer

You are given 'N' stones labeled from 1 to 'N'. The 'i-th' stone has the weight W[i]. There are 'M' colors labeled by integers from 1 to 'M'. The 'i-th' stone has the color C[i] which is an integer between 1 to 'M', both inclusive.

You have been required to fill a Knapsack with these stones. The Knapsack can hold a total weight of 'X'.

You are required to select exactly 'M' stones; one of each color. The sum of the weights of the stones must not exceed 'X'. Since you paid a premium for a Knapsack with capacity 'X', you are required to fill the Knapsack as much as possible.

Write a program to calculate the best way to fill the Knapsack - that is, the unused capacity should be minimized.

1. OSI layers along with functions of each layer.
2. Differentiate between TCP and UDP.
3. DNS.

The interview started by greeting each other and followed by which the panelist asked me to introduce myself. I also mentioned my hobbies in my introduction. So we had a good discussion on it as well. The panelist then gave me a situation where I was asked to design a solution.
Situation: You are given a stream of frames from a CCTV and you are supposed to detect suspicious activity. I talked about everything that I could think of at the moment. The panelist then asked what could be the most difficult thing in designing the solution.
The following questions were discussed in the interview.
1. What are you most inclined to from Platform Engineering, Software Development, and Data Engineering, and why?