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
Articles by Tapas Kumar Ghosh
Page 18 of 19
Difference between Backtracking and Branch-N-Bound technique
The Backtracking technique is an algorithm used to solve the decision problem whereas the Branch-N-Bound technique is an algorithm used to solve the optimization problem. Both techniques follow the brute force method and are used to generate the State Space tree. A State Space tree is the tree that represents the nodes in all possible states of the problem from a root node to the terminal node.Let us learn both techniques one by one and understand the difference in detail. Backtracking Technique Backtracking is the modified process of the brute force approach where the technique efficiently searches for a solution ...
Read MoreCheck if product of Array elements in given range are M-th root or not
M-th root is defined as the cube of any number and array ranges mean to count the indexes from first to end. We will take three numbers in the array range as input and see if their product value comes in the form of a cube value then it will be the 'M-th' root of the number. Let’s take an example to understand the product range of an array and calculate the M-th root of the number. Example 1 Given array integer is 9, 8, 3, 1 Now we see the product range of array 9*8*3*1 is 216. Therefore, 216 ...
Read MoreCheck if it is possible to reach the index with value K when start index is given
C++ has a bitwise operator “||” to check multiple conditions at once and for finding the length of an array we use the size() function. In the given problem statement, we need to reach the K-th value which sets to 0 in the array range, and the starting index is already known. If the given index satisfies to K-th value in the array range then it will print that “We can reach the value k from the given start index”. Let’s take an example of this − Given integer array is 5, 6, 0, 9, 10 having a length of ...
Read MoreInversion Count using Policy Based Data Structure
We will use the g++ header file to compile the code in C++ compiler. g++ is a Linux based header file that is used in C++ to compile the code of policy based data structure. The policy based data structure are such structures used for high performance and flexibility of the code. As these data structures are so resourceful that we can use them for many functions like searching the index of an element, inserting the element into the index position, removing the element from the range of index, etc. Example Let’s take an example of inversion count − Suppose ...
Read MoreFind strings that end with a given suffix
C++ has a predefined function substr to return the portion of string and compare function to check the sequence of characters. The suffix means the group of characters added to the end of the word. In this article, we are going to find the strings that end with a given suffix. Let us understand the example of suffix by taking some of the strings − Tutorialspoint − The characters n and t represent the suffix. Tutorix − The characters r, i, and x represent the suffix. Note that, the length of the reverse of some characters in ...
Read MoreMinimum cost of reducing Array by merging any adjacent element repetitively
In C++ we have a pop() function to remove the element from the beginning. The top() function returns the reference of the first element of the priority_queue whereas the push() function is used to insert an element on it. A priority queue is a part of the data structure that manages elements based on their values. In this article, we will learn the minimum cost of reducing an array by merging any adjacent element repetitively. Let's take an example from this article − We will draw the array of size 4 and add the adjacent element repetitively. Syntax The ...
Read MoreString Range Queries to count number of distinct character with updates
A string range query is the range of characters present in the string where a character starts from the index[0] and the last index[] may be specified according to the length of a given string. In this article, we are going to learn how string range queries count the number of distinct characters with their updates. Let’s take an example of counting the number of distinct characters of a string with its update. string = “tutorialpoint” // original string The given string is the length of 12. So the count is 13(counting always starts from 1). If we ...
Read MoreNumber of times an array can be partitioned repetitively into subarrays with equal sum
In C++ we have a vector header file that can change the size of an array during runtime. In this article, we are going to learn the concept of the number of times an array can be partitioned repetitively into subarrays with equal sum. Let’s take an example to show an array partition with an equal sum. The given array is {1, 2, 3, 4, 2} and we are subdividing the array into two parts − {1, 2, 3}- The total sum of each index of an array is 6. {4, 2}- The total sum of each index of an ...
Read MoreSum of minimum element at each depth of a given non cycle graph
A graph that does not contain any cycles or loops is called a non-cycle graph. A tree is a non-cycle graph in which every node is joined to another unique node. A non-cycle graph is also known as an acyclic graph. Difference between cycle graph and non-cycle graph − Cycle Graph Non-Cycle graph The graph forms a closed loop. The graph doesn’t form a closed loop. The graph doesn’t contain a depth loop The graph contains each depth. Example 1 let’s take an example of a cycle graph − A Cycle ...
Read MoreIsomorphism in N-ary Trees
Isomorphism is defined as two trees either having identical or mirror structures. In the case of mirror structure, the left node data will always match the right node. For example, we will take a number nearest to the mirror and see what its reverse would be, that is the real concept of isomorphism. In this article, we are going to check whether two different binary trees are isomorphic or not. Let’s take an example of Isomorphism in N-ary Trees − Note that, L represents as left node whereas R represents as Right node Mirror structure of P and Q ...
Read More