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 174 of 597
Preorder predecessor of a Node in Binary Tree in C++
In this problem, we are given a binary tree and a node value. Our task is to print the preorder predecessor of the node.Binary Tree is a special type of tree in which each root node can have maximum 2 child nodes.Preorder Traversal is a way to traverse nodes of the tree. In this we will first traverse root node then left child and then the right child.Preorder predecessor node is the node that comes before the node in the preorder traversal of the node.Let’s take an example to understand the problemInput: 1 Output: 9To solve this problem, a navie approach will ...
Read MorePrefix to Infix Conversion in C++
In this problem, we are given a prefix expression. Our task is to print the infix conversion of the given expression.Prefix expression is those expressions which have operators before the operands.Example: +AB.Infix expressions are those expressions which have operators between the operands.Example: A+BInfix expression are information for human understanding, but the computer does computations on prefix or postfix expressions (generally postfix).Let’s take an example to understand the problemInput: prefix : /+LM/NX Output: infix : (L+M) / (N/X)To solve this problem, we will be using the stack data structure. We will traverse the prefix expression in reverse order of the expression. ...
Read MorePreorder from Inorder and Postorder traversals in C++
In this problem, we are given the inorder and postorder traversal of a binary tree. Our task is to print the postorder traversal of the tree.Let’s take an example to understand the problemInput:inorder: 16 7 21 12 1 5 9 postorder: 16 21 7 1 9 5 12 Output: preorder: 12 7 16 21 5 1 9 Explanation: the binary tree is :To solve this problem, a simple solution could be creating a tree using the given traversals and then finding the preorder traversal of the tree. But this method will be more complex for the system.A more effective solution ...
Read MorePrefix Sum of Matrix (Or 2D Array) in C++
In this problem, we are given a 2D array of integer values mat[][]. Our task is to print the prefix sum matrix of mat.Prefix sum matrix: every element of the matrix is the sum elements above and left of it. i.eprefixSum[i][j] = mat[i][j] + mat[i-1][j]...mat[0][j] + mat[i][j-1] +... mat[i][0].Let’s take an example to understand the problemInput: arr =[ [4 6 1] [5 7 2] [3 8 9] ] Output:[ [4 10 11] [9 22 25] [12 33 45] ]To solve this problem, ...
Read MorePredict the winner in Coin Game in C++
In this game, there are two players X and Y. our task is to predict who will win the game if both play optimally and X starts the game.GameIn the coin game, there are two piles with N and M number of coins. One of the players chooses any one of the piles for the game. Then the task is to divide the piles into two halves till any one player cannot further divide the piles.Let’s take an example to understand the problem, Input: M = 2 , N = 2 Output:XExplanation - X starts the game and choose M pile(both ...
Read MoreCorrect the Random Pointer in Doubly Linked List in C++
In this tutorial, we will be discussing a program to correct the random pointer in a doubly linked list.For this we will be provided with a doubly linked list with one node having a random pointer. Our task is to rectify the element to whom the pointer should be pointing i.e the element next to it.Example#include using namespace std; //node structure for doubly linked list struct node { int data; node* next; node* prev; }; //new node creation node* newNode(int data){ node* temp = new node; temp->data = data; temp->next = temp->prev = ...
Read MoreCost of painting n * m grid in C++
In this tutorial, we will be discussing a program to find the cost of painting n*m grid.For this we will be provided with two integers n and m. Our task is to calculate the minimum cost of painting a n*m grid is the cost of painting a cell is equal to the number of painted cells adjacent to it.Example#include using namespace std; //calculating the minimum cost int calc_cost(int n, int m){ int cost = (n - 1) * m + (m - 1) * n; return cost; } int main(){ int n = 4, m = 5; cout
Read MoreCost to Balance the parentheses in C++
In this tutorial, we will be discussing a program to find the cost to balance the parentheses.For this we will be provided with a sequence of brackets. Our task is to balance those parentheses in the equation by shifting their position by one and print -1 if balancing them isn’t possible.Example#include using namespace std; int costToBalance(string s) { if (s.length() == 0) cout
Read MoreCost to make a string Panagram in C++
In this tutorial, we will be discussing a program to find the cost of making a string panagram.For this we will be provided with an array of integers. Our task is to convert the given string into a panagram and calculate the cost of doing that with the help of the array provided with the costs of adding characters.Example#include using namespace std; //calculating the total cost of //making panagram int calc_cost(int arr[], string str) { int cost = 0; bool occurred[26] = { false }; for (int i = 0; i < str.size(); i++) ...
Read MoreCount 'd' digit positive integers with 0 as a digit in C++
In this tutorial, we will be discussing a program to find the numbers having ‘d’ digits with 0 as a digit.For this we will be provided with a number ‘d’. Our task is to count and print the number of positive integers having ‘d’ digits and 0 as one of their digit.Example#include using namespace std; //counting the number of 'd' digit numbers int count_num(int d) { return 9*(pow(10,d-1) - pow(9,d-1)); } int main(){ int d = 1; cout
Read More