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 548 of 597
Print common nodes on path from root (or common ancestors) in C++
In this problem, we are given a binary tree and two nodes of the binary tree are defined. And we have to print all the common ancestors of the node i.e. common nodes that occur in the path from traversal from root to the node.Binary Tree is a special tree whose every node has at max two child nodes. So, every node is either a leaf node or has one or two child nodes.Example, Ancestor node is a node that is connected to lower-level nodes in a tree.The common ancestor node of two nodes is a node that is an ...
Read MorePrint cousins of a given node in Binary Treein C++
Binary Tree is a special tree whose every node has at max two child nodes. So, every node is either a leaf node or has one or two child nodes.Example, In this problem, we are given a binary tree and we have a node of the tree and we have to find the cousin nodes of the node. No sibling nodes are to be printed for the binary tree.Let’s take an example, For the above binary tree, the cousin node is 5.To make the concept more clear let’s describe cousin node. In a binary tree, two nodes are said to ...
Read MoreProgram to print last N lines in c++
In this tutorial, we will be discussing a program to print the last N lines.For this, we will be provided with a string that consists of the new line character to denote the start of the next line and the number of lines to be printed from the last. Our task is to start from the last and print all the N lines counting from the last.Example#include using namespace std; #define DELIM '' //printing the last N lines void print_last_lines(char *str, int n){ if (n
Read MoreMaximum average sum partition of an array in C++
Problem statementGiven an array, we partition a row of numbers A into at most K adjacent (non-empty) groups, then the score is the sum of the average of each group. What is the maximum score that can be scored?ExampleIf input array is {9, 2, 5, 3, 10} then we can partition array as follows −{9} {2, 5, 3} and {10} then average sum of this is −9 + (2 + 5 + 3)/ 3 + 10 = 22.33AlgorithmWe can use memorization technique to solve this problem −Let memo[i][k] be the best score portioning A[i to n-1] into at most K ...
Read MoreMaximum and Minimum in a square matrix in C++
Problem statementGiven a square matrix of order n*n, find the maximum and minimum from the matrixExampleIf given matrix is −{{15, 17, 19}, {5, 1, 7}, {14, 5, 16}} then Minimum number is 1 and maximum number is 19AlgorithmSelect two elements from the matrix one from the start of a row of the matrix another from the end of the same row of the matrixCompare them and next compare smaller of them to the minimum of the matrix and larger of them to the maximum of the matrix.We can see that for two elements we need 3 compare so for traversing ...
Read MoreSetting up C++ Development Environment
Text EditorThis will be used to type your program. Examples of few editors include Windows Notepad, OS Edit command, Brief, Epsilon, EMACS, and vim or vi.Name and version of text editor can vary on different operating systems. For example, Notepad will be used on Windows and vim or vi can be used on windows as well as Linux, or UNIX.The files you create with your editor are called source files and for C++ they typically are named with the extension .cpp, .cp, or .c.A text editor should be in place to start your C++ programming.C++ CompilerThis is an actual C++ ...
Read MoreCons of using the whole namespace in C++
In C++, we use different namespaces. We can also create our own namespaces. For example, generally, we use standard namespace called std. We write the syntax like:using namespace std;In the standard library, it contains common functionality you use in building your applications like containers, algorithms, etc. If names used by these were out in the open, for example, if they defined a queue class globally, you'd never be able to use the same name again without conflicts. So they created a namespace, std to contain this change.The using namespace statement just means that in the scope it is present, make ...
Read MoreFind the closest pair from two sorted arrays in c++
Suppose we have two sorted arrays and a number x, we have to find the pair whose sum is closest to x. And the pair has an element from each array. We have two arrays A1 [0..m-1] and A2 [0..n-1], and another value x. We have to find the pair A1[i] + A2[j] such that absolute value of (A1[i] + A2[j] – x) is minimum. So if A1 = [1, 4, 5, 7], and A2 = [10, 20, 30, 40], and x = 32, then output will be 1 and 30.We will start from left of A1 and right from ...
Read MoreProduct of non-repeating (distinct) elements in an Array in C++
We are given with an array of repeating or duplicate elements and the task is to find the product of all those elements which are non-repeating or distinct in the given array and display the results.ExampleInput-: arr[] = {2, 1, 1, 2, 3, 4, 5, 5 } Output-: 120 Explanation-: Since 1, 2 and 5 are repeating more than once so we will take them into consideration for their first occurrence. So result will be 1 * 2 * 3 * 4 * 5 = 120 Input-: arr[] = {1, 10, 9, 4, 2, 10, 10, 45, 4 } ...
Read MoreProgram for Mobius Function in C++
Given a number n; the task is to find the Mobius function of the number n.What is Mobius Function?A Mobius function is number theory function which is defined by$$\mu(n)\equiv\begin{cases}0\1\(-1)^{k}\end{cases}$$n= 0 If n has one or more than one repeated factorsn= 1 If n=1n= (-1)k If n is product of k distinct prime numbersExampleInput: N = 17 Output: -1 Explanation: Prime factors: 17, k = 1, (-1)^k 🠠(-1)^1 = -1 Input: N = 6 Output: 1 Explanation: prime factors: 2 and 3, k = 2 (-1)^k 🠠(-1)^2 = 1 Input: N = 25 Output: 0 Explanation: Prime factor is ...
Read More