Project Euler 1 - Multiples of 3 or 5 - Solved with TypeScript

The first Project Euler problem - Multiples of 3 and 5 - is stated as follows. Find the sum of all the multiples of 3 or 5 below 1000.

function isMultiple(n:number): boolean {
    return n % 3 === 0 || n % 5 === 0;
}

function sum(previous: number, current: number): number {
    return previous + current;
}

function range(size:number):number[] {
    return [...Array.from({length: size})]
        .map((_:any, index:number):number => index + 1);
}

function solve(target: number): number {
    // Create a range between 1 and 999.
    return range(target)
        // Keep all multiples of 3 or 5.
        .filter(isMultiple)
        // Sum the remaining numbers.
        .reduce(sum);
}

solve(999);