Index and Search (2021 Kakao Blind Recruitment)
Task https://programmers.co.kr/learn/courses/30/lessons/72412;
My Solution referenced from:
https://velog.io/@alvin/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4-%EB%AC%B8%EC%A0%9C%ED%92%80%EC%9D%B4-%EC%88%9C%EC%9C%84-%EA%B2%80%EC%83%89-Javascript https://12bme.tistory.com/120 function solution(info, query) { let answer = []; // store every possible combination that every info can match to let combinations = {}; const getCombinations = (arr, score, init) => { let spec = arr.join(''); let value = combinations[spec]; // add score to combination object if (value) { combinations[spec].push(score); } else { combinations[spec] = [score]; } // recursive function, to loop through every possibility for (let i = init; i < arr.