Round-1 (Online Coding Test, Platform: HackerEarth)

Round-2 (Online Interview, Platform: Google Meet): Only one DSA question was asked. The time allotted was 45 minutes.

Round-3 (Online Interview, Platform: Google Meet): Only one DSA question was asked. The time allotted was 45 minutes, followed by a 15-minute G&L round.

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′