Associate Professional

You are given two matrices, ‘MATRIX1’ and ‘MATRIX2’ of size ‘M’ x ‘N’ having 0s and 1s only, where ‘0’ in the matrix represents water, and ‘1’ in the matrix represents the land. An island is a group of 1s connected horizontally and vertically. An island in ‘MATRIX2’ is considered to be good if there is an island in ‘MATRIX1’ that contains all the cells that make up this island in ‘MATRIX2’. You have the find the count of good islands.

For example :

Let ‘MATRIX1’ be : 
1 1
0 0

Let ‘MATRIX2’ be: 
1 1
0 0

All the 1s present in ‘MATRIX2’ can be considered a good island. There is 1 good island present.

You have been given an undirected, connected graph of ‘V’ vertices (labelled from 0 to V-1) and ‘E’ edges. Each edge connecting two nodes 'u' and 'v' has a weight denoting the distance between them.

Your task is to find the shortest path distance from the source node 'S' to all the vertices. You have to return a list of integers denoting the shortest distance between each vertex and source vertex 'S'.

Note:

1. There are no self-loops(an edge connecting the vertex to itself) in the given graph.

2. There are no parallel edges i.e no two vertices are directly connected by more than 1 edge.

For Example:

Input:
4 5
0 1 5
0 2 8
1 2 9
1 3 2
2 3 6

The source node is node 0.

The shortest distance from node 0 to node 0 is 0.

The shortest distance from node 0 to node 1 is 5. In the above figure, the green path represents this distance. The path goes from node 0->1, giving distance = 5.

The shortest distance from node 0 to node 2 is 8. In the above figure, the pink path represents this distance. The path goes from node 0->2, giving distance = 8.

The shortest distance from node 0 to node 3 is 7. In the above figure, the yellow path represents this distance. The path goes from node 0->1->3, giving distance = 7.

You’re given two strings, 'text' of length 'n' and 'pattern' of length 'm', consisting of lowercase characters.

Find all the occurrences of the string ‘pattern’ in ‘text’.

For each occurrence, print the index from where it starts in the string ‘text’ (1 - indexed).

Example:

Input: ‘text’ = “cxyzghxyzvjkxyz” and ‘pattern’ = “xyz”

Output: 2 7 13

Explanation: The pattern ‘pattern’ = “xyz” appears at 3 positions in ‘text’.

For a given Binary Tree of type integer and a number X, find whether a node exists in the tree with data X or not.

What do you know about us?

Where do you see yourself in next 5 years?

Will you be willing to relocate if necessary?