DP-2 Problem1(https://leetcode.com/problems/paint-house/) Problem2 (https://leetcode.com/problems/coin-change-2/) //problem1.java has O(m) time complexity and O(1) space complexity //problem2.java has O(mn) time complexity (m is length of coins and n is the total amount) and O(mn) space complexity