Given an integer array A of size N, check if the input array can be splitted in two parts such that -

Given an integer array A of size N, check if the input array can be splitted in two parts such that -

TITLE :- Split Array PROBLEM :- Given an integer array A of size N, check if the input array can be splitted in two parts such that - - Sum ...
Read More
You have made a smartphone app and want to set its price such that the profit earned is maximised. There are certain buyers who will buy your app only if their budget is greater than or equal to your price.

You have made a smartphone app and want to set its price such that the profit earned is maximised. There are certain buyers who will buy your app only if their budget is greater than or equal to your price.

TITLE :- Maximum Profit on App PROBLEM :- You have made a smartphone app and want to set its price such that the profit earned is maximised....
Read More
Given two string s and t, write a function to check if s contains all characters of t (in the same order as they are in string t)

Given two string s and t, write a function to check if s contains all characters of t (in the same order as they are in string t)

TITLE :- Does s contain t ? PROBLEM :- Given two string s and t, write a function to check if s contains all characters of t (in the same or...
Read More
Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?

Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?

PROBLEM :- Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1? T(n) = 2T(n/2) + Logn Opti...
Read More
Which of the following operations is not O(1) for an array of sorted data. You may assume that array elements are distinct.

Which of the following operations is not O(1) for an array of sorted data. You may assume that array elements are distinct.

PROBLEM :- Which of the following operations is not O(1) for an array of sorted data. You may assume that array elements are distinct. Optio...
Read More
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is :

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is :

PROBLEM :- The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is : Options T(n) = 2T(n...
Read More