Python coding challenges: "recursion"

All Easy Medium Hard

All Python Basics Strings & Text Lists & Arrays Dicts & Sets Functions & Closures OOP & Classes Data Structures & Algorithms Advanced Python Iterators & Generators Decorators & Context Managers Error Handling & Exceptions Regular Expressions Math & Number Theory Bit Manipulation Dynamic Programming Trees & Binary Trees Graphs & Graph Algorithms Recursion & Backtracking Greedy Algorithms Binary Search Two Pointers & Sliding Window Stacks & Queues Heaps & Priority Queues Linked Lists Matrix & 2D Arrays Datetime & Time Calculations Data Formats & Parsing SQL & SQLite Numpy & Vectorized Computing Cryptography & Hashing

Lists & Arrays easy

Sort List Merge Sort

Write a function that sorts a list of integers using the merge sort algorithm.

merge sort sorting recursion

+10 pts 15m

Lists & Arrays easy

Flatten Multidimensional Lists

Write a function that flattens arbitrarily nested lists of integers into a single list.

recursion nested-lists flatten

+10 pts 15m

Showing 1–2 of 2 challenges · easy · Lists & Arrays

Lists & Arrays — Python coding challenges

What you will find here

This page lists lists & arrays challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.

Challenges vs tutorials and quizzes

Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.

Python Coding Challenges

Sort List Merge Sort

Flatten Multidimensional Lists

Lists & Arrays — Python coding challenges

What you will find here

Challenges vs tutorials and quizzes

Python Coding
Challenges