Grokking the Art of Recursion for Coding Interviews
0% completed
5. Check Prime
Problem Statement
Write a Recursive Solution to Check if a Given Number is a Prime Number or Not.
Given a positive integer, we need to determine whether it is a prime number or not. A prime number is a number greater than 1 that has no positive divisors other than 1 and the number itself.
The following table describes three example outputs for three inputs along with the description:
| <span style="white-space:nowrap">Input(s</span>) | <span style="white-space:nowrap">Output(s</span>) | Explanation |
.....
.....
.....
Like the course? Get enrolled and start learning!
Reading Progress
0%