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.
PROBLEM:-Given a string, compute recursively a new string where all appearances of “pi” have been replaced by “3.14”.
PROBLEM:-Given a string, find and print all the possible permutations of the input string.
PROBLEM:-Given a string S, find and return all the possible permutations of the input string.
PROBLEM:-Assume that the value of a = 1, b = 2, c = 3, … , z = 26. You are given a numeric string S. Write a program to print the list of all possible codes that can be generated from the given string.
PROBLEM:- Assume that the value of a = 1, b = 2, c = 3, … , z = 26. You are given a numeric string S. Write a program to return the list of all possible codes that can be generated from the given string.
PROBLEM:-Given an array A and an integer K, print all subsets of A which sum to K.