Given a string, compute recursively a new string where all appearances of “pi” have been replaced by “3.14”.
PROBLEM:-Given a string, compute recursively a new string where all appearances of “pi” have been replaced by “3.14”.
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.
PROBLEM:-Given an array A of size n and an integer K, return all subsets of A which sum to K.
PROBLEM:-Given an integer array (of length n), find and print all the subsets of input array.
PROBLEM:-Given an integer array (of length n), find and return all the subsets of input array.
PROBLEM:-Given an integer sorted array (sorted in increasing order) and an element x, find the x in given array using binary search. Return the index of x.