Associate Software Engineer

Note that any cell (i, j) can be reached in i+j-2 steps. Thus, only the pair (i, j) is required with i * j = N which minimizes i + j. It can be found by finding all the possible pairs (i, j) and checking them in 0(√N). To do this, without loss of generality, it can be assumed that i <= j and i <= √N. Since N = i * j >= i². So √N ≥ i² i.e. √N >= i.

Thus, iterate over all the possible values of i from 1 to √N and, among all the possible pairs (i, j), pick the lowest value of i + j - 2 and that is the required answer.

Each pattern program has two or more than two loops. The number of loops depends on the complexity of the pattern or logic. The first loop works for the row and the second loop works for the column. In pattern programs, Java for loop is widely used.

Tip 1: We can find nth salary using a general query like in MySQL: 
SELECT salary 
FROM employee 
ORDER BY salary desc limit n-1,1
Tip 2: You can solve it by nesting the queries as well on this query [select *from employee where salary=(select Max(salary) from employee);]
Tip 3: Have Basic understanding of SQL queries of CRUD operations