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 247 of 597
Print all n-digit numbers with absolute difference between sum of even and odd digits is 1 in C++
In this problem, we are given an integer n, and we have to print all n-digit numbers such that the absolute difference between the sum of digit of the number at even and odd places is 1. While creating the numbers leading 0’s are not considered.The absolute difference is the difference between both numbers whose value is an absolute value (positive value).Let’s take an example to understand the problem −Input: n = 2 Output: 10 12 21 23 32 34 43 45 54 56 65 67 76 78 87 89 98 Explaination : taking an of the numbers from the ...
Read MorePrint All Leaf Nodes of a Binary Tree from left to right using Iterative Approach in C++
In this problem, we are given a binary tree and we have to print all leaf nodes of the binary tree from left to right the iterative approach.Let’s take an example to understand the problemInput −Output − 1 4 7To solve this problem using the iterative approach, we will use a Depth-first search(DFS). To Traverse tree, we will start from root node and check if it is a leaf node if it is then print the node else find its child trees and traverse the child subtrees to find all leaf nodes.ExampleThe below code will implement our solution −#include ...
Read MorePrint all n digit patterns formed by mobile Keypad in C++
In this problem, we are given a number n and we have to print all N digit patterns formed by pressing the mobile keypad button. While pressing the buttons, we can press only nearby buttons of the current button i.e. only keys left, right, up, down can be pressed.Let’s see how the old keypad looks like −12ABC3DEF4GHI5JKL6MNO7PQRS8TUV9WXYZ*0#Let’s take an example to understand the problemInput: n=2 Output: 12 14 21 23 25 32 36 41 45 47 52 54 56 58 63 65 69 74 78 85 87 89 80 96 98To solve this problem, we will use a depth-first search ...
Read MorePrint all k-sum paths in a binary tree in C++
In this problem, we are given a binary tree and a number K and we have to print all paths in the tree which have the sum of nodes in the path equal k.Here, the path of the tree can start from any node of the tree and end at any node. The path should always direct from the root node to the leaf node. The values of the nodes of the tree can be positive, negative, or zero.Let’s take an example to understand the problem −K = 5Output −1 3 1 3 2 1 4To solve this problem, we ...
Read MorePrint all leaf nodes of a binary tree from right to left in C++
In this problem, we are given a binary tree and we have to print all leaf nodes of the binary tree from right to left.Let’s take an example to understand the problemInput −Output − 7 4 1To solve this problem, we will have to traverse the binary tree. This traversal can be done in two ways −Preorder traversal − This traversal uses recursion. Here, we will traverse, root then left and then right subtree. If we encounter a leaf node then we will print it, else we check for children of the node and explore them to find leaf node.ExampleProgram ...
Read MorePrint all Jumping Numbers smaller than or equal to a given value in C++
In this problem, we are given a number n and we have to print all jumping numbers that are smaller than or equal to n.Jumping Numbers are the number whose adjacent digits differ by one only. Some jumping numbers are 4565, 98, 7. All single-digit numbers are considered as jumping numbers. 235 is not a jumping number.Now, let’ take an example to understand the problemInput: N = 32 Output: 0 1 2 3 4 5 6 7 8 9 10 12 21 23 32To solve this problem, we will assume a graph where 0 is the starting node and traverse ...
Read MorePrint all interleavings of given two strings in C++
In this problem, we are given two string str1 and str2 and we have to print all interleaving strings from both the string.Interleaving string created using two given strings such that the order of characters of each string.Let’s take an example to understand the problem −Input: str1 = “XY” str2= “NS” Output: XYNS, XNYS, XNSY, NXYS, NXSY, NSXYTo solve this problem, we will take all the characters in the strings. Length of str1 = m and length of str2 = n so we will create all interleaved strings from these strings.For printing all interleaving strings, we will fix characters of ...
Read MorePrint all internal nodes of a Binary tree in C++
In this problem, we are given a binary tree and we have to print all internal nodes of the binary tree.The binary tree is a tree in which a node can have a maximum of 2 child nodes. Node or vertex can have no nodes, one child or two child nodes.Example −Internal Node is a node that can have at least one child i.e. non-leaf node is an internal node.Let’s take an example to understand the problem −Output − 7 4 9To solve this problem, we will traverse the binary tree using BFS(breadth-first search) traversal.While traversal we will push nodes ...
Read MorePrint all integers that are sum of powers of two given numbers in C++
In this problem, we are given two numbers a and b and an integer bound and we have to print all values less than binding which is the sum of squares of a and b.Bound >= ai + bjLet’s take an example to understand the problem −Input: a=2, b=3, bound=8 Output: 2 3 4 5 7To solve this problem, we will use nested loops using two variables i and j from 0. The outer loop will have ending condition xi = bound and the inner loop will have ending condition xi + yj > bound. For each iteration of the ...
Read MorePrint all Good numbers in given range in C++
In this problem, we are given three values L, R, and d. Our task is to print all good numbers within the range L to R that do not contain the d as its digit.A good number is a number in which every digit is larger than the sum of digits of its right (all less significant bits than it). For example, 732 is a good number, 7> 3+2 and 3>2.Now, let’s take an example to understand the problem, Input: L = 400 , R = 500 , k = 3 Output: 410, 420, 421Explanation − good numbers between 400 ...
Read More