Notes

Q.1 Input a matrix. Check if do we get the same number consecutively at least 4 times in any fashion (Vertical, Horizontal, Diagonal). Record those sets.
If we get such multiple sets then print the number which is the least one
If we get such a single set then print the same number
If we get such no set then print -1

Example1
Input m x n. Let’s take

1 3 3 3 3 9
1 6 9 2 3 9
1 2 2 5 4 9
2 2 4 5 7 9
2 4 5 6 7 2

Q.2 For a given list of numbers, find its factors and add the factors. Then if the sum of factors is present in the original list, sort it and print it. If the sum numbers are not present in original list, then return -1.

Example:
Input: 0,1,6
Factors of 0 = 0. Thus sum = 0
Factors of 1 = 1. Thus sum = 1
Factors of 6 = 1,2,3. Thus sum = 6

Output = 1,6

Q.3 Given input of array of string in format <employee name>:<employee number> separated by comas. Employee name should contain only alphabets and employee number should contain only number.
Input pattern: employeename:employeenumber, employeename:employeenumber.

You have to generate password.

Condition:
If length of employee is n and n is present in employee number, return the alphabet at position n.
If length of employee is n and n is not present in employee number, so select the number which is maximum and less than length n and return the alphabet at selected position .
If length of employee is n and n is not present in employee number, and there is not any number which is less than n, so return "X".

For example, you give input
Robert:36787, Tina:68721, Jo:56389 Output: tiX