# 240906

문제 : [삼총사](https://school.programmers.co.kr/learn/courses/30/lessons/131705)\
난이도 : Lv.1

## 풀이

```javascript
function solution(number) {
    let count = 0;


    for (let i = 0; i < number.length - 2; i++) {
        for (let j = i + 1; j < number.length - 1; j++) {
            for (let k = j + 1; k < number.length; k++) {
                if (number[i] + number[j] + number[k] === 0) {
                    count++;
                }
            }
        }
    }

    return count;
}
```