Only DSA questions were asked. Not a single question related to OS, DBMS, CNS, OOP, system design, or even your resume was asked.
So now you know what to focus on.
You are given a string S of length N, consisting of digits from ‘0’ to ‘9’.
You need to partition the string into ‘K’ substrings such that each substring starts with an even digit and ends with an odd digit. Each substring must be of length at least equal to ‘M’.
Determine the total number of ways in which you can partition the string into ‘K’ substrings. Give the answer modulo 1e9+7.
Sample: N=9, M=2, K=3, S=’454569421′
The following metrics were computed from 158 interview experiences for the Google Software Development Engineer (SDE) role in India.
Google's interview process for their Software Development Engineer (SDE) roles in India is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Google's Software Development Engineer (SDE) interview process in India.