[Programmers] (Summer/Winter Coding(~2018)) Lv 2. 영어 끝말잇기

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

프로그래머스

 

function solution(n, words) {
    let lastWord = words[0].charAt(0),
        idx = 0;
    const from = [];

    for (const word of words) {
        if (word.charAt(0) !== lastWord || from[word])
            return [(idx % n) + 1, Math.floor(idx / n) + 1];

        lastWord = word.slice(-1);
        ++idx;
        from[word] = true;
    }

    return [0, 0];
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/12981.%E2%80%85%EC%98%81%EC%96%B4%E2%80%85%EB%81%9D%EB%A7%90%EC%9E%87%EA%B8%B0

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드