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 40 of 597
Deletion in a Binary Tree in C++ Program
In this tutorial, we are going to learn how to delete a node in a binary tree.The nodes in a binary tree don't follow any order like binary search trees. So, how to arrange the nodes after deleting a node in a binary tree?Well, we will replace the deepest node of the tree with the deleting node. And then we will delete the deepest node from the node.Let's see the steps to solve the problem.Initialize the tree with binary node struct.Write a function (preorder, in order, and postorder) to print the nodes of the tree.Write a function to delete the ...
Read MoreDifferent substrings in a string that start and end with given strings in C++ Program
In this tutorial, we are going to write a program that finds the total number of substrings that starts and ends with the given strings.We are given one string and two substrings. We need to find the different substrings count that starts and ends with the given two substrings. Let's see an example.Inputstr = "getmesomecoffee" start = "m" end = "e"Output6There are a total of 6 different substrings in the given string. They are me, mesome, mesomemecoffe, mesomemecoffee, mecoffe, mecoffee.Let's see the steps to solve the problem.Initialize the strings.Iterate over the str and find the start and end substrings indexes. ...
Read MorePowerful Integers in C++
Let us suppose we have three integers 'a' and 'b' and 'limit'. The task is to print the numbers in the range [a, limit]. List of these numbers is said to be powerful integers and represented as, a^i + b^j such that i >= 0 and j >= 0For ExampleInput-1:a = 2b = 5limit = 10Output:[2, 3, 4, 5, 6, 7, 9]Explanation: for each i and j, 2^0 + 5^0 = 2 , 2^0 + 5^1= 6 2^1 + ...
Read MoreDivide the given linked list in two lists of size ratio p:q in C++ Program
In this tutorial, we are going to write a program that divides the given linked list into a p:q ratioIt's a straightforward program. Let's see the steps to solve the problem.Create a struct for the linked list node.Initialize the linked list with dummy data.Initialize the p:q ratio.Find the length of the linked list.If the length of the linked list is less than p + q, then it's not possible to divide the linked into a p:q ratio.Else iterate the linked list until p.After the p iterations, remove the link and create a new head for the second linked list.Now, print ...
Read MoreDouble ended priority queue in C++ Program
In this tutorial, we are going to create a double-ended priority queue using the set in c++.Let's see the steps to create a double-ended queue.Create a struct with a name as you wish.Create a variable for the queue using the set.size method that returns the size of the queue.is_empty method that returns whether the queue is empty or not.insert method to insert a new element into the queue.get_start method that returns an element from the left side of the queue.get_end method that returns the element from the right side of the queue.delete_start method that deletes the first element from the ...
Read MoreCreate a linked list from two linked lists by choosing max element at each position in C++ Program
In this tutorial, we are going to write a program that creates a new linked list from the given linked lists.We have given two linked lists of the same size and we have to create a new linked list from the two linked lists with the max numbers from the two linked lists.Let's see the steps to solve the problem.Write a struct node.Create two linked lists of the same size.Iterate over the linked list.Find the max number from the two linked lists nodes.Create a new node with the max number.Add the new node to the new linked list.Print the new ...
Read MoreCount number of ways to reach destination in a Maze in C++
Given a Maze represented as a row X col matrix in which the obstacle is represented as -1 and a clear cell has value other than -1. The goal is to start from the first cell arr[0][0] and reach the last cell arr[row][col] such that only two moves are allowed:Right move arr[i][j] to arr[i][j+1] and Down move arr[i][j] to arr[i+1][j].Let us understand with examples.Input - arr[row][col] = {{0, 0, 0}, {-1, -1, 0}, {0, 0, 0}}Output - Count of number of ways to reach destination in a Maze are: 1Explanation 0 1 2 0 0 ...
Read MoreCount numbers in range such that digits in it and it's product with q are unequal in C++
Given two numbers start and end as range variables and an integer q as input. The goal is to find the numbers within a range such that the number and its product with q have no common digits.If the number is 5 and q is 3 then the product will be 15. Both 5 and 15 have a common digit 5.If the number is 2 and q is 5 then the product will be 10. Both 2 and 10 have no common digit.Let us understand with examples.For ExampleInput - start = 5, end = 10, q = 2Output - Count ...
Read MoreCount Numbers in Range with difference between Sum of digits at even and odd positions as Prime in C++
Given two numbers start and end as range variables. The goal is to find the count of numbers that lie in this range [start, end] and have a difference of sum of digits at even and sum of digits at odd positions as Prime.That is (sum of digits at even position)-(sum of digits at odd position) = a Prime numberLet us understand with examples.For ExampleInput - start = 230, end = 270Output - Count of Numbers in Range with difference between Sum of digits at even and odd positions as Prime are: 6Explanation - The number(s) between 230 to 270 ...
Read MoreCount of a, b & c after n seconds for given reproduction rate in C++
Given three numbers 'a', 'b' and 'c' as input. The goal is to find the count/value of 'a', 'b' and 'c' after n seconds such that the rate of reproductions are:-Every a changes to b after every 2 secondsEvery b changes to c after every 5 secondsEvery c changes to 2 a after every 12 seconds.Let us understand with examples.For ExampleInput - n_seconds = 62 a = 1 b = 1 c = 1Output - Count of a after n seconds for given reproduction rate is: 0Count of b after n seconds for given reproduction rate is: 33Count of c after ...
Read More