## 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 »

- Sort elements by frequency | Set 5 (using Java Map)
- Check if the given string of words can be formed from words present in the dictionary
- Accolite Interview Experience (On-campus)
- Level Ancestor Problem
- 2-3 Trees | (Search and Insert)
- Find maximum in a stack in O(1) time and O(1) extra space
- Fibonacci Heap - Insertion and Union
- Number of elements greater than K in the range L to R using Fenwick Tree (Offline queries)
- Minimum changes required to make two arrays identical
- Iterative Preorder Traversal of an N-ary Tree
- Flatten a binary tree into linked list | Set-2
- Program for assigning usernames using Trie
- Iterative Segment Tree (Range Minimum Query)
- Iterative Segment Tree (Range Maximum Query with Node Update)
- Counting inversions in an array using segment tree
- C++ Program to implement Symbol Table
- Convert an Array to a Circular Doubly Linked List
- Range queries to count 1s in a subarray after flip operations
- Count pairs (A, B) such that A has X and B has Y number of set bits and A+B = C
- Queries to find maximum product pair in range with updates
- Hashtables Chaining with Doubly Linked Lists
- Count inversions of size k in a given array
- Print the DFS traversal step-wise (Backtracking also)
- Optimal sequence for AVL tree insertion (without any rotations)
- Coalesced hashing
- Insertion at Specific Position in a Circular Doubly Linked List
- Remove edges connected to a node such that the three given nodes are in different trees
- Search an Element in Doubly Circular Linked List
- Extended Mo's Algorithm with ≈ O(1) time complexity
- Some Basic Theorems on Trees

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 »