Company: Placewit
Difficulty: medium
Denominations of Coins body { font-family: Arial, sans-serif; line-height: 1.6; margin: 20px; } .problem-container { max-width: 800px; margin: 0 auto; padding: 20px; border: 1px solid #ccc; border-radius: 8px; background-color: #f9f9f9; } h1, h2, h3 { color: #333; } .problem-description, .input-format, .output-format, .constraints, .examples { margin-bottom: 20px; } .example { background-color: #fff; padding: 15px; border: 1px solid #ddd; border-radius: 5px; margin-bottom: 15px; } pre { background-color: #f4f4f4; padding: 10px; border: 1px solid #ddd; border-radius: 5px; overflow-x: auto; } .explanation { margin-top: 10px; color: #555; } Denominations of Coins Given an integer N denoting the number of different denominations of coins you have, and an integer array A of size N denoting the denomination of all coins, you have an unlimited number of coins of each denomination. Your task is to find the K-th lowest amount that can be made using these coins. Note that if there are multiple w