Articles on Trending Technologies

Technical articles with clear explanations and examples

How to combine vectors of equal length into a list with corresponding elements representing a single element of the list in R?

Nizamuddin Siddiqui
Nizamuddin Siddiqui
Updated on 11-Mar-2026 595 Views

To combine three vectors into a list with corresponding elements representing a single element of the list we can use mapply function. For example, if we have three vectors x, y, and z each having number of elements equal to one-hundred then the list with corresponding elements can be created by using mapply(c,x,y,z,SIMPLIFY=FALSE).Examplex1

Read More

How to find percentile rank for groups in an R data frame?

Nizamuddin Siddiqui
Nizamuddin Siddiqui
Updated on 11-Mar-2026 1K+ Views

The word percentile means the percentage that falls below or above the percentile value. For example, if we have a value that lies at 50th percentile then we would say 50 percent of the values lies below or above that value. The value 50 here is called the percentile rank. To find the percentile rank for groups in an R data frame, we can use mutate function of dplyr package.ExampleConsider the below data frame −Group

Read More

Deleting a binary tree using the delete keyword in C++?

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 282 Views

Let us first define our binary tree using a class containing int data, btree_node * rightChild, btree_node * leftChild. The leftChild and rightChild are pointers to btree_node. All the members in our class are public.class btree_node {    public:       int data;       btree_node* leftChild;       btree_node* rightChild;For creating a new node we have the constructor function that takes the int value as parameter to assign it to the newly created node value. The leftChild and rightChild are set to null.btree_node(int data){    this->data = data;    this->leftChild = NULL;    this-> = NULL; ...

Read More

How to create three-dimensional arrays of different sizes in R?

Nizamuddin Siddiqui
Nizamuddin Siddiqui
Updated on 11-Mar-2026 1K+ Views

A three-dimensional array can have matrices of different size and they are not necessarily to be square or rectangular. Also, all the elements in an array are of same data type. To create a three-dimensional array of different size we would need to use the proper number of rows and columns within the array function.ExampleA1

Read More

Maximum product of a triplet (subsequence of size 3) in array in C++ Program.

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 879 Views

In this problem, we are given an array arr[] consisting of n integers. Our task is to find the maximum product of a triplet (subsequence of size 3) in array. Here, we will be finding the triple with maximum product value and then return the product.Let’s take an example to understand the problem, Inputarr[] = {9, 5, 2, 11, 7, 4}Output693ExplanationHere, we will find the triplet that gives the maximum product of all elements of the array. maxProd = 9 * 11 * 7 = 693Solution ApproachThere can be multiple solutions to the problem. We will be discussing them here, ...

Read More

Demlo number (Square of 11...1)" in C++?

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 350 Views

Demlo numbers are palindromic numbers that are generated by the square of number of form 11..1 given that the number is less than 10 digits.Let us first declare the string variables −string demNum = "1111"; string square = "";Now, we loop till the length of the demNum string. Inside the loop we convert the index value i to string and append it to square variable.for(int i=1 ;i= 1; i--)    square += char(i + '0');ExampleLet us see the following implementation to get a better understanding of demlo numbers −#include using namespace std; int main(){    string demNum = "1111"; ...

Read More

Maximum product of an increasing subsequence of size 3 in C++ program

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 305 Views

In this problem, we are given an array arr[] of n positive integers. Our task is to create a program to find the Maximum product of an increasing subsequence of size 3.Problem Description − Here, we need to find the maximum product of 3 elements of the array such that they form an increasing subsequence and array index are also increasing i.e.arr[i]*arr[j]*arr[k] is maximum, arr[i] j to n−1Step 1.1.1.1 −if(arr[j] < arr[k]) −> find prod = arr[i]*arr[j]*arr[k].Step 1.1.1.2 −if(maxProd > prod) −> maxProd = prod.Step 2 −Return maxProd.ExampleProgram to illustrate the working of our solution, #include using namespace std; ...

Read More

Maximum product of an increasing subsequence in C++ Program

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 314 Views

In this problem, we are given an array arr[] of size n. Our task is to find the maximum product of an increasing subsequence.Problem Description − We need to find the maximum product of increasing subsequence of any size possible from the elements of the array.Let’s take an example to understand the problem, Inputarr[] = {5, 4, 6, 8, 7, 9}Output2160ExplanationAll Increasing subsequence: {5, 6, 8, 9}. Prod = 2160 {5, 6, 7, 9}. Prod = 1890 Here, we have considered only max size subsequence.Solution ApproachA simple solution to the problem is by using a dynamic programming approach. For this, ...

Read More

Deletion in a Binary Tree in C++?

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 451 Views

The deletion is to be performed by replacing the deleted mode by bottom and rightmost node.Let us first define the struct that would represent a tree node that contains the data and its left and right node child. If this is the first node to be created then it’s a root node otherwise a child node.struct Node {    int data;    struct Node *leftChild, *rightChild; };Next we create our newNode(int data) function that takes an int value and assign it to the data member of the node. The function returns the pointer to the created struct Node. Also, the ...

Read More

Maximum product of indexes of next greater on left and right in C++ Program

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 467 Views

In this problem, we are given an array arr[]. Our task is to create a program to calculate the Maximum product of indexes of next greater on left and right.Problem Description −For the given array we need to find the product of maximum value of left[i]*right[i]. Both arrays are defined as −left[i] = j, such that arr[i] j. right[i] = j, such that arr[i] < arr[j] and i < j. *The array is 1 indexed.Let’s take an example to understand the problem, Inputarr[6] = {5, 2, 3, 1, 8, 6}Output15ExplanationCreating left array, left[] = {0, 1, 1, 3, 0, ...

Read More
Showing 25771–25780 of 61,299 articles
Advertisements