You are given a string S of length N consisting of digits from ‘0’ to ‘9’. You need to partition the string in ‘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 answer modulo 1e9+7. Sample: N=9, M=2, K=3, S=’454569421′
Algorithm
WHAT"S Kernal SOM algorith
Questions on Graph and String Algorithms, Questions about CV
Given an array of integers, find the nearest smaller number for every element such that the smaller element is on left side.
How to find the 100 most frequent words in a large file. Implement an iterator.
what do you think about overtime work.
DP and GRAPH theory problems
tell me about yourself
Both interviews focussed on data structures and array/string manipulation. There was expected knowledge of time/space complexity of your code.
Viewing 1531 - 1540 interview questions