SDE - Intern

You are given two numbers 'A' and 'B' in the form of two arrays (A[] and B[]) of lengths 'N' and 'M' respectively, where each array element represents a digit. You need to find the sum of these two numbers and return this sum in the form of an array.

Note:

1. The length of each array is greater than zero.

2. The first index of each array is the most significant digit of the number. For example, if the array A[] = {4, 5, 1}, then the integer represented by this array is 451 and array B[] = {3, 4, 5} so the sum will be 451 + 345 = 796. So you need to return {7, 9, 6}.

3. Both numbers do not have any leading zeros in them. And subsequently, the sum should not contain any leading zeros.

You are given a binary tree with ‘N’ nodes.

Your task is to find the “Maximum Path Sum” for any path.

Note :

1. A ‘path’ is a sequence of adjacent pair nodes with an edge between them in the binary tree.
2. The ‘path’ doesn’t need to pass through the root.
3. The ‘path sum’ is the sum of the node’s data in that path. 

Ques 1 : Do you know Binary search tree.
Ques 2 : Difference between Binary Tree and Binary Search Tree.
Ques 3 : Given two words A and B, and a dictionary, C, find the length of shortest transformation sequence from A to B such that you must change exactly one character in every transformation and each intermediate word must exist in the dictionary C. You can see the problem here.
After these coding problems he starts asking from my resume.
Ques 4 : Tell me about your previous internships you have done.
Ques 5 : He asks few questions from javascripts like callbacks etc.

Ques 6 : What is SQL, what are all types of joins in SQL. What is the use of self-join in SQL?

An assignment was given to build a website with all the features and some additional requirements.

Add some new features in the project that I made.