# Python: Recursion - Exercises, Practice, Solution

## Recursion [ 11 exercises with solution]

[*An editor is available at the bottom of the page to write and execute the scripts.*]

**1.** Write a Python program to calculate the sum of a list of numbers. Go to the editor

Click me to see the sample solution

**2.** Write a Python program to convert an integer to a string in any base. Go to the editor

Click me to see the sample solution

**3.** Write a Python program to sum recursion lists. Go to the editor

Test Data: [1, 2, [3,4], [5,6]]

Expected Result: 21

Click me to see the sample solution

**4.** Write a Python program to get the factorial of a non-negative integer. Go to the editor

Click me to see the sample solution

**5.** Write a Python program to solve the Fibonacci sequence using recursion. Go to the editor

Click me to see the sample solution

**6.** Write a Python program to get the sum of a non-negative integer. Go to the editor

*Test Data*:

sumDigits(345) -> 12

sumDigits(45) -> 9

Click me to see the sample solution

**7.** Write a Python program to calculate the sum of the positive integers of n+(n-2)+(n-4)... (until n-x =< 0). Go to the editor

*Test Data*:

sum_series(6) -> 12

sum_series(10) -> 30

Click me to see the sample solution

**8.** Write a Python program to calculate the harmonic sum of n-1. Go to the editor

*Note*: The harmonic sum is the sum of reciprocals of the positive integers.

Example :

Click me to see the sample solution

**9.** Write a Python program to calculate the geometric sum of n-1. Go to the editor

*Note*: In mathematics, a geometric series is a series with a constant ratio between successive terms.

Example :

Click me to see the sample solution

**10.** Write a Python program to calculate the value of 'a' to the power of 'b'. Go to the editor

*Test Data* :

(power(3,4) -> 81

Click me to see the sample solution

**11.** Write a Python program to find the greatest common divisor (GCD) of two integers. Go to the editor

Click me to see the sample solution

**Python Code Editor:**

**More to Come !**

**Do not submit any solution of the above exercises at here, if you want to contribute go to the appropriate exercise page.**

Test your Python skills with w3resource's quiz

## Python: Tips of the Day

**Chunks a list into smaller lists of a specified size:**

Example:

from math import ceil def tips_chunk(lst, size): return list( map(lambda x: lst[x * size:x * size + size], list(range(0, ceil(len(lst) / size))))) print(tips_chunk([1, 2, 3, 4, 5, 6], 3))

Output:

[[1, 2, 3], [4, 5, 6]]

**Weekly Trends**- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join
- JavaScript functions Exercises
- Python Tutorial
- Python Array Exercises
- SQL Cross Join
- C# Sharp Array Exercises