You are given a grid (n * m size) of numbers from 0 to 255 . and you have to find the 3 * 3 subgrid in that grid , such that it's sum is maximum . The n and m were 100 .

You are given N . 1 <= N <= 1000 you have to find the all n such that n = a^2 + b ^ 2 = c ^ 2 + d ^ 2 . and a != c && a != d && b != c && b != d . You have to return a vector of all such n.

Tips: State your assumptions before coding and clarify the constraints. Also try to communicate with interviewer throughout the interview while writing code . Also code should be with good comments and suitable variable naming . Try to solve problem within 20 to 25 minutes from code to dry run and Complexity analysis.