SDE - 1

Ninja is given a binary number as a string ‘S’ of size ‘N’, he is asked to convert it into its decimal equivalent (as an Integer) and print it.

Note:

A binary string is a string in which all characters are either ‘1’ or ‘0’.

Ninja has been given ‘N’ stars. Ninja has to make a triangle using these stars. The ‘i’th’ level of a triangle contains a ‘i’ number of stars.

Can you help Ninja to make a triangle as large as possible using these stars?

For example:

Let the number of stars is 6.

Then we can make a triangle of maximum height 3.

Note:

If the number of stars is 7 in the above example, then also the maximum height of the triangle is 3. This is because to make a triangle of height 4 we need at least 10 stars. So in this case (N = 7) to we will return 3.

I was given two tables one was employee table and other was a department table. On basis of these tables I was asked few questions :-
1. Write a query to find the max salary of any employee .
2. Write a query to find the max salary of any employee in all the department , grouped by department .
3. Write a query to find all the departments where sum of salaries of the employees is less than a particular sum.
4. Write a query to find all the departments where total number of employees is less than 3.
5. Write a query to select all the salaries of the employees grouped by department where the departments were arranged based on the sum of the salaries in that department.