Grokking the Art of Recursive Problem-Solving

Demystifying Recursion

Recursion Types

Recursion vs. Iteration

Recursive Algorithm Strategies

Complexity Analysis

Intrduction

1. Basic Sum 

Solution: Basic Sum

2. Factorial

Solution: Factorial 

3. Greatest Common Divisor (GCD)

Solution: Greatest Common Divisor (GCD) 

4. Converting Decimal to Binary 

Solution: Converting Decimal to Binary 

5. Check Prime 

Solution: Check Prime 

6. Perfect Square

Solution: Perfect Square 

7. Number Frequency

Solution: Number Frequency

Coding Problems (easy)

8. Pascal's Triangle

Solution: Pascal's Triangle

9. Binary Search

Solution: Binary Search

10. Inserting a new node in a BST 

Solution: Inserting a new node in a BST

11. BST Inorder Traversal

Solution: BST Inorder Traversal

12. Merge Sort

Solution: Merge Sort

13. Quick Sort

Solution: Quick Sort

14. Depth First Search 

Solution: Depth First Search

15. Removing Nodes From Linked List

Solution: Removing Nodes From Linked List

Coding Problems (medium)

16. Fibonacci Series Using Memoization

Solution: Fibonacci Series Using Memoization

17. Good Number

Solution: Good Number

18. Split BST

Solution: Split BST

19. Pow(x,n)

Solution: Pow(x,n)

Coding Problems (hard)

Grokking the Art of Recursion for Coding Interviews

## 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:

| Input(s)    | Output(s)        | Explanation                                                                       |