You are viewing a single comment's thread. Return to all comments →
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.
Thank you for the help!
Prime Checker
You are viewing a single comment's thread. Return to all comments →
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.
Thank you for the help!