Recursion Practice

Practice recursive thinking and implementation through 31 problems, ordered from REC01 to REC31.

Problems

# Problem Points AC Rate Users
1 Sum from 1 to n 100 0.0% 0
2 Sum of Squares 100 0.0% 0
3 Sum of Cubes 100 0.0% 0
4 Alternating Sum 100 0.0% 0
5 Factorial 100 0.0% 0
6 The n-th Fibonacci Number 100 0.0% 0
7 Binomial Coefficient 100 0.0% 0
8 Greatest Common Divisor and Least Common Multiple 100 0.0% 0
9 Modular Exponentiation 100 0.0% 0
10 Harmonic Sum 100 0.0% 0
11 Binary Representation 100 0.0% 0
12 Hexadecimal Representation 100 0.0% 0
13 Digit Sum 100 0.0% 0
14 Count Digits 100 0.0% 0
15 First Digit 100 0.0% 0
16 Largest and Smallest Digits 100 0.0% 0
17 Print Digits in Both Directions 100 0.0% 0
18 Sums of Even and Odd Digits 100 0.0% 0
19 All Digits Even 100 0.0% 0
20 Reduce n to 1 100 0.0% 0
21 Palindrome Array 100 0.0% 0
22 Print an Array in Both Directions 100 0.0% 0
23 All Array Elements Even 100 0.0% 0
24 Strictly Increasing Array 100 0.0% 0
25 Binary Search in a Descending Array 100 0.0% 0
26 Tribonacci Sequence 100 0.0% 0
27 Memoized Fibonacci Queries 100 0.0% 0
28 Binomial Coefficient Queries 100 0.0% 0
29 Divide-by-Three Sequence 100 0.0% 0
30 Divide-by-Four Function 100 0.0% 0
31 Generate Binary Strings 100 0.0% 0
32 First N Fibonacci Numbers 100 0.0% 0
33 Fibonacci Membership 100 0.0% 0
34 Binary Strings 100 0.0% 0
35 Combinations 100 0.0% 0
36 Permutations of 1 through N 100 0.0% 0
37 Descending AB Strings 100 0.0% 0
38 Integer Partitions 100 0.0% 0
39 Reverse Combination Rank 100 0.0% 0
40 Permutations of Distinct Characters 100 0.0% 0
41 Balanced Apple Distribution 100 0.0% 0

Comments

There are no comments at the moment.