Zepto SDE OA Questions and Solutions | A Sum of Coins & Minimize Path Value

Problem 1 - A Sum of Coins Problem Statement You have N coins whose face values are sequentially numbered from 0 to N - 1. Your friend wants to borrow exactly K coins. A selection of coins is considered useful if the sum of the selected coin values is divisible by M. Your task is to determine the total number of unique ways to choose exactly K coins such that the resulting sum is divisible by M. Since the answer ...