vertices_sorting

function getHash (v) {
    return v.x+'-'+v.y+'-'+v.z;
}

function solve(input) {
    
    var l = input.length,
        map = {};
    
    while(l--) {
        
        map[getHash(input[l])] = l;
        
    }
    
    l = input.length;
    
    while(l--) {
        
        if( map[ getHash(input[l]) ] > -1 && map[ getHash(input[l]) ] !== l ) {
            
            return true;
            
        };
        
    }
    
    return false;
    
}