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
C++ Articles
Page 152 of 597
K Inverse Pairs Array in C++
Suppose we have two integers n and k, we have to find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs. The inverse pair is for ith and jth element in the array, if i < j and a[i] > a[j] it is called an inverse pair. Here the answer may be very large, the answer should be modulo $10^{9}$ + 7.So if the input is like n = 3 and k = 1, then the output will be 2 as the arrays [1, 3, 2] and [2, 1, 3] ...
Read MoreIPO in C++
Suppose one company A wants to start its IPO soon. In order to sell a good price of its shares to B, A would like to work on some projects to increase its capital before the IPO. A has limited resources, it can only finish at most k distinct projects before the IPO. Can you help A, by designing the best way to maximize its total capital after finishing at most k distinct projects?Suppose we have several projects. For each project i, it has a pure profit Pi and a minimum capital of Ci is needed to start the corresponding ...
Read MoreRandom Pick with Blacklist in C++
Suppose we have a blacklist called B. This is holing unique integers from range [0, N), we have to define a function to return a uniform random integer from range [0, N) which is NOT in B. We will try to make this function more optimized by reducing random(). function call. Suppose the input array is likeTo solve this, we will follow these steps −Define one mapWe will initialize with N and array v.for initalize i := 0, when i < size of v, update (increase i by 1), do −if v[i] < N, then:, m[v[i]] := -1M := N ...
Read MoreRemove Boxes in C++
Suppose we have several boxes with different colors These colors are represented by different positive numbers. We can experience several rounds to remove boxes until there is no box left. In each round we can choose some continuous boxes with the same color (composed of k boxes, k >= 1), and remove them and get k*k points. So if the input is like − [1, 3, 2, 2, 2, 4, 4, 3, 1], then the output will be 21.Find the maximum points you can get.To solve this, we will follow these steps −Define a function solve(), this will take an ...
Read MoreFind K-th Smallest Pair Distance in C++
Suppose we have an integer array; we have to find the kth smallest distance among all the pairs. The distance of a pair (A, B) is actually the absolute difference between A and B. So if the input is like [1, 3, 8], then all possible pairs are [1, 3], [3, 8], [1, 8], then when k = 2, the second smallest distance is 5 (8 - 3).To solve this, we will follow these steps −n := size of nums, x := 0for initialize i := 0, when i < n, update (increase i by 1), do −x := maximum ...
Read MoreStudent Attendance Record II in C++
Suppose we have a positive integer n, we have to find the number of all possible attendance records with length n, which will be regarded as rewardable. As the answer may be very large, we will return it using mod 109 + 7.In the student attendance record the string can only contain the following three characters −'A' means absent.'L' means late.'P' means present.one attendance is treated as rewardable if it doesn't contain more than one 'A' (absent) or more than two continuous 'L' (late). So we have to find the maximum points.If the input is like 2, then the output ...
Read MoreReaching Points in C++
Suppose we have a starting points (sx, sy), and target point (tx, ty), we have to check whether a sequence of moves exists from the start point to the end point. Here move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y).So if the inputs are (1, 1) and (4, 5), then the answer will be true, this is because move (1, 1) to (2, 1), then (3, 1), then (4, 1), then (4, 5).To solve this, we will follow these steps −while tx > sx and ty > sy, do −if ...
Read MoreFind the Closest Palindrome in C++
Suppose we have a number n, we have to get the closest number that is palindrome. So the palindrome could be less than or greater than the number whose absolute difference is smaller. So if the number is like 145, then the result will be 141.To solve this, we will follow these steps −sn := size of nif sn is same as 1, then −decrease n[0] by 1 and return a string of 1s of size n[0]half_sn := (sn + 1) / 2half_val := stol(substring of n from index 0 to half_snDefine an array candidates = {10^(sn) – 1, 10^(sn ...
Read MorePreimage Size of Factorial Zeroes Function in C++
Suppose we have a function f(x), this will return the number of zeroes at the end of factorial of x. So for f(3) = 0 because 3! = 6 has no zeroes at the end, while f(11) = 2 because 11! = 39916800 has 2 zeroes at the end. Now when we have K, we have to find how many non-negative integers x have the property that f(x) = K.So if the input is like K = 2, then the answer will be 5.To solve this, we will follow these steps −Define a function ok(), this will take x,ret := 0for initialize i := 5, when i
Read MoreNon-negative Integers without Consecutive Ones in C++
Suppose we have a positive integer n. We have to find the non-negative integers less than or equal to n. The constraint is that the binary representation will not contain consecutive ones. So if the input is 7, then the answer will be 5, as binary representation of 5 is 101.To solve this, we will follow these steps −Define a function convert(), this will take n, ret := empty stringwhile n is non-zero, do −ret := ret + (n mod 2)n := right shift n, 1 timereturn retFrom the main method, do the following −bits := call the function convert(num)n ...
Read More