Retired
Fast Prime Test (retired)
10 of 37Dingledooper
Description:
The problem is simple: Given an integer, return whether it is a prime or not.
Notes:
- There is a strict time limit on this problem, so a naive solution will not pass.
-
Constraint: The number n =>
0 ≤ n ≤ 231-1. - Python 2 is recommended over Python 3, as it is faster.
Good Luck!
Algorithms
Mathematics
Performance
Similar Kata:
Stats:
| Created | Jun 6, 2019 |
| Warriors Trained | 205 |
| Total Skips | 26 |
| Total Code Submissions | 1093 |
| Total Times Completed | 37 |
| C++ Completions | 10 |
| Java Completions | 1 |
| Python Completions | 29 |
| Total Stars | 7 |
| % of votes with a positive feedback rating | 48% of 21 |
| Total "Very Satisfied" Votes | 7 |
| Total "Somewhat Satisfied" Votes | 6 |
| Total "Not Satisfied" Votes | 8 |
| Total Rank Assessments | 21 |
| Average Assessed Rank | 5 kyu |
| Highest Assessed Rank | 3 kyu |
| Lowest Assessed Rank | 8 kyu |
