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 1858 of 2547
Find 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 MoreGolang program to find maximum element in array using linear search
In this Golang article, we will learn how to find maximum element in array using linear search by using recursion and iterative method. Syntax func findMax(arr []int) int {…} The findMax() function is used to find maximum element in array using linear search iteratively. It takes an integer array as argument to it. func findMax(arr []int, n int) int {…} The findMax() function is used to find maximum element in array using linear search recursively. It takes an integer array and the size of the array as arguments to it. Algorithm Step 1 − First, ...
Read MoreGolang program to find minimum element in array using linear search
In this Golang article, we will learn how to find the minimum element in an array using linear search by using recursion and iterative method. An array is a collection of elements of the same data type, arranged in a contiguous block of memory, and accessed using an index or a subscript. Linear search is a simple search algorithm that checks every element in a list or array one by one, starting from the beginning, until a target value is found or the entire list has been searched. It is also known as sequential search. Syntax func minFind(arr []int) int ...
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 MoreSwift Program to Sort Dictionary by keys
Swift supports a sorted() method to sort all the elements present in the given dictionary. This method sorts the key-value pairs of the dictionary according to their keys. Syntax func sorted(by:) Here, the value of by parameters are − Greater than(>) − To sort the elements into descending order. Less than(
Read MoreSwift Program to convert the string into an array of characters based on the specified character
In Swift, convert the string into an array of characters based on the specified character using the split() function. The split() function splits the given string at the specified separator and returns the result in an array. Input String = “Today is cloudy day” Character = “y” Output [“toda”, “is cloud”, “da”] Here, the string is split at character “y” and converted the split string into an array. Syntax func.split(separator:Character, maxSplits Int, ommittingEmptySequence:Bool) The split function takes the following arguments − separator − It is an element at which the split operation happens. maxSplits − ...
Read MoreSwift Program to Sort a Dictionary By Values
Swift supports a sorted() method to sort all the elements present in the given dictionary. This method sorts the key-value pairs of the dictionary according to the values. Syntax func sorted(by:) Here, the value of by parameters are − Greater than(>) − To sort the elements into descending order. Less than(
Read More