Trainee Software Engineer

You need to find max number of elements in list with out duplicates and also return sorted list with out duplicates.
Ex1:arr=[1, 22,11,22,5,6]
Output: [5, [1, 5,6,11,22]]

You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values:

Value 0 - representing an empty cell.

Value 1 - representing a fresh orange.

Value 2 - representing a rotten orange.

Every second, any fresh orange that is adjacent(4-directionally) to a rotten orange becomes rotten.

Your task is to find out the minimum time after which no cell has a fresh orange. If it's impossible to rot all the fresh oranges then print -1.

Note:

1. The grid has 0-based indexing.
2. A rotten orange can affect the adjacent oranges 4 directionally i.e. Up, Down, Left, Right.

Chose between Heap Sort and Merge Sort with reasoning. (Learn)

You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

Note :

Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.

• Explain inheritance. (Learn)
• Explain abstract class. (Learn)
• Explain the 4 pillars of OOPs. (Learn)

• What are the ACID properties? (Learn)
• Explain normal forms. (Learn)
• Explain difference between primary and foreign keys. (Learn)

Write a SQL query to find the 2nd highest salary. (Practice)

• What is the most difficult situation you faced till now?
• In depth discussion of internship experience.

• Describe a time you faced a difficult problem and how you solved it.
• Tell me about a mistake you've made and how you handled it.
• Tell me about a time you worked with others to achieve a goal.
• How did you handle a disagreement with a co-worker or a senior?