Coders Crushby Napplied AI
Back to DSA Problems
MediumDynamic Programming

Coin Change II

Number of ways to make amount

Solution Approach

DP unbounded knapsack

Complexity Analysis

Time Complexity

O(n*m)

Space Complexity

O(n)
Complexity
Time:O(n*m)
Space:O(n)
Asked at
GoogleAmazon
Coders Crushby Napplied AI

The ultimate interview preparation platform. Master System Design, DSA, and tackle community challenges to crush your FAANG interviews.

Looking for jobs? Visit Napplied AI Jobs Search Agent

System Design

  • All Problems
  • Easy
  • Hard

DSA

  • All Problems
  • Dynamic Programming
  • Graphs

More

  • Problems Arena
  • Growth Paths
  • My Crush

Coders Crush by Napplied AI - Tech Interview & Coding Should Be Effortless