In this problem, we are given a number n. Our task is to print patterns with decreasing to 0 or negative then increasing back to the number.Let’s take an example to understand the problem,Input: n = 12 Output: 12 7 2 -3 2 7 12To solve this problem, we will use recursion and call the function after each update. The track of update is kept using the flag variable which tells the function to increase or decrease the number by 5.ExampleThe below code gives the implementation of our solution, Live Demo#include using namespace std; void printNextValue(int m){    if (m > 0){       cout

In this problem, we are given a string and an integer n. Our task is to print the given string in a wave pattern of n lines.Let’s take an example to understand the problem, Input: Tutorial n = 3 Output: T             r    U       o       i       s       t                lWave patterns are printed by printing each character of the string one by one in the next line and tab space away from the next element till ... Read More

In this problem, we are given a number. And we have to print all 3 digit repeating numbers.Let’s take an example to understand the problem, Input: 98769876598765 Output:    987: 3 times    876: 3 times    765: 2 timesTo solve this problem, we will use the large number which is stored string. The digits of the numbers are counted as characters. Now, we will check the first three numbers and then start from the 3rd index to the end and get a new number. After this, we will check for the next 3 digit numbers are count its frequency. ... Read More

In this problem, we are given an integer n. Our task is to print all possible pairs of n balanced parentheses.Balanced parentheses are parentheses pairs that have a closing symbol for every corresponding opening symbol. Also, pairs should be properly nested.Let’s take an example to understand the problem, Input: n = 2 Output: {}{} {{}}To solve this problem, we need to keep track of pairs of brackets. The initial count of brackets is 0. Then we will recursively a function till the total bracket count is less than n. Count brackets, recursively call for brackets based on the count. If ... Read More

In this problem, we are given a number n. Our task is to print all combinations of factors of n.Let’s take an example to understand the topic better −Input: 24 Output: 2 2 2 3 2 4 3 8 3 4 6 2 12For this, we will use recursion function which will find a combination of factors of the number. And we will store all our combinations in an array of array.ExampleThis code will show the implementation of our solution. Live Demo#include using namespace std; vector factor_Combo; void genreateFactorCombinations(int first, int eachFactor, int n, vectorfactor) {    if (first>n || eachFactor>n) ... Read More

In this problem, we are given the total score n. Print all combinations of basketball points that are 1, 2, and 3 that give a total score of n.Let’s see an example to understand the problem, Input: 4 Output: 1 1 1 1 1 1 2 1 2 1 1 3 2 1 1 2 2 3 1To solve this problem, we will use recursion. And fix and resources for rest values n-s, where s is the score. If the combination adds up to n, print the combination.ExampleThe code shows the implementation of our code − Live Demo#define MAX_POINT 3 #define ... Read More

In this problem, we are given a string. Our task is to print all distinct characters of the string in the order they appear in the string.Let’s take an example to understand our problem, Input: tutorials Point Output: uralsPnThere are multiple ways to solve this problem but we will discuss the most effective one. The simple one includes the nesting of loops.For this, we will use two arrays of size 256(8-bit characters are stored).First we will initialize all values of counter array to 0 and all values of index array to n (length of string). On traversal of the string ... Read More

In this problem, we are given a string and an integer M. our task is to print all distinct circular strings of length M in lexicographical order (alphabetical order).Let’s take an example to understand the problem, Input: str= “ssssn” M=3 Output: nss sns ssn sssExplanation − all possible circular strings of length 3 are: sss sss ssn sns nss. Distinct elements in lexicographical order are sss ssn sns nss.To solve this problem, we will iterate over the elements of the string and generate all possible substrings of length M. we will store this generated string in a set that stores ... Read More

In this problem, we are given an array of integer values. Our task is to print all distinct elements of the array. The output should contain only distinct values.Let’s take an example to understand the problemInput: array = {1, 5, 7, 12, 1, 6, 10, 7, 5} Output: 1 5 7 12 6 10To solve this problem, we will have to check elements of the array for uniqueness. For this, we will use two nested loops, the outer one will take values and the inner one will check the rest of the values with it. If more than one values ... Read More

In this problem, we are given an array of N integers and a number K. Our task is to print all distinct numbers that can be created by adding any K elements from the array. While choosing any number can be repeated K times.Let’s take an example to understand the problem −Input: array = {2, 5, 13, 9} K = 2 Output: 2, 7, 15, 11, 10, 18, 14, 26, 22 Explaination: 2 elements added : 2+2=4, 2+5=7, 2+13=15, 2+9=11, 5+5=10, 5+13=18, 5+9=14, 13+13=26, 13+9=22, 9+9=18To solve this problem, we will find all combinations of the k element from the ... Read More