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 367 of 597
Monotonic Shortest Path from Source to Destination in Directed Weighted Graph
Pathfinding algorithms are based on graph search techniques that study paths between nodes, starting with one node and progressing via connections until the objective is attained. In this post, we'll talk about weighted graphs and how to calculate the monotonic shortest route between source and end node in a directed weighted graph. What Are Weighted Graphs? A weighted graph combines a graph with a weight function. That is, it assigns an integer weight to every edge. There are multiple uses for edge weights for a graph − Network Connection Latency Road Network Distances The Strength of a social network interaction ...
Read MoreFind All Remaining Vertices In Graph After Marking Shortest Path For Neighbours
Algorithms concerning graph search algorithms traverse a graph in pursuit of broad discovery or targeted search. These algorithms cut pathways across the network, but no one expects those paths to be computationally optimum. Pathfinding algorithms are assembled on graph search techniques as well as these investigate pathways amongst vertices, beginning at a specific node and going via connections till the goal is visited. What Are Graphs? Graphs are data structures that reflect "connections" among sets of components. These items are known as nodes. Edges are the connections between nodes. Shortest Path The Shortest Path algorithms locate the shortest paths or ...
Read MoreSorting a Vector of Numeric Strings in Ascending Order
In this article, we'll examine a C++ procedure for ascendingly sorting an array of numerical string values. Sorting is a basic operation that entails organizing elements in a predetermined order. Because they are character-based strings that represent numbers, and these numerical strings provide a special set of challenges when it is related to sorting. The issue statement, a method and algorithm for solving it, a C++ implementation, a complexity reasoning of the provided approach, and a summary of the main points will all be covered. Problem Statement Consider a vector containing numerical strings, the aim is to arrange them in ...
Read MoreMaximum count of unique index 10 or 01 substrings in given Binary string
In this problem, we will count the maximum number of 10 and 01 pairs that can be formed using the given binary string. To solve the problem, we can check the number of 10 and 01 pairs we can form using adjacent characters without sharing any characters in two pairs. Problem Statement We have given a bin_str binary string. We need to count the maximum number of 10 and 01 pairs we can make using the adjacent characters only. Also, we can use one character in any single pair. Two pairs can't share a single character. Sample Examples Input ...
Read MoreC++ Program to Find the Mth element of the Array after K left rotations
In this problem, we need to print the element from the given index after rotating the array for K times. This problem teaches us to find the element from the particular index in the rotational array. At first sight, the solution that comes to mind is that rotate the array for K times and access the Mth element, but we will also learn to access the Mth element in the rotational array without rotating the array. Problem Statement We have given arr[] array containing N numbers. Also, we have given the positive integer M and K. We need to rotate ...
Read MoreFind index of pair among given pairs with just greater average
In this problem, we will find the index value for each pair such that the resultant pair's average value is just greater than the current pair's average value. To solve the problem, we will use the sorting algorithm and binary search technique. We will use a sorting algorithm to sort the array based on the pair's average value and a binary search algorithm to search a pair with a greater average value from the sorted array. Problem Statement We have given a pairs[] array containing the N pairs of positive integers. It is also given that the first element of ...
Read MoreCount unique Strings by replacing Consonant with closest vowel and vice versa
In this problem, we will count the number of unique strings we can generate by replacing each vowel with the closest consonant and each consonant with the closest vowel. We can find the number of choices for each character of the string to replace the current character with other characters. After that, we can multiply the number of choices of each character to get the answer. Problem Statement We have given an alpha string. We need to count the total number of different strings we can generate from the given string by performing the below operations on each character of ...
Read MoreCan String be considered as a Keyword?
Keywords are important in any programming language, as they are reserved words with a particular predefined meaning. The keywords are used to define the variables, function, and class, change the program's control flow, traverse the list, etc. When we talk about the 'String', it is a fundamental data type to represent a series of characters. Some programming languages refer to the 'String' as a class, and some programming languages refer to the 'String' as a keyword. In this tutorial, we will explore the use of the 'String' word in the programming language. C/C++ The C or C++ programming languages are ...
Read MoreValue of k-th index of a series formed by append and insert MEX in middle
In this article, we will learn about Mex and will also generate the C++ code that returns the kth index of the series so formed by using append and MEX (>0) operations on the given sequence. The roadmap of the operations to be performed is given below − Start with a sequence containing only the number 1 i.e, [1]. Now, we need to perform (n-1) steps − In each step, we append the current series by itself. For example, if the existing series is [1, 2, 3], after appending, it becomes [1, 2, 3, 1, 2, 3]. Now, find ...
Read MoreSum of series (n/1) + (n/2) + (n/3) + (n/4) +……. + (n/n)
This this article, we will discuss the different approaches to calculate the sum of the given series. Problem Statement We are given a number and our task is to calculate the sum of the series Σ (n / i) for I =0 to i=n. We are given any given value of n where n can be any number less than 10^12 considering on integer division. For example, if the given input is 10, The sum of given series can be written as (10/1) + (10/2) + (10/3) + (10/4) + (10/5) + (10/6) + (10/7) + (10/8) + ...
Read More