What will be the base case for this problem?
Funky Chess Board problem doubt
Hi @vishalkharwar, it solely depends on what algo you have designed to solve the problem. Base case will be the case where you will return a constant value and it will not do any more function / recursive calls.
Can you please explain the problem with sample inputs and outputs.
code-link
Can you please tell me what is wrong in this code.
Hi @vishalkharwar, can u explain ur logic first !?!
Hint: use value of squares that CAN BE visited and no. of squares ACTUALLY visited together. Just add this thing in ur code.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.