[TIL] 코드카타

const solution = (t, p) => {
    let count = 0;
    for(let i=0; i<t.length - p.length + 1; i++) {
        const temp = Number(t.slice(i, i + p.length));
        if(temp <= p) {
            count++;
        }
    }
    return count;
}