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 1434 of 2547
Convert a Binary Tree into its Mirror Tree in C++
In this tutorial, we will be discussing a program to convert a binary tree into its mirror tree.For this, we will be provided with a binary tree. Our task will be to swap the values on the left and the right end creating a mirror tree from the given binary tree.Example#include using namespace std; //binary tree node structure struct Node{ int data; struct Node* left; struct Node* right; }; //creation of a new node with no child nodes struct Node* newNode(int data){ struct Node* node = (struct Node*)malloc(sizeof(struct Node)); node->data = data; node->left = ...
Read MoreMaximum subarray sum modulo m in C++
In this problem, we are given an array of size n and an integer m. our task is to create a program that will find the maximum subarray sum modulo m in C++.Program description − Here, we will find the maximum value obtained by dividing the sum of all elements of subarray divided by m.Let’s take an example to understand the problem, Input − array = {4, 9 ,2} m = 6Output − 5Explanation − All subarrays and their remainders on dividing{4}: 4%6 = 4 {9}: 9%6 = 3 {2}: 2%6 = 2 {4, 9}: 13%6 = 1 {9, 2}: ...
Read MoreProgram for power of a complex number in O(log n) in C++
Given a complex number in the form of x+yi and an integer n; the task is calculate and print the value of the complex number if we power the complex number by n.What is a complex number?A complex number is number which can be written in the form of a + bi, where a and b are the real numbers and i is the solution of the equation or we can say an imaginary number. So, simply putting it we can say that complex number is a combination of Real number and imaginary number.Raising power of a complex numberTo raise ...
Read MoreMaximum subset with bitwise OR equal to k in C++
Problem statementGiven an array of non-negative integers and an integer k, find the subset of maximum length with bitwise OR equal to k.ExampleIf given input array is = [1, 4, 2] and k = 3 then output is: [1, 2] The bitwise OR of 1 and 2 equals 3. It is not possible to obtain a subset of length greater than 2.AlgorithmBelow are the properties of bitwise OR −0 OR 0 = 0 1 OR 0 = 1 1 OR 1 = 1for all the positions in the binary representation of k with the bit equal to 0, the corresponding ...
Read MoreConvert a Binary Tree such that every node stores the sum of all nodes in its right subtree in C++
In this tutorial, we will be discussing a program to convert a binary tree such that every node stores the sum of all nodes in its right subtree.For this, we will be provided with a binary tree. Our task is to return another tree where every node must be equal to the sum of the node and its right subtree.Example#include using namespace std; //node structure of tree struct Node { int data; Node *left, *right; }; //creation of a new node struct Node* createNode(int item){ Node* temp = new Node; temp->data = item; temp->left ...
Read MoreMaximum sum after repeatedly dividing N by a divisor in C++
In this problem, we are given an integer N. Our task is to create a program that will find the maximum sum after repeatedly dividing N by a divisor in C++.Program description − we will divide the number N recursively until it becomes one and then sum up all the divisors and find the maximum of all divisors.Let’s take an example to understand the problem, Input − N = 12Output − 22Explanation − let’s divide the number recursively and find the sum.Division 1: 12/2 = 6 Division 2: 6/2 = 3 Division 3: 3/3 = 1 Sum = 12+6+3+1 = ...
Read MoreMaximum sum by adding numbers with same number of set bits in C++
Problem statementGiven an array of N numbers, the task is to find the maximum sum that can be obtained by adding numbers with the same number of set bitsExampleIf input array is {2, 5, 8, 9, 10, 7} then output would be 14 −Number of set bits in 2 is 1Number of set bits in 5 is 2Number of set bits in 8 is 1Number of set bits in 9 is 2Number of set bits in 10 is 2Number of set bits in 7 is 3Then sum of (5 + 9 + 10) is 24 whose number of set bits ...
Read MoreConvert a Binary Tree to a Circular Doubly Link List in C++
In this tutorial, we will be discussing a program to convert a binary tree to a circular doubly linked list.For this, we will be provided with a binary tree. Our task will be to convert the left and right nodes to the left and right elements respectively. And take the inorder of the binary tree to be the sequence order of the circular linked listExample#include using namespace std; //node structure of the binary tree struct Node{ struct Node *left, *right; int data; }; //appending rightlist to the end of leftlist Node *concatenate(Node *leftList, Node *rightList){ //if one ...
Read MorePrint all n-digit strictly increasing numbers in C++
In this problem, we are given a number N and we have to print all n-digit numbers whose digits are strickly increasing from MSB to LSB i.e. the number at LSB (left) should be smaller than the number at right.Let’s take an example to understand the problem −Input − n = 2Output −01 02 03 04 05 06 07 08 09 12 13 14 15 16 17 18 19 23 24 25 26 27 28 29 34 35 36 37 38 39 45 46 47 48 49 56 57 58 59 67 68 69 78 79 89.Explanation − as you ...
Read MoreMaximum sum of a path in a Right Number Triangle in C++
Problem statementGiven a right triangle of numbers, find the largest of the sum of numbers that appear on the paths starting from the top towards the base, so that on each path the next number is located directly below or below-and-one-place-to-the-rightExampleIf given input is: 3 4 5 1 10 7 Then maximum sum is 18 as (3 + 5 + 10).AlgorithmThe idea is to find largest sum ending at every cell of last row and return maximum of these sums.We can recursively compute these sums by recursively considering above two cellsSince there are overlapping sub-problems, we use dynamic programming to ...
Read More