Daffodil Software Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

2 Coding Question were given to be solved in 1 hr . Both questions were medium level .

Q1. 
Digits Decoding Problem
Ninja has a string of characters from 'A' to 'Z', encoded using their numeric values (A=1, B=2, ..., Z=26). The encoded string is given as a sequence of digits (SEQ). The task is t...read more
Ans. 
The task is to determine the number of possible ways to decode a sequence of digits back into a string of characters from 'A' to 'Z'.
• Use dynamic programming to keep track of the number of ways to decode the sequence at each position.

• Consider different cases for decoding single digits and pairs of digits.

• Handle edge cases such as '0' and '00' appropriately.

• Return the final count modulo 10^9 + 7 as the answer.
Answered by AI
Add your answer
Q2. 
Distribute N Candies Among K People
Explanation: Sanyam wishes to distribute 'N' candies among 'K' friends. The friends are arranged based on Sanyam's order of likeness. He initially distributes candies s...read more
Ans. 
Distribute N candies among K people in a specific order, incrementing by K each round until all candies are distributed.
• Distribute candies starting from 1st friend, incrementing by K each round

• If remaining candies are fewer than what a friend is supposed to receive, distribute all remaining candies to that friend

• Output the number of candies each friend ends up with at the end of distribution
Answered by AI
Add your answer