Found 7197 Articles for C++

Count of pair of nodes at even distance (Using BFS)

Satvik Watts
Updated on 01-Nov-2023 11:56:06

124 Views

In this article, we will find the number of the pair of nodes, which are at an even distance of each other in a graph. We will be using the breadth first search (BFS) approach to find the total count. In the approach discussed in this article, we will use a queue data structure which will contain pair of integers. The queue data structure will allow us to go through the graph using the breadth first search algorithm (BFS). We will pick a random node and apply the breadth first search from that node. We will use two variables to ... Read More

Minimize count of alternating subsequences to divide a given Binary String with subsequence number

Thanweera Nourin A V
Updated on 31-Oct-2023 16:17:51

178 Views

The aim of this article is to implement a program Minimize count of alternating subsequences to divide a given binary string with subsequence number. Here, you are provided with a binary string as part of the issue. In order to prevent any subsequence from including adjacent zeros and ones, we must reduce the number of subsequences and output the subsequence number that corresponds to each string element. A subsequence represents a sequence which can be created by taking the supplied sequence and eliminating zero or more members while maintaining the initial position of the elements that remain. Input Let ... Read More

C++ Program to Check if all rows of a matrix are circular rotations of each other

Thanweera Nourin A V
Updated on 30-Oct-2023 16:46:06

106 Views

The aim of this article is to implement a program C++ program to check if all rows of a matrix are circular rotations of each other. Here is a small glimpse on what a matrix exactly is. The rectangular array of symbols or numbers organized in rows and columns is known as a matrix. A matrix can be of many distinct types, including row, column, horizontal, vertical, square, diagonal, identity, equal, and singular. Addition, subtraction, as well as multiplication are the three fundamental matrix operations. The goal is to determine whether all rows of a matrix of size n*n ... Read More

Minimize given Number by swapping adjacent digits with odd difference

Thanweera Nourin A V
Updated on 30-Oct-2023 15:57:27

188 Views

The aim of this article is to implement a program to minimize a given number by swapping adjacent digits with odd differences. The goal is to determine the lowest amount that can be created from a string of size N indicating an integer using only the characters '1', '2', and '3' by exchanging adjacent characters any number of times. As we all know, a string is a group of characters that ends with the null character "0" in C programming. Characters from the C String are kept in a character array. A C string differs from a character array in ... Read More

Check if given String is K-periodic for all K in range [1, N]

Thanweera Nourin A V
Updated on 30-Oct-2023 15:14:19

311 Views

The aim of this article is to implement a program to check if a given String is K-periodic for all K in range [1, N]. The aim is to determine whether the supplied string is K-periodic provided the string s and the integer K. If a string repeats the sub-string str[0... k-1], it is said to be k-periodic; for example, the string "ababab" is 2 periods long. Print Yes if the supplied string is k-periodic; otherwise, print No. If a character string can be created by concatenating at least one repeats from another string of length k, it is said ... Read More

C++ Program to Find Lexicographically minimum string rotation

Thanweera Nourin A V
Updated on 30-Oct-2023 15:54:20

297 Views

The aim of this article is to implement a C++ Program to Find Lexicographically minimum string rotation. Coming on to the definition of string, a string is a group of characters that ends with the null character "0" in C programming. Characters from the C String are kept in a character array. A C string differs from a character array in that it ends with the distinctive character "\0." Finding the rotation of a string that has the lowest lexicographical order among all feasible rotations is known to be the lexicographically minimal string rotation as well as lexicographically smallest circular ... Read More

Check if a path exists for a cell valued 1 to reach the bottom right corner of a Matrix before any cell valued 2

Divya Sahni
Updated on 25-Oct-2023 13:28:50

169 Views

Problems involving grids and matrices are mostly solved using either BFS or DFS traversal algorithms. Taking a look into the first one, Breadth First Traversal − BFS or Breadth First Traversal is an algorithm for searching a tree or a graph data structure. It starts at the root node and explores all the nodes at the present level before moving on to the next level. Algorithm procedure BFS(G, root) is let Q be a queue label root as explored Q.enqueue(root) while Q is not empty do ... Read More

Reduce the array to a single element by repeatedly removing an element from any increasing pair

Divya Sahni
Updated on 25-Oct-2023 13:26:49

234 Views

Reducing an array to a single element by repeatedly removing element is done by the following criteria − Select indices i and j such that i < j and arr[i] < arr[j] and convert one of the two elements to 0. Problem Statement Given an array arr[] containing positive integers. Find if the array can be reduced to a single element by repeatedly removing an element from any increasing pair. If possible return true along with the indices chosen and the index of the element that is removed. Sample Example 1 Input arr[] = {5, 7, 10, 2, 4, ... Read More

Nth term of given recurrence relation having each term equal to the product of previous K terms

Divya Sahni
Updated on 25-Oct-2023 13:24:35

131 Views

Recurrence Relation − In mathematics, recurrence relation refers to an equation where the nth term of the sequence is equal to some combination of the previous terms. For a recurrence relation where each term equals the product of previous K terms, let’s define N and K along with an array arr[] containing the first K terms of the relation. Thus, the nth term is given by − $$\mathrm{F_N= F_{N−1} ∗ F_{N−2} ∗ F_{N−3} ∗ . . .∗ F_{N−K}}$$ Problem Statement Given two positive integers N and K and an array of integers containing K positive integers. Find the Nth term ... Read More

Maximize the length of a subarray of equal elements by performing at most K increment operations

Divya Sahni
Updated on 25-Oct-2023 13:18:47

193 Views

A subarray is a contiguous part of an array i.e. it can be considered as an array inside another array. For example, take the following array, array[] = {1, 2, 3, 4, 5, 6} For the above array, one possible subarray is subarry[] = {2, 3, 4} Problem Statement Given an array arr[] having N positive integers and a positive integer K representing the maximum number that can be added to the elements of the array. The task is to increment the elements of the array by most K increment operations and return the maximum possible ... Read More

Advertisements