Read the original in CodeThat.today
Welcome back. Here is the second part of the series about the top 30 Javascript Interview Warmup Exercises. If...
Some comments have been hidden by the post's author - find out more
For further actions, you may consider blocking this person and/or reporting abuse
If you want to check whether is a number prime or not, you just have to go up to sqrt(n).
Please kindly explain
I think that in the first exercise it should be better to make a special case 2 too and then iterate from 3 incrementing 2 by 2. It shows that you don't only know how to code but basic math too ;)