| ID | PROBLEM | DIFFICULTY | SOLVED | ||
|---|---|---|---|---|---|
| M121 | Factorial | Recursion | Easy | 1/1 | |
| M122 | Double factorial | Recursion | Easy | 0/0 | |
| M123 | Digit sum without loops | Recursion | Easy | 0/0 | |
| M124 | Array maximum without loops | Recursion | Easy | 0/0 | |
| M125 | Is it a palindrome | Recursion | Easy | 0/0 | |
| M126 | Integer power, negative too | Recursion | Medium | 0/0 | |
| M127 | Fibonacci and the number of calls | Recursion | Medium | 0/0 | |
| M128 | Combinations and the number of calls | Recursion | Medium | 0/0 | |
| M129 | Tower of Hanoi | Recursion | Medium | 0/0 | |
| M130 | Evaluating a bracketed expression | Recursion | Medium | 0/0 |
