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
C++ Articles
Page 396 of 597
Check if any permutation of a given string is lexicographically larger than the other given string
We have given two strings and need to check whether the given string's permutations exist such that one permutation can have a larger character than another permutation at the ith index. We can solve the problem by sorting the string and comparing each character of the string one by one. Also, we can solve the problem using the frequency of characters of both strings. Problem statement – We have given a string str1 and str2 of length N. We need to check whether any permutations of both strings exist such that the permutation of one string is lexicographically larger than ...
Read MoreC++ Program for Longest subsequence of a number having same left and right rotation
In this problem, we need to find the maximum length of the sub sequence with the same left and right rotations. The left rotation means moving all characters of the string in the left direction and the first character at the end. The right rotation means moving all string characters in the right direction and the last character at the start. Problem statement – We have given string str containing numeric digits and need to find the sub sequence of maximum length with the same left and right rotations. Sample examples Input – str = "323232", Output – 6 Explanation– ...
Read MoreAverage value of set bit count in given Binary string after performing all possible choices of K operations
In this problem, we need to find the average value of the count of set bits after performing K operations of all choices on the given string. There can be a brute force approach to solve the problem, but we will use the probability principles to overcome the time complexity of the brute force approach. Problem statement – We have given an integer N, array arr[] containing K positive integers, and a binary string of length N containing only set bits. We need to find the average value of the count of set bits after performing all possible choices ...
Read MoreIs there any equivalent to typedef of C/C++ in Java?
We can find many similarities between Java and C/C++ programming languages in terms of syntaxes and features. But, there are several functionalities that have been omitted from Java like 'typedef'. If someone coming from a C/C++ background, must have heard the 'typedef' keyword, and often wonders, is there any equivalent to typedef in Java? In simple words, Java does not provide a direct equivalent to typedef. The creators of Java replaced this feature with classes. In fact, a class can do even more than a typedef can do. Replacement to typedef of C/C++ in Java? Before exploring the ...
Read MoreCheck whether all the substrings have number of vowels atleast as that of consonants
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 MoreThe time when the minute hand and the hour hand coincide after a given hour
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 MoreSum of the series 5+55+555+.. up to n terms
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 MoreSum of products of all combinations taken (1 to n) at a time
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 MoreSort on the basis of number of factors using STL
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 MoreP-Smooth Numbers or P-friable Number
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