Binary Indexed Tree

Sum of previous numbers that are greater than current number for given array

Last Updated: 11 March 2022

Given an array A[], for each element in the array, the task is to find the sum of all the previous elements which are strictly greater than ...read more

Tree

Algorithms

Count smaller elements on right side and greater elements on left side using Binary Index Tree

Last Updated: 19 March 2025

Given an array arr[] of size N. The task is to find smaller elements on the right side and greater elements on the left side for each elemen ...read more

Bit Magic

Range Sum Queries and Update with Square Root

Similar Topics

DSA

22.3k+ articles

Arrays

6.4k+ articles

Competitive Programming

2.3k+ articles

Algorithms

1.9k+ articles

Tree

1.4k+ articles

Bit Magic

1.2k+ articles

Advanced Data Structure

580+ articles

array-range-queries

360+ articles

Segment-Tree

140+ articles

inversion

37+ articles

Last Updated: 30 January 2023

Given an array A of N integers and number of queries Q. You have to answer two types of queries.Update [l, r] – for every i in range from ...read more

Bit Magic

Tree

Algorithms

Technical Scripter 2018

Number of elements greater than K in the range L to R using Fenwick Tree (Offline queries)

Last Updated: 29 November 2023

Prerequisites: Fenwick Tree (Binary Indexed Tree)Given an array of N numbers, and a number of queries where each query will contain three nu ...read more

Sorting

Array range queries over range queries

Last Updated: 03 May 2023

Given an array of size n and a give set of commands of size m. The commands are enumerated from 1 to m. These commands can be of the followi ...read more

Queries for number of distinct elements in a subarray

Last Updated: 27 April 2023

Given a array 'a[]' of size n and number of queries q. Each query can be represented by two integers l and r. Your task is to print the numb ...read more

Numbsubarrayer of elements less than or equal to a given number in a given

Last Updated: 27 April 2023

Given an array 'a[]' and number of queries q. Each query can be represented by l, r, x. Your task is to print the number of elements less th ...read more

Binary Indexed Tree : Range Update and Range Queries

Last Updated: 21 November 2023

Given an array arr[0..N-1]. The following operations need to be performed.update(l, r, val): Add ‘val’ to all the elements in the array ...read more

Misc

How to prepare for ACM - ICPC?

Last Updated: 25 May 2023

ACM ICPC(Association for Computing Machinery - International Collegiate Programming Contest) is a worldwide annual multi-tiered programming ...read more

Two Dimensional Binary Indexed Tree or Fenwick Tree

Last Updated: 30 November 2023

Prerequisite - Fenwick TreeWe know that to answer range sum queries on a 1-D array efficiently, binary indexed tree (or Fenwick Tree) is the...read more

Misc

Count Inversions of size three in a given array

Last Updated: 20 March 2023

Given an array arr[] of size n. Three elements arr[i], arr[j] and arr[k] form an inversion of size 3 if a[i] a[j] a[k] and i j k. Find to ...read more

inversion

Inversion count in Array using BIT

Last Updated: 27 August 2024

Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted then the invers ...read more

Bit Magic

Mathematical

inversion

Top 10 Algorithms and Data Structures for Competitive Programming

Last Updated: 10 September 2024

In this post, we will discuss Important top 10 algorithms and data structures for competitive coding.Topics :Graph algorithmsDynamic program...read more

GBlog

GBlog-Competitive-Programming

Binary Indexed Tree or Fenwick Tree

Last Updated: 19 December 2024

Binary Indexed Trees are used for problems where we have following types of multiple operations on a fixed sized.Prefix Operation (Sum, Prod...read more

Tree