## Range and Update Sum Queries with Factorial

Given an array arr[] of N integers and number of queries Q. The task is to answer three types of queries. Update [l, r] –… Read More »

- Count inversions in an array | Set 4 ( Using Trie )
- Shortest cycle in an undirected unweighted graph
- Maximise the number of toys that can be purchased with amount K using min Heap
- Number of triplets in array having subarray xor equal
- Lexicographical ordering using Heap Sort
- Range maximum query using Sparse Table
- Van Emde Boas Tree | Set 4 | Deletion
- Need for Abstract Data Type and ADT Model

Given an array arr[] of N integers and number of queries Q. The task is to answer three types of queries. Update [l, r] –… Read More »

Given an array A of N integers and number of queries Q. You have to answer two types of queries. Update [l, r] – for… Read More »

Given two numbers x, y which denotes the number of set bits. Also given is a number C. The task is to print the number… Read More »

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 »