Binary Indexed Tree - Medium Articles

Range Sum Queries and Update with Square Root

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

Binary Indexed Tree

Technical Scripter 2018

Advanced Data Structure

Algorithms

Bit Magic

Competitive Programming

DSA

Tree

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

Prerequisites: Fenwick Tree (Binary Indexed Tree)Given an array of N numbers, and a number of queries where each query will contain three numbers(l, r and… Read More

array-range-queries

Binary Indexed Tree

Bit Algorithms

cpp-structure

Advanced Data Structure

Competitive Programming

DSA

Sorting

XOR of numbers that appeared even number of times in given Range

Given an array of numbers of size N and Q queries. Each query or a range can be represented by L (LeftIndex) and R(RightIndex). Find… Read More

array-range-queries

Binary Indexed Tree

Advanced Data Structure

DSA

Searching

Technical Scripter

Tree

Sum of Interval and Update with Number of Divisors

Given an array A of N integers. You have to answer two types of queries : 1. Update [l, r] – for every i in… Read More

array-range-queries

Binary Indexed Tree

Segment-Tree

DSA

Technical Scripter

Tree

Maximum Sum Increasing Subsequence using Binary Indexed Tree

Given an array of size n. Find the maximum sum of an increasing subsequence.Examples: Input : arr[] = { 1, 20, 4, 2, 5 }… Read More

Binary Indexed Tree

Advanced Data Structure

Algorithms

Competitive Programming

DSA

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

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… Read More

array-range-queries

Binary Indexed Tree

Advanced Data Structure

DSA

Querying the number of distinct colors in a subtree of a colored tree using BIT

Prerequisites: BIT, DFS Given a rooted tree T, with ‘n’ nodes, each node has a color denoted by the array color[](color[i] denotes the color of… Read More

Binary Indexed Tree

Advanced Data Structure

Competitive Programming

DSA

Misc

Counting Triangles in a Rectangular space using BIT

Pre-requisite: BIT(Binary Indexed Tree or Fenwick Tree), 2D BITGiven a 2D plane, respond to Q queries, each of the following type: Insert x y –… Read More

Binary Indexed Tree

triangle

Advanced Data Structure

DSA

Count Inversions of size three in a given array

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… Read More

Binary Indexed Tree

inversion

Advanced Data Structure

Arrays

DSA

Top 10 Algorithms and Data Structures for Competitive Programming

In this post, we will discuss Important top 10 algorithms and data structures for competitive coding. Topics : Graph algorithms Dynamic programming Searching and… Read More

BFS

Binary Indexed Tree

BIT

DFS

GBlog-Competitive-Programming

Modular Arithmetic

number-theory

Segment-Tree

sieve

Topological Sorting

Competitive Programming

DSA

GBlog

Binary Indexed Tree or Fenwick Tree

Let us consider the following problem to understand Binary Indexed Tree.We have an array arr[0 . . . n-1]. We would like to 1 Compute the… Read More

array-range-queries

Binary Indexed Tree

Tutorials

Advanced Data Structure

DSA

Tree