Skip to content

Tag Archives: Data Structures

Given a permutation A[] of first N integers (i.e. array contains integers from 1 to N exactly once) and an integer K, the task is… Read More
Given an array A[] of N integers, the task is to find the minimum number of operations to sort the array in non-decreasing order, by… Read More
Given two binary strings S and T of size N and M respectively, the task is to check if S can be converted into T… Read More
What is TCS NQT ? TCS NQT is National Qualifier Test conducted by Tata Consultancy Services, it is a prerequisite for all the tests. The… Read More
The push–relabel algorithm (alternatively, pre flow–push algorithm) is an algorithm for computing maximum flows in a flow network. Push-relabel algorithms work in a more localized… Read More
Overview :This article will make you aware about Encapsulation & Decapsulation, and their differences. In any type transmission of data, it is very important to… Read More
Two strings are said to be isomorphic if it is possible to map every character of the first string to every character of the second… Read More
Mother vertex: A mother vertex in a Graph G = (V, E) is a vertex v such that all other vertices in  G can be… Read More
Given a binary tree, the task is to compress all the nodes on the same vertical line into a single node such that if the… Read More
An Orthogonal Linked List is a data structure composed of fundamental elements called Nodes (similar to linked lists). Each node in an orthogonal Linked List… Read More
AVL Tree: It is a self-balancing Binary Search Tree where the Balance Factor cannot be more than one for all nodes. Balance Factor can be… Read More
The Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix or discrete Laplacian, is a matrix representation of a graph. To find the… Read More
The stack is a linear data structure which works on the LIFO concept. LIFO stands for last in first out. In the stack, the insertion… Read More

Start Your Coding Journey Now!