Associate Software Engineer

You have given two positive integers N and K. Your task is to print a series of numbers i.e subtract K from N until it becomes 0 or negative then add K until it becomes N. You need to do this task without using any loop.

For Example:

For  N = 5 , K = 2 
Series = [ 5, 3, 1, -1, 1, 3, 5]

The height of a tree is equal to the number of nodes on the longest path from the root to a leaf.

You are given an arbitrary binary tree consisting of 'n' nodes where each node is associated with a certain value.

Find out the height of the tree.

Example :

Input: Let the binary tree be:

Output: 2

Explanation: The root node is 3, and the leaf nodes are 1 and 2.

There are two nodes visited when traversing from 3 to 1.
There are two nodes visited when traversing from 3 to 2.

Therefore the height of the binary tree is 2.

You have a birthday cake and have to cut it into 8 equal pieces by making 3 cuts only. How do you do it?

If you get higher packages from a company, what will you do?