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
C++ Articles
Page 72 of 597
Count subarrays with equal number of occurrences of two given elements in C++
We are given an array arr[] of integers. Also, two numbers A and B. The goal is to count all subarrays of arr[] such that occurrences of A and B is equal in all. If the array is [1, 2, 3] and A is 1 and B is 2. Subarrays will be [3], [1, 2], [1, 2, 3].Let us understand with examples.Input − arr[] = { 2, 2, 1, 1, 1, 5 }; A=1, B=5Output − Count of subarrays with equal no. of occurrences of two given elements are − 4Explanation − Subaarays will be − [2], [2], [2, 2], ...
Read MoreCount subarrays with all elements greater than K in C++
We are given an array arr[] of integers. Also a number K. The goal is to count all subarrays of arr[] such that all elements of the subarray are greater than K or K is less than all elements of the subarrays. If the array is [1, 2, 3] and K is 1. Subarrays will be [2], [3], [2, 3].Let us understand with examples.Input − arr[] = { 2, 2, 1, 1, 1, 5 }; K=1Output − Count of subarrays with all elements greater than K are − 4Explanation − Subaarays will be: [2], [2], [5], [2, 2]. All elements ...
Read MoreCount subarrays with equal number of 1’s and 0’s in C++
We are given an array arr[] containing 0’s and 1’s only. The goal is to count all subarrays of arr[] such that occurrences of 0s and 1s is equal in all. If the array is [1, 0, 0] .Subarray will be [1, 0] only.Let us understand with examples.Input − arr[] = { 0, 0, 1, 1, 1, 0 };Output − Count of subarrays with an equal number of 1’s and 0’s are − 4Explanation − Subaarays will be −arr[0 to 3] = [0, 0, 1, 1], arr[1 to 2] = [0, 1], arr[4 to 5] =[1, 0], Arr[0 to 5] ...
Read MoreCount Subarrays with Consecutive elements differing by 1 in C++
We are given an array arr[] containing integers. The goal is to count all subarrays of arr[] such that consecutive elements in each subarray differ by 1 only. If the array is [1,2,3] .Subarrays will be [1,2], [2,3], [1,2,3] only.Let us understand with examples.Input − arr[] = { 4,3,2,1 };Output − Count of Subarrays with Consecutive elements differing by 1 is − 6Explanation − Subaarays will be −[4,3], [3,2], [2,1], [4,3,2], [3,2,1], [4,3,2,1]. Total 6.Input − arr[] = { 1,5,6,7,9,11 };Output − Count of Subarrays with Consecutive elements differing by 1 is − 3Explanation − Subaarays will be −[5,6], [6,7], [5,6,7]. Total 3The approach used in the below program is as followsWe will traverse the array using a for a loop. From i=0 to i
Read MoreCount subarrays having total distinct elements same as original array in C++
We are given an array arr[] containing integers. The goal is to count all subarrays of arr[] such that the number of distinct elements in each is the same as the number of distinct elements in the original array. If the original array is [1, 1, 2, 3] then subarrays will be [1, 2, 3] and [1, 1, 2, 3].Total distinct elements in the original array is 3. Total distinct elements in both subarrays is also 3Let us understand with examples.Input − arr[] = {1, 2, 1, 2, 3, 4, 2 };Output − Count of subarrays having total distinct elements ...
Read MoreCount subarrays consisting of only 0’s and only 1’s in a binary array in C++
We are given an array arr[] containing 0’s and 1’s only. The goal is to count all subarrays of arr[] such that each subarray contains only 0’s or only 1’s not both. If the array is [1, 0, 0] .Subarrays will be for 0’s only [0], [0], [0, 0] and for 1’s only [1].Let us understand with examples.Input − arr[] = { 0, 0, 1, 1, 1, 0 };Output − Subarrays with only 0's are : 4 Subarrays with only 1's are : 6Explanation − Subaarays will be −For all 0’s: [0], [0], [0], [0, 0]. Total 4 ( arr[0], ...
Read MoreCount sub-arrays which have elements less than or equal to X in C++
We are given an array arr[] containing integers and a variable X. The goal is to count all subarrays of arr[] such that each subarray contains only elements that are less than or equal to X. For example if array is [1, 2, 3] and X=2 then subarrays will be [1], [2] and [1, 2]Let us understand with examples.Input − arr[] = { 4, 3, 2, 1, 6 }; X=3Output − Count of sub-arrays which have elements less than or equal to X is − 6Explanation − Subaarays will be −[3], [2], [1], [3, 2], [2, 1], [3, 2, 1]Input ...
Read MoreCount rows in a matrix that consist of same element in C++
We are given a matrix consisting of integers. The goal is to find the number of rows in the matrix that have all identical elements in it.If there is 5X4 matrix as shown −15131111115323577777The answer would be 2, row 1 (having all 1’s) and row 3 (having all 7’s) contain the same element.Let us understand with examples.Input matrix = [ 1 1 1 1 ] [ 2 3 2 7 ] [ 3 3 3 3 ]Output − Count of rows in a matrix that consist of same element are − 2Explanation − Row 0 contains all 1’s ...
Read MoreCount rotations in sorted and rotated linked list in C++
We are given a linked list. The list is sorted first and then rotated by K number of nodes. The goal is to find the value of K. If we are given below linked list as input which is rotated by K number of nodes −Then original must have been −And we can see K here is 2. Input linked list is a rotation of 2 nodes in the original sorted linked list.Let us understand with examples.Input − List : 5 → 7 → 9 → 1 → 3Output Elements in the linked list are: 5 7 9 1 3Count of ...
Read MoreCount rotations divisible by 4 in C++
We are given a large number. The goal is to count the rotations of num that are divisible by 4.As the rotations can not be done again and again. We will use the divisible by 4 property. If the last two digits are divisible by 4 then the number is divisible by 4. If the number is 1234 then it’s rotations will be 1234, 4123, 3412, 2341 out of which 3412 will be divisible by 4 as the last two digits 12 is divisible by 4.Let us understand with examples.Input − num=15324Output − Count of rotations divisible by 4 are: ...
Read More