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 30 of 81
Count 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 MoreCount rotations divisible by 8 in C++
We are given a large number. The goal is to count the rotations of num that are divisible by 8.As the rotations can not be done again and again. We will use the divisible by 8 property. If the last three digits are divisible by 8then the number is divisible by 8. If the number is 1800 then it’s rotations will be 1800, 0180, 0018, 8001 out of 1800 is divisible by 8.Let us understand with examples.Input − num=15320Output − Count of rotations divisible by 4 are: 1Explanation − Rotations are −15320, 01532, 20153, 32015, 53201 Out of these, only ...
Read MoreCount Possible Decodings of a given Digit Sequence in C++
We are given a string representing a digit sequence. Each digit is decoded from 1 to 26 as English Alphabet. 1 is ‘A’, 2 is ‘B’ and so on till 26 as ‘Z’. The goal is to find the count of all possible decodings out of a given digit sequence. If the sequence is ‘123’ then possible decodings are ‘ABC’ ( 1-2-3 ), ‘LC’ (12-3), ‘AW’ (1-23). Count is 3.Let us understand with examples.Input − str[]=”1532”Output − Count of Possible Decodings of a given Digit Sequence are − 2Explanation − Possible decodings are AECB - (1-5-3-2) and OCB (15-3-2).Input − ...
Read MoreCount the number of rhombi possible inside a rectangle of given size in C++
We are given a rectangle with dimensions as height X width. The rectangle is represented on a 2D coordinate system with the left-lower corner at point (0, 0). So the goal is to count the number of rhombi possible inside this rectangle such that all these conditions are met −The rhombus has an area more than 0.The diagonals of the rhombus are parallel to the x and y axis.The rhombus has integer coordinates for all corners.Let us understand with examplesInput − length=3 width=3Output − Count of number of rhombi possible inside a rectangle of given size are: 4Explanation − Below ...
Read MoreCount positive integers with 0 as a digit and maximum 'd' digits in C++
We are given a number d which represents the number of digits. The goal is to find the count of positive integers with 0 as a digit and have maximum d digits. Count all 1 digit, 2 digit, 3 digit….d digit positive numbers containing at least one 0.We will first find numbers the count of numbers that have d digits with at least one 0. Let’s say d=3. To make a 3-digit number with at least one 0, possible ways are −Here d1 can have 1 to 9 : 9 ways d2 can have 0-9 : 10 ways d3 can ...
Read MoreCount the number of carry operations required to add two numbers in C++
We are given two numbers num_1 and num_2. The goal is to count the number of carry operations required if the numbers are added. If numbers are 123 and 157 then carry operations will be 1. (7+3=10, 1+2+5=8, 1+1=2 ).Let us understand with examplesInput − num_1=432 num_2=638Output − Count of number of carry operations required to add two numbers are − 2Explanation − From right to left adding digits and counting carry −(2+9=10, carry 1 ) count=1, (1+3+3=7, carry 0 ) count=1, (4+6=10, carry 1 ) count=2Input − num_1=9999 num_2=111Output − Count of number of carry operations required to add ...
Read MoreCount pairs of numbers from 1 to N with Product divisible by their Sum in C++
We are given a number N. The goal is to find the pairs of numbers from 1 to N such that the product of pairs is equal to the sum of pairs.Let us understand with examples.Input − N=11Output − Count of pairs of no. from 1 to N with Product divisible by their Sum are − 1Explanation − Numbers 3 and 6 have product 18 and their sum 9 fully divides 18.Input − N=30Output − Count of pairs of no. from 1 to N with Product divisible by their Sum are − 12Explanation − Pairs are − (3, 6), (4, ...
Read MoreCount pairs with average present in the same array in C++
We are given an array of integers such that each element of the array is in the range [- 1000, 1000]. The goal is to find pairs of elements of the array such that their average is also present in that array. If array is arr[]= [1, 2, 3, 4]. Then pairs would be (1, 3) and (2, 4) as the average of 1, 3 is 2 and the average of 2, 4 is 3 and both 2 and 3 are present in the array. Count would be 2.Let us understand with examples.Input − arr[]= { -1, 2, 5, -3, ...
Read More