DSA in TypeScript

find_nth_prime.ts

function isPrime(n: number): boolean {
    if (n <= 1) return false;
    for (let i = 2; i <= Math.sqrt(n); i++) {
      if (n % i === 0) return false;
    }
  
    return true;
  }

function getFirstNPrimeNumbers(n: number): number[] {
  const result: number[] = [];
  let count = 1;
  while (result.length < n) {
    if (isPrime(count)) {
      result.push(count);
    }
    count++;
  }

  return result;
}


console.log(getFirstNPrimeNumbers(5));
console.log(getFirstNPrimeNumbers(3));
console.log(getFirstNPrimeNumbers(20));