Coding Problems

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.

PROBLEM:-A child is running up a staircase with N steps, and can hop either 1 step, 2 steps or 3 steps at a time. Implement a method to count how many possible ways the child can run up to the stairs. You need to return number of possible ways W.

PROBLEM:-Suppose you have a string, S, made up of only ‘a’s and ‘b’s. Write a recursive function that checks if the string was generated using the following rules:

PROBLEM:- Given an integer n, using phone keypad find out and print all the possible strings that can be made using digits of input n.

PROBLEM:-Given an integer n, using phone keypad find out all the possible strings that can be made using digits of input n.

Sort an array A using Quick Sort. Change in the input array itself. So no need to return or print anything.

Sort an array A using Merge Sort. Change in the input array itself. So no need to return or print anything.