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
Maximum subarray (Kadane)
Find the contiguous subarray with the largest sum.
dp
arrays
kadane
+25 pts
20m
Data Structures & Algorithms
medium
Coin change (DP)
Find the minimum number of coins to make exactly the target amount.
dp
greedy
+30 pts
28m
Showing 3 challenges · medium