Welcome to part 3 of this series, Q3.Given a string, write a recursive function that checks if the given string is a palindrome, else, not a palindrome. What is Palindrome? Palindrome :- a word, phrase, or sequence that reads the same backwards as forwards, e.g. madam or nurses run. Before…

Hello, I’m back with another example to help you grasp recursion better. Question: Given N, count the number of ways in which N may be expressed as the sum of 1, 3, and 4. First and foremost, anytime we write a recursive solution, we declare our function NumberofWays(X) : This…

Recursion is the most crucial topic for a programmer. When I learned recursion for the first time it was very overwhelming for me and it made me curious like how just by function calling itself and given base condition we can solve complex problems. So today i am gonna tell…