SDE - 1

You are given a tree having ‘N’ nodes, where each node has some coins ‘C[i]’, attached to it.

You are allowed to collect the coins from any node. Your task is to maximize the sum of chosen coins given that you cannot choose coins from adjacent nodes(i.e., nodes which are directly connected by an edge).

You have been given a Binary Search Tree and two keys 'NODE1' and 'Node2' in it.

Your task is to find the shortest distance between two nodes with the given two keys. It may be assumed that both keys exist in BST.

Example:

For the above BST:
‘NODE1’ = 6, ‘NODE2’ = 14

Distance between 6 and 14 = (Number of nodes in the path from 6 to 14) + 1.
So the path from 6 to 14 is : ( 6 -> 3 -> 8 -> 10 -> 14).

Distance between 6 and 14 = 3 ( i.e. 3, 8, 10 are in path) + 1 = 4.

• What are joins?
• What is normalization?
• What are acid properties?

You have been given a non-empty grid consisting of only 0s and 1s. You have to find the number of islands in the given grid.

An island is a group of 1s (representing land) connected horizontally, vertically or diagonally. You can assume that all four edges of the grid are surrounded by 0s (representing water).

Given a binary tree. Your task is to print the bottom right view of the binary tree.

Bottom right view, on viewing the given binary tree at the angle of 45 degrees from the bottom right side.

For Example

In the above binary tree, only node { 4, 5, 6 } is visible from the bottom right only node ‘1’ and node ‘3’ are hidden behind node ‘6’.
node ‘2’ is hidden behind node ‘5’.

Given an input string (STR), print all possible permutations of the input string.

Note:

The input string may contain the same characters, so there will also be the same permutations.
The order of permutations doesn’t matter.

You have been given a binary tree of integers. You are supposed to serialize and deserialize (refer to notes) the given binary tree.

You can choose any algorithm to serialize/deserialize the given binary tree. You only have to ensure that the serialized string can be deserialized to the original binary tree.

Note :

Serialization is the process of translating a data structure or object state into a format that can be stored or transmitted (for example, across a computer network) and reconstructed later. The opposite operation, that is, extracting a data structure from stored information, is deserialization.

• Tell me about yourself
• Explain the projects mentioned in your project.
• Have you done any internships? If yes, Explain the role you fulfilled there?
• Are you open to learn new tech skills or you prefer sticking to the previous ones?
• If you are team leader, and the team is not working as expected. How will you manage the team?