SDE - 1

You have been given a Binary Tree of 'n' nodes, where the nodes have integer values

Print the left view of the binary tree.

Example :

If the input tree is as depicted in the picture: 

The Left View of the tree will be:  2 35 2 

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.

A cycle occurs when a node's next points back to a previous node in the list.

Example:

In the given linked list, there is a cycle, hence we return true.

You have been given an integer array/list (ARR) of size N. You have to return an array/list PRODUCT such that PRODUCT[i] is equal to the product of all the elements of ARR except ARR[i]

 Note :

Each product can cross the integer limits, so we should take modulo of the operation. 

Take MOD = 10^9 + 7 to always stay in the limits.

Follow up :

Can you try solving the problem in O(1) space?

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

A String ‘a’ is a subsequence of a String ‘b’ if ‘a’ can be obtained from ‘b’ by deletion of several (possibly, zero or all) characters. A common subsequence of two Strings is a subsequence that is common to both Strings.

1) Why did you decide to work here? 
2) Why should we hire you? 
3) Describe your interests to me and, if you have any, ask me about them.
4) Concerns about the location of my birth 
5) Expected salary