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
Server Side Programming Articles
Page 1259 of 2109
Count words in a given string in C++
We are given with a sentence or string containing words that can contain spaces, new line characters and tab characters in between. The task is to calculate the total number of words in a string and print the result.Input − string str = “welcome to tutorials point\t”Output − Count of words in a string are − 4Explanation − There are four words in a string i.e. welcome, to, tutorials, point and the rest are spaces(“ ”), next line character() and tab character(\t) present between the words.Input − string str = “honesty\t is the best policy”Output − Count of words in ...
Read MoreCount total bits in a number in C++
We are given an integer number let’s say, num and the task is to firstly calculate the binary digit of a number and calculate the total digits of a number.Input − int number = 50Output − Count of total bits in a number are − 6Explanation − Binary representation of a number 50 is 110010 and if we calculate it in 8-digit number then two 0’s will be appended in the beginning. So, the total bits in a number are 6.Input − int number = 10Output − Count of total bits in a number are − 6Explanation − Binary representation ...
Read MoreCount Odd and Even numbers in a range from L to R in C++
We are given a range starting from L to R of integer values and the task is to calculate the count of odd numbers and the even numbers in the range.Input − L = 7, R = 17Output − Count of Even numbers in a range from L to R are − 5Count of Odd numbers in a range from L to R are − 6Input − L = 1, R = 10Output − Count of Even numbers in a range from L to R are − 5Count of Odd numbers in a range from L to R are − ...
Read MoreCount of pairs from 1 to a and 1 to b whose sum is divisible by N in C++
We are given an integer array and the task is to count the total number of pairs (x, y) that can be formed using the given array values such that the integer value of x is less than y.Input − int a = 2, b = 3, n = 2Output − Count of pairs from 1 to a and 1 to b whose sum is divisible by N are − 3Explanation −Firstly, We will start from 1 to a which includes 1, 2 Now, we will start from 1 to b which includes 1, 2, 3 So the pairs that ...
Read MoreCount number of sub-sequences with GCD 1 in C++
We are given an array of integer elements and the task is to find the sub-sequences from the given array which are having GCD as 1. GCD is the greatest common divisor of two or more integers that divides the given numbers entirely and greatest amongst all.Input − int arr[] = {3, 4, 8, 16}Output − Count of number of sub-sequences with GCD 1 are − 7Explanation −The sub-sequences that can be formed from the given array with GCD as 1 are (3, 4), (3, 8), (3, 16), (4, 3), (8, 3), (16, 3), (3, 4, 8)Input − int arr[] ...
Read MoreLongest Interval Containing One Number in C++
Suppose we have a list of distinct integers called nums. We have to find the size of the largest interval (inclusive) [start, end] such that it contains at most one number in nums.So, if the input is like nums = [10, 6, 20], then the output will be 99990, as the largest interval is [11, 100000], this contains 20 only.To solve this, we will follow these steps −ret := -infend := 100000prev := 1sort the array numsn := size of numsfor initialize i := 0, when i < size of nums, update (increase i by 1), do −if i + ...
Read MoreMaking List Values Equal in C++
Suppose we have a list of integers called nums. Now suppose an operation where we select some subset of integers in the list and increment all of them by one. We have to find the minimum number of required operations to make all values in the list equal to each other.So, if the input is like [1, 3, 5], then the output will be 4.To solve this, we will follow these steps −if size of nums is same as 1, then −return 0ret := 0maxVal := -infminVal := inffor initialize i := 0, when i < size of nums, update ...
Read MoreContained Interval in C++
Suppose we have a two-dimensional list of intervals where each interval has two values [start, end]. We have to find whether there's an interval which contains another interval.So, if the input is like [[2, 4], [5, 11], [5, 9], [10, 10]], then the output will be true as [5, 11] is containing [5, 9].To solve this, we will follow these steps −sort the array vDefine one 2D array retfor each interval it in v −if ret is empty, then −insert it at the end of retotherwise when last element of ret >= it[0], then −return trueOtherwiseinsert it at the end ...
Read MoreSplit List in C++
Suppose we have a list of integers called nums, we have to find whether we can partition the list into two sublists (non-empty) such that every number in the left part is strictly less than every number in the right part.So, if the input is like [6, 4, 3, 8, 10], then the output will be true, as left = [6, 4, 3] and right = [8, 10]To solve this, we will follow these steps −n := size of numsDefine an array right of size nDefine an array left of size nleft[0] := nums[0]last element of right := last element ...
Read MoreFlip to Zeros in C++
Suppose we have one integer array called nums and this contains 0s and 1s. Suppose we have an operation where we pick an index i in nums and flip element at index i as well as all numbers to the right of i. We have to find the minimum number of operations required to make nums contain all 0s.So, if the input is like [1, 0, 1], then the output will be 3, operation on index 0, it will convert [0, 1, 0], then on index 1 [0, 0, 1], then index 2, [0, 0, 0].To solve this, we will ...
Read More