1p3a
Question
·
Dec 2025
Google 2025 L4 Software Engineer OA and Phonescreen Interview Questions
Question Details
1) Given N, M, K, there are coins valued (0 to N - 1). Calculate no. of ways to select K coins such that their sum is divisible by M. Return answer modulo 1e9 + 7. int solve(int N, int M, int K)
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Binary Tree
Graph
Sql
Strings