Please help me with sample test case how this code works.
Please answer @rishabhmahajan546
Https://hack.codingblocks.com/app/contests/16/1092/problem
Please save your code on ide.codingblocks.com and then share its link. Also mention the question name.
https://ide.codingblocks.com/s/210867 solution
https://hack.codingblocks.com/app/contests/16/1092/problem question
bhaiya while explaining give more focus on recursive function call which is made from for loop i know tail and head recursion but how to run this code manually sine it ise inside a loop
@AyushKumar9 032 hi bro,as mentioned in video by sir ,dont go deeper into calls ,just assume that recursion will give you answer of shorter problem as like in your question fir uske bad ap apna dry run kro assuming recursion ne ans la dia .To Solve any Problem related to Recursion All you need to do is Break the Problem into 3 important components which are as follows :-
Bigger Problem : The original Problem statement is your bigger problem.
Smaller Problem: In every recursive prblm there exist a prblm statement which you need to achieve in order to fullfill the prblm statement but by considering such a smaller prblm from the bigger prblm is needed which we need to assume that the recursion will work and will give the answer.
Self Work: The amount of work which one should do in order to make the smaller problem your problem.
For e.g…, In order to find the max of any array, three components will be :-
Bigger Problem : To find the max in whole array viz find max in array from index 0 to n - 1.
Smaller Problem: Assume that the recursion works and will find the max of array from index 1 to n - 1.
Self Work : In order to make your smaller prblm your bigger prblm all you need to do is to compare the ans return by assuming the smaller prblm works with the 0th index element and return the max among both of them.
For this question:
Bigger Problem : To Print all of the possible Strings from the given array that contains code generated by given number.
Smaller Problem : Assume the recursion works and will give you ans for N - 1 length of String.
Self Work : In order to make your smaller problem all you need to do is work for the 0th index element. Because it could be the part included in the answer or not. and self work is to use first character as it is and another time with the next variable.For e.g…,
In 123 either use 1 as it is or use code for 12 instead.
How is if working
Please try to explain this with a test case I understood what you said it would make my concept more clear because then code will be transparent It will help me in designing this code again if similar question is asked
https://hack.codingblocks.com/app/contests/16/1092/problem
Question link smartKey pad
uske editorial mae ek baar test case leke explain krdijye to fir similar problem milie to solve kr sakun please ap krna sample test case ke saath
aapne ek baar bubble sort algo se ek problem smhya lexographic sort krna tha vo treka kaafe easy aur simple tha
I want to run this code manually as algoritms are done
i got it myself sorry for trouble i first tried it my self yesterday . i was getting problems now i have understood your kind help made me also thinking about again and aagin and now i can run it mannualy thanks bhaiya will reach you again for help