I made the answer earlier and forgot to put it here after I solved it in CodeWars lmao JavaScript answer, Big O time complexity of O(sqrt(n)) to find if N is a Prime Number.
const isPrime = num => { for(let i = 2, s = Math.sqrt(num); i <= s; i++) if(num % i === 0) return false; return num > 1; } const numberProperty = n => [ isPrime(n), n % 2 === 0, n % 10 === 0, ];
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
I made the answer earlier and forgot to put it here after I solved it in CodeWars lmao
JavaScript answer, Big O time complexity of O(sqrt(n)) to find if N is a Prime Number.