Software Engineer

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.

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

You are given a connected, undirected graph with ‘V’ vertices and ‘E’ edges.

You are provided with two vertices, ‘src’ and ‘dest’. Your task is to return the shortest distance between the given vertices ‘src’ and ‘dest’.

For Example:

For the given graph,
The shortest distance between 1 and 3 is 2 (via 1 <-> 2 <-> 3). Hence, the answer is 2.

You are given a 2D integer array points where points[i] = [xstart, xend] represents the horizontal diameter of a spherical balloon. You are shooting arrows vertically upwards from the x-axis.

An arrow shot at position x on the x-axis will burst any balloon whose xstart <= x <= xend. A single arrow can burst multiple balloons if their horizontal diameters overlap with the arrow's path.

Your task is to find the minimum number of arrows that must be shot to burst all the balloons.

In the assignment, I was asked to attend a pen-and-paper round that included easy to medium-level questions such as BFS and DFS, along with other easy-level problems and five aptitude questions, including train and clock problems.

I was asked how I manage deadlines, handle work pressure, and how I am different from other applicants in the room.