Prime Checker

  • + 1 comment

    Nice job solving the problem. It's runtime is O(n). If you want a faster solution, see my original comment above, since it's O(n^(1/2)) runtime.

    HackerRank solutions.