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
Queries for counts of multiples in an array in C++
In this problem, we are given an arr[] and Q queries each consisting of a value m. Our task is to create a program to solve the Queries for counts of multiples in an array in C++.Problem DescriptionFor solving the queries, we need to count all the numbers that are multiples of m. For this we will check for elements divisible by m.Let’s take an example to understand the problem, Input:arr[] = {4, 7, 3, 8, 12, 15}Q = 3 query[] = {2, 3, 5}Ouput:3 3 1ExplanationQuery 1: m = 2, multiples in the array = 4, 8, 12. Count ...
Read MoreQueries for counts of array elements with values in given range in C++
In this problem, we are given an array arr[] and Q queries, each can be one of the two types, {1, L, R}− For the count of array elements in the range [L, R].{2, index, val}− For updating the element at index with val.Our task is to create a program to solve the Queries for counts of array elements with values in given range in C++.Let’s take an example to understand the problem, Input:arr[] = {1, 5, 2, 4, 2, 2, 3, 1, 3}Q = 3Query = { {1, 4, 8}, {2, 6, 5}, {1, 1, 4}}Ouput:3 7ExplanationQuery 1: count ...
Read MoreQueries for maximum difference between prime numbers in given ranges in C++
In this problem, we are given Q queries that consist of two values L and R. Our task is to create a program to solve Queries for maximum difference between prime numbers in given ranges in C++.Problem description: Here, in each querry, we are given two values L and R. We have to find the maximum difference i.e. the difference between the largest and the smallest prime numbers within the given range.Let’s take an example to understand the problem, InputQ = 2 2 45 14 16 41 0OutputExplanationFor query 1, the smallest prime number within the given range is 2 ...
Read MoreQueries for decimal values of subarrays of a binary array in C++
In this problem, we are given a binary array bin[] and Q queries each consists of two values L and R. Our task is to create a program to solve queries for decimal values of subarrays of a binary array in C++.Problem description − Here to solve each query, we will have to find and print the decimal number which is created by the subarray starting from L to R i.e. subarray[L...R].Let’s take an example to understand the problem, Inputbin[] = {1, 1, 0, 0, 1, 0, 1, 0, 0, 0} Q = 2 2 5 0 6Output2 101ExplanationFor query ...
Read MoreQueries for frequencies of characters in substrings in C++
In this problem, we are given a string. And Q queries each has two integers l and r and character ch. our task is to create a program to solve the queries for frequencies of characters in substrings in C++.Problem description: Here for each querry, we will find the frequency of occurrence of the character ‘ch’ in the substring str[l...r].Let’s take an example to understand the problem, Inputstr = “tutorialspoint” Q = 2 0 6 t 5 13 iOutput2 2ExplanationFor query 1 − the substring is “tutoria”, the character t appears 2 times.For query 2 − the substring is “ialspoint”, ...
Read MoreWrite a C program that displays contents of a given file like 'more' utility in Linux
Here, we will write a C program that will display the contents of a file page by page as displayed in Linux using the more command.This program will show a specific number of lines on the screen first and then wait for the user to hit enter to move to the next page i.e. next set of n lines.For displaying the content of the file like this we will open the file and print its contents. And maintain a counter for new lines in the file. When this counter reaches n, we will read a key pressed by the user ...
Read MoreQueries for number of distinct elements in a subarray in C++
In this problem, we are given an array arr[] of size n. And Q queries, each consisting of two elements l and r. Our task is to create a program to solve Queries for number of distinct elements in a subarray in C++.Problem description − Here for each querry, we need to find the total number of distinct integers in the subarray starting from arr[l] to arr[r].Let’s take an example to understand the problem, Inputarr[] = {5, 6, 1, 6, 5, 2, 1} Q = 2 {{1, 4}, {0, 6}}Output3 4ExplanationFor querry 1: l = 1 and r = 4, ...
Read MoreWord Abbreviation in C++
Suppose we have an array of n unique strings, We have to generate minimal possible abbreviations for every word following rules below.Starting with the first character and then the number of characters abbreviated, which followed by the last character.If we find any conflict and that is more than one words share the same abbreviation, a longer prefix can be used instead of only the first character until making the map from word to abbreviation become unique.When the abbreviation doesn't make the word shorter, then keep it as original.So, if the input is like ["like", "god", "internal", "me", "internet", "interval", "intension", ...
Read MoreRotation of a point about another point in C++
Rotation of a point X about origin is by an angle θ in anti-clockwise direction is done by − X by θ about origin anti-clRotateockwise: X*polar( 1.0, θ ).Here, the function polar for complex numbers is defined under header file and is used to find a complex number using phase angle and magnitude. polar(mag, angle) returns a complex number.Rotation of point X about a point YTo rotate a point about another point, we will use translation in which movement of all coordinates occur in a particular direction.Steps to rotate X about Y.Translate X to Y, so Y becomes the new ...
Read MoreQueries for number of distinct elements in a subarray | Set 2 in C++
In this problem, we are given an array arr[] of size n and we are given a query. Each query contains two values (L, R). our task is to create a program to solve queries for number of distinct elements in a subarrayProblem description − Here, we will need to find the total number of distinct integers that are present in the subarray from the index (L-1) to (R-1).Let’s take an example to understand the problem, Inputarr[] = {4, 6, 1, 3, 1, 6, 5} query = [1, 4]Output4ExplanationFor query 1: L = 1 & R = 4, we need ...
Read More