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 have been given ‘K’ different arrays/lists, which are sorted individually (in ascending order). You need to merge all the given arrays/list such that the output array/list should be sorted in ascending order.

You are given a Singly Linked List of integers. You need to reverse the Linked List by changing the links between nodes.

Note :

You do not need to print anything, just return the head of the reversed linked list. 

You are given two Singly Linked Lists of integers, which may have an intersection point.

Your task is to return the first intersection node. If there is no intersection, return NULL.

Example:-

The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

He asked me to introduce myself. 

Then he asked me whether I knew OOPS concepts. 

I explained all the OOPS concepts with real time examples.

Questions Related to trees.

He asked me to write some sql queries.

 

Ninjas has been given an array. He wants to find a subarray such that the sum of all elements in the subarray is maximum.

Subarray 'A' is greater than sub-array 'B' if sum(A) > sum(B). If two sub-array have the same maximum sum, then output the subarray that has a larger length.

A subarray means a contiguous part of an array. For example, In 'arr' = [1, 2, 3, 4], [1, 2], [2, 3, 4] are the contiguous subarry but [1, 3, 4] is not a subarray.

Note:

More than one sub-array can have a maximum sum, in that case, output any.

1. Tell me about yourself.

2. Explain your project as it was mentioned in the resume.

3. Few questions from the project.

4. Questions on OOPS concepts

5. Real time examples of OOPS concepts.

6. Questions of web development (based on resume)

7. Implementation of trees

8. BFS and DFS on trees.

9. Traversals of trees.