codewars #90 Cure Cancer (6kyu)

 #90 Cure Cancer

Now you are a doctor.

You are working with a patient's body which has many cells.

The patient's body is a matrix where every row represents a cell.

Each cell contains just uppercase and lowercase letters,

and every cell in the body should be the same.

Oh no! It seems that one of the cells have mutated!

It is your job to locate the mutation so that the chemo specialists can fix it!

return the location [i,j] within the matrix...

before it's too late! :(

example:

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecadecells <- here it is! [9, 20]

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecodecells

cellscellscellscodecodecells

no bodies will have less than 3 cells.

if the diagnose was a false alarm, return an empty array.

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

class JomoPipi {
    public static int[] mutationLocation(char[][] body) {
    	Map<string, integer=""> map = new HashMap<>();
    	for (int i = 0; i < 3; i++) {
    		map.put(String.valueOf(body[i]), 1 + map.getOrDefault(String.valueOf(body[i]),0));
		}
    	
    	char [] dna = map.entrySet().stream()
    	.sorted(Map.Entry.<string, integer="">comparingByValue().reversed())
    	.findFirst().get().getKey().toCharArray();

    	for (int x = 0; x < body.length; x++) {
    		if(!Arrays.equals(dna, body[x]))
    			for (int y = 0; y < body[x].length; y++) {
    				if(dna[y] != body[x][y]) {
    					return new int [] {x,y};
    				}
				}
			
		}
    	return new int [0];
    }
}