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 554 of 597
Minimum flips to make all 1s in left and 0s in right in C++
Problem statementGiven a binary string in which we can flip all 1’s in left part and all 0’s in right part. The task is to calculate minimum flips required to make all 1’s in left and all 0’s in rightExampleGiven binary string is 0010101. In this string there are 3 1-bits and 4 0-bits. We have to flip highlighted 4 bits to make all 1’s in left and all 0’s in right as shown below −0010101After flipping string will become −1110000AlgorithmTraverse the string from left to right and calculate the number of flips required to convert all 0’s to 1’s.Traverse ...
Read MoreMinimum height of a triangle with given base and area in C++
DescriptionGiven two integers a and b, find the smallest possible height such that a triangle of atleast area ‘a’ and base ‘b’ can be formed.ExampleIf a = 16 and b = 4 then minimum height would be 8AlgorithmArea of triangle can be calculate using below formula −area = ½ * height * baseUsing above formula, height can be calculated as −height = (2 * area) / baseSo Minimum height is the ceil() of the height obtained using above formula.Example#include #include using namespace std; float minHeight(int area, int base) { return ceil((2 * area) / base); } int main() { int area = 16, base = 4; cout
Read MoreBinomial Coefficient in C++
Binomial coefficient denoted as c(n, k) or ncr is defined as coefficient of xk in the binomial expansion of (1+X)n.The Binomial coefficient also gives the value of the number of ways in which k items are chosen from among n objects i.e. k-combinations of n-element set. The order of selection of items not considered.Here, we are given two parameters n and k and we have to return the value of binomial coefficient nck .ExampleInput : n = 8 and k = 3 Output : 56There can be multiple solutions to this problem, General SolutionThere is a method to calculate the value ...
Read MoreBinary representation of next number in C++
In this problem, we are given the binary representation of a number and we have to find the binary representation of the next number i.e. the number that is resulted after adding one to the given number.Binary representation of a number is changing the base of the number to base 2 and representing the number using only 0 or 1.For example, Binary representation of 14 is 1110.So, here we would be given a number, let's say n in binary form. And we have to find the binary representation of n+1.To solve this problem, we need to know the basics of ...
Read MoreBinary Insertion Sort in C++
Binary Insertion sort is a special type up of Insertion sort which uses binary search algorithm to find out the correct position of the inserted element in the array.Insertion sort is sorting technique that works by finding the correct position of the element in the array and then inserting it into its correct position.Binary search is searching technique that works by finding the middle of the array for finding the element.As the complexity of binary search is of logarithmic order, the searching algorithm’s time complexity will also decrease to of logarithmic order.Implementation of binary Insertion sort. this program is a ...
Read MoreBiggest number by arranging numbers in certain order in C++
In this problem, we are given an array of numbers and we have to find the largest value that can be made by changing them in a certain way. the condition for the arrangement is, the order of even numbers and odd numbers shall remain the same i.e. the order of all even numbers cannot be changed.let's take an example to understand the concept better, Input : {17, 80, 99, 27, 14 , 22} Output: 801799271422 Explanation: the order of Even and Odd numbers is : Even : 80 14 22 Odd : 17 99 27Here 99 is the biggest ...
Read MoreBFS for Disconnected Graph in C++
Disconnected graph is a Graph in which one or more nodes are not the endpoints of the graph i.e. they are not connected.A disconnected graph…Now, the Simple BFS is applicable only when the graph is connected i.e. all vertices of the graph are accessible from one node of the graph. in the above disconnected graph technique is not possible as a few laws are not accessible so the following changed program would be better for performing breadth first search in a disconnected graph.Example#include using namespace std; void insertnode(vector adj[], int u, int v) { adj[u].push_back(v); } void breathFirstSearch(int u, ...
Read MoreBest meeting point in 2D binary array in C++
In this problem, we are given a 2D binary array i.e. it has values that are either 0 or 1, where 1 is marked as a home of a person of the group. And people of the group want to meet. So, they need to minimise the total distance travelled by them for meeting at a common point. A valid meeting point can be anywhere but not at anyone home.For find minimum distance a formula is created, this is named as manhattan distance, where distance −(p1, p2) = |p2.x| + |p2.y - p1.y|.Let’s take an example, to make the concept ...
Read MoreBest First Search (Informed Search)
Best first search is a traversal technique that decides which node is to be visited next by checking which node is the most promising one and then check it. For this it uses an evaluation function to decide the traversal.This best first search technique of tree traversal comes under the category of heuristic search or informed search technique.The cost of nodes is stored in a priority queue. This makes implementation of best-first search is same as that of breadth First search. We will use the priorityqueue just like we use a queue for BFS.Algorithm for implementing Best First SearchStep 1 ...
Read MoreBell Numbers - Number of ways to Partition a Set in C++
A bell number is used to denote the number of ways a set of n elements can be partitioned into subsets that are not empty (i.e. have at least one element).In this program, we are given a set of n elements and we have to find the number of ways to partition the set into non-empty subsets.ExampleInput : 3 Output : 5Explanation − let the set of three elements {1, 2, 3}.The subsets are {{1} , {2} , {3}} ; {{1} , {2, 3}} ; {{1 , 2} , {3}} ; {{2} , {1 , 3}} ; {1 , 2 , 3}.Bell ...
Read More