인프런 커뮤니티 질문&답변

const sol = (arr, n) => {
  let p1 = 0,
    cnt = 0;

  while (p1 < arr.length) {
    arr.slice(p1++).reduce((acc, cur) => {
      const result = acc + cur;
      if (result === n) cnt++;
      return result;
    }, 0);
  }

  const answer = cnt;
  return answer;
};