DDeloitte | COGNIZANT | IBM | CAPGEMINIdef MathChallenge(num): coins = [1, 5, 7, 9, 11] dp = [float('inf')] * (num + 1) dp[0] = 0 for i in range(1, num + 1): for coin in coins: if i >= coin: dp[i] = min(dp[i], dp[i - coin] + 1) return dp[num] AssestSense✅ //q2 3 · 1.5K · 10:32