Comments

How to solve $$$counting$$$ $$$problem$$$?

+1 :(

Yes you have to check the next character in the direction you are currently moving in is it '.' or not.

For reference see my solution submission

Do a dfs from (2,2) and maintain a visited 2D array and move to that neighbour whichever has atleast one cell left unvisited.You can brute force to check the row or column have any unvisited cell or not.

Can someone tell me how to solve F?

On adamantI'm adamant, AMA, 3 years ago
-6

Give me some guidance to reach CM in next 2-3 months.Whatever it takes i can it pay off!!

Yeah

Congo to you man on reaching expert. Let's talk drop me a message.

Me also Waiting for it.I think there must be system testing.

Same with me !!

166947093 this submission get accepted during test but shows runtime error in system testing at test 2. 167102391 submitted the same solution which is accepted. Now showing heavy minus in rating.