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
Articles on Trending Technologies
Technical articles with clear explanations and examples
C++ code to count years to reach certain rank in an army
Suppose we have an array D with n-1 elements and two values a and b. In an army, there are n ranks numbered from 1 to n. One needs D[i] years to rise from rank i to rank i+1. Amal has just reached new rank 'a' but he wants to reach rank 'b'. We have to count the number of years he will need to reach his goal.So, if the input is like D = [5, 6]; a = 1; b = 3, then the output will be 11.To solve this, we will follow these steps −n := size of ...
Read MoreC++ code to count number of unread chapters
Suppose we have an array of pairs P. Where P[i] is in the form (l, r), and have another number k. Consider we are going to read a book with n chapters. so that one page of the book belongs to exactly one chapter and each chapter contains at least one page. We have read some pages and marked the page with number k as the first page which was not read. We have to find the number of chapters we have not completely read yet. P[i] represents the chapter page numbers range.So, if the input is like P = ...
Read MoreC++ code to find sorted array with non-divisibility conditions
Suppose we have a number n. Consider we are going to form an array A with n elements. A is sorted in ascending order and all elements are distinct. For every i from 2 to n (considering array index starts from 1) A[i] is not divisible by A[i-1].So, if the input is like n = 7, then the output will be [2, 3, 4, 5, 6, 7, 8]To solve this, we will follow these steps −for initialize i := 2, when i
Read MoreC++ code to find minimum difference between concerts durations
Suppose we have three numbers a, b and c. A singer has 'a' one-minute songs, 'b' tow-minutes song and 'c' three-minutes song. He wants to distribute all songs into two concerts, such that every song should be included to exactly one concert. He wants to make the absolute difference of durations of the concerts as small as possible. The duration of the concert is the sum of durations of all songs in that concert. We have to find the minimal possible difference between the concerts durations.So, if the input is like a = 2; b = 1; c = 3, ...
Read MoreC++ code to count number of even substrings of numeric string
Suppose we have a string S with n digits. A substring of S is said to be even if the number represented by this string is also even. We have to find the number of even substrings of S.So, if the input is like S = "1234", then the output will be 6, because the substrings are 2, 4, 12, 34, 234, 1234.To solve this, we will follow these steps −a := 0 n := size of S for initialize i := 0, when i < n, update (increase i by 1), do: if S[i] mod 2 is same ...
Read MoreC++ code to find string where trygub is not a substring
Suppose we have a string S with n lowercase English letters. We have to reorder the characters in S, so that "trygub" is not a subsequence of the resulting string.So, if the input is like S = "pintontrygubabc", then the output will be "abbcginnoprttuy".StepsTo solve this, we will follow these steps −sort the array S return SExampleLet us see the following implementation to get better understanding −#include using namespace std; string solve(string S){ sort(S.begin(), S.end()); return S; } int main(){ string S = "pintontrygubabc"; cout
Read MoreC++ code to find three numbers whose sum is n
Suppose we have a number n. We are going to find three numbers a, b and c, such that a + b + c = n and none of these three numbers are multiple of 3.So, if the input is like n = 233, then the output will be [77, 77, 79]StepsTo solve this, we will follow these steps −if (n - 2) mod 3 is same as 0, then: return 1, 2, and n - 3 Otherwise return 1, 1, and n - 2ExampleLet us see the following implementation to get better understanding −#include using namespace std; void solve(int n){ if ((n - 2) % 3 == 0) cout
Read MoreC++ code to count operations to make array sorted
Suppose we have an array A with n elements (n is odd). A contains a permutation of first n natural numbers. Let there is a function f(i) this takes single argument i in range 0 to n-2, and does the operation: if A[i] > A[i+1], swap the values of A[i] and A[i+1]. We have to count number of iterations to make array A sorted, for the first time.So, if the input is like A = [4, 5, 7, 1, 3, 2, 6], then the output will be 5, because the array states after each iteration is like: [4, 5, 1, ...
Read MoreC++ code to count minimum button click to set volume as before
Suppose we have two numbers a and b. Amal always sets TV volume to 'b' value. But someday Bimal has changed it to 'a' value. The remote has six buttons (-5, -2, -1, 1, 2, 5) using them we can increase or decrease the volume by 1, 2 or 5. Volume can be very large but not negative. We have to count the number of buttons Amal needs to press at minimum to get the volume same as b.So, if the input is like a = 5; b = 14, then the output will be 3, because press +5 to ...
Read MoreC++ code to kid chair association
Suppose we have a number n. We have to find an array A of size n. There are n tables and each table has 4 chairs. Chairs are numbered from 1 to 4n. It is known that two kids who sit on chairs with numbers a and b (a != b) will indulge if −gcd(a, b) = 1 or, a divides b or b divides a.We want to seat the kids so there are no 2 of the kid that can indulge. More formally. We have to find the chair association.So, if the input is like n = 4, then ...
Read More