Problem of the day
Tip 1 : Good Command over Data Structure
Tip 2 : Prepare Core Subjects
Tip 3 : Have at least 1 project
Tip 1 : Single Page resume with good Projects in it.
Tip 2 : Short and Crisp resume.
2 Coding Question were given to be solved in 1 hr . Both questions were medium level .
Simply try building a recursive solution first and then change it to iterative one.
This problem is recursive and can be broken into sub-problems. We start from the end of the given digit sequence. We initialize the total count of decodings as 0. We recur for two subproblems.
1) If the last digit is non-zero, recur for remaining (n-1) digits and add the result to the total count.
A naive approach is to iterate for every turn and distribute candies accordingly till candies are finished. Here Naive solution was also accepted.