Senior Software Engineer

You are given a string 'str' of length 'N'.

Your task is to reverse the original string word by word.

There can be multiple spaces between two words and there can be leading or trailing spaces but in the output reversed string you need to put a single space between two words, and your reversed string should not contain leading or trailing spaces.

Example :

If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.

Indexing in DB(Learn)
Locking in DB(Learn)
Internal DS used in Mysql

You are given an array/list NUM of integers. You are supposed to rearrange the elements of NUM such that no two adjacent elements will be the same or find out if it not possible.

For example:

Input: arr[] = {1,1,1,2,2,2} 
Output: {1,2,1,2,1,2}

Note: {2,1,2,1,2,1} is also valid because there are no two adjacent elements which are the same.

You have been given a Binary Tree of integers. You are supposed to return the top view of the given binary tree.

Top view of the binary tree is the set of nodes which are visible when we see the tree from the top.

For example:

For the given binary tree

The top view of the tree will be {10, 4, 2, 1, 3, 6}.