- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Found 7346 Articles for C++
127 Views
In Alphabetical series there are consists of 26 characters of which 5 characters are vowels such as a, e, i, o, u and the rest are called as consonants. In C++, we have predefined functions such as tolower() and length() that will help to Check whether all the substrings have number of vowels atleast as that of consonants. Let’s take an example of this. The string has only one consonant with the rest vowel “aiteau”. Hence, it is accepted as the final result. The string has more than one consonant with the rest vowel “appioa”. Hence, it is not ... Read More
140 Views
XOR, or exclusive OR, is a boolean logic operation which is used in generating parity bits for error checking, fault tolerance, etc. Various symbols are used to represent this operation: ^, ⊕, ⊻, etc. XOR Logic The XOR operation is only true if the two arguments are different. This means that the XOR of the same bits is 0, and that of different bits is 1. Same bits − 0 ^ 0 = 0 1 ^ 1 = 0 Different bits − 0 ^ 1 = 1 1 ^ 0 = 1 Problem Statement Given two numbers, a and b, ... Read More
296 Views
When the minute hand moves from 12 to 12 in one hour, the hour hand also moves from the previous hour to the next. Hence, every hour, the minute hand and the hour hand coincide once. Problem Statement Given an input hour, find the time in minutes when the hour hand and the minute hand coincide within the next hour. Examples Input − Hour = 4 Output − Coinciding time: 240/11 minutes. We will discuss the explanation further with the approach. Input − Hour = 5 Output − Coinciding time: 300/11 minutes. Explanation and the Approach ... Read More
310 Views
5, 55, 555, ... is a series that can be derived from geometric progression and, thus, computed with the help of GP formulae. Geometric progression is a type of series in which each succeeding term is the product of some specific term (ratio) with the preceding term. We will utilize the knowledge of GP, to find the sum of the given series. Problem Statement Given a number n, find the sum of the series 5+5+555+... up to n terms. Examples Input − N = 3 Output − 595 Explanation 5 + 5 + 555 = 595. ... Read More
109 Views
There can be multiple combinations of numbers if taken 1 to n at a time. For example, if we take one number at a time, the number of combinations will be nC1. If we take two numbers at a time, the number of combinations will be nC2. Hence, the total number of combinations will be nC1 + nC2 +… + nCn. To find the sum of all combinations, we will have to use an efficient approach. Otherwise, the time and space complexities will go very high. Problem Statement Find the sum of products of all the combinations of numbers taken ... Read More
96 Views
Sorting a vector using STL is a piece of cake. We can use the famous sort() function to perform the task. The real challenge is to count the number of factors for each number. A factor is a number which divides another number completely, i.e. with zero remainder. Traversing through all the numbers to count the factors might be an approach but we will try to optimize and reach efficient solutions in this article. Problem Statement Sort a given array based on the number of factors of each number in increasing order. Thus, the number having the lowest number of ... Read More
87 Views
A number is p-friable for p-smooth if all of its prime factors are less than or equal to p. For example, 1620 is a 5-smooth number. Because, the prime factors of 1620 are: 2, 3, and 5. As it can be seen, 1620 is also a 7-smooth and 11-smooth number. Problem Statement Given two numbers N and P, we have to check if N is a P-friable number or not. Examples Input − N = 50, P = 7 Output − Yes, 50 is a 7-friable number. Explanation 50 can be prime factorized as: 5*5*5*5. Hence, ... Read More
362 Views
In this problem, we need to convert one binary string to another binary string by flipping the characters of the string. We can hold any set bit and flip other bits, and we need to count the total operation to achieve another string by doing it. We can solve the problem based on the total number of ‘01’ and ‘10’ pairs in the given strings. Problem statement − We have given two strings named str1 and str2 of the same length containing ‘0’ and ‘1’ characters, representing the binary string. We need to convert the string str1 to str2 by ... Read More
64 Views
In this problem, we need to find the reversible equal substring of maximum length from the start and end of the string. The problem is very similar to finding the palindromic string. We can start traversing the string and traverse the string until characters from the start and end match. Problem statement − We have given string str containing N characters. We need to check whether the string contains the reversible equal substring at the start and end of the string. If we find the substring according to the given condition, print the longest substring. Otherwise, print ‘false’ in the ... Read More
109 Views
In this problem, we need to transform the string of a length greater than 2 into its abbreviation form. We can use the ‘length’ property of the string to count the total number of middle characters in the string, and we can first and last characters using the respected index value. Problem statement − We have given a string str of length greater than or equal to 2 and need to convert the string into its abbreviation form. The abbreviation form of the string is as shown here: first character + the total number of middle characters + last ... Read More