SDE - 1

In a chessboard(‘N’ x ‘N’) game of Angles(‘A’) and Demons(‘O’, ‘X’, and ‘Z’), various demons try to kill the angel whose aim is to get across from one end of the board to the opposite end of the board. There are 3 different devils having different powers.

Starting point of Angel can only be on the border but not the corners of the board. He will walk in a straight line(horizontal or vertical only) across the board, one cell every second.

The powers of various devils are as follows:-

OGRE(‘O’): Cannot move but he can kill with his breath. His powers change with time:

In 1st second ‘O’ can kill the angel if the ‘A’ reaches the ogre’s location.
In the 2nd second, ‘O’ can kill if ‘A’ is in 8 surrounding cells.
In 3rd second ‘O’ can kill if ‘A’ reaches the ogre’s location.
In the 4th second, ‘O’ cannot kill ‘A’ in any condition.
This sequence repeats cyclically.

XILL(‘X’): He has the power to kill an angel only if

‘A’ is the same colored cell as ‘X’.
‘X’ is only active at the time equal row number of ‘X’.

ZAHHAK(‘Z’): He leaves a poison trail and moves in the ‘Z’ shape. His first move is ‘down’ and then ‘right’ and keeps on making a trail in that order until he reaches the border. If he reacher a border, he changes his direction of movement to the opposite direction he came from. Angel coming on poison will die immediately.

You need to tell the coordinate of the cell at which the angel will die or output [-1, -1] if Angel successfully crosses the board.

EXAMPLE:

Input: 
'N' = 12
‘A’ = [12 11]
‘O’ = [3, 9]
‘X’ = [8, 4]
‘Z’ = [4, 3]

Output: [5, 11]

The Angel will be killed by the demon(‘X’) at 8th second as follows:

You are given an array/list of positive integers ‘HOUSES’ that represents the positions of 'N' different houses in Ninja’s village on a horizontal line. There is an attack by the enemy that a group of 'M' Ninjas positioned at different houses can stop as long as the houses are within their radius range. The positions of these 'M' Ninjas are given in an array/list 'NINJAS'.

Your task is to return the minimum radius standard of the defender Ninjas so that those Ninjas could defend all houses in 'HOUSES' array.

Example :

Suppose given ‘HOUSES’ is [1,2,3] and ‘NINJAS’ is [2] then
The defending radius range of the ninjas (‘NINJAS’) is 1 since there is only one ninja that is defending at position 2, and if we use the radius 1 standard, then all the houses can be protected.

Ninja has given a list of unique words 'WORDS' of size 'N' and he wants to find all the words in the list formed after concatenating two or more words in the same list.

As Ninja's best friend, he asked you to help him with the above problem. So, your task is to find all words in the list which are formed after concatenating two or more words in the same list.

Print words in any order.

Note: One word can be concatenated multiple times. It is guaranteed that there is at least one word in the list, which is formed after concatenating two or more words.

Example:

Input: 'WORDS' = ["ninjas", "coding", "codingninjas"]
Output: ["codingninjas"]

Only word "codingninjas' is formed after concatenating two or more words in the list i.e "coding" and "ninjas".

Elliot wants to build a website that will offer free hacking courses to anyone who registers. He wants to make sure that everyone who registers on his site must have a unique username. So if a user with a username ‘s’ is already registered with the system, his username will be concatenated with the smallest non-negative integer such that the new username is not present in the database.

Every time a string with the same username registers, the order of registration will be s, s0, s1, s2….. s9, s10, s11.

You are given ‘n’ usernames, for each username find the username which will be given to each user.

Note :

Initially, there are no usernames in the database. 

For Example :

Let s = {“ninjas”, “ninja”, “ninjas”, “ninjas1”}

Now In this example, first and second users are not present in the database, so they will be given the same usernames i.e. “ninjas”, “ninja”, now for the third user, “ninjas” is already present in the database, so he will be given the username “ninjas0” and for the last username, “ninjas1” is also not present in the database so he will be given the same username.

Hence the final usernames in the database will be {“ninjas”, “ninja”, “ninjas0”, “ninjas1”}.

You are given a positive integer ‘N’. Your task is to find the total number of ‘1’ in the binary representation of all the numbers from 1 to N.

Since the count of ‘1’ can be huge, you are required to return it modulo 1e9+7.

Note:

Do not print anything, just return the number of set bits in the binary representation of all integers between 1 and ‘N’.

1- Tell me about yourself.
2- Strength and weekness?
3- Why do you wants to join us?