알파코드

function solution(s) {
  var answer = new Set([]);
  function dfs(curIdx, arr) {
    if (curIdx === s.length) {
      console.log(arr);
      return;
    }

    for (let count = 1; count <= 2; count++) {
      if (curIdx + count > s.length) {
        break;
      }
      let newStr = Array.from(s).slice(curIdx, curIdx + count);
      const slicedNum = Number(newStr.join(""));
      if (slicedNum > 0 && slicedNum <= 26) {
        dfs(curIdx + count, [...arr, slicedNum]);
      }
    }
  }

  dfs(0, []);

  return answer.size;
}