nthPrime.js

function nthPrime(n) {
  let count = 0;
  let current = 2;
  let prime = 2;

  while(count < n){
    let isPrime = true;
    for(let i = 2; i < current; i++){
      if(current % i === 0){
        isPrime = false;
        break;
      }
    }

    if(isPrime){
      prime = current;
      count += 1;
    }

    if(current === 2){
      current = 3;
    } else {
      current += 2;
    }
  }
  return prime;
}