Suppose we have an array A with n elements. Here n is even. A[i] is a number written on ith card. There are n/2 people who want to play a game. At the beginning, each player will take two cards. We have to find the way to distribute cards in ... Read More

Suppose we have two arrays A and B with n number of elements. Consider an operation: Select two indices i and j, then decrease ith element by 1 and increase jth element by 1. Each element of the array must be non-negative after performing an operation. We want to make ... Read More

Suppose we have two numbers c and d. Amal has two numbers a and b initially both are zero. Amal wants to perform some operation on them. Before performing each operation, some positive integer k is picked, which is then used to perform one of the following operations −add number ... Read More

Suppose we have a string S with n digits. A number with exactly 11 digits is a telephone number if it starts with '8'. In one operation, we can remove one digit from S. We have to check whether we can make the string a valid phone number or not.So, ... Read More

Suppose we have an array A with n elements and another list of queries Q with q queries. each Query[i] contains a pair (x, k). When we process a query, for x: decrease the value of A[x] by 1. For k, print kth largest element. Initially all elements in A ... Read More

Suppose we have two numbers l and r. There is a shop and we want to sell some food container with 'a' number of foods with a discount, and some customer wants to buy x foods. The customer following a greedy strategy −He buys floor of (x/a) packs with discountThen ... Read More

Suppose we have an array A with n elements and another number k. There are n piles of candies. The ith pile has A[i] number of candies. We can perform the operation on two indices i and j (i != j), then add another A[i] number of candies to A[i] ... Read More

Suppose we have a string S of length . Consider there are n numbers and they are arranged in a circle. We do not know the values of these numbers but if S[i] = 'E' it indicates ith and (i+1)th numbers are same, but if that is 'N' then they ... Read More

Suppose we have two arrays A and B of size n, and another number x. We have to check whether we can rearrange the elements in B, so that A[i] + B[1]

Suppose we have a number n. We have to find two composite integers (non-prime) a and b, such that a - b = n.So, if the input is like n = 512, then the output will be 4608 and 4096StepsTo solve this, we will follow these steps −print 10*n and ... Read More