## 2-3 Trees | (Search and Insert)

2-3 tree is a tree data structure in which every internal node (non-leaf node) has either one data element and two children or two data… 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
- Minimum cost of reducing Array by merging any adjacent elements repetitively
- Design a data structure that supports insert, delete, getRandom in O(1) with duplicates
- Design a Queue data structure to get minimum or maximum in O(1) time
- Difference between B tree and B+ tree
- Median of sliding window in an array | Set 2
- Finding shortest path between any two nodes using Floyd Warshall Algorithm
- Queries for elements having values within the range A to B in the given index range using Segment Tree
- Ackermann Function
- Paranthesis Theorem
- Sum of prime numbers in range [L, R] from given Array for Q queries
- 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
- Queries to check if any non-repeating element exists within range [L, R] of an Array
- Maximum CPU Load from the given list of jobs
- Lexicographical smallest number after at most K consecutive swaps
- Proof that traveling salesman problem is NP Hard
- Range Sum and Update in Array : Segment Tree using Stack
- Sum and Maximum of elements in array from [L, R] before and after updates
- Find K-th smallest element in an array for multiple queries
- Count of Array elements greater than all elements on its left and at least K elements on its right
- Counting Inversions using Ordered Set and GNU C++ PBDS
- Query to find the maximum and minimum weight between two nodes in the given tree using LCA.
- Static and Dynamic data structures in Java with Examples
- Queries to find the Minimum Weight from a Subtree of atmost D-distant Nodes from Node X
- Check if a Tree can be split into K equal connected components

2-3 tree is a tree data structure in which every internal node (non-leaf node) has either one data element and two children or two data… Read More »

Given an integer array, sort the array according to the frequency of elements in decreasing order, if frequency of two elements are same then sort… Read More »

Accolite hiring process include 6 rounds. 1.First Round::First round is online round, which has 30 MCQs.Accolite uses their own product called Eduthrill to conduct online… Read More »

Given two arrays and with n elements each. The task is to make these two arrays identical i:e, for each , we want to make… Read More »

Pre-requisite: Convert an Array to a Circular Doubly Linked List, Doubly Circular Linked List Given a Doubly circular linked list. The task is to find… Read More »

Suppose there is a queue of n users and your task is to assign a username to them. The system works in the following way.… Read More »

The level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a… Read More »

Prerequisite: Insert Element Circular Doubly Linked List. Convert an Array to a Circular Doubly Linked List. Given the start pointer pointing to the start of… Read More »

Prerequisite: Doubly Linked list, Circular Linked List, Circular Doubly Linked List Given an array of N elements. The task is to write a program to… Read More »

Prerequisite: Symbol Table A Symbol table is a data structure used by the compiler, where each identifier in program’s source code is stored along with… Read More »

Given a K-ary Tree. The task is to write an iterative program to perform the preorder traversal of the given n-ary tree. Examples: Input: 3-Array… Read More »

Given a binary tree, flatten it into a linked list. After flattening, the left of each node should point to NULL and right should contain… Read More »

Given an array arr[0 . . . n-1]. The task is to perform the following operation: Find the maximum of elements from index l to… Read More »

Given a graph, the task is to print the DFS traversal of a graph which includes the every step including the backtracking. 1st step:- 0… Read More »

Given an array of N positive integers. The task is to perform the following operations according to the type of query given. 1. Print the… Read More »