SDE - 1

Given a password in a string, we have to determine whether the string satisfies all the conditions below: -
1 - Must contain a capital letter.
2 - Must contain a number.
3 - Must contain a special character.
4 - Must not contain the word “password” in any form.
5 - Length should be more than 7 characters and less than 31 characters.

Nobita has got math assignment to solve. In this assignment, he has to solve a mathematical equation given in the form of a string 'S'. The equation contains only ‘+’ and ‘-’ operators and a variable ‘x’. Nobita doesn’t know how to solve the equation. So, he went to Doremon for help. Doremon gives him a gadget for this. But as usual, Nobita didn’t listen to the instructions to use that gadget.

So, now it's your task to help Nobita find solutions to the given equation, or if there is no solution, report that as well.

Note :

If there is no solution for the equation, return "No solution.”

If there is only one solution for the equation, return that solution for ‘x.’

If there are infinite solutions for the equation, return "Infinite solutions.”

‘x’ may or may not have coefficients associated with it.

‘+’, ‘-’, and ‘x’ can occur any number of times in the equation.

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

The students of Ninjaland are going through tough practice, so some of them are a little irritated and angry. So, In a classroom, if two sad angry students sit adjacent to each other, they are likely to fight.

There are ‘N’ seats in the classroom. How many distinct arrangements of students can sit in these ‘N’ seats such that no students are likely to fight. As the number of such arrangements can be very large.Return answer % (10^9 +7).

For Example

For the given if N = ‘3’, the possible number of arrangements is 5.
They are ‘000’,’101’, ‘001’,’100’ and ‘010’. Here 1 represents an Angry student and 0 represents a normal student.