i have built this brute force one . let me know whether its correct or not?
Is my brute force appoach correct?
You are doing it wrong, please do see your approach once again.I am giving you a hint - It is similar to fibonacci recurrence.
F(n) = F(n-1) + F(n-2);
So the answer will follow the fibonacci series. Check with the sample output.
i want to know whether am i generating all the string of it correctly or not??
please reply am waiting
Yes the strings generated seems correct. Check it by yourself taking different inputs.
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.