w3resource

Python Data Structures and Algorithms: Recursion - Exercises, Practice, Solution

Data Structures and Algorithms: 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 :
harmonic series
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 :
harmonic series

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.



Python: Tips of the Day

Returns a list of elements that exist in both lists, after applying the provided function to each list element of both.

Example:

def tips_intersection_by(a, b, fn):
  _b = set(map(fn, b))
  return [item for item in a if fn(item) in _b]

from math import floor
print(tips_intersection_by([2.1, 1.2], [2.3, 3.4],floor))

Output:

[2.1]