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 by Sunidhi Bansal
Page 23 of 81
Count the number of vowels occurring in all the substrings of given string in C++
Given a string str containing English alphabets. The goal is to find the number of vowels occurring in all the substrings of str. If string is “abcde” then substrings will be “a”, “b”, “c”, “d”, “e”, “ab”, “bc”, “cd”, “de”, “abc”, “bcd”, “cde”, “abcd”, “bcde”, “abcde”. The count of vowels in these substrings is 10. (a and e)For ExampleInputstr = ”aloe”OutputCount the number of vowels occurring in all the substrings of given string are: 14ExplanationThe substrings are: “a”, “l”, “o”, “e”, “al”, “lo”, “oe”, “alo”, “loe”, “aloe”. Total vowels in these are: 14Inputstr=”http”OutputCount the number of vowels occurring in all ...
Read MoreCount the number of sub-arrays such that the average of elements present in the subarray is greater than that not present in the sub-array in C++
Given an array arr[ ] of positive integers. The goal is to find the count of subarrays of arr[ ] that have an average of its elements greater than the average of the rest of the elements of arr[ ] that are not present in it.For ExampleInputarr[ ] = { 3, 2, 4 }OutputCount of number of sub-arrays such that the average of elements present in the sub−array is greater than that do not present in the sub−array are: 2ExplanationThe subarrays are − [ 3 ], [ 2 ], [ 4 ], [ 3, 2 ], [ 2, 4 ], ...
Read MoreCount of suffix increment/decrement operations to construct a given array in C++
We are given a target array arr[] containing positive integers. The goal is to construct the target array arr[] using an initial array with all 0s. The operations that can be applied on a given empty array with all 0s will suffix increment/decrement operations.If we choose any index say i, then in case of suffix increment operation we will add 1 to all elements from index i till last index.In case of suffix decrement operation we will subtract 1 from all elements from index i till last index.Let us understand with examplesInput − arr[]= { 1, 2, 3 }Output − ...
Read MoreCount the number of rectangles such that ratio of sides lies in the range [a,b] in C++.
Given sides of rectangles in and range variables first and last. The goal is to find the count of rectangles that have a ratio of their side’s length/breadth lying in the range [ first, last].For ExampleInputrec[] = { { 200, 210 }, { 100, 50 }, { 300, 190}, {180, 200}, {300, 200}} and first = 1.0, last = 1.6OutputCount of number of rectangles such that ratio of sides lies in the range [a, b] are: 4ExplanationThe sides that have ratio in the range [ 1.0, 1.6 ] are : {200, 210}, {300, 190}, {180, 200}, {300, 200}Inputrec[] = { ...
Read MoreCount of total anagram substrings in C++
We are given a string str[] as input. The goal is to count the number of anagram substrings present in str[]. Two strings are anagrams of each other if they contain the same number of characters and all characters occur in both. The order of characters can be different.“abc” is an anagram of “cba”, “bca” etc.Let us understand with examples.Input − str[] = “abccb”Output − Count of total anagram substrings are − 4Explanation − Anagrams are − (b, b), (c, c), (bc, cb), (bcc, ccb)Input − str = “aaa”Output − Count of total anagram substrings are − 4Explanation − Anagrams ...
Read MoreCount number of subsets of a set with GCD equal to a given number in C++
Given an array ar, containing positive numbers and an array GCD[] containing gcd values.The goal is to find the number of subsets of elements of arr[] that have gcd values as given in GCD[].For ExampleInputarr[] = {10, 5, 6, 3}, GCD[] = {2, 3, 5}OutputCount of number of subsets of a set with GCD equal to a given number are: 1 2 2ExplanationThe subsets with GCD equal to 2 is [ 10, 6 ]. Subsets with GCD equal to 3 is [ 3 ], [ 6, 3 ] Subsets with GCD equal to 5 is [ 5 ], [ 10, ...
Read MoreCount of triangles with total n points with m collinear in C++
We are given two variables n and m representing the number of points on a 2D plane. Out of n points, m points are collinear. The goal is to find the number of triangles that can be formed using these n points.Collinear points − The points that lie on the same line are called collinear. Points A and B are collinear.Given n=4 (A, B, C, D ) , m=2 (A, B)Number of triangles −Choosing any three points out of 4 = 4C3But collinear points cannot form triangle so remove possible triangles that will be counted above = 2C3Total triangles= 4C3 ...
Read MoreCount number of subsets whose median is also present in the same subset in C++
Given an array arr[] containing positive numbers. The goal is to find subsets of elements of arr[] such that the median of values of the subset is also present in that set.For ExampleInputarr[] = { 1, 2, 3 }OutputCount of number of subsets whose median is also present in the same subset are: 4ExplanationThe sets with their medians in that same set are: [ 1 ], median is 1 [ 2 ], median is 2 [ 3 ], median is 3 [ 1, 2, 3 ], median is 2Inputarr[] = { 4, 6, 5 }OutputCount of number of subsets whose ...
Read MoreCount pairs formed by distinct element sub-arrays in C++
We are given an array arr[] containing integer elements. The goal is to find the count of pairs that can be formed by elements of sub-arrays of arr[] such that each subarray has only distinct elements. If the array is [ 1, 2, 2, 3, 3 ] then subarrays with distinct elements only will be [ 1, 2 ] and [ 2, 3 ]. And pairs will be (1, 2) and (2, 3) hence count of pairs is 2.Let us understand with examplesInput − arr[] = {1, 2, 5, 3 }Output − Count of pairs formed by distinct element sub-arrays ...
Read MoreCount number of substrings with exactly k distinct characters in C++
Given a string str[] containing lowercase alphabets only and an integer value k. The goal is to find the number of possible substrings of str that have exactly k distinct elements.For ExampleInputstr= ”pqr” k=2OutputCount of number of substrings with exactly k distinct characters are: 2ExplanationThe substrings having exactly 2 distinct elements are: “pq”, “qr”.Inputstr= ”stristr” k=4OutputCount of number of substrings with exactly k distinct characters are: 10ExplanationThe substrings having exactly 2 distinct elements are: “stri”, “tris”, “rist”, “istr”, “stris”, “trist”, “ristr”, “strist”, “tristr”, “stristr”.Approach used in the below program is as follows −In this approach we will an array array[26] ...
Read More