Algorithm

Free_Araay.js

function solution(string, n){
    var answer = [];
    var empt = []
    for(var i = 0; i < string.length; i++){
        empt[i] = string[i].charAt(n);
    }
    empt.sort();
    console.log(empt);    
    for(var i = 0 ; i < string.length; i++){
        for(var j = 0; j < empt.length; j++){
            if(string[i].charAt(n) == empt[j] && string[j] != answer[j]){
                answer[i] = string[j];
                if(string[i] != string[j] && string[i].charAt(n) == string[j].charAt(n)){
                    answer.sort();
                    break;
                }
            }
        }
    }
    return answer;
}