Manhattan associates Interview Question for SDE-2s
- 1of 1 vote
They conducted a hiring round and this was asked there ?- Rahul Sharma August 30, 2014 in India
Hi friends This question was asked in recent hiring challenge at hackerearth , that is over now,Please discuss your strategies.I am not able to devise algorithm please provide some hints to solve it.
Pulkit is really good at maths. Recently, he came to know about a problem on matrices. Amazed by the problem he got, he asked Ashish the same problem. Ashish also being good at maths solved the problem within 5 minutes. Now, its your time to solve the problem.
You will be given n*m binary matrix. You need to tell if it is possible to delete a column such that after deleting that column, rows of the matrix will be unique. If yes than print "Yes" else print "No".
First line contains an integer t denoting no.of test cases.
Next line contains 2 integers n and m denoting no.of rows and columns.
Next n line contains binary string of length m each.
For each test case output "Yes" or "No".
Sample Input (Plaintext Link)
Sample Output (Plaintext Link)
| Report Duplicate | Flag | PURGE
Manhattan associates SDE-2 Algorithm
Open Chat in New Window