Tip 1 : Learn and understand the deep logic
Tip 2 : Do practice as much as possible that makes you perfect and you will remember all your concepts always
Tip 3 : Practice DSA regularly
Tip 1 : Mention your key skill, don't add anything that you didn't know
Tip 2 : For fresher make it one page only
They had asked one coding question related to trees. It was scheduled on google meet making it proctored.



1. A node will be in the bottom-view if it is the bottom-most node at its horizontal distance from the root.
2. The horizontal distance of the root from itself is 0. The horizontal distance of the right child of the root node is 1 and the horizontal distance of the left child of the root node is -1.
3. The horizontal distance of node 'n' from root = horizontal distance of its parent from root + 1, if node 'n' is the right child of its parent.
4. The horizontal distance of node 'n' from root = horizontal distance of its parent from the root - 1, if node 'n' is the left child of its parent.
5. If more than one node is at the same horizontal distance and is the bottom-most node for that horizontal distance, including the one which is more towards the right.
Input: Consider the given Binary Tree:

Output: 4 2 6 3 7
Explanation:
Below is the bottom view of the binary tree.

1 is the root node, so its horizontal distance = 0.
Since 2 lies to the left of 0, its horizontal distance = 0-1= -1
3 lies to the right of 0, its horizontal distance = 0+1 = 1
Similarly, horizontal distance of 4 = Horizontal distance of 2 - 1= -1-1=-2
Horizontal distance of 5 = Horizontal distance of 2 + 1= -1+1 = 0
Horizontal distance of 6 = 1-1 =0
Horizontal distance of 7 = 1+1 = 2
The bottom-most node at a horizontal distance of -2 is 4.
The bottom-most node at a horizontal distance of -1 is 2.
The bottom-most node at a horizontal distance of 0 is 5 and 6. However, 6 is more towards the right, so 6 is included.
The bottom-most node at a horizontal distance of 1 is 3.
The bottom-most node at a horizontal distance of 2 is 7.
Hence, the bottom view would be 4 2 6 3 7
I solved it using the vector concept.
Interviewer is the director of the company. She is a very good lady and remained very polite during the whole interview.


Forgiven A = 10, B = 15 and K = 2.
12 and 14 are magical numbers because the sum of digits of 12 and 14 is a prime number, also 12 and 14 both are divisible by 2.
You have to get a magic number.
Steps:
* do the square of each digit of a number
* do the sum of all square
* divide by 9 if you will get less than 9 then return answer other wise repeat the process

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?