## Difference between B tree and B+ tree

B-Tree: B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. In B-tree, a node can have more than… Read More »

- Shortest Path Faster Algorithm
- Count the number of words with given prefix using Trie
- Check if given words are present in a string
- How Coronavirus outbreak can end | Visualize using Data structures
- Design a data structure that supports insert, delete, getRandom in O(1) with duplicates
- Minimum cost of reducing Array by merging any adjacent elements repetitively
- Design a Queue data structure to get minimum or maximum in O(1) time
- Difference between B tree and B+ tree
- Queries for elements having values within the range A to B in the given index range using Segment Tree
- Median of sliding window in an array | Set 2
- Finding shortest path between any two nodes using Floyd Warshall Algorithm
- Ackermann Function
- Paranthesis Theorem
- XOR of elements in a given range with updates using Fenwick Tree
- Types of Tries
- Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
- Maximum CPU Load from the given list of jobs
- Build a segment tree for N-ary rooted tree
- Queries to check if any non-repeating element exists within range [L, R] of an Array
- Proof that traveling salesman problem is NP Hard
- Sum and Maximum of elements in array from [L, R] before and after updates
- Lexicographical smallest number after at most K consecutive swaps
- Range Sum and Update in Array : Segment Tree using Stack
- Sum of prime numbers in range [L, R] from given Array for Q queries
- Query to find the maximum and minimum weight between two nodes in the given tree using LCA.
- Find K-th smallest element in an array for multiple queries
- Counting Inversions using Ordered Set and GNU C++ PBDS
- Static and Dynamic data structures in Java with Examples
- Check if a Tree can be split into K equal connected components
- Count of elements in an Array whose set bits are in a multiple of K

B-Tree: B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. In B-tree, a node can have more than… Read More »

Algorithms are the methodical sequence of steps which are defined to solve complex problems. In this article, we will see the difference between two such… Read More »

Content has been removed on Author’s request. My Personal Notes arrow_drop_up Save

Pre-requisite: Dominant Set of a Graph, NP-Complete A dominating set in a graph G = (V, E) is a subset of vertices V’ following the… Read More »

Given a N-ary tree with some colour associated with every node and Q queries. Each query contains two integers A and X. The task is… Read More »

Pre-requisite: Travelling Salesman Problem, NP Hard Given a set of cities and the distance between each pair of cities, the travelling salesman problem finds the… Read More »

Given an array A[] of integers and array Q consisting of queries of the following two types: (1, L, R) : Return XOR of all… Read More »

Parenthesis Theorem is used in DFS of graph. It states that the descendants in a depth-first-search tree have an interesting property. If v is a… Read More »

Given an array arr[] of size N and an array Q[][] consisting of M queries that needs to be processed on the given array. It… Read More »

The minimum bottleneck spanning tree in an undirected graph is a tree whose most expensive edge is as minimum as possible. In this article, we… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: maximum(start, end): Print the maximum Armstrong number of elements… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of perfect square numbers… Read More »

Given a tree, and the weights of all the node. Each query contains two integers u and v, the task is to find the minimum… Read More »

Prerequisite: Segment Trees, Lazy Propagation in Segment Tree. Given an array arr[] of N integers. The task is to do the following operations: Change the… Read More »

Given N lines in a plane in the form of a 2D array arr[][] such that each row consists of 2 integers(say m & c)… Read More »