I had got mail directly from recruiter to attempt assessment test.\n\nFollowing are questions -\n\n**Problem 1 - Easy**\nGiven n number of kids, t toys and random number d from where the distribution will start. find the last kid who will get the toy. assume kids are sitting in ascending order and in circular way.\n\nInput :\nN - The number of kids\nT - The number of toys\nD - Random number from where distribution should start\n\nExample\nN - 5, T - 2, D - 1\n\nAns for above is 2. As we will start from 1 and kid getting last toy is 2\n\n**ans = (D + T - 1) % N;**\n\n**Problem 2 - Medium**\nGiven a string \'1192\' find number of different words that can be formed. \nExample \n1192\n1,1,9,2 - aaib\n11,9,2 - kib\n1,19,2 - asb\n\nAnswer for above is **3**.\n\nSimilar problem to https://leetcode.com/problems/decode-ways/description/\n\n\nThe assessment was for 120 minutes. I was able to solve both problems in 15 minutes. What are my chances of getting interview call?

I had got mail directly from recruiter to attempt assessment test.\n\nFollowing are questions -\n\nProblem 1 - Easy\nGiven n number of kids, t toys and random n