GIVEN AN ARRAY OF INTEGERS OF SIZE N WHICH CONTAINS NUMBERS FROM 0 TO N – 2. EACH NUMBER IS PRESENT AT LEAST ONCE. THAT IS, IF N = 5, NUMBERS FROM 0 TO 3 IS PRESENT IN THE GIVEN ARRAY AT LEAST ONCE AND ONE NUMBER IS PRESENT TWICE. YOU NEED TO FIND AND RETURN THAT DUPLICATE NUMBER PRESENT IN THE ARRAY.

Bystudyrate

Given an array of integers of size n which contains numbers from 0 to n – 2. Each number is present at least once. That is, if n = 5, numbers from 0 to 3 is present in the given array at least once and one number is present twice. You need to find and return that duplicate number present in the array.

GIVEN AN INTEGER ARRAY A OF SIZE N, CHECK IF THE INPUT ARRAY CAN BE SPLITTED IN TWO PARTS SUCH THAT –

Bystudyrate

Given an integer array A of size N, check if the input array can be splitted in two parts such that – – Sum of both parts is equal
– All elements in the input, which are divisible by 5 should be in the same group.
– All elements in the input, which are divisible by 3 (but not divisible by 5) should be in another group.
– Elements that are neither divisible by 5 nor by 3, can be put in any group.

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.

Bystudyrate

TITLE:-Maximum Profit on AppPROBLEM:- 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 will be provided with a list of size N having…