Agoda| Backend Engineer | Bangkok | Reject
Anonymous User
2031

Recruiter contacted me and scheduled for first round

First round:
Given an coins array and a value, find the minimim number of coins needed that pair up the value.
This is pretty much similar to subarray sum
https://leetcode.com/problems/minimum-size-subarray-sum/

I provided one solution using dynamic programming approach but it didn't passed few test cases.

Comments (1)