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
Tag Archives: Data Structures
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
A linked list is a kind of linear data structure where each node has a data part and an address part which points to 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
Prerequisite: XOR Linked List An ordinary Doubly Linked List requires space for two address fields to store the addresses of previous and next nodes. A… Read More
1. Database : A Database is a collection of data that is stored in an organized fashion in a table containing rows and columns using a… Read More
Why is Math required for Deep Learning? Interested people who have the thirst to learn more about the concept behind a deep learning algorithm need… Read More
Data Structure is the way of storing data in computer’s memory so that it can be used easily and efficiently. There are different data-structures used… Read More
Google AdWords: is an online advertising platform developed by Google, where advertisers pay to display brief advertisements, service offerings, product listings, video content, and generate… Read More
Given a Binary Tree, the task is to find the maximum value of GCD from any path from the root node to the leaf node.… Read More
Given an array prices[] which denotes the prices of the stocks on different days, the task is to find the maximum profit possible after buying… Read More
I got referred to DE Shaw by my friend and was invited to take their online coding round. Round 1 | Online coding | 70… Read More
Given an array arr[] consisting of N integers, the task is to modify the array such that arr[index] = index using minimum number of operations… Read More
Given an undirected and unweighted graph and two nodes as source and destination, the task is to print all the paths of the shortest length… Read More
Given two arrays arr1[] and arr2[] of N integers. We can choose any two adjacent elements from array arr1[] and swap them if they are… Read More
Courses
