[Programmers] 코딩테스트 입문 - 평행

https://school.programmers.co.kr/learn/courses/30/lessons/120875

프로그래머스

function solution(dots) {
    for(let i = 0 ; i < 3  ; i++){
        for(let  j = 0 ; j < 3 - i; j++) {
            const tmp1 = [dots[i], dots[i+j+1]];
            const tmp2 = dots.filter((d) => {
                return ![dots[i].join(""),dots[i+j+1].join("")].includes(d.join(""));
            });
            
            const inclination1 = Math.abs((tmp1[0][0] - tmp1[1][0])/(tmp1[0][1] - tmp1[1][1]));
            const inclination2 = Math.abs((tmp2[0][0] - tmp2[1][0])/(tmp2[0][1] - tmp2[1][1]));
            
            if(inclination1 === inclination2) {
                return 1;
            }
        }
    }
    
    return 0;
}