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
Programming Articles
Page 1204 of 2547
Program to Find Out the Cost after Finding k Unique Subsequences From a Given String in C++
Suppose, we have a string s and another value k. We have to select some subsequences of s, so that we can get k unique subsequences. Here, the cost of selecting a subsequence equals the length of (s) - length of (subsequence). So, we have to find the lowest total cost possible after selecting k unique subsequences. If we are unable to find out this set, we will return -1. We will consider the empty string as a valid subsequence.So, if the input is like s = "pqrs", k = 4, then the output will be 3.To solve this, we ...
Read MoreEven size subtree in n-ary tree in C++
In this problem, we are given an adjacency list that denotes an n-ary tree. Our task is to find the number of even size subtree in n-ary tree. N-ary tree is defined as a collection of nodes normally represented hierarchically in the following manner.The tree is started at the root node.Each node of the tree maintains a list of pointers to its child nodes.The number of child nodes is less than or equal to m.Let’s take an example to understand the problem, Input: Output: 4Explanation: Tree rooted with 7 has an even size.Tree rooted with 2 has an even size.Tree rooted with 0 has an ...
Read MoreCount of unique pairs (arr[i], arr[j]) such that i < j in C++
We are given an array containing integer elements. The goal is to find unique pairs of elements of array such that pairs of type (arr[i],arr[j]) have indexes such that iLet us understand with examplesInput − arr[] = {1,2,3};Output − Count of unique pairs (arr[i], arr[j]) such that i < j are − 3Explanation − As all elements are unique. Pairs would be −(1,2) - ( arr[0],arr[1] ) 0
Read MoreEven-odd turn game with two integers in C++
In this problem, we are given three integer values A , B and T. Our task is to create a program to play Even-odd turn game with two integers. The two integer value are :T, that denotes the number of turns in the game.A denotes the value for player1B denotes the value for player2If the value of T is odd, the value of A is multiplied by 2.If the value of T is even, the value of B is multiplied by 2.We need to find and return value of max(A, B) / min(A, B) at the end.Let’s take an example to understand ...
Read MoreCount of values of x <= n for which (n XOR x) = (n – x) in C++
We are given a number n as input. The goal is to find values x such that condition (n xor x)=(nx) holds. Also x lies in range [0,n].Let us understand with examplesInput − n=10Output − Count of values of x
Read MoreEvil Number with Example in C++
In this problem, we are given an array a number N. Our task is to check whether the number is an evil Number or Odious Number. Evil Number: It is a positive number which has an even number of 1’s in its binary expansion.Example: 5, 17 Odious Number: It is a positive number which has an odd number of 1’s in its binary expansion.example : 4, 6Let’s take an example to understand the problem, Input: N = 65Output: Evil NumberExplanation: Binary Expansion of 65 : 1000001Solution Approach: A simple solution to the problem is by finding the binary expansion of the number and then counting the number of 1’s ...
Read MoreCount of subarrays whose maximum element is greater than k in C++
We are given an array arr[] containing integer elements and a variable k . The goal is to find the count of subarrays of arr[] that have greatest/maximum element more that k. If the array is [1, 2, 3] and k is 1. Then possible subarrays are [1], [2], [3], [1, 2], [2, 3], [1, 2, 3]. The subarrays with maximum element > 1 are [2], [3], [1, 2], [2, 3], [1, 2, 3]. So the count is 5.Let us understand with examplesInput − arr[] = {1, 2, 5, 3 } k=3Output − Count of subarrays whose maximum element is ...
Read MoreExpress an odd number as sum of prime numbers in C++
In this problem, we are given an odd number N. Our task is to express an odd number as the sum of prime numbers.There can be at max three prime numbers while expressing the number.Let’s take an example to understand the problem, Input: N = 55Output: 53 + 2Solution Approach: The odd number can be represented as a sum of primes. Taking these primes into consideration we have three cases.Case 1: If n is a prime number, it is represented as the sum of one prime number n.Case 2: If (n - 2) is a prime number, it is represented as the sum of two ...
Read MoreCount of sub-strings that do not contain all the characters from the set {'a', 'b', 'c'} at the same time in C++
We are given a string str[] containing ‘a’, ‘b’ and ‘c’ only. The goal is to find the substrings of str[] such that all the three characters are not part of that substring. For any string str, substrings could be “a”, “b”, “c”, “abb”, “bba”, “bc”, “ca”, “ccc” but not “abc”, “bcca” , “cab” as these have ‘a’, ‘b’ and ‘c’, all three.Let us understand with examples.Input − str[] = “aabc”Output − Count of sub-strings that do not contain all the characters from the set {‘a’, ‘b’, ‘c’} at the same time are − 8Explanation − Substrings will be : ...
Read MoreCount occurrences of a substring recursively in Java
Given two strings str_1 and str_2. The goal is to count the number of occurrences of substring str2 in string str1 using a recursive process.A recursive function is the one which has its own call inside it’s definition.If str1 is “I know that you know that i know” str2=”know”Count of occurences is − 3Let us understand with examples.For ExampleInputstr1 = "TPisTPareTPamTP", str2 = "TP";OutputCount of occurrences of a substring recursively are: 4ExplanationThe substring TP occurs 4 times in str1.Inputstr1 = "HiHOwAReyouHiHi" str2 = "Hi"OutputCount of occurrences of a substring recursively are: 3ExplanationThe substring Hi occurs 3 times in str1.Approach used ...
Read More