SDE - 1

You have been given a long type array/list 'arr’ of size 'n’.

It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.

Print the total amount of rainwater that can be trapped in these elevations.

Note :

The width of each bar is the same and is equal to 1.

Example:

Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].

Output: 10

Explanation: Refer to the image for better comprehension:

Note :

You don't need to print anything. It has already been taken care of. Just implement the given function.

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.

Details about project, questions on improvement, technologies used in project.

LLD Object oriented design of bus ticketing system.
Define and explain class diagram, data structures, functional requirements.
Optimise for efficiency.

Discuss in detail about projects worked on.
Improvements possible in project.
Design improvements on the project based on situation provided.

Why is normalization required?
What are the different types of normalization?
Which normalization type is most frequently used?
SQL query to find second highest salary.

What is multithreading?
Cache replacement algorithms.

Weaknesses/Strengths
Situatuional question: What would you do to resolve a ideological differences between two of your teammates?
Why do you want to join the company?