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 1443 of 2547
Program to print an inverse pyramid character pattern in C++
In this tutorial, we will be discussing a program to print an inverse pyramid character pattern.For this we will be provided with the number of rows containing in the inverted pyramid triangle. Our task is to print the alphabets in the given number of rows to develop the shape of an inverse pyramid.Example#include using namespace std; //printing the inverse pyramid pattern void inv_pyramid(int n){ int i, j, num, gap; for (i = n; i >= 1; i--) { for (gap = n - 1; gap >= i; gap--) { cout
Read MoreAdd to Array-Form of Integer in Python
Suppose we have a number in array form. So if the number is say 534, then it is stored like [5, 3, 4]. We have to add another value k with the array form of the number. So the final number will be another array of digits.To solve this, we will follow these steps −Take each number and make them string, then concatenate the stringconvert the string into integer, then add the numberThen convert it into string again, and make an array by taking each digit form the string.ExampleLet us see the following implementation to get better understanding −class Solution(object): ...
Read MoreMaximum even length sub-string that is permutation of a palindrome in C++
Problem statementGiven a string the task is to find the maximum length of the sub-string of that can be arranged into a Palindrome.ExampleIf input string = “5432112356” then answer is 6 as maximum palindrome substring is “321123” and its length is 6AlgorithmIf the length of the sub-string is odd, then it cannot be considered in the final solutions.If the length of the sub-string is even, then it can be a possible solution only if each character in that sub-string occurs even number of times which can be done using the dictionary count. We check if each character occurs even number ...
Read MoreComplement of Base 10 Integer in Python
Suppose we have a number in decimal number system. We have to get the complement of the number in binary form, then again change it to decimal and return the result. So if the number is 20, then the binary form will be 10100, the complement will be 01011, this is 11 in decimalTo solve this, we will follow these steps −s := binary string of the number nsum := 0 and num := 1for each element i in s in reverse directionif i = ‘b’, then return sumotherwise when i = ‘0’, then sum := sum + numnum := ...
Read MoreFind the closest leaf in a Binary Tree in C++
Suppose, one binary tree is given. It has leaf nodes at different levels. Another pointer is given, that is pointing to a node. We have to find the distance to the nearest leaf node from the pointed node. Consider the tree is like below −Here leaf nodes are 2, -2 and 6. If the pointer is pointing to node -5, The nearest nodes from -5 will be at distance 1.To solve this, we will traverse the subtree rooted with the given node, and find the closest leaf in the subtree, then store the distance. Now traversing tree starting from the ...
Read MorePrint all combinations of balanced parentheses in C++
In this problem, we are given an integer n. Our task is to print all possible pairs of n balanced parentheses.Balanced parentheses are parentheses pairs that have a closing symbol for every corresponding opening symbol. Also, pairs should be properly nested.Let’s take an example to understand the problem, Input: n = 2 Output: {}{} {{}}To solve this problem, we need to keep track of pairs of brackets. The initial count of brackets is 0. Then we will recursively a function till the total bracket count is less than n. Count brackets, recursively call for brackets based on the count. If ...
Read MoreMaximum games played by winner in C++
Problem statementThere are N players which are playing a tournament. We need to find the maximum number of games the winner can play. In this tournament, two players are allowed to play against each other only if the difference between games played by them is not more than oneExampleIf There are 3 players then 2 games are required to decide the winner as follows −Game – 1: player 1 vs player 2Game - 2: player 2 vs winner from Game - 1AlgorithmWe can solve this problem by first computing minimum number of players required such that the winner will play ...
Read MorePath Sum III in C++
Suppose we have given a binary tree in which each node holds an integer key. We have to find the paths that sum to a given value. The path should start from root to leaf. We have to find the path where the sum is same.If the tree is like [5, 4, 8, 11, null, 13, 4, 7, 2, null, null, 5, 1], and sum is 22, then it will be −The paths are [[5, 4, 11, 2], [5, 8, 4, 5]].To solve this, we will follow these steps −Use the dfs function to solve this problem, the dfs is ...
Read MorePrint all 3 digit repeating numbers in a very large number in C++
In this problem, we are given a number. And we have to print all 3 digit repeating numbers.Let’s take an example to understand the problem, Input: 98769876598765 Output: 987: 3 times 876: 3 times 765: 2 timesTo solve this problem, we will use the large number which is stored string. The digits of the numbers are counted as characters. Now, we will check the first three numbers and then start from the 3rd index to the end and get a new number. After this, we will check for the next 3 digit numbers are count its frequency. ...
Read MoreMaximum height of triangular arrangement of array values in C++
Problem statementGiven an array, we need to find the maximum height of the triangle which we can form, from the array values such that every (i+1)th level contain more elements with the larger sum from the previous level.ExampleIf input array is {40, 100, 20, 30 } then answer is 2 as −We can have 100 and 20 at the bottom level and either 40 or 30 at the upper level of the pyramidAlgorithmOur solution just lies on the logic that if we have maximum height h possible for our pyramid then ( h * (h + 1) ) / 2 ...
Read More