Full Stack Engineer

Ninja is given an integer ‘N’. One day Ninja decides to do the sum of all digits and replace the ‘N’ with the sum of digits until it becomes less than 10. Ninja wants to find what will be the value of ‘N’ after applying this operation.

Help Ninja in finding out this value.

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.

Given a binary tree, convert this binary tree into its mirror tree.

A binary tree is a tree in which each parent node has at most two children.

Mirror of a Tree: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged.

Note:

1. Make in-place changes, that is, modify the nodes given a binary tree to get the required mirror tree.

Given a natural number 'N', return the sum of all proper divisors of ‘N’.

‘X’ is a proper divisor of ‘Y’ if X < Y and Y % X = 0.

Where will you see yourself in the next five years?

mongodb relations. 

How to connect relations between

2 databases in mongodb