You are given two linked lists representing two non-negative numbers. Add the two numbers and return the sum as a linked list. The digits are stored in reverse order, and each of their nodes contains a single digit.

Given a set of coin denominations and a target amount, find the minimum number of coins needed to reach that amount. You can assume you have an unlimited supply of each coin type.