-Given an array of length N and an integer x, you need to find and return the first index of integer x present in the array. Return -1 if it is not present in the array.First index means, the index of first occurrence of x in the input array.
Do this recursively. Indexing in the array starts from 0.

PROBLEM:- Given an array of length N and an integer x, you need to find if x is present in the array or not. Return true or false.

PROBLEM:-Given an array of length N, you need to find and return the sum of all elements of the array.

PROBLEM:-Given the code to find out and return the number of digits present in a number recursively. But it contains few bugs, that you need to rectify such that all the test cases should pass.

PROBLEM:-Given is the code to print numbers from 1 to n in increasing order recursively. But it contains few bugs that you need to rectify such that all the test cases pass.

PROBLEM:-Write a program to find x to the power n (i.e. x^n). Take x and n from the user. You need to return the answer.Do this recursively.

PROBLEM:-Tower of Hanoi is a mathematical puzzle where we have three rods and n disks. The objective of the puzzle is to move all disks from source rod to destination rod using third rod (say auxiliary). The rules are :

PROBLEM:- Given a string S, compute recursively a new string where identical chars that are adjacent in the original string are separated from each other by a “*”.

PROBLEM:-Write a recursive function to convert a given string into the number it represents. That is input will be a numeric string that contains only numbers, you need to convert the string into corresponding integer and return the answer.

PROBLEM:- Given a string, compute recursively a new string where all ‘x’ chars have been removed.