## Counting inversions in an array using segment tree

Given an array of integers arr, the task is to count the number of inversions in the array. If A[i] > A[j] and i <… Read More »

- Design a Chess Game
- Kth smallest element in a subarray
- Implement a Dictionary using Trie
- Rearrange numbers in an array such that no two adjacent numbers are same
- Trie Data Structure using smart pointer and OOP in C++
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Persistent Trie | Set 1 (Introduction)
- Sort an array of strings based on the frequency of good words in them
- Longest string in an array which matches with prefix of the given string
- Count of strings whose prefix match with the given string to a given length k
- Queries for number of distinct elements in a subarray | Set 2
- Queries to update a given index and find gcd in range
- Flipping Sign Problem | Lazy Propagation Segment Tree
- Search in a trie Recursively
- Extendible Hashing (Dynamic approach to DBMS)
- Bottom-up traversal of a Trie
- Find the number of different numbers in the array after applying the given operation q times
- Gap Buffer Data Structure
- Count inversions in an array | Set 4 ( Using Trie )
- String Range Queries to find the number of subsets equal to a given String
- B*-Trees implementation in C++
- Insertion in a Trie recursively
- B-Tree Insert without aggressive splitting
- Van Emde Boas Tree | Set 1 | Basics and Construction
- Shortest cycle in an undirected unweighted graph
- Strings from an array which are not prefix of any other string
- Maximise the number of toys that can be purchased with amount K using min Heap
- Arrange array elements such that last digit of an element is equal to first digit of the next element
- Index of kth set bit in a binary array with update queries
- Number of triplets in array having subarray xor equal

Given an array of integers arr, the task is to count the number of inversions in the array. If A[i] > A[j] and i <… Read More »

Tree:- A connected graph without any circuit is called a Tree. In other words, a tree is an undirected graph G that satisfies any of… Read More »

Given an array ‘arr’ all the numbers of which are initialized to ‘0’ then the array can be updated at any time in the following… Read More »

Given an array of integers, the task is to find the sequence in which these integers should be added to an AVL tree such that… Read More »

Prerequisites:Fibonacci Heap (Introduction) Fibonacci Heap is a collection of trees with min-heap or max-heap property. In Fibonacci Heap, trees can can have any shape even… Read More »

Given a stack of integers. The task is to design a special stack such that maximum element can be found in O(1) time and O(1)… Read More »

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 »