Sponsored
Reserved space — layout preview until AdSense is connected
Python Basics
medium
Fibonacci(n)
Return the nth Fibonacci number efficiently.
recursion
dp
memoization
+15 pts
15m
Lists & Arrays
medium
Flatten nested list
Yield every integer from an arbitrarily nested list, depth-first.
recursion
generators
+25 pts
22m
Data Structures & Algorithms
medium
Quicksort
Implement quicksort and return a sorted list.
sorting
recursion
divide-and-conquer
+25 pts
25m
Data Structures & Algorithms
medium
Graph DFS
Return all nodes reachable from a start node via DFS.
graph
DFS
recursion
+28 pts
25m
Showing 4 challenges · medium