# 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 converting an Integer to a string in any base. Go to the editor

Click me to see the sample solution

**3.** Write a Python program of recursion list sum. 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 '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

**Getting the last element of a list:**

some_list[-1] is the shortest and most Pythonic.

In fact, you can do much more with this syntax. The some_list[-n] syntax gets the nth-to-last element. So some_list[-1] gets the last element, some_list[-2] gets the second to last, etc, all the way down to some_list[-len(some_list)], which gives you the first element.

You can also set list elements in this way. For instance:

>>> some_list = [1, 2, 3] >>> some_list[-1] = 5 # Set the last element >>> some_list[-2] = 3 # Set the second to last element >>> some_list [1, 3, 5]

Note that getting a list item by index will raise an IndexError if the expected item doesn't exist. This means that some_list[-1] will raise an exception if some_list is empty, because an empty list can't have a last element.

Ref: https://bit.ly/3d8TfFP

**New Content published on w3resource:**- Scala Programming Exercises, Practice, Solution
- Python Itertools exercises
- Python Numpy exercises
- Python GeoPy Package exercises
- Python Pandas exercises
- Python nltk exercises
- Python BeautifulSoup exercises
- Form Template
- Composer - PHP Package Manager
- PHPUnit - PHP Testing
- Laravel - PHP Framework
- Angular - JavaScript Framework
- React - JavaScript Library
- Vue - JavaScript Framework
- Jest - JavaScript Testing Framework