1p3a Experience · Dec 2025

Google 2025 L4 Software Engineer OA and Phonescreen Interview Questions

SWE OA Mid

Interview Experience

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 all Google questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a candidate experience report from a google interview for a swe role (mid level) during the oa round reported in 2025.

It covers the following topics: Binary Tree, Graph, Sql, Strings .