Given an array arr[] of size N, where arr[i] denotes the number of elements on the left that are greater than the ith element in… Read More

# Category Archives: Advanced Data Structure

Tarjan’s Algorithm: The Tarjan’s Algorithm is an efficient graph algorithm that is used to find the Strongly Connected Component(SCC) in a directed graph by using… Read More

Prerequisite: Generic Trees(N-array Trees) In this article, we will discuss the conversion of the Generic Tree to a Binary Tree. Following are the rules to… Read More

Given an array of strings arr[], the task is to find the pair of strings from the given array whose length of the longest common… Read More

Given an array arr[]of size N and an integer K, the task is to count the number of pairs from the given array such that… Read More

Given an array A[] of size N, the task for each array element is to count the array elements on their right that are smaller… Read More

Given an array arr[] consisting of N integers, the task is to find the maximum Bitwise XOR from all the possible pairs in the given… Read More

Prerequisite: Introduction to Social Networks In Social Networks, Network is of 2 types- Unsigned Network and Signed Network. In the unsigned network, there are no… Read More

Prerequisite: Page Rank Algorithm and Implementation, Random Walk In Social Networks page rank is a very important topic. Basically page rank is nothing but how… Read More

Prerequisite: Introduction to Social Networks, Erdos-Renyi Model Erdos Renyi model is used to create random networks or graphs on social networking. In the Erdos Reny… Read More

Prerequisite: Introduction to Social Networks K-shell decomposition is the method in which we can divide nodes on the basis of the number of its degree… Read More

Prerequisite- Introduction to Social Networks, Barabasi Albert Graph In social networks, there is a phenomenon called Rich getting Richer also known as Preferential Attachment. In… Read More

Given a Binary Tree, the task is to find the node from the given tree which has the maximum number of nodes in its subtree… Read More

Given two arrays arr[] and query[] of sizes N and Q respectively and an integer M, the task for each query, is to count the… Read More