Software Engineer

Given an array arr of length N consisting of positive and negative integers, return the length of the longest subarray whose sum is zero.

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.

Why is multiple inheritances not supported in Java?
What is multithreading?
What are Java Applets?

You are given an array/list of words ‘ARR’. Your task is to find all the words having the longest length which can be made from some other words on the list.

Note :

Return the list of all those words sorted in alphabetical. Return an empty list in case there are no such words

For Example :

Input: cat, banana, dog, nana, my, walk, walker, baby, dogwalkers, s, babymybaby

Output: babymybaby dogwalkers

Here in the given list of words, you can see that the words babymybaby, dogwalkers contain the words present in the list i.e. ‘s’, 'dog’, ‘walker’,‘baby’ and ‘my’ and both are of the same length.

You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a square matrix of order 'N' * 'N' where the cells with value 0 represent the maze’s blocked locations while value 1 is the open/available path that the rat can take to reach its destination. The rat's destination is at ('N' - 1, 'N' - 1). Your task is to find all the possible paths that the rat can take to reach from source to destination in the maze. The possible directions that it can take to move in the maze are 'U'(up) i.e. (x, y - 1) , 'D'(down) i.e. (x, y + 1) , 'L' (left) i.e. (x - 1, y), 'R' (right) i.e. (x + 1, y).

Note:

Here, sorted paths mean that the expected output should be in alphabetical order.

For Example:

Given a square matrix of size 4*4 (i.e. here 'N' = 4):
1 0 0 0
1 1 0 0
1 1 0 0
0 1 1 1 
Expected Output:
DDRDRR DRDDRR 
i.e. Path-1: DDRDRR and Path-2: DRDDRR

The rat can reach the destination at (3, 3) from (0, 0) by two paths, i.e. DRDDRR and DDRDRR when printed in sorted order, we get DDRDRR DRDDRR.

You have a glass of tomato soup. You have one other empty glass of a different size and shape. You have to give the soup to two children. How would you divide the soup into two glasses so that both of them are satisfied that they have got an equal share of soup?

At which moment you made your parents proud?
What is the difference between Ambition and Goal?
Why should we hire you?