I have started and stopped DSA multiple times on arrays and Strings but this time I want to do it whatever it takes and someone from my known give me advice that if I get a good hand on recursion and backtracking then it will be easy for me to solve DSA . I know what is recursion and backtracking and I also know its steps like find base case, perform operations and call method itself , i know that much but its not enough to practice recursion , even I have solved some problems like(fibbonacci,factorial, sum of N and other basic problems) but its not enough. Can anyone tell me how to properly practice recursion, which strategy should i use, and i am ready to give how much time it may takes.