No i mean the explanation of question 10 11 12
Btw i was getting 595 in q.6
Plz post the questions as well if possible
Could you please post your solution to the 4th problem? It would help to know better approaches 
The answers for the last question should be something like 21, 144, 154.
The expected solution was using dynamic programming :
dp[i][0] denotes number of subsequences in the first (i) indices of the string that end with “0”
dp[i][1] denotes the same for “00”
dp[i][2] denotes the same for “001”
dp[i][3] denotes the same for “0011”
What we seek is just dp[stringLength][3]
(http://pastie.org/pastes/10966296/text?key=zzyanb8jua9cfjomrklrq)
1 Like
I literally did the ditto same thing by making a dp matrice.
But because of some calculation mistake, I got the second part wrong.
Ah, that’s ok. You did exceptionally well, especially considering that you’re an 8th grader.
2 Likes
For Ques 6 is the answer 593 or 599.
I see both answers, Can someone confirm?
Most people are saying 593 although I got 599.
In what class are you in?
Yes I did.
I think you remember it wrong. I remember it as 6,7,7,8,9 and 9 the rest. The answer is 10.
Ques 1-8 are definitely correct
I also want to know that.
Send a mail to Dr Madhavan. It might help us sort things in the future. Changing comps was a problem.
Yup definitely.
You’ll definitely qualify.
You’ll probably get full.
You’re getting 55 probably.
Question edited, the answers are there.