COIN CHANGE – 2D DP VISUALIZER

Group Members: Nitharsana A, Saaniya Ashraf, Arundathi M, Sarani

Fill the DP table, then backtrack to see one optimal coin combination.

Coins: Amount:

Mode:

ModeFill DP Table

Step–

Positioni=–, j=–

Answer–

Pseudocode

Time Complexity: O(n × amount) ; n = number of coins
Space Complexity: O(n × amount)

Speed: 700 ms

Formula / explanation will appear here.