Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Server Side Programming Articles
Page 1760 of 2109
C++ code to process query operation on binary array
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 is either 0 or 1.So, if the input is like A = [1, 1, 0, 1, 0]; Q = [[2, 3], [1, 2], [2, 3], [2, 1], [2, 5]], then the output will be [1, 1, 1, 0]StepsTo solve this, we will follow these steps −n := size of A ...
Read MoreC++ code to check pack size can be determined from given range
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 wants to buy remaining (x mod a) foods one by one.But the customer is greedy, so if he wants to buy (x mod a) foods one by one and it happens that (x mod a) ≥ a/2, so he decides to buy the whole pack of a foods. A customer ...
Read MoreC++ code to count copy operations without exceeding k
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] (A[i] will not be reduced). We can perform this operation any number of times, but unfortunately if some pile contains strictly more than k candies we cannot perform the operation anymore. We have to find the maximum number of times we can perform this operation.So, if the input is like ...
Read MoreC++ code to check array can be formed from Equal Not-Equal sequence or not
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 are different. From S we have to check whether we can recreate the sequence or not.So, if the input is like S = "ENNEENE", then the output will be True, because we can assign values like [15, 15, 4, 20, 20, 20, 15].StepsTo solve this, we will follow these steps ...
Read MoreC++ code to check reengagements can be done so elements sum is at most x
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]
Read MoreC++ code to find composite numbers whose difference is n
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 9*n.ExampleLet us see the following implementation to get better understanding −#include using namespace std; void solve(int n){ cout
Read MoreC++ code to find maximum score we can assign to first student
Suppose we have an array A with n elements and a number m. There are n students giving an exam. The highest possible score is m. A[i] is the score of ith student. We can manipulate each students score, but the conditions must be satisfied. The score will not exceed m, all scores are integers and the average marks of all student does not change. If we want to maximize the first person's score what will be the highest possible score we can give.So, if the input is like A = [1, 2, 3, 4]; m = 10, then the ...
Read MoreC++ code to find the number of dial rotations to print a string
Suppose, we are given a rotary dial that contains all lowercase English alphabets. There is a printer attached to the dial and whichever character resides in the pointer of the rotary dial for 3 seconds, gets printed. The rotary dial initially stays at the letter 'a' and it does not reset to the initial position whenever it prints a character. We are given a string s and we have to print the given string. Whenever we move the dial to another letter, one amount of rotation takes place. We have to find out the total amount of rotations needed to ...
Read MoreC++ code to find the lamps needed to light up a floor
Suppose, there is a floor divided into a grid that has n rows and m columns. Now the floor has to be lit using lamps. A lamp, if placed at the border of two cells can light up two cells. If the lamp is placed in the vertical border, it lights up the cells to its left and right and if it is placed in the horizontal border, it lights up cells to its front and back. Given n and m, we have to find out the minimum number of lamps needed to light up the whole floor.So, if the ...
Read MoreC++ code to find out if an image is B/W or color
Suppose, we are given an image that contains n pixels. The pixels can be of the following color −'C' (cyan)'M' (magenta)'Y' (yellow)'W' (white)'G' (grey)'B' (black)The color of the i-th pixel is given in the string 'pixels'. Given the string, we have to find out if the given photograph is colorful or black and white. If it is a color photograph it will contain at least one pixel of color 'C', 'M' and 'Y' and we will print 'Color'; otherwise, it will contain pixels of color 'W', 'G', 'B' only and we will print 'BW'.So, if the input is like n ...
Read More