C#

In array A, there are prices for N items. There are K coupons that reduce the item's price by X. If t coupons are applied to an item with price a, its final cost will be max(a - t*X, 0). Return the minimum amount of money needed to buy all items. A = 8, 3, 10, 5, 13 K = 4 X = 7 result=12 --- Given an array a of n positive integers, are there three distinct indices i, j, k such that the sum a[i]+a[j]+a[k] ends with the digit m? For example, for m = 3 solve([20, 22, 19, 84]) => true // 20 + 84 + 19 = 123 solve([1,2,3]) => false

Given an array A of N positive numbers, are there three different indices i, j, k such that the sum A[i] + A[j] + A[k] ends with the digit M?

The interview will last 1 hour, with live coding. Connect from a computer with video for convenience.